Exploració per autor "Serra Albó, Oriol"
Ara es mostren els items 67-74 de 74
-
Semigroups with the Erdös-Turán Property
(2006-01)
Article
Accés obertA set X in a semigroup G has the Erdös-Turán property ET if, for any basis A of X, the representation function rA is ubounded, where rA(x) counts the number of representations of x as a product two elements in A. We ... -
Set systems with distinct sumsets
(Elsevier, 2018)
Text en actes de congrés
Accés obertA family $\mathcal{A}$ of $k$-subsets of $\{1,2,\dots, N\}$ is a Sidon system if the sumsets $A+A'$, $A,A'\in \mathcal{A}$ are pairwise distinct. We show that the largest cardinality $F_k(N)$ of a Sidon system of $k$-subsets ... -
Sidon set systems
(2020-02-11)
Article
Accés obertA family A of k-subsets of {1,2,…,N} is a Sidon system if the sumsets A+B, A,B¿A are pairwise distinct. We show that the largest cardinality Fk(N) of a Sidon system of k-subsets of [N] satisfies Fk(N)=(N-1k-1)+N-k and the ... -
Speeding up random walk mixing by starting from a uniform vertex
(Project Euclid, 2024-01-01)
Article
Accés obertThe theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the ... -
TEORIA DE GRAFS | FINAL
(Universitat Politècnica de Catalunya, 2024-01-12)
Examen
Accés restringit a la comunitat UPC -
The multicolored graph realization problem
(Elsevier, 2022-07-01)
Article
Accés obertWe introduce the multicolored graph realization problem (MGR). The input to this problem is a colored graph (G, φ), i.e., a graph G together with a coloring φ on its vertices. We associate each colored graph (G, φ) with a ... -
Towards 3n - 4 in groups of prime order
(2023-06-16)
Article
Accés obertWe show that if A is a subset of a group of prime order p such that |2.Al < 2.7652|Al and 10 < |A| < 1.25 - 10-®p, then A is contained in an arithmetic progression with at most 2A - [Al + 1 terms, and 2.4 contains an ... -
Triangulations and a discrete Brunn–Minkowski inequality in the plane
(2019-08-29)
Article
Accés obertFor a set A of points in the plane, not all collinear, we denote by tr(A) the number of triangles in a triangulation of A, that is, tr(A)=2i+b-2 , where b and i are the numbers of boundary and interior points of the convex ...
