English
Related papers

Related papers: Ascending chain condition in generic groups

200 papers

We give a sufficient condition for a sequence of normal subgroups of a free group to have the property that both, their growths tend to the upper bound and their cogrowths tend to the lower bound. The condition is represented by planarity…

Dynamical Systems · Mathematics 2015-12-15 Johannes Jaerisch , Katsuhiko Matsuzaki

We prove that any non-cocompact irreducible lattice in a higher rank semi-simple Lie group contains a subgroup of finite index, which has three generators.

Group Theory · Mathematics 2013-02-28 Ritumoni Sarma , T. N. Venkataramana

We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…

Group Theory · Mathematics 2015-09-17 Rostislav Grigorchuk , Konstantin Medynets

Let $G$ be a multiplicative subsemigroup of the general linear group $\Gl(\mathbb{R}^d)$ which consists of matrices with positive entries such that every column and every row contains a strictly positive element. Given a $G$--valued random…

Probability · Mathematics 2011-11-09 Mariusz Mirek

We consider the problem of determining all pairs (c_1, c_2) of Chern classes of rank 2 bundles that are cokernel of a skew-symmetric matrix of linear forms in 3 variables, having constant rank 2c_1 and size 2c_1+2. We completely solve the…

Algebraic Geometry · Mathematics 2016-02-09 Ada Boralevi , Emilia Mezzetti

Let $G$ denote a graph and $k\geq2$ be an integer. A $\{K_{1,1},K_{1,2},\ldots,K_{1,k},\mathcal{T}(2k+1)\}$-factor of $G$ is a spanning subgraph, whose every connected component is isomorphic to an element of…

Combinatorics · Mathematics 2024-10-10 Sizhong Zhou

We prove that a random group, in Gromov's density model with $d < 1/16$ satisfies with overwhelming probability a universal-existential first-order sentence $\sigma$ (in the language of groups) if and only if $\sigma$ is true in a…

Logic · Mathematics 2022-12-23 Olga Kharlampovich , Rizos Sklinos

Let $q$ be an odd prime, $m$ a positive integer, and let $\Ga_m(q)$ be the group generated by two elements $x$ and $y$ subject to the relations $x^{2m}=y^{qm}=1$ and $x^2=y^q$; that is, $\Ga_m(q)$ is the free product of two cyclic groups of…

Group Theory · Mathematics 2008-12-23 Christian Krattenthaler , Thomas W. Müller

We construct monoid algebras which satisfy the ascending chain condition on principal ideals and which have the property that every nonempty subset of $\mathbb{N}_{\ge 2}$ occurs as a length set.

Commutative Algebra · Mathematics 2024-04-18 Alfred Geroldinger , Felix Gotti

Let M be a family of sequences (a_1,...,a_p) where each a_k is a flat in a projective geometry of rank n (dimension n-1) and order q, and the sum of ranks, r(a_1) + ... + r(a_p), equals the rank of the join a_1 v ... v a_p. We prove upper…

Combinatorics · Mathematics 2007-05-23 Matthias Beck , Thomas Zaslavsky

Assume that $K$ is a field and $I_{1}\subsetneq ...\subsetneq I_{t}$ is an ascending chain (of length $t$) of ideals in the polynomial ring $K[x_{1},,...,x_{m}]$, for some $m\geq 1$. Suppose that $I_{j}$ is generated by polynomials of…

Commutative Algebra · Mathematics 2016-05-23 Grzegorz Pastuszak

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Group Theory · Mathematics 2019-05-31 S. P. Glasby

For an arbitrary countable group G = <A|R> given by its generators A and defining relations R we discuss a specific method for embedding of G into a certain 2-generator group T. Our embedding explicitly lists the images of generators from A…

Group Theory · Mathematics 2020-09-23 V. H. Mikaelian

We generalize the concept of the group determinant and prove a necessary and sufficient novel condition for a subset to be a subgroup. This development is based on the group determinant work by Edward Formanek, David Sibley, and Richard…

Representation Theory · Mathematics 2023-03-03 Naoya Yamaguchi , Yuka Yamaguchi

The generalized Kneser graph $K(n,k,t)$ for integers $k>t>0$ and $n>2k-t$ is the graph whose vertices are the $k$-subsets of $\{1,\dots,n\}$ with two vertices adjacent if and only if they share less than $t$ elements. We determine the…

Combinatorics · Mathematics 2022-03-29 Klaus Metsch

Conjugacy separability of any group of the class of one-relator groups given by the presentation $<a, b; [a^m,b^n]=1>$ ($m,n>1$) is proven.

Group Theory · Mathematics 2007-05-23 D. Tieudjo , D. I. Moldavanskii

Let $G_{m \times n}$ be an $m \times n$ real random matrix whose elements are independent and identically distributed standard normal random variables, and let $\kappa_2(G_{m \times n})$ be the 2-norm condition number of $G_{m \times n}$.…

Numerical Analysis · Computer Science 2008-10-07 Zizhong Chen , Jack Dongarra

Let $k\ge 2$. We prove that the characteristic sequence of a regular language over a $k$-letter alphabet is $k$-automatic. More generally, if $t\ge 2$ and $t,k$ are multiplicatively dependent, we show that the characteristic sequence of a…

Formal Languages and Automata Theory · Computer Science 2018-07-24 Michel Rigo , Robert Underwood

In this paper, we bring the terminology of the Kunz coordinates of numerical semigroups to gapsets and we generalize this concept to $m$-extensions. It allows us to identify gapsets and, in general, $m$-extensions with tilings of boards. As…

Combinatorics · Mathematics 2022-08-17 Gilberto B. Almeida Filho , Matheus Bernardini

Adding two generators and one arbitrary relator to a nontrivial torsion-free group, we always obtain an SQ-universal group. In the course of the proof of this theorem, we obtain some other results of independent interest. For instance,…

Group Theory · Mathematics 2007-07-29 Anton A. Klyachko