Related papers: Word length versus lower central series depth for …
In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds…
We describe a bound on the degree of the generators for some adjoint rings on surfaces and threefolds.
This paper continues the study of the lower central series quotients of an associative algebra A, regarded as a Lie algebra, which was started in math/0610410 by Feigin and Shoikhet. Namely, it provides a basis for the second quotient in…
The dead-end depth of an element g of a group G, with respect to a generating set A is the distance from g to the complement of the radius $d_A(1,g)$ closed ball, in the word metric $d_A$ defined with respect to A. We exhibit a finitely…
For the right-angled Artin group action on the extension graph, it is known that the minimal asymptotic translation length is bounded above by 2 provided that the defining graph has diameter at least 3. In this paper, we show that the same…
We show that non-abelian two-generator subgroups of right-angled Artin groups are quasi-isometrically embedded free groups. This provides an alternate proof of a theorem of A. Baudisch: that all two-generator subgroups are free or free…
The basic sequence of a homogeneous ideal $I\sset R=k[\seq{x}{1}{r}]$ defining an Artinian graded ring $A=R/I$ not having the weak Lefschetz property has the property that the first term of the last part is less than the last term of the…
In the first part of this paper we prove that the mapping class subgroups generated by the $D$-th powers of Dehn twists (with $D\geq 2$) along a sparse collection of simple closed curves on an orientable surface are right angled Artin…
Let R be a ring and G a group. An R-module A is said to be minimax if A includes an noetherian submodule B such that A=B is artinian. The authors study a ZG-module A such that A/C_A(H) is minimax (as a Z-module) for every proper not…
This paper is a continuation of [GLT], which develops a level theory and establishes strong character bounds for finite simple groups of linear and unitary type in the case that the centralizer of the element has small order compared to…
We prove a division algorithm for group rings of high genus surface groups and use it to show that some $2$-complexes with surface fundamental groups are standard. We also give an application of division to cohomological dimension of…
A non-cyclic finite $p$-group $G$ is said to be thin if every normal subgroup of $G$ lies between two consecutive terms of the lower central series and $|\gamma_i(G):\gamma_{i+1}(G)|\le p^2$ for all $i\geq 1$. In this paper, we determine…
The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…
We give a short proof of the following theorem of Sang-hyun Kim: if $A(\Gamma)$ is a right-angled Artin group with defining graph $\Gamma$, then $A(\Gamma)$ contains a hyperbolic surface subgroup if $\Gamma$ contains an induced subgraph…
Given an affine Coxeter group $W$, the corresponding Shi arrangement is a refinement of the corresponding Coxeter hyperplane arrangements that was introduced by Shi to study Kazhdan-Lusztig cells for $W$. In particular, Shi showed that each…
In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and five. Also, we give examples to show the order of the bound we give is sharp.
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.
A common feature of Coxeter groups and right-angled Artin groups is their solution to the word problem. Matthew Dyer introduced a class of groups, which we call Dyer groups, sharing this feature. This class includes, but is not limited to,…
Given any generating set of any pseudo-Anosov-containing subgroup of the mapping class group of a surface, we construct a pseudo-Anosov with word length bounded by a constant depending only on the surface. More generally, in any subgroup G…
We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…