Related papers: Counting configuration-free sets in groups
We present a general framework to represent discrete configuration systems using hypergraphs. This representation allows one to transfer combinatorial removal lemmas to their analogues for configuration systems. These removal lemmas claim…
Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…
In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our…
In this paper we study sum-free sets of order $m$ in finite Abelian groups. We prove a general theorem on 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting.…
Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…
We give explicit formulas for the asymptotic Betti numbers of the unordered configuration spaces of an arbitrary finite graph over an arbitrary field.
We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.
In this paper we study asymptotic behavior of regular subsets in a free group F of finite rank, compare their sizes at infinity, and develop techniques to compute the probabilities of sets relative to distributions on F that come naturally…
In this paper we study asymptotic density of rational sets in free abelian group $\mathbb{Z}^n$ of rank $n$. We show that any rational set $R$ in $\mathbb{Z}^n$ has asymptotic density. If $R$ is given by its semi-simple decomposition we…
We introduce a family of atomic measures on free groups generated by no-return random walks. These measures are shown to be very convenient for comparing "relative sizes" of subgroups, context-free and regular subsets (that, subsets…
Scale-free networks contain many small cliques and cycles. We model such networks as inhomogeneous random graphs with regularly varying infinite-variance weights. For these models, the number of cliques and cycles have exact integral…
Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. Let SF(G) denotes the set of all sum-free subets of $G$ and $\sigma(G)$ denotes…
We expand the class of linear symmetric equations for which large sets with no non-trivial solutions are known. Our idea is based on first finding a small set with no solutions and then enlarging it to arbitrary size using a…
We investigate the power of counting in Group Isomorphism. We first leverage the count-free variant of the Weisfeiler--Leman Version I algorithm for groups (Brachter & Schweitzer, LICS 2020) in tandem with limited non-determinism and…
There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch…
We construct a group (an HNN extension of a free group) with polynomial isoperimetric function, linear isodiametric function and non-simply connected asymptotic cones.
We count the ordered sum-free triplets of subsets in the group $\mathbb{Z}/p\mathbb{Z}$, i.e., the triplets $(A,B,C)$ of sets $A,B,C \subset \mathbb{Z}/p\mathbb{Z}$ for which the equation $a+b=c$ has no solution with $a\in A$, $b \in B$ and…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
In this paper we study the asymptotic probability that a random system of equations in free abelian group $\mathbb{Z}^m$ of rank $m$ is solvable. Denote $SAT(\mathbb{Z}^m, k, n)$ and $SAT_{\mathbb{Q}^m}(\mathbb{Z}^m, k, n)$ the sets of all…
Known and new results on free Boolean topological groups are collected. An account of properties which these groups share with free or free Abelian topological groups and properties specific of free Boolean groups is given. Special emphasis…