相关论文: On the length of non-solutions to equations with c…

For a finitely generated lawless group $\Gamma$ and $n \in \mathbb{N}$, let $\mathcal{A}_{\Gamma} (n)$ be the minimal positive integer $M_n$ such that for all nontrivial reduced words $w$ of length at most $n$ in the free group of fixed…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…

Let $\Gamma$ be a torsion-free hyperbolic group. We study $\Gamma$--limit groups which, unlike the fundamental case in which $\Gamma$ is free, may not be finitely presentable or geometrically tractable. We define model $\Gamma$--limit…

We prove that in a torsion-free hyperbolic group $\Gamma$, the length of the value of each variable in a minimal solution of a quadratic equation $Q=1$ is bounded by $N|Q|^3$ for an orientable equation, and by $N|Q|^{4}$ for a…

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…

We introduce a quantitative notion of lawlessness for finitely generated groups, encoded by the "lawlessness growth function" $\mathcal{A}_{\Gamma} : \mathbb{N} \rightarrow \mathbb{N}$. We show that $\mathcal{A}_{\Gamma}$ is bounded iff…

We prove that for every $n \in \mathbb{N}$ and $\delta>0$ there exists a word $w_n \in F_2$ of length $n^{2/3} \log(n)^{3+\delta}$ which is a law for every finite group of order at most $n$. This improves upon the main result of [A. Thom,…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

Classical results on the classification of reflections in an arithmetic subgroup $\Gamma$ imply that if the graded algebra of modular forms $M_*(\Gamma)$ is freely generated, then $\Gamma$ must be an arithmetic subgroup of either the…

The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…

Let $\Gamma$ be a torsion-free hyperbolic group. We show that the set of solutions of any system of equations with one variable in $\Gamma$ is a finite union of points and cosets of centralizers if and only if any two-generator subgroup of…

We show that if $\Gamma$ is an infinite finitely generated finitely presented sofic group with zero first $L^{2}$ Betti number then the von Neumann algebra $L(\Gamma)$ is strongly $1$-bounded in the sense of Jung. In particular,…

Let K be a field of characteristic 0 and let n be a natural number. Let Gamma be a subgroup of the multiplicative group $(K^\ast)^n$ of finite rank r. Given $A_2,...,a_n\in K^\ast$ write $A(a_1,...,a_n,\Gamma)$ for the number of solutions…

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…

$ $Abert, Gelander and Nikolov [AGN17] conjectured that the number of generators $d(\Gamma)$ of a lattice $\Gamma$ in a high rank simple Lie group $H$ grows sub-linearly with $v = \mu(H / \Gamma)$, the co-volume of $\Gamma$ in $H$. We prove…

Normal residual finiteness growth measures how well a finitely generated group is approximated by its finite quotients. We show that any linear group $\Gamma \leq \mathrm{GL}_d(K)$ has normal residual finiteness growth asymptotically…

We study the word image of words with constants in ${\rm GL}(V)$ and show that it is large provided the word satisfies some natural conditions on its length and its critical constants. There are various consequences: We prove that for every…

Let $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of…

A finite group of order $n$ can be represented by its Cayley table. In the word-RAM model the Cayley table of a group of order $n$ can be stored using $O(n^2)$ words and can be used to answer a multiplication query in constant time. It is…

We consider two natural problems about nondeterministic finite automata. First, given such an automaton M of n states, and a length l, does M accept a word of length l? We show that the classic problem of triangle-free graph recognition…