Related papers: Random equations in nilpotent groups

The functions $F_{G}(n)$ measures the asymptotic behavior of residual finiteness for a finitely generated group $G$. In previous work \cite{Pengitore_1}, the author claimed a characterization for $F_{N}(n)$ when $N$ is a finitely generated…

Let $G$ be a finite soluble group and $G^{(k)}$ the $k$th term of the derived series of $G$. We prove that $G^{(k)}$ is nilpotent if and only if $|ab|=|a||b|$ for any $\delta_k$-values $a,b\in G$ of coprime orders. In the course of the…

Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is…

We consider positive entropy $G$-systems for certain countable, discrete, infinite left-orderable amenable groups $G$. By undertaking local analysis, the existence of asymptotic pairs and chaotic sets will be studied in connecting with the…

We study finitely generated nilpotent groups $G$ given by full rank finite presentations $\langle A \mid R\rangle$ in the variety $\mathcal{N}_c$ of nilpotent groups of class at most $c$, where $c \geq 2$. We prove that if the deficiency…

A set $A$ is an $(r,\ell)$-approximate group in the additive abelian group $G$ if $A$ is a nonempty subset of $G$ and there exists a subset $X$ of $G$ such that $|X| \leq \ell$ and $rA \subseteq X+A$. The set $A$ is an asymptotic…

Let $F$ and $G$ be integer polynomials where $F$ has degree at least $2$. Define the sequence $(a_n)$ by $a_n=F(a_{n-1})$ for all $n\ge 1$ and $a_0=0.$ Let $\mathscr{B}_{F,\,G,\,k}$ be the set of all positive integers $n$ such that $k\mid…

For a countable abelian group $G$ we investigate generic properties of the space of all invariant metrics on $G$. We prove that for every such an unbounded group $G$, i.e. group which has elements of arbitrarily high order, there is a dense…

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…

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…

In the paper we study irreducible representations of some nilpotent groups of finite abelian total rank. The main result of the paper states that if a torsion-free minimax group $G$ of nilpotency class 2 admits a faithful irreducible…

We give a criterion on pairs $(G,S)$ - where $G$ is a virtually $s$-step nilpotent group and $S$ is a finite generating set - saying whether the geodesic growth is exponential or strictly sub-exponential. Whenever $s=1,2$, this goes further…

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…

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…

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.

We study metabelian groups $G$ given by full rank finite presentations $\langle A \mid R \rangle_{\mathcal{M}}$ in the variety $\mathcal{M}$ of metabelian groups. We prove that $G$ is a product of a free metabelian subgroup of rank…

We determine the asymptotic density $\delta_k$ of the set of ordered $k$-tuples $(n_1,...,n_k)\in \N^k, k\ge 2$, such that there exists no prime power $p^a$, $a\ge 1$, appearing in the canonical factorization of each $n_i$, $1\le i\le k$,…

Random $K$-satisfiability ($K$-SAT) is a paradigmatic model system for studying phase transitions in constraint satisfaction problems and for developing empirical algorithms. The statistical properties of the random $K$-SAT solution space…

We show that a finitely generated soluble group is virtually nilpotent if and only if the diameter of its finite coset spaces admits a uniform polynomial lower bound in terms of their size. We obtain the same conclusion for certain finitely…