Search arXivSearch

arXiv · 2503.22630

Large subsets avoiding algebraic patterns

Abstract

We prove the existence of a subset of the torus with large sumsets and avoiding all linear patterns. This extends a result of Körner, who had shown that for any integer $q \geq 1$, there exists a subset $K$ of $\mathbb R/\mathbb Z$ satisfying no non-trivial linear relations of order $2q-1$ and such that $q.K$ has positive Lebesgue measure. Our method is based on transfinite induction, which also allows us to produce large sets in different senses (cardinality, outer Lebesgue measure or Hausdorff dimension) avoiding families of algebraic patterns, for example Sidon sets in infinite abelian groups with small $2$ and $3$-torsion or sets with no repeated distances in $\mathbb R^n$. We also discuss questions of measurability of such sets and the role of the axiom of choice in our constructions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexandre Bailleul, Robin Riblet. 2026-06-19. Large subsets avoiding algebraic patterns. https://arxiv.org/abs/2503.22630

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO