Related papers: Product set phenomena for countable groups

We generalize the results of Skorobogatov and Zarhin considering the commutativity of Brauer groups (and Brauer-Manin sets) with taking product of two varieties, by relaxing the condition that varieties are projective.

Finite mixture models are statistical models which appear in many problems in statistics and machine learning. In such models it is assumed that data are drawn from random probability measures, called mixture components, which are…

For a simple algebraic group $G$ over an algebraically closed field, we study products of normal subsets. For this we mark the nodes of the Dynkin diagram of $G$. We use two types of labels, a binary marking and a labeling with non-negative…

We consider an action of a countable amenable group on a compact metric space, focusing on the set of generic points with respect to a fixed F{\o}lner sequence. For a given characteristic class, we prove that the set of points that are…

We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…

Groups preserving a distributive product are encountered often in algebra. Examples include automorphism groups of associative and nonassociative rings, classical groups, and automorphism groups of p-groups. While the great variety of such…

We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr…

We consider random walks on locally compact groups, extending the geometric criteria for the identification of their Poisson boundary previously known for discrete groups. First, we prove a version of the Shannon-McMillan-Breiman theorem,…

This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…

We construct a set $S$ such that every translate of $S$ is a set of recurrence and a set of rigidity for a weak mixing measure preserving system. This construction generalizes or strengthens results of Katznelson, Saeki, Forrest, and Fayad…

Our goal is to develop a limit approach for a class of problems in additive combinatorics that is analogous to the limit theory of dense graph sequences. We introduce metric, convergence and limit objects for functions on groups and for…

In this article, we consider a generalization of Young tableaux in which we allow some consecutive pairs of cells with decreasing labels. We show that this leads to a rich variety of combinatorial formulas, which suggest that these new…

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 the first part of this work we have established an efficient method to obtain a topological classification of locally discrete, finitely generated, virtually free subgroups of real-analytic circle diffeomorphisms. In this second part we…

N. Hindman and D. Strauss had shown that, for discrete semigroups, the cartesian product of two central sets are central. They also proved that the product of J- sets and C-sets are also J-set and C-set and characterized when the infnite…

We study two properties for subsets of a metric space. One of them is generalization of chainability, finite chainability, and Menger convexity for metric spaces; while the other is a generalization of compactness. We explore the basic…

We are going to classify sets by a given mean in two ways. Firstly we study small and big sets regarding a given mean. Secondly we study sets that have the same weight according to a mean. We also generalize the notion of roundness and get…

This paper proves the existence of nonmeasurable dense sets with additional properties using combinatorial techniques.

Let $A$ and $B$ be finite subsets of $\mathbb{C}$ such that $|B|=C|A|$. We show the following variant of the sum product phenomenon: If $|AB|<\alpha|A|$ and $\alpha \ll \log |A|$, then $|kA+lB|\gg |A|^k|B|^l$. This is an application of a…

We prove new results in generalized Harish-Chandra theory providing a description of the so-called Brauer--Lusztig blocks in terms of the information encoded in the $\ell$-adic cohomology of Deligne--Lusztig varieties. Then, we propose new…