Related papers: Short presentations for crystallographic groups
The Cayley-crystals introduced in [F. R. Lux and E. Prodan, Annales Henri Poincar\'e 25(8), 3563 (2024)] are a class of lattices endowed with a Hamiltonian whose translation group $G$ is generic and possibly non-commutative. We show that…
We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…
We have defined weight of the pair $(\langle S \mid R \rangle, R)$ for a given presentation $\langle S \mid R \rangle$ of a group, where the number of generators is equal to the number of relations. We present an algorithm to construct…
We give several new positive finite presentations for the pure braid group that are easy to remember and simple in form. All of our presentations involve a metric on the punctured disc so that the punctures are arranged "convexly", which is…
Generators and defining relations for wreath products of groups are given. Under some condition (conormality of the generators) they are minimal. In particular, it is just the case for the Sylow subgroups of the symmetric groups.
Numerical estimates are given for the spectral radius of simple random walks on Cayley graphs. Emphasis is on the case of the fundamental group of a closed surface, for the usual system of generators.
For a connected graph L, let G(L) be a group with generators the vertex set of L, subject only to the relations that the ends of each edge commute. Now let H(L) be the kernel of the homomorphism from G(L) to the integers that takes each…
In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…
This paper considers minimum-dimensional representations of graphs in pseudo-Euclidean spaces, where adjacency and non-adjacency relations are reflected in fixed scalar square values. A representation of a simple graph $(V,E)$ is a mapping…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
We study the properties of groups that have presentations in which the square of each generator gives the identity and all relations are of even length. We consider the parabolic subgroups of such a group and show that every element has a…
A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…
Condensed ionic systems are described in the framework of a combined approach that takes into account both long-range and short-range interactions. Short-range interaction is expressed in terms of mean potentials and long-range interaction…
We consider a question of Edjvet and Vdovina concerning which groups defined by special presentations are large. For each integer $n \ge 3$, we construct an $n$-generator one-relator presentation whose star graph is the complete bipartite…
Deformation K-theory associates to each discrete group G a spectrum built from spaces of finite dimensional unitary representations of G. In all known examples, this spectrum is 2-periodic above the rational cohomological dimension of G…
We give formulae for a module presentation of the module of identities among relations for a presentation of a group, in terms of information on 0- and 1-combings of the Cayley graph. This is seen as a special case of extending a partial…
Low-rank matrices are pervasive throughout statistics, machine learning, signal processing, optimization, and applied mathematics. In this paper, we propose a novel and user-friendly Euclidean representation framework for low-rank matrices.…
We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.
The aim of this paper is to analyse algorithms for constructing presentations of graph braid groups from the point of view of anyonic quantum statistics on graphs. In the first part of this paper, we provide a comprehensive review of an…
Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…