Related papers: Counting configuration-free sets in groups

The problem of integer partitions is addressed using the microcanonical approach which is based on the analogy between this problem in the number theory and the calculation of microstates of a many-boson system. For ordinary…

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

This paper develops a general asymptotic theory for nonparametric kernel regression in the presence of cluster dependence. We examine nonparametric density estimation, Nadaraya-Watson kernel regression, and local linear estimation. Our…

We give an infinite family of torsion-free groups that do not satisfy the unique product property. For these examples, we also show that each group contains arbitrarily large sets whose square has no uniquely represented element.

We show that the theory of the free group -- and more generally the theory of any torsion-free hyperbolic group -- is $n$-ample for any $n\geq 1$. We give also an explicit description of the imaginary algebraic closure in free groups.

A regular sampling theory in a multiply generated unitary invariant subspace of a separable Hilbert space $\mathcal{H}$ is proposed. This subspace is associated to a unitary representation of a countable discrete abelian group $G$ on…

We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to infinity. We develop a general method…

We build quasi--isometry invariants of relatively hyperbolic groups which detect the hyperbolic parts of the group; these are variations of the stable dimension constructions previously introduced by the authors. We prove that, given any…

We construct finitely generated simple torsion-free groups with strong homological control. Our main result is that every subset of $\mathbb{N} \cup \{\infty\}$, with some obvious exceptions, can be realized as the set of dimensions of…

The study of minimal complements in a group or a semigroup was initiated by Nathanson. The notion of minimal complements and being a minimal complement leads to the notion of co-minimal pairs which was considered in a prior work of the…

We construct continuum many infinite, simple, characteristic quotients of non-abelian free groups, answering a 1978 question of James Wiegold. The method is very flexible, allowing to impose certain properties on the quotients, to…

We answer a question raised by Pillay, that is whether the infinite weight of the generic type of the free group is witnessed in $F_{\omega}$. We also prove that the set of primitive elements in finite rank free groups is not uniformly…

In this paper we present a new characterization of free group actions (in classical differential geometry), involving dynamical systems and representations of the corresponding transformation groups. In fact, given a dynamical system, we…

We study word metrics on Z^d by developing tools that are fine enough to measure dependence on the generating set. We obtain counting and distribution results for the words of length n. With this, we show that counting measure on spheres…

We construct an uncountable sequence of groups acting uniformly properly on hyperbolic spaces. We show that only countably many of these groups can be virtually torsion-free. This gives new examples of groups acting uniformly properly on…

A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is…

We give examples of principal algebraic actions of the noncommutative free group $F$ of rank two, as well as other groups, by automorphisms of a connected compact abelian group for which there is an explicit measurable isomorphism to a…

Finite hamiltonian groups are counted. The sequence of numbers of all groups of order $n$ all whose subgroups are normal and the sequence of numbers of all groups of order less or equal to $n$ all whose subgroups are normal are presented.

We introduce a general method to count unlabeled combinatorial structures and to efficiently generate them at random. The approach is based on pointing unlabeled structures in an "unbiased" way that a structure of size n gives rise to n…

We study a chromatic theory of asymptotic approximate groups for tuples of subsets of abelian groups, combining Nathanson's chromatic sumset formalism with asymptotic covering ideas from approximate group theory. This framework encodes…