Related papers: Bounds for Matchings in Nonabelian Groups

We prove new upper bounds for the length of laws that hold for all groups of size at most $n$ -- improving on previous results of Bou-Rabee and Kassabov-Matucci. The methods make use of the classification of finite simple groups. Stronger…

In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent $\omega$ of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans…

We establish bounds of triple exponential sums with mixed exponential and linear function. The method we use is by Shparlinski together with a bound of additive energy from Roche-Newton, Rudnev and Shkredov.

We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

We find a lower bound to the size of finite groups detecting a given word in the free group, more precisely we construct a word w_n of length n in non-abelian free groups with the property that w_n is the identity on all finite quotients of…

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

We show the boundedness of finite subgroups in any anisotropic reductive algebraic group over a perfect field that contains all roots of 1. Also, we provide explicit bounds for orders of finite subgroups of automorphism groups of…

We consider a problem posed by Shparlinski, of giving nontrivial bounds for rational exponential sums over the arithmetic function $\tau(n)$, counting the number of divisors of $n$. This is done using some ideas of Sathe concerning the…

In this paper, building among others on earlier works by U. Krause and C. Zahlten (dealing with the case of cyclic groups), we obtain a new upper bound for the little cross number valid in the general case of arbitrary finite Abelian…

This is an expository account of the proof of the theorem of Bourgain, Glibichuk and Konyagin which provides non-trivial bounds for exponential sums over very small multiplicative subgroups of prime finite fields.

A matching in a group G is a bijection f from a subset A to a subset B in G such that af(a) does not belong to A for all a in A. The group G is said to have the matching property if, for any finite subsets A,B in G of same cardinality with…

Higher-dimensional Thompson's groups nV are finitely presented groups described by Brin which generalize dyadic self-maps of the unit interval to dyadic self-maps of n-dimensional unit cubes. We describe some of the metric properties of…

We give a new bound on colinear triples in subgroups of prime finite fields and use it to give some new bounds on exponential sums with trinomials.

We improve an existing result on exponential quadrilinear sums in the case of sums over multiplicative subgroups of a finite field and use it to give a new bound on exponential sums with quadrinomials.

We prove new upper bounds on homotopy and homology groups of o-minimal sets in terms of their approximations by compact o-minimal sets. In particular, we improve the known upper bounds on Betti numbers of semialgebraic sets defined by…

This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < \epsilon <…

Every abelian (and even every nilpotent) group contains a solution of any finite unimodular system of equations over itself. However, this is not true for infinite systems. We deduced a criterion for a periodic abelian group to contain a…

Let $G$ be a finite abelian group, let $0 < \alpha < 1$, and let $A \subseteq G$ be a random set of size $|G|^\alpha$. We let $$ \mu(A) = \max_{B,C:|B|=|C|=|A|}|\{(a,b,c) \in A \times B \times C : a = b + c \}|. $$ The issue is to determine…

We give effective proofs of residual finiteness and conjugacy separability for finitely generated nilpotent groups. In particular, we give precise asymptotic bounds for a function introduced by Bou-Rabee that measures how large the…