Related papers: The conjugacy problem in $GL(n,Z)$
In Grochow and Qiao (SIAM J. Comput., 2021), the complexity class Tensor Isomorphism (TI) was introduced and isomorphism problems for groups, algebras, and polynomials were shown to be TI-complete. In this paper, we study average-case…
Computational problems concerning the orbit of a point under the action of a matrix group occur throughout computer science, including in program analysis, complexity theory, quantum computation, and automata theory. In many cases the focus…
In this paper we describe the set of conjugacy classes in the group SL(n,Z). We expand geometric Gauss Reduction Theory that solves the problem for SL(2,Z) to the multidimensional case. Further we find complete invariant of classes in terms…
We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…
We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…
Predicting the cheapest sample size for the optimal stratification in multivariate survey design is a problem in cases where the population frame is large. A solution exists that iteratively searches for the minimum sample size necessary to…
Previous work identifying depth-optimal $n$-channel sorting networks for $9\leq n \leq 16$ is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper…
Symmetry is a guiding principle in physics that allows to generalize conclusions between many physical systems. In the ongoing search for new topological phases of matter, symmetry plays a crucial role because it protects topological…
Let G be a noncyclic group of order 4, and let K be the ring Z of rational integers, the localization of Z at the prime 2 and the ring of 2-adic integers, respectively. We describe, up to conjugacy, all of the indecomposable subgroups in…
Bell and Zhang have shown that if $A$ and $B$ are two connected graded algebras finitely generated in degree one that are isomorphic as ungraded algebras, then they are isomorphic as graded algebras. We exploit this result to solve the…
Generating multiple-choice questions (MCQs) with difficulty estimation remains challenging in automated MCQ-generation systems used in adaptive, AI-assisted education. This study proposes a novel methodology for generating MCQs with…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
Toral automorphisms, represented by unimodular integer matrices, are investigated with respect to their symmetries and reversing symmetries. We characterize the symmetry groups of GL(n,Z) matrices with simple spectrum through their…
Landau-Ginzburg mirror symmetry studies isomorphisms between graded Frobenius algebras, known as A- and B-models. Fundamental to constructing these models is the computation of the finite, Abelian $\textit{maximal symmetry group}$…
Coalition formation is a fundamental type of interaction that involves the creation of coherent groupings of distinct, autonomous, agents in order to efficiently achieve their individual or collective goals. Forming effective coalitions is…
In this paper we present algorithms for several string problems in the Congested Clique model. In the Congested Clique model, $n$ nodes (computers) are used to solve some problem. The input to the problem is distributed among the nodes, and…
For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…
Firstly, we give a partial solution to the isomorphism problem for uniserial modules of finite length with the help of the morphisms between these modules over an arbitrary ring. Later, under suitable assumptions on the lattice of the…
We design efficient algorithms to evaluate modular equations of Siegel and Hilbert type for abelian surfaces over number fields or finite fields using complex approximations. Their output is provably correct when the associated graded ring…
As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…