Related papers: Short presentations of finite simple groups

We introduce a compressed suffix array representation that, on a text $T$ of length $n$ over an alphabet of size $\sigma$, can be built in $O(n)$ deterministic time, within $O(n\log\sigma)$ bits of working space, and counts the number of…

The notion of defining relations is well-defined for any nilpotent Lie algebra. Therefore a conventional way to present a simple Lie algebra G is by splitting it into the direct sum of a commutative Cartan subalgebra and two maximal…

In this note, we investigate how different fundamental groups of presentations of a fixed algebra $A$ can be. For finitely many finitely presented groups $G_i$, we construct an algebra $A$ such that all $G_i$ appear as fundamental groups of…

For a non-cyclic finite group $G$, let $\gamma(G)$ denote the smallest number of conjugacy classes of proper subgroups of $G$ needed to cover $G$. Bubboloni, Praeger and Spiga, motivated by questions in number theory, have recently…

An orientable sequence of order $n$ is a cyclic binary sequence such that each length-$n$ substring appears at most once \emph{in either direction}. Maximal length orientable sequences are known only for $n\leq 7$, and a trivial upper bound…

Let $s(n)$ be the minimum number of edges in a graph that contains every $n$-vertex tree as a subgraph. Chung and Graham [J. London Math. Soc. 1983] claim to prove that $s(n)\leqslant O(n\log n)$. We point out a mistake in their proof. The…

We investigate subsets with small sumset in arbitrary abelian groups. For an abelian group $G$ and an $n$-element subset $Y \subseteq G$ we show that if $m \ll s^2/(\log n)^2$, then the number of subsets $A \subseteq Y$ with $|A| = s$ and…

We solve an open problem related to an optimal encoding of a straight line program (SLP), a canonical form of grammar compression deriving a single string deterministically. We show that an information-theoretic lower bound for representing…

$ $Abert, Gelander and Nikolov [AGN17] conjectured that the number of generators $d(\Gamma)$ of a lattice $\Gamma$ in a high rank simple Lie group $H$ grows sub-linearly with $v = \mu(H / \Gamma)$, the co-volume of $\Gamma$ in $H$. We prove…

Gonz{\'a}lez-Acu{\~n}a showed that Artin presentations characterize closed, orientable $3$-manifold groups. Winkelnkemper later discovered that each Artin presentation determines a smooth, compact, simply-connected $4$-manifold. We utilize…

A set $\mathcal{G}$ of integers is called a $g$-Golomb ruler of length $n$ if the difference between any two distinct elements of $\mathcal{G}$ is repeated at most $g$ times. If $g=1$, these are also called $B_2$-sets, Sidon sets, and…

We study the problem of computing a longest increasing subsequence in a sequence $S$ of $n$ distinct elements in the presence of persistent comparison errors. In this model, every comparison between two elements can return the wrong result…

A Straight-Line Program (SLP) $G$ for a string $T$ is a context-free grammar (CFG) that derives $T$ only, which can be considered as a compressed representation of $T$. In this paper, we show how to encode $G$ in $n \lceil \lg N \rceil + (n…

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…

In this paper we study the minimal number of translates of an arbitrary subset $S$ of a group $G$ needed to cover the group, and related notions of the efficiency of such coverings. We focus mainly on finite subsets in discrete groups,…

We provide lower estimates on the minimal number of generators of the profinite completion of free products of finite groups. In particular, we show that if C_1,...,C_n are finite cyclic groups then there exists a finite group G which is…

It is known that the level $2$ principal congruence subgroup of $GL(n;\mathbb{Z})$ has a finite generating set. In this paper, we give a finite presentation of the level $2$ principal congruence subgroup of $GL(n;\mathbb{Z})$.

The generalized order $e_G(g)$ of an element $g$ of a group $G$ is the smallest positive integer $k$ such that there exist $x_1,\ldots,x_k \in G$ such that $g^{x_1} \ldots g^{x_k}=1$, where $g^x=x^{-1}gx$. Let $e(G) = \max \{e_G(g)\ |\ g…

Composing with the inclusion $\mathsf{Set}\to\mathsf{Cat} $, a graph $G$ internal to $\mathsf{Set} $ becomes a graph of discrete categories, the coinserter of which is the category freely generated by $G$. Introducing a suitable definition…

Let $\mathcal A$ be an $\mathbb F$-algebra and let $\mathcal S$ be its generating set. The length of $\mathcal S$ is the smallest number $k$ such that $\mathcal A$ equals the $\mathbb F$-linear span of all products of length at most $k$ of…