Related papers: Efficient Black-Box Identity Testing over Free Gro…
Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial…
A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…
We initiate a systematic study of ${\sf TFZPP}$, the class of total ${\sf NP}$ search problems solvable by polynomial time randomized algorithms. ${\sf TFZPP}$ contains a variety of important search problems such as…
We generalize the positive solution of the Frobenius conjecture and refinements thereof by studying the structure of groups that admit a fix-point-free automorphism satisfying an identity. We show, in particular, that for every polynomial…
The goal of this paper is to provide exact and terminating algorithms for the formal analysis of deterministic continuous-time control systems with affine input and polynomial state dynamics (in short, polynomial systems). We consider the…
Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph $F \in \mathcal{F}$. Many graph isomorphism relaxations such as (quantum) isomorphism…
Determining whether an unknown distribution matches a known reference is a cornerstone problem in distributional analysis. While classical results establish a rigorous framework in the case of distributions over finite domains, real-world…
We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…
Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|) time. This generalizes a quantum algorithm of Arvind et al.…
The aim of this note is to discuss the following quite queer Problem: \noindent GIVEN \noindent i) the free non-commutative polynomial ring, ${\Cal P} := {\Bbb F}\langle X_1,\ldots,X_n\rangle$ {\em (public)}, \noindent ii) a bilateral ideal…
We study the functional identity $G(x)f(x)=H(x)$ on a division ring $D$, where $f \colon D\to D$ is an additive map and $G(X)\ne 0, H(X)$ are generalized polynomials in the variable $X$ with coefficients in $D$. Precisely, it is proved that…
Let $\mathbf{f}=(f\_1,\ldots,f\_m)$ and $\mathbf{g}=(g\_1,\ldots,g\_m)$ be two sets of $m\geq 1$ nonlinear polynomials over $\mathbb{K}[x\_1,\ldots,x\_n]$ ($\mathbb{K}$ being a field). We consider the computational problem of finding -- if…
We characterize group representations that factor through monomial representations, respectively, block-triangular representations with monomial diagonal blocks, by arithmetic properties. Similar results are obtained for semigroup…
We study deterministic polynomial identity testing (PIT) and reconstruction algorithms for depth-$4$ arithmetic circuits of the form \[ \Sigma^{[r]}\!\wedge^{[d]}\!\Sigma^{[s]}\!\Pi^{[\delta]}. \] This model generalizes Waring…
The present paper proposes a new and systematic approach to the so-called black box group methods in computational group theory. Instead of a single black box, we consider categories of black boxes and their morphisms. This makes new…
We consider goodness-of-fit tests with i.i.d. samples generated from a categorical distribution $(p_1,...,p_k)$. For a given $(q_1,...,q_k)$, we test the null hypothesis whether $p_j=q_{\pi(j)}$ for some label permutation $\pi$. The…
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…
This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as…
In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…
It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kampen diagrams, which represent groups as quotients of…