English
Related papers

Related papers: The ranks of alternating string C-groups

200 papers

We determine C-special subgroups of the Bianchi groups of index bounded above by 120 by effectivising the arguments of Agol-Long-Reid. These subgroups are congruence of level 2 or 4 and retract to the free group on two generators. As a…

Group Theory · Mathematics 2020-10-28 Michelle Chu

We prove that the twisted group C*-algebra of an acylindrically hyperbolic group -- not necessarily having trivial finite radical -- has stable rank one.

Operator Algebras · Mathematics 2024-03-12 Sven Raum

We prove a first part of the standard description of groups $H$ lying between an exterior power of an elementary group $\bigwedge^m E_n(R)$ and a general linear group $GL_{n \choose m}(R)$ for a commutative ring $R$, $2\in R^*$ and…

Group Theory · Mathematics 2024-04-25 Roman Lubkov , Ilia Nekrasov

Let $G$ be a subgroup of the symmetric group $S_n$. If the proportion of fixed-point-free elements in $G$ (or a coset) equals the proportion of fixed-point-free elements in $S_n$, then $G=S_n$. The analogue for $A_n$ holds if $n \ge 7$. We…

Group Theory · Mathematics 2024-06-04 Bjorn Poonen , Kaloyan Slavov

In this paper we introduce the open Waring rank of a form of degree d in n variables and prove the that this rank in bounded from above by \binom{n+d-2}{d-1} - \binom{n+d-6}{d-3} whenever n, d >= 3. This proves the same upper bound for the…

Commutative Algebra · Mathematics 2013-05-31 Joachim Jelisiejew

We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

Logic in Computer Science · Computer Science 2017-07-19 Thomas Place , Marc Zeitoun

We prove that there is an absolute constant $c>0$ with the following property: if $Z/pZ$ denotes the group of prime order $p$, and a subset $A\subset Z/pZ$ satisfies $1<|A|<p/2$, then for any positive integer…

Number Theory · Mathematics 2009-12-04 Vsevolod F. Lev

An alternating sign matrix is a square matrix satisfying (i) all entries are equal to 1, -1 or 0; (ii) every row and column has sum 1; (iii) in every row and column the non-zero entries alternate in sign. The 8-element group of symmetries…

Combinatorics · Mathematics 2007-05-23 David P. Robbins

In this paper, Lie conformal superalgebras of rank (2 + 1) are completely classified (up to isomorphism) and their automorphism groups are determined. Furthermore, we give the classification of the finite irreducible conformal modules over…

Rings and Algebras · Mathematics 2025-05-07 Jinrong Wang , Xiaoqing Yue

Let A_n be the alternating group on n letters. For n>5, we describe the elements alpha, beta in A_n when alpha^{A_n} beta^{A_n} is the union of at most four distinct conjugacy classes.

Group Theory · Mathematics 2009-06-16 Edith Adan-Bante , John Harris , Helena Verrill

A limit group is the limit of a sequence of conjugates of the diagonal Cartan subgroup, C, of SL(3,R). We show C has 5 possible limit groups, up to conjugacy. Each limit group is determined by an equivalence class of nonstandard triangle,…

Geometric Topology · Mathematics 2015-03-12 Arielle Leitner

We study the generic and typical ranks of 3-tensors of dimension l x m x n using results from matrices and algebraic geometry. We state a conjecture about the exact values of the generic rank of 3-tensors over the complex numbers, which is…

Algebraic Geometry · Mathematics 2011-01-25 Shmuel Friedland

The graphs with permutation-representation number (\textit{prn}) at most two are known. While a characterization for the class of graphs with the \textit{prn} at most three is an open problem, we summarize the graphs of this class that are…

Discrete Mathematics · Computer Science 2023-10-03 Khyodeno Mozhui , K. V. Krishna

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

Number Theory · Mathematics 2023-03-20 Colin Alberts , Olivia Beckwith , Irfan Demetoglu , Robert Dicks , John H. Smith , Jasmine Wang

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Information Theory · Computer Science 2011-09-20 John Scoville

Given a finite word $w$ over a finite alphabet $V$, consider the graph with vertex set $V$ and with an edge between two elements of $V$ if and only if the two elements alternate in the word $w$. Such a graph is said to be word-representable…

Combinatorics · Mathematics 2021-01-15 Marisa Gaetz , Caleb Ji

All quasi-affine connected Generalized Dynkin Diagrams with rank $> 5$ are found. All quasi-affine Nichols (Lie braided) algebras with rank $> 5$ are also found.

Algebraic Geometry · Mathematics 2024-04-01 Zhengtang Tan , Shouchuan Zhang

We show that for all $n\leq X$ apart from $O(X\exp(-c(\log X)^{1/2}(\log \log X)^{1/2}))$ exceptions, the alternating group $A_n$ is invariably generated by two elements of prime order. This answers (in a quantitative form) a question of…

Group Theory · Mathematics 2023-08-24 Joni Teräväinen

In this paper we examine embeddings of alternating groups and symmetric groups into almost simple groups of exceptional type. In particular, we prove that unless the alternating or symmetric group has degree 6 or 7, there is no maximal…

Group Theory · Mathematics 2017-05-17 David A. Craven

Given a set of $t$ words of length $n$ over a $k$-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least $\frac{n}{k}+cn^{1-1/(t-k-2)}$, for some $c>0$ depending on $k$ and $t$. This is…

Combinatorics · Mathematics 2014-10-23 Boris Bukh , Jie Ma