Related papers: On the Identity and Group Problems for Complex Hei…
We introduce the notion of a probabilistic identity of a residually finite group. We prove that a finitely generated linear group satisfies a probabilistic identity if and only if it is virtually solvable. As an application, we prove a…
We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring $\mathbb{Z} G$ of a finite nilpotent group $G$, this provided the rational group algebra $\mathbb{Q} G$…
We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…
The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…
Using ideas from automata theory we design a new efficient (deterministic) identity test for the \emph{noncommutative} polynomial identity testing problem (first introduced and studied in \cite{RS05,BW05}). We also apply this idea to the…
Complexity problems associated with finite rings and finite semigroups, particularly semigroups of matrices over a field and the Rees matrix semigroups, are examined. Let M_nF be the ring of n x n matrices over the finite field F and let…
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…
The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with…
We present a new proof for the main claim made in the author's paper "On the identity bases of Brandt semigroups" (Ural. Gos. Univ. Mat. Zap. 14, no.1 (1985), 38--42); this claim provides an identity basis for an arbitrary Brandt semigroup…
In 2008, Lehner, Wettig, Guhr and Wei conjectured a power series identity and showed that it implied a determinantal formula for a Bessel-type integral over the unitary supergroup. The integral is the supersymmetric extension of Bessel-type…
We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial…
We show that the problem of deciding membership in the moment polytope associated with a finite-dimensional unitary representation of a compact, connected Lie group is in NP and coNP. This is the first non-trivial result on the…
We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…
We define the symmetric Post Correspondence Problem (PCP) and prove that it is undecidable. As an application we show that the original proof of undecidability of the freeness problem for 3-by-3 integer matrix semigroups works for the…
We present a polynomial-time quantum algorithm for the Hidden Subgroup Problem over $\mathbb{D}_{2^n}$. The usual approach to the Hidden Subgroup Problem relies on harmonic analysis in the domain of the problem, and the best known algorithm…
The isomorphism problem for graphs (GI) and the isomorphism problem for groups (GrISO) have been studied extensively by researchers. The current best algorithms for both these problems run in quasipolynomial time. In this paper, we study…
It is shown that the knapsack problem (introduced by Myasnikov, Nikolaev, and Ushakov) is undecidable in a direct product of sufficiently many copies of the discrete Heisenberg group (which is nilpotent of class 2). Moreover, for the…
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…
In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…