Related papers: Verbal width in arithmetic Chevalley groups
The work takes another look at the number of runs that a string might contain and provides an alternative proof for the bound. We also propose another stronger conjecture that states that, for a fixed order on the alphabet, within every…
In this article we improve the known uniform bound for subgroup growth of Chevalley groups over $\mathbf{G}(\mathbb{F}_p[[t]])$. We introduce a new parameter, the ridgeline number $v(\mathbf{G})$, and give new bounds for the subgroup growth…
The classical Chevalley-Weil theorem asserts that for an \'etale covering of projective varieties over a number field K, the discriminant of the field of definition of the fiber over a K-rational point is uniformly bounded. We obtain a…
In this paper, we show that the volumes for a family of A-adequate closed braids can be bounded above and below in terms of the twist number, the number of braid strings, and a quantity that can be read from the combinatorics of a given…
We define a GL-variety to be a (typically infinite dimensional) algebraic variety equipped with an action of the infinite general linear group under which the coordinate ring forms a polynomial representation. Such varieties have been used…
We prove the triviality of the Grothendieck ring of a integer-valued field K under slight conditions on the logical language and on K. We construct a definable bijection from the plane K^2 to itself minus a point. When we specialize to…
We study numerically and analytically the average length of reduced (primitive) words in so-called locally free and braid groups. We consider the situations when the letters in the initial words are drawn either without or with…
We prove that every isomorphism of Chevalley groups of type $G_2$ over commutative local rings with 1/2 and 1/3 is standard, i. e., it is a composition of a ring isomorphism and an inner automorphism.
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete…
We propose a distributional theory of how hypernymy -- the ``is-a'' relation between general and specific concepts -- is encoded geometrically in language representations. Starting from the empirically verified assumption that words closer…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We prove that a homomorphism between free groups of finite rank equipped with the bi-invariant word metrics is a quasi-isometry if and only if it is an isomorphism.
We show that the verbal width is infinite for acylindrically hyperbolic groups, which include hyperbolic groups, mapping class groups and Out(Fn).
We explore "semibounded" expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We show that if $\mathcal R=\langle R, <, +, \dots\rangle$ is a semibounded o-minimal structure and…
A group $G$ is called root graded if it has a family of subgroups $G_\alpha$ indexed by roots from a root system $\Phi$ satisfying natural conditions similar to Chevalley groups over commutative unital rings. For any such group there is a…
If $\A$ is an algebra over a field $\F$ and $\s$ is a generating set of $\A$, the length of $\s$ indicates the maximal length needed to express an arbitrary element of $\A$ as a linear combination of words in the elements of $\s$. The…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
Weight enumerators are important tools for deciphering the algebraic structure of the related code spaces and for understanding group actions on these spaces. Our study focuses on symmetrized weight enumerators of pairs of Type II codes…
Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…
We construct certain integral structures for the cores of reduced tame extended affine Lie algebras of rank at least 2. One of the main tools to achieve this is a generalization of Chevalley automorphisms in the context of extended affine…