IMUVA - Artículos de RevistaIMUVA - Artículos de Revistahttp://uvadoc.uva.es/handle/10324/321992020-10-21T11:02:35Z2020-10-21T11:02:35ZForwards attraction properties in scalar non-autonomous linear-dissipative parabolic PDEs. The case of null upper Lyapunov exponentLanga, José AntonioObaya García, RafaelSanz Gil, Ana Maríahttp://uvadoc.uva.es/handle/10324/416032020-07-26T18:31:16Z2020-01-01T00:00:00ZAs it is well-known, the forwards and pullback dynamics are in general unrelated. In this paper we present an in-depth study of whether the pullback attractor is also a forwards attractor for the processes involved with the skew-product semiflow induced by a family of scalar non-autonomous reaction-diffusion equations which are linear in a neighbourhood of zero and have null upper Lyapunov exponent. Besides, the notion of Li-Yorke chaotic pullback attractor for a process is introduced, and we prove that this chaotic behaviour might occur for almost all the processes. When the problems are additionally sublinear, more cases of forwards attraction are found, which had not been previously considered even in the case of linear-dissipative ODEs.
2020-01-01T00:00:00ZAlmost symmetric numerical semigroups with high typeGarcía Sánchez, Pedro A.Ojeda, Ignaciohttp://uvadoc.uva.es/handle/10324/408102020-07-01T16:03:13Z2019-01-01T00:00:00ZWe establish a one-to-one correspondence between numerical semigroups of genus g and almost symmetric numerical semigroups with Frobenius number F and type F−2g, provided that F is greater than or equal to 4g−1.
2019-01-01T00:00:00ZSemigroups with fixed multiplicity and embedding dimensionGarcía García, Juan IgnacioMarín Aragón, DanielMoreno Frías, María ÁngelesRosales, José CarlosVigneron Tenorio, Albertohttp://uvadoc.uva.es/handle/10324/408092020-09-10T12:15:28Z2019-01-01T00:00:00ZGiven m ∈ N, a numerical semigroup with multiplicity m is called a packed numerical
semigroup if its minimal generating set is included in {m, m + 1, . . . , 2m − 1}. In this
work, packed numerical semigroups are used to build the set of numerical semigroups
with a given multiplicity and embedding dimension, and to create a partition of this set.
Wilf’s conjecture is verified in the tree associated to some packed numerical semigroups.
Furthermore, given two positive integers m and e, some algorithms for computing the
minimal Frobenius number and minimal genus of the set of numerical semigroups with multiplicity m and embedding dimension e are provided. We also compute the semigroups
where these minimal values are achieved
2019-01-01T00:00:00ZOn graph combinatorics to improve eigenvector-based measures of centrality in directed networksArratia, ArgimiroMarijuán López, Carloshttp://uvadoc.uva.es/handle/10324/408072020-05-15T10:41:15Z2016-01-01T00:00:00ZWe present a combinatorial study on the rearrangement of links in the structure of directed networks for the purpose of improving the valuation of a vertex or group of vertices as established by an eigenvector-based centrality measure. We build our topological classification starting from unidirectional rooted trees and up to more complex hierarchical structures such as acyclic digraphs, bidirectional and cyclical rooted trees (obtained by closing cycles on unidirectional trees). We analyze different modifications on the structure of these networks and study their effect on the valuation given by the eigenvector-based scoring functions, with particular focus on α-centrality and PageRank.
2016-01-01T00:00:00ZAre algebraic links in the Poincaré sphere determined by their Alexander polynomials?Campillo López, AntonioDelgado de la Mata, FélixGusein-Zade, Sabir M.http://uvadoc.uva.es/handle/10324/407362020-05-15T10:41:15Z2020-01-01T00:00:00ZThe Alexander polynomial in several variables is defined for links in three-dimensional homology spheres, in particular, in the Poincaré sphere: the intersection of the surface S={(z1,z2,z3)∈C3:z51+z32+z23=0} with the 5-dimensional sphere S5ε={(z1,z2,z3)∈C3:|z1|2+|z2|2+|z3|2=ε2}. An algebraic link in the Poincaré sphere is the intersection of a germ of a complex analytic curve in (S, 0) with the sphere S5ε of radius ε small enough. Here we discuss to which extent the Alexander polynomial in several variables of an algebraic link in the Poincaré sphere determines the topology of the link. We show that, if the strict transform of a curve in (S, 0) does not intersect the component of the exceptional divisor corresponding to the end of the longest tail in the corresponding E8-diagram, then its Alexander polynomial determines the combinatorial type of the minimal resolution of the curve and therefore the topology of the corresponding link. The Alexander polynomial of an algebraic link in the Poincaré sphere is determined by the Poincaré series of the filtration defined by the corresponding curve valuations. (They coincide with each other for a reducible curve singularity and differ by the factor (1−t) for an irreducible one.) We show that, under conditions similar to those for curves, the Poincaré series of a collection of divisorial valuations determines the combinatorial type of the minimal resolution of the collection.
2020-01-01T00:00:00ZFulcrum: Flexible Network Coding for Heterogeneous DevicesLucani, Daniel E.Pedersen, Morten VidebækRuano Benito, DiegoSørensen, Chres W.Fitzek, Frank H. P.Heide, JanusGeil, OlavNguyen, VuReisslein, Martinhttp://uvadoc.uva.es/handle/10324/407352020-05-15T10:41:15Z2018-01-01T00:00:00ZWe introduce Fulcrum, a network coding framework that achieves three seemingly conflicting objectives: 1) to reduce the coding coefficient overhead down to nearly n bits per packet in a generation of n packets; 2) to conduct the network coding using only Galois field GF(2) operations at intermediate nodes if necessary, dramatically reducing computing complexity in the network; and 3) to deliver an end-to-end performance that is close to that of a high-field network coding system for high-end receivers, while simultaneously catering to low-end receivers that decode in GF(2). As a consequence of 1) and 3), Fulcrum has a unique trait missing so far in the network coding literature: providing the network with the flexibility to distribute computational complexity over different devices depending on their current load, network conditions, or energy constraints. At the core of our framework lies the idea of precoding at the sources using an expansion field GF(2 h ), h > 1, to increase the number of dimensions seen by the network. Fulcrum can use any high-field linear code for precoding, e.g., Reed-Solomon or Random Linear Network Coding (RLNC). Our analysis shows that the number of additional dimensions created during precoding controls the trade-off between delay, overhead, and computing complexity. Our implementation and measurements show that Fulcrum achieves similar decoding probabilities as high field RLNC but with encoders and decoders that are an order of magnitude faster.
2018-01-01T00:00:00ZStructural and spectral properties of minimal strong digraphsMarijuán López, CarlosGarcía López, JesúsPozo Coronado, Luis Miguelhttp://uvadoc.uva.es/handle/10324/407342020-05-15T10:41:14Z2016-01-01T00:00:00ZIn this article, we focus on structural and spectral properties of minimal strong
digraphs (MSDs). We carry out a comparative study of properties of MSDs versus
trees. This analysis includes two new properties. The first one gives bounds on
the coefficients of characteristic polynomials of trees (double directed trees), and
conjectures the generalization of these bounds to MSDs. As a particular case, we
prove that the independent coemcient of the characteristic polynomial of a tree or
an MSD must be — 1, 0 or 1. For trees, this fact means that a tree has at most one
perfect matching; for MSDs, it means that an MSD has at most one covering by
disjoint cycles. The property states that every MSD can be decomposed in a rooted
spanning tree and a forest of reversed rooted trees, as factors. In our opinión, the
analogies described suppose a significative change in the traditional point of view
about this class of digraphs.
2016-01-01T00:00:00ZOn pseudo-Frobenius elements of submonoids of NdGarcía García, Juan IgnacioOjeda, IgnacioRosales, José CarlosVigneron Tenorio, Albertohttp://uvadoc.uva.es/handle/10324/407302020-05-15T10:41:14Z2020-01-01T00:00:00ZIn this paper we study those submonoids of Nd with a nontrivial pseudo-Frobenius set. In the affine case, we prove that they are the affine semigroups whose associated algebra over a field has maximal projective dimension possible. We prove that these semigroups are a natural generalization of numerical semigroups and, consequently, most of their invariants can be generalized. In the last section we introduce a new family of submonoids of Nd and using its pseudo-Frobenius elements we prove that the elements in the family are direct limits of affine semigroups.
2020-01-01T00:00:00ZAlmost symmetric numerical semigroups with given Frobenius number and typeBranco, Manuel B.Ojeda, IgnacioRosales, José Carloshttp://uvadoc.uva.es/handle/10324/407282020-05-15T10:41:14Z2019-01-01T00:00:00ZWe give two algorithmic procedures to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number and type, and the whole set of almost symmetric numerical semigroups with fixed Frobenius number. Our algorithms allow to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number with similar or even higher efficiency that the known ones. They have been implemented in the GAP [The GAP Group, GAP — Groups, Algorithms and Programming, Version 4.8.6; 2016, https://www.gap-system.org] package NumericalSgps [M. Delgado and P. A. García-Sánchez and J. Morais, “numericalsgps”: A GAP package on numerical semigroups, https://github.com/gap-packages/numericalsgps].
2019-01-01T00:00:00ZUniqueness of limit cycles for quadratic vector fieldsBravo, José LuisFernández, ManuelOjeda, IgnacioSánchez, Fernándohttp://uvadoc.uva.es/handle/10324/407272020-05-15T10:41:14Z2019-01-01T00:00:00ZThis article deals with the study of the number of limit
cycles surrounding a critical point of a quadratic planar vector field,
which, in normal form, can be written as x
′ = a1x − y − a3x
2 + (2a2 +
a5)xy+a6y
2
, y
′ = x+a1y+a2x
2+(2a3+a4)xy−a2y
2
. In particular, we
study the semi-varieties defined in terms of the parameters a1, a2, . . . , a6
where some classical criteria for the associated Abel equation apply.
The proofs will combine classical ideas with tools from computational
algebraic geometry.
2019-01-01T00:00:00ZThe short resolution of a semigroup algebraOjeda, IgnacioVigneron Tenorio, Albertohttp://uvadoc.uva.es/handle/10324/407262020-05-15T10:41:14Z2017-01-01T00:00:00ZThis work generalises the short resolution given by Pisón Casares [‘The short resolution of a lattice ideal’, Proc. Amer. Math. Soc. 131(4) (2003), 1081–1091] to any affine semigroup. We give a characterisation of Apéry sets which provides a simple way to compute Apéry sets of affine semigroups and Frobenius numbers of numerical semigroups. We also exhibit a new characterisation of the Cohen–Macaulay property for simplicial affine semigroups.
2017-01-01T00:00:00ZOn the ideal associated to a linear codeMárquez Corbella, IreneMartínez Moro, EdgarSuárez Canedo, Emiliohttp://uvadoc.uva.es/handle/10324/407252020-05-15T10:41:14Z2016-01-01T00:00:00ZThis article aims to explore the bridge between the algebraic structure of a linear code and the complete decoding process. To this end, we associate a specific binomial ideal I+(C) to an arbitrary linear code. The binomials
involved in the reduced Gr¨obner basis of such an ideal relative to a degreecompatible ordering induce a uniquely defined test-set for the code, and this
allows the description of a Hamming metric decoding procedure. Moreover,
the binomials involved in the Graver basis of I+(C) provide a universal test-set
which turns out to be a set containing the set of codewords of minimal support
of the code.
2016-01-01T00:00:00ZUpdating a map of sufficient conditions for the real nonnegative inverse eigenvalue problemMarijuán López, CarlosPisonero Pérez, MiriamSoto, Ricardo L.http://uvadoc.uva.es/handle/10324/407242020-05-15T10:41:14Z2019-01-01T00:00:00ZThe real nonnegative inverse eigenvalue problem (RNIEP) asks for necessary and sufficient conditions in order that a list of real numbers be the spectrum of a nonnegative real matrix. A number of sufficient conditions for the existence of such a matrix are known. The authors gave in a map of sufficient conditions establishing inclusion relations or independency relations between them. Since then new sufficient conditions for the RNIEP have appeared. In this paper we complete and update the map given in.
2019-01-01T00:00:00ZExponential polynomial inequalities and monomial sum inequalities in p-Newton sequencesJohnson, Charles R.Marijuán López, CarlosPisonero Pérez, MiriamYeh, Michaelhttp://uvadoc.uva.es/handle/10324/406982020-05-15T10:41:13Z2016-01-01T00:00:00ZWe consider inequalities between sums of monomials that hold for all p-Newton
sequences. This continues recent work in which inequalities between sums of two, two-term
monomials were combinatorially characterized (via the indices involved). Our focus is on
the case of sums of three, two-term monomials, but this is very much more complicated. We
develop and use a theory of exponential polynomial inequalities to give a sufficient condition
for general monomial sum inequalities, and use the sufficient condition in two ways. The
sufficient condition is necessary in the case of sums of two monomials but is not known if it
is for sums of more. A complete description of the desired inequalities is given for Newton
sequences of less than 5 terms.
2016-01-01T00:00:00ZQuantum error-correcting codes from algebraic geometry codes of Castle typeMunuera Gómez, CarlosTenório, WandersonTorres, Fernandohttp://uvadoc.uva.es/handle/10324/406972020-05-15T10:41:13Z2016-01-01T00:00:00ZWe study Algebraic Geometry codes producing quantum error-correcting
codes by the CSS construction. We pay particular attention to the family of Castle
codes. We show that many of the examples known in the literature in fact belong to
this family of codes. We systematize these constructions by showing the common theory
that underlies all of them.
2016-01-01T00:00:00ZImproved Bounds on the Threshold Gap in Ramp Secret SharingCascudo, IgnacioGundersen, Jaron SkovstedRuano Benito, Diegohttp://uvadoc.uva.es/handle/10324/401362020-05-15T10:22:12Z2019-01-01T00:00:00ZIn this paper, we consider linear secret sharing schemes over a finite field F q , where the secret is a vector in Fℓ q and each of the n shares is a single element of F q . We obtain lower bounds on the so-called threshold gap g of such schemes, defined as the quantity r-t where r is the smallest number such that any subset of r shares uniquely determines the secret and t is the largest number such that any subset of t shares provides no information about the secret. Our main result establishes a family of bounds which are tighter than previously known bounds for ℓ ≳ 2 . Furthermore, we also provide bounds, in terms of n and q , on the partial reconstruction and privacy thresholds, a more fine-grained notion that considers the amount of information about the secret that can be contained in a set of shares of a given size. Finally, we compare our lower bounds with known upper bounds in the asymptotic setting.
2019-01-01T00:00:00Z