Related papers: Efficient Black-Box Identity Testing over Free Gro…

We develop methods to study $2$-dimensional $2$-adic Galois representations $\rho$ of the absolute Galois group of a number field $K$, unramified outside a known finite set of primes $S$ of $K$, which are presented as Black Box…

Artificial Intelligence aims to provide computer programs with commonsense knowledge to reason about our world. This paper offers a new practical approach towards automated commonsense reasoning with first-order logic (FOL) ontologies. We…

Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…

We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the…

Hilbert's Nullstellensatz characterizes polynomials that vanish on the vanishing set of an ideal in C[x]. In the free algebra C<X> the vanishing set of a two-sided ideal I is defined in a dimension-free way using images in…

A recent model for property testing of probability distributions (Chakraborty et al., ITCS 2013, Canonne et al., SICOMP 2015) enables tremendous savings in the sample complexity of testing algorithms, by allowing them to condition the…

We study the structure of the absolute differential Galois group of a rational function field over an algebraically closed field of characteristic zero. In particular, we relate the behavior of differential embedding problems to the…

With this paper we present an extension of our recent ISSAC paper about computations of Groebner(-Shirshov) bases over free associative algebras Z<X>. We present all the needed proofs in details, add a part on the direct treatment of the…

In this paper, we show that it is possible for a commutative ring with identity to be non-atomic (that is, there exist non-zero nonunits that cannot be factored into irreducibles) and yet have a strongly atomic polynomial extension. In…

Exact ground truth invariant polynomial systems can be written for arbitrarily correlated binary classifiers. Their solutions give estimates for sample statistics that require knowledge of the ground truth of the correct labels in the…

Noncommutative rational functions, i.e., elements of the universal skew field of fractions of a free algebra, can be defined through evaluations of noncommutative rational expressions on tuples of matrices. This interpretation extends their…

We study two group theoretic problems, GROUP INTERSECTION and DOUBLE COSET MEMBERSHIP, in the setting of black-box groups, where DOUBLE COSET MEMBERSHIP generalizes a set of problems, including GROUP MEMBERSHIP, GROUP FACTORIZATION, and…

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…

Let G be a finite group, (g_{1},...,g_{r}) an (unordered) r-tuple of G^{(r)} and x_{i,g_i}'s variables that correspond to the g_i's, i=1,...,r. Let F<x_{1,g_1},...,x_{r,g_r}> be the corresponding free G-graded algebra where F is a field of…

Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…

Binary classification is widely used in ML production systems. Monitoring classifiers in a constrained event space is well known. However, real world production systems often lack the ground truth these methods require. Privacy concerns may…

In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…

In the classical linear degeneracy testing problem, we are given $n$ real numbers and a $k$-variate linear polynomial $F$, for some constant $k$, and have to determine whether there exist $k$ numbers $a_1,\ldots,a_k$ from the set such that…

Radical membership testing, and the special case of Hilbert's Nullstellensatz (HN), is a fundamental computational algebra problem. It is NP-hard; and has a famous PSPACE algorithm due to effective Nullstellensatz bounds. We identify a…

We define a class of "algebraic" random matrices. These are random matrices for which the Stieltjes transform of the limiting eigenvalue distribution function is algebraic, i.e., it satisfies a (bivariate) polynomial equation. The Wigner…