Related papers: Permutation-Based Distances for Groups and Group-V…
Given two finite groups G(.), G(*) defined on the same set G, their distance is the number of pairs (x,y) for which x.y and x*y differ. The Cayley stability of a group G(.) is the minimum distance of G(.) from another group defined on G. We…
In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for…
Computational asymmetry, i.e., the discrepancy between the complexity of transformations and the complexity of their inverses, is at the core of one-way transformations. We introduce a computational asymmetry function that measures the…
This note is a continuation of the study of the relationship between the geometry of Cayley graphs and the size of its metric-functional boundary. We show that, if there exists a Cayley graph with finitely many Busemann points, then the…
Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that…
The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…
Mathematical core of quantum mechanics is the theory of unitary representations of symmetries of physical systems. We argue that quantum behavior is a natural result of extraction of "observable" information about systems containing…
The classical Cayley transform is a birational map between a quadratic matrix group and its Lie algebra, which was first discovered by Cayley in 1846. Because of its essential role in both pure and applied mathematics, the classical Cayley…
The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…
Similarity search is an important problem in information retrieval. This similarity is based on a distance. Symbolic representation of time series has attracted many researchers recently, since it reduces the dimensionality of these high…
We study invariant and bi-invariant metrics on groups focusing on finite groups $G$. We show that non-equivalent (bi) invariant metrics on $G$ are in 1-1 correspondence with unitary symmetric (conjugate) partitions on $G$. To every metric…
Deformed generalized gauge groups, whch were created from physical considerations and made it possible to clarify some long-standing problems in physics, such as the problem of motion and the problem of the energy of the gravitational…
In this paper we study discrete-time quantum walks on Cayley graphs corresponding to Dihedral groups, which are graphs with both directed and undirected edges. We consider the walks with coins that are one-parameter continuous deformation…
Group theory is used in many textbooks of contemporary physics. However, electromagnetic community often considers group theory as an "exotic" tool. Graduate and postgraduate textbooks on electromagnetics and electrodynamics usually do not…
Classical Lie group theory provides a universal tool for calculating symmetry groups for systems of differential equations. However Lie's method is not as much effective in the case of integral or integro-differential equations as well as…
In this paper we consider Tyler's robust covariance M-estimator under group symmetry constraints. We assume that the covariance matrix is invariant to the conjugation action of a unitary matrix group, referred to as group symmetry. Examples…
Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…
This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…
In this work we consider interval metrics on groups; that is, integral invariant metrics whose associated weight functions do not have gaps. We give conditions for a group to have and to have not interval metrics. Then we study Lee metrics…
We study groups acting by length-preserving transformations on spaces equipped with asymmetric, partially-defined distance functions. We introduce a natural notion of quasi-isometry for such spaces and exhibit an extension of the…