Related papers: Hierarchical Complexity of Finite Groups
A finitely generated group is lacunary hyperbolic if one of its asymptotic cones is an $\mathbb{R}$-tree. In this article we give a necessary and sufficient condition on lacunary hyperbolic groups in order to be stable under free product by…
Long-range entanglement--the backbone of topologically ordered states--cannot be created in finite time using local unitary circuits, or equivalently, adiabatic state preparation. Recently it has come to light that single-site measurements…
We propose some axioms for hierarchical clustering of probability measures and investigate their ramifications. The basic idea is to let the user stipulate the clusters for some elementary measures. This is done without the need of any…
Finite covers are a technique for building new structures from simpler ones. The original motivation to study finite covers is in the Ladder theorem of Zilber which describes how totally categorical structures are built from strictly…
Nanoparticles with "sticky patches" have long been proposed as building blocks for the self-assembly of complex structures. The synthetic realizability of such patchy particles, however, greatly lags behind predictions of patterns they…
Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. The known upper bound on the time…
A subgroup $H$ of a group $G$ is $commensurated$ in $G$ if for each $g\in G$, $gHg^{-1}\cap H$ has finite index in both $H$ and $gHg^{-1}$. If there is a sequence of subgroups $H=Q_0\prec Q_1\prec ...\prec Q_{k}\prec Q_{k+1}=G$ where $Q_i$…
This paper considers the cohomology and bounded interpolation of nonstandard finite element complexes, e.g. Stokes, Hessian, Elasticity, divdiv. Compared to the standard finite element exterior calculus, the main challenge is the existence…
A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory…
This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…
We show that a differential algebraic group can be filtered by a finite subnormal series of differential algebraic groups such that successive quotients are almost simple, that is have no normal subgroups of the same type. We give a…
Given a complex of groups over a finite simplicial complex in the sense of Haefliger, we give conditions under which it is possible to build an EZ-structure in the sense of Farrell-Lafont for its fundamental group out of such structures for…
The Graph Minors Structure Theorem of Robertson and Seymour asserts that, for every graph $H,$ every $H$-minor-free graph can be obtained by clique-sums of ``almost embeddable'' graphs. Here a graph is ``almost embeddable'' if it can be…
Kernel matrices are ubiquitous in computational mathematics, often arising from applications in machine learning and scientific computing. In two or three spatial or feature dimensions, such problems can be approximated efficiently by a…
Our motivating goal is factorization in Krull Domains $H$ with finitely generated class group $G$. The elasticity $\rho(H)$ is the maximal number of atoms in any re-factorization of a product of $k$ atoms. The elasticities are the same as…
Shape complexity is a hard-to-quantify quality, mainly due to its relative nature. Biased by Euclidean thinking, circles are commonly considered as the simplest. However, their constructions as digital images are only approximations to the…
We discuss the notion of essential dimension of a finite group and explain its relation with birational algebraic geometry. We show how this leads to a (partial) classification of simple finite groups of essential dimension less than or…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…
We construct a series of finite-dimensional quantum groups as braided Drinfeld doubles of Nichols algebras of type Super A, for an even root of unity, and classify ribbon structures for these quantum groups. Ribbon structures exist if and…