Related papers: Efficient Isomorphism Testing for a Class of Group…
We study the complexity of isomorphism problems for d-way arrays, or tensors, under natural actions by classical groups such as orthogonal, unitary, and symplectic groups. Such problems arise naturally in statistical data analysis and…
We study properties of a group, abelian group, ring, or monoid $B$ which (a) guarantee that every homomorphism from an infinite direct product $\prod_I A_i$ of objects of the same sort onto $B$ factors through the direct product of finitely…
Group classification of a class of nonlinear fin equations is carried out exhaustively. Additional equivalence transformations and conditional equivalence groups are also found. They allow to simplify results of classification and further…
The power graph and the enhanced power graph of a group $\mathbf G$ are simple graphs with vertex set $G$; two elements of $G$ are adjacent in the power graph if one of them is a power of the other, and they are adjacent in the enhanced…
Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in…
We find an algorithmic procedure that enables to compute and to describe the structure of the isotropy subgroups of the group of complex orthogonal matrices with respect to the action of similarity on complex symmetric matrices. A key step…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
We resolve the question of whether Fourier sampling can efficiently solve the hidden subgroup problem. Specifically, we show that the hidden subgroup problem over the symmetric group cannot be efficiently solved by strong Fourier sampling,…
The classification of gradings by abelian groups on finite direct sums of simple finite-dimensional nonassociative algebras over an algebraically closed field is reduced, by means of the use of loop algebras, to the corresponding problem…
In this work, we introduce bidirectional collision detection --- a new algorithmic tool that applies to the collision problems that arise in many isomorphism problems. For the group isomorphism problem, we show that bidirectional collision…
Based on the recent development of commutator theory for loops, we provide both syntactic and semantic characterization of abelian normal subloops. We highlight the analogies between well known central extensions and central nilpotence on…
In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…
We classify gradings by arbitrary abelian groups on the classical simple Lie and Jordan superalgebras $Q(n)$, $n \geq 2$, over an algebraically closed field of characteristic different from $2$ (and not dividing $n+1$ in the Lie case): fine…
A matching from a finite subset $A$ of an abelian group to another subset $B$ is a bijection $f:A\rightarrow B$ with the property that $a+f(a)$ never lies in $A$. A matching is called acyclic if it is uniquely determined by its multiplicity…
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
Multi-Higgs models equipped with global symmetry groups, either exact or softly broken, offer a rich framework for constructions beyond the Standard Model and lead to remarkable phenomenological consequences. Knowing all the symmetry…
We explore the role of group symmetries in binary classification tasks, presenting a novel framework that leverages the principles of Neyman-Pearson optimality. Contrary to the common intuition that larger symmetry groups lead to improved…
We consider two variants of those Abelian groups with all proper strongly invariant subgroups isomorphic and give an in-depth study of their basic and specific properties in either parallel or contrast to the Abelian groups with all proper…
The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…
A fundamental problem in robust learning is asymmetry: a learner needs to correctly classify every one of exponentially-many perturbations that an adversary might make to a test-time natural example. In contrast, the attacker only needs to…