The descending chain condition on solution sets for systems of equations in groups

We classify the groups that are the inverse limits of sequences of free groups of finite rank. Except free groups of finite rank, there exist four groups that are the inverse limits of sequences of free groups of finite rank.

Equations in groups play an important part in many applied questions of algebra and logic. The development of this theory is also connected with intrinsic problems in the theory of groups. The greatest progress has been in the theory of equations in free groups, and in the main it is to the latter that we shall devote our attention in this chapter.

In this article we relate two different densities. Let $F_k$ be the free group of finite rank $k \ge 2$ and let $\alpha$ be the abelianization map from $F_k$ onto $ \mathbb{Z}^k$. We prove that if $S \subseteq \mathbb{Z}^k$ is invariant under the natural action of $SL(k, \mathbb{Z})$ then the asymptotic density of $S$ in $\mathbb Z^k$ and the annular density of its full preimage $\alpha^{-1}(S)$ in $F_k$ are equal. This implies, in particular, that for every integer $t\ge 1$, the annular density of the set of elements in $F_k$ that map to $t$-th powers of primitive elements in $\mathbb{Z}^k$ is equal to $\frac{1}{t^k\zeta(k)}$, where $\zeta$ is the Riemann zeta-function. An element $g$ of a group $G$ is called a \emph{test element} if every endomorphism of $G$ which fixes $g$ is an automorphism of $G$. As an application of the result above we prove that the annular density of the set of all test elements in the free group $F(a,b)$ of rank two is $1-\frac{6}{\pi^2}$. Equivalently, this shows that the union of all proper retracts in $F(a,b)$ has annular density $\frac{6}{\pi^2}$. Thus being a test element in $F(a,b)$ is an ``intermediate property'' in the sense that the probability of being a test element is strictly between $0$ and $1$.

We consider free groups of finite rank and write F k for the absolutely free group of rank k, freely generated by f = {f1, ..., f k }. An automorphism of F k maps a verbal subgroup U(F k ) onto itself; hence

This paper is devoted to the computation of the space $$\mathrm{H}_\mathrm{b}^2(\Gamma ,H;{\mathbb {R}})$$ , where $$\Gamma $$ is a free group of finite rank $$n\ge 2$$ and $$H$$ is a subgroup of finite rank. More precisely we prove that $$H$$ has infinite index in $$\Gamma $$ if and only if $$\mathrm{H}_\mathrm{b}^2(\Gamma ,H;{\mathbb {R}})$$ is not trivial, and furthermore, if and only if there is an isometric embedding $$\oplus _\infty ^n\mathcal {D}({\mathbb {Z}})\hookrightarrow \mathrm{H}_\mathrm{b}^2(\Gamma ,H;{\mathbb {R}})$$ , where $$\mathcal {D}({\mathbb {Z}})$$ is the space of bounded alternating functions on $${\mathbb {Z}}$$ equipped with the defect norm.

Characterizing a free group in its automorphism group

Test sets for finite substitutions

We investigate algebraic sets over certain finitely generated torsion-free metabelian groups. The class of groups under consideration is the class of so-called ρ-groups. It consists of all wreath products of finitely generated free abelian groups and their subgroups. In particular, it includes all free metabelian groups of finite rank. Our main result is a characterization of certain irreducible algebraic sets over ρ-groups. More precisely, we consider irreducible algebraic sets which are determined by a system of equations in n indeterminates. For their coordinate groups, we introduce a discrete invariant called the relative characteristic. This is an ordered pair of non-negative integers. We determine the structure of the coordinate group of the n-dimensional affine space, and show that its relative characteristic is (n, n). Then we characterize the irreducible algebraic sets of relative characteristic (n, n) and (0, k ) where 0 ≤ k ≤ n . We also obtain some examples of somewhat unusual algebraic sets over ρ-groups, thus demonstrating that algebraic sets over these groups are much more varied and complicated than, say, algebraic sets over free groups.

We show that every right-angled Artin group AΓ defined by a graph Γ of finite chromatic number is poly-free with poly-free length bounded between the clique number and the chromatic number of Γ. Further, a characterization of all right-angled Artin groups of poly-free length 2 is given, namely the group AΓ has poly-free length 2 if and only if there exists an independent set of vertices D in Γ such that every cycle in Γ meets D at least twice. Finally, it is shown that AΓ is a semidirect product of two free groups of finite rank if and only if Γ is a finite tree or a finite complete bipartite graph. All of the proofs of the existence of polyfree structures are constructive.

Let G be a finite group, F a free group of finite rank, R the kernel of a homomorphism φ of F onto G, and let [R, F], [R, R] denote mutual commutator subgroups. Conjugation in F yields a G-module structure on R/[R, R] let dg(R/[R, R]) be the number of elements required to generate this module. Define d(R/[R, F]) similarly. By an earlier result of the first author, for a fixed G, the difference dG(R/[R, R]) − d(R/[R, F]) is independent of the choice of F and φ; here it is called the proficiency gap of G. If this gap is 0, then G is said to be proficient. It has been more usual to consider dF(R), the number of elements required to generate R as normal subgroup of F: the group G has been called efficient if F and φ can be chosen so that dF(R) = dG(R/[R, F]). An efficient group is necessarily proficient; but (though usually expressed in different terms) the converse has been an open question for some time.

A Presentation for the Automorphism Group of a Free Group of Finite Rank

In 1968–1969, A. V. Jategaonkar published his famous constructions of left but not right noetherian rings that provided counterexamples to several important conjectures of that era. These examples, and others like them, seemed to indicate that, in general, the task of completely understanding the structure of indecomposable injective modules over one-sided noetherian rings was hopeless. In this paper I show how to deduce by natural methods, directly from the known description of these rings and their properties, explicit computational descriptions of the indecomposable injective left modules over Jategaonkar's rings. I use these explicit descriptions to answer some simple structural questions about the indecomposables. The structure of indecomposable injective modules over a commutative noetherian ring has been well understood since the work of Matlis[10] in the 1950's. There is a natural correspondence between the indecomposable injectives and the localizations of the ring, and the structure of ...

The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard over any field. When the number of equations m is the same as the number of unknowns n the best known algorithms are exhaustive search for small fields, and a Gröbner base algorithm for large fields. Gröbner base algorithms have large exponential complexity and cannot solve in practice systems with n ≥ 15. Kipnis and Shamir [9] have recently introduced a new algorithm called “relinearization”. The exact complexity of this algorithm is not known, but for sufficiently overdefined systems it was expected to run in polynomial time.In this paper we analyze the theoretical and practical aspects of relinearization. We ran a large number of experiments for various values of n and m, and analysed which systems of equations were actually solvable. We show that many of the equations generated by relinearization are linearly dependent, and thus relinearization is less efficient that one could expect. We then develop an improved algorithm called XL which is both simpler and more powerful than relinearization. For all 0 < ε ≤ 1/2, and m ≥ εn 2, XL and relinearization are expected to run in polynomial time of approximately \( n^{\mathcal{O}(1/\sqrt \varepsilon )} \). Moreover, we provide strong evidence that relinearization and XL can solve randomly generated systems of polynomial equations in subexponential time when m exceeds n by a number that increases slowly with n.KeywordsQuadratic EquationExhaustive SearchAsymptotic ComplexityExact ComplexityMultivariate EquationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

A description of the general solution of given bounded periodicity exponent is obtained for an arbitrary system of equations in a free group. On the basis of this result an algorithm is constructed that computes the rank of coefficient-free systems of equations. Bibliography: 7 titles.

A kind of fixed-point problem in the area of discrete tomography is proposed and investigated.Our chief concern in this paper is the case of square windows in the plane.Dealing with the arrays which are bounded, of polynomial growth, and finite-ring-valued, one comes across several interesting phenomena of combinatorial and arithmetic nature.