Related papers: Permutation-Based Distances for Groups and Group-V…
Symmetry principles underlie and guide scientific theory and research, from Curie's invariance formulation to modern applications across physics, chemistry, and mathematics. Building on a recent matrix Lie group measurement model, this…
Non-invertible symmetries of a quantum field theory (QFT) are a natural generalization of unitary symmetries, but in which the product of operators does not satisfy a group multiplication law. We show that such symmetry operations on states…
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…
In contrast to being automatic, being Cayley automatic \emph{a priori} has no geometric consequences. Specifically, Cayley graphs of automatic groups enjoy a fellow traveler property. Here we study a distance function introduced by the…
The variation in genome arrangements among bacterial taxa is largely due to the process of inversion. Recent studies indicate that not all inversions are equally probable, suggesting, for instance, that shorter inversions are more frequent…
The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…
We study deterministic and quantum dynamics from a constructive "finite" point of view, since the introduction of a continuum, or other actual infinities in physics poses serious conceptual and technical difficulties, without any need for…
We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…
The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…
In the study of walks with small steps confined to multidimensional orthants, a certain group of transformations plays a central role. In particular, several techniques to potentially compute the generating function, including the orbit sum…
We consider a classical problem in choice theory -- vote aggregation -- using novel distance measures between permutations that arise in several practical applications. The distance measures are derived through an axiomatic approach, taking…
We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated…
The finite dihedral group generated by one rotation and one flip is the simplest case of the non-abelian group. Cayley graphs are diagrammatic counterparts of groups. In this paper, much attention is given to the Cayley graph of the…
In this paper we prove that any finite group of order $n$ can be viewed as the group of the solutions of a certain matrix equation $XB=BY$, where the unknowns $X,Y$ are two permutation matrices of order $n$ and $(1+k)n+2 $ respectively and…
We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…
A skew-morphism of a finite group $G$ is a permutation $\s$ on $G$ fixing the identity element, and for which there exists an integer function $\pi$ on $G$ such that $\s(xy)=\s(x)\s^{\pi(x)}(y)$ for all $x,y\in G$. It has been known that…
We construct an explicit generating sets $F_n$ and $\tilde F_n$ of the alternating and the symmetric groups, which make the Cayley graphs $C(Alt(n), F_n)$ and $C(Sym(n), \tilde F_n)$ a family of bounded degree expanders for all sufficiently…
We show that the Subgroup distance problem regarding the Hamming distance, the Cayley distance and the $l_\infty$ distance is NP-complete when the input group is cyclic. When we restrict the $l_\infty$ distance to fixed values we show that…