Related papers: Redundant relators in cyclic presentations of grou…
Bott and Samuelson constructed explicit cycles representing a basis of the Z_2-homology of the orbits of variationally complete representations of compact Lie groups. As a consequence, all those orbits are taut. We were able to show that an…
We classify irreducible unitary representations of the group of all infinite matrices over a $p$-adic field ($p\ne 2$) with integer elements equipped with a natural topology. Any irreducible representation passes through a group $GL$ of…
We explicitly determine all CI-groups with respect to ternary relational structures that have the form $C \times D$, where $C$ is cyclic and $D$ is either a dicyclic group whose order is not divisible by $3$ or a dihedral group. Such groups…
The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. For a graph G with a certain reflective symmetry, we generalize a result of Ciucu-Yan-Zhang factorizing the spanning tree…
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we…
We show that, when the actions of a Mazurkiewicz trace are considered not merely as atomic (i.e., mere names) but transformations from a specified type of inputs to a specified type of outputs, we obtain a novel notion of presentation for…
The paper gives two approaches to write explicit presentations for the class of Dehn quandles using presentations of their underlying groups. The first approach gives finite presentations for Dehn quandles of a class of Garside groups and…
The representation theory for categorical groups is constructed. Each categorical group determines a monoidal bicategory of representations. Typically, these categories contain representations which are indecomposable but not irreducible. A…
We give a finite presentation by generators and relations of the unitary operators expressible over the {CNOT, T, X} gate set, also known as CNOT-dihedral operators. To this end, we introduce a notion of normal form for CNOT-dihedral…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
We show that under suitable hypotheses, the second homotopy group of the coned-off space associated to a $C(9)$ cubical presentation is trivial, and use this to provide classifying spaces for proper actions for the fundamental groups of…
A cyclic random walk is a random walk whose transition probabilities/rates can be written as a superposition of the empirical measures of a family of finite cycles. This identifies a convex set of models. We discuss the problem of…
A set of independence statements may define the independence structure of interest in a family of joint probability distributions. This structure is often captured by a graph that consists of nodes representing the random variables and of…
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…
In this paper we study obstructions to presentability by products for finitely generated groups. Along the way we develop both the concept of acentral subgroups, and the relations between presentability by products on the one hand, and…
We extend classical results on the classification of reversible elements of the group $\mathrm{GL}(n, \mathbb{C})$ (and $\mathrm{GL}(n, \mathbb{R})$) to $\mathrm{GL}(n, \mathbb{H})$ using an infinitesimal version of the classical…
A group theoretical description of basic discrete symmetries (space inversion P, time reversal T and charge conjugation C) is given. Discrete subgroups of orthogonal groups of multidimensional spaces over the fields of real and complex…
The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of ``elementary transformations" which are Nielsen transformations augmented by arbitrary…
A cycle-transversal of a graph G is a subset T of V(G) such that T intersects every cycle of G. A clique cycle-transversal, or cct for short, is a cycle-transversal which is a clique. Recognizing graphs which admit a cct can be done in…
We propose a systematic scheme for computing the variation of rearrangement operators arising in the recently developed spectral geometry on noncommutative tori and $\theta$-deformed Riemannian manifolds. It can be summarized as a category…