Zobrazeno 1 - 10
of 288
pro vyhledávání: '"SERRA, ORIOL"'
Autor:
Perarnau, Guillem, Serra, Oriol
The Lonely Runner Conjecture originated in Diophantine approximation will turn 60 in 2028. Even if the conjecture is still widely open, the flow of partial results, innovative tools and connections to different problems and applications has been stea
Externí odkaz:
http://arxiv.org/abs/2409.20160
An edge-colored multigraph $G$ is rainbow connected if every pair of vertices is joined by at least one rainbow path, i.e., a path where no two edges are of the same color. In the context of multilayered networks we introduce the notion of multilayer
Externí odkaz:
http://arxiv.org/abs/2407.12323
A perfect code in a graph is an independent set of the graph such that every vertex outside the set is adjacent to exactly one vertex in the set. A circulant graph is a Cayley graph of a cyclic group. In this paper we study perfect codes in circulant
Externí odkaz:
http://arxiv.org/abs/2403.02205
Autor:
Serra, Oriol, Vena, Lluís
In \cite[Serra, Vena, Extremal families for the Kruskal-Katona theorem]{sv21}, the authors have shown a characterization of the extremal families for the Kruskal-Katona Theorem. We further develop some of the arguments given in \cite{sv21} and give a
Externí odkaz:
http://arxiv.org/abs/2305.10152
Autor:
Serra, Oriol, Vena, Lluís
Given a family $S$ of $k$--subsets of $[n]$, its lower shadow $\Delta(S)$ is the family of $(k-1)$--subsets which are contained in at least one set in $S$. The celebrated Kruskal--Katona theorem gives the minimum cardinality of $\Delta(S)$ in terms o
Externí odkaz:
http://arxiv.org/abs/2304.05145
Autor:
Lev, Vsevolod F., Serra, Oriol
We show that if $A$ is a subset of a group of prime order $p$ such that $|2A|<2.7652|A|$ and $|A|<1.25\cdot10^{-6}p$, then $A$ is contained in an arithmetic progression with at most $|2A|-|A|+1$ terms, and $2A$ contains an arithmetic progression with
Externí odkaz:
http://arxiv.org/abs/2302.08465
Publikováno v:
Mathematika, Volume70, Issue3, July 2024 Paper e12255
We prove that product-free sets of the free group over a finite alphabet have maximum density $1/2$ with respect to the natural measure that assigns total weight one to each set of irreducible words of a given size. This confirms a conjecture of Lead
Externí odkaz:
http://arxiv.org/abs/2302.03748
Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. We are interested in giving upper bounds o
Externí odkaz:
http://arxiv.org/abs/2211.03206
The 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 presence of bottlenecks in a gra
Externí odkaz:
http://arxiv.org/abs/2208.07462
Autor:
Alsina-Pagès Rosa Ma, Parés Ma Eulàlia, Vidaña-Vila Ester, Freixes Marc, Garcia Danielly, Arnela Marc, Martínez-Suquía Carmen, Serra Oriol, Ferrandiz-Rovira Mariona
Publikováno v:
Noise Mapping, Vol 11, Iss 1, Pp 439-57 (2024)
High environmental noise as well as poor biodiversity and air pollution pose significant challenges for the European population, particularly those residing in urban areas, impacting clearly on citizens’ health. The Conscious Walk initiative stands
Externí odkaz:
https://doaj.org/article/a97a9126dc7a420ba25c3743c697e8c8
