English
Related papers

Related papers: Product-free sets in the free group

200 papers

Motivated by questions asked by Erdos, we prove that any set $A\subset{\mathbb N}$ with positive upper density contains, for any $k\in{\mathbb N}$, a sumset $B_1+\cdots+B_k$, where $B_1,\dots,B_k\subset{\mathbb N}$ are infinite. Our proof…

Dynamical Systems · Mathematics 2024-02-23 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

In this paper, we introduce the prime trees associated with a finite subset $P$ of the set of all prime numbers, and provide conditions under which the tree is of finite type. Moreover, we compute the density of finite-type subsets $P$. As…

Number Theory · Mathematics 2026-02-02 Yusuke Fujiyoshi

A subset $A$ of a finite abelian group is called $(k,\ell)$-sum-free if $kA \cap \ell A=\emptyset.$ In this paper, we extend this concept to compact abelian groups and study the question of how large a measurable $(k,\ell)$-sum-free set can…

Combinatorics · Mathematics 2019-01-16 Noah Kravitz

It is shown that the big free group (the set of countably-long words over a countable alphabet) is almost free, in the sense that any function from the alphabet to a compact topological group factors through a homomorphism. This statement…

Group Theory · Mathematics 2015-06-12 Tamer Tlas

Let F be a family of subsets of {1,2,...,n}. The width-degree of an element x in at least one member of F is the width of the family {U in F | x in U}. If F has maximum width-degree at most k, then F is locally k-wide. Bounds on the size of…

Combinatorics · Mathematics 2016-09-06 Emanuel Knill

The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…

Combinatorics · Mathematics 2016-04-20 Paul Balister , Béla Bollobás , Karen Gunderson

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

Let $G$ be a group generated by a finite set $A$. An element $g\in G$ is a strict dead end of depth $k$ (with respect to $A$) if $|g|>|ga_1|>|ga_1a_2|>...>|ga_1a_2... a_k|$ for any $a_1,a_2, ..., a_k\in A^{\pm1}$ such that the word…

Group Theory · Mathematics 2007-05-23 Victor Guba

We present a proof of the following claim. Suppose that $n$ is an integer such that $n>1$ and that $k$ is any field. Suppose that $g$ is an element of $\mathrm{SL}(n,k)$ of infinite order. Then the set $\{h\in\mathrm{SL}(n,k)\mid <g,h>$ is…

Group Theory · Mathematics 2014-11-06 Rupert McCallum

We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.

Logic · Mathematics 2016-11-15 Shimon Garti

We study families of subsets of $\omega$ which are independent with respect to the asymptotic density $\mathsf{d}$. We show, for instance, that there exists a maximal $\mathsf{d}$-independent family $\mathcal{A}$ such that…

Logic · Mathematics 2026-04-01 Jonathan M. Keith , Paolo Leonetti

We prove that for any sequence of binary alphabets $\mathcal{A}_1,\mathcal{A}_2,\dots$, there exists a cube-free word $c_1c_2\dots$ so that $c_1\in\mathcal{A}_1,c_2\in\mathcal{A}_2,\dots$. In particular, for every $n$, there are at least…

Combinatorics · Mathematics 2025-12-04 Vuong Bui , Matthieu Rosenfeld

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

Number Theory · Mathematics 2020-09-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…

Group Theory · Mathematics 2017-05-17 Mark Shusterman

In this article we relate two different densities. Let $F_k$ be the free group of finite rank $k \ge 2$ and let $\alpha$ be the abelianization map from $F_k$ onto $ \mathbb{Z}^k$. We prove that if $S \subseteq \mathbb{Z}^k$ is invariant…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Igor Rivin , Paul Schupp , Vladimir Shpilrain

Let a and b be non-zero rational numbers that are multiplicatively independent. We study the natural density of the set of primes p for which the subgroup of the multiplicative group of the finite field with p elements generated by (a\mod…

Number Theory · Mathematics 2007-05-23 Pieter Moree , Peter Stevenhagen

We study fibers of word maps in finite, profinite, and residually finite groups. Our main result is that, for any word w in the free group on d generators, there exists $\epsilon > 0$ such that if G is a residually finite group with…

Group Theory · Mathematics 2017-06-27 Michael Larsen , Aner Shalev

I prove that the generic type of the free nonabelian group has infinite weight (strengthening non superstability of the free group).

Group Theory · Mathematics 2008-12-10 Anand Pillay

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove that for any given system of equations \Sigma, all the solutions of \Sigma over a random group of density d<\frac{1}{2} are…

Group Theory · Mathematics 2024-08-13 Sobhi Massalha

We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…

Logic · Mathematics 2025-12-16 J. B. Nation , Gianluca Paolini