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

For a skew polynomial ring $R=A[X;\theta,\delta]$ where $A$ is a commutative Frobenius ring, $\theta$ an endomorphism of $A$ and $\delta$ a $\theta$-derivation of $A$, we consider cyclic left module codes $\mathcal{C}=Rg/Rf\subset R/Rf$…

Let $K \langle X\rangle$ be the free associative algebra freely generated over the field $K$ by the countable set $X = \{x_1, x_2, \ldots\}$. If $A$ is an associative $K$-algebra, we say that a polynomial $f(x_1,\ldots, x_n) \in K \langle…

We give a randomness-efficient homomorphism test in the low soundness regime for functions, $f: G\to \mathbb{U}_t$, from an arbitrary finite group $G$ to $t\times t$ unitary matrices. We show that if such a function passes a derandomized…

We provide an effective algorithm for determining whether an element of the outer automorphism group of a free group is fully irreducible. Our method produces a finite list which can be checked for periodic proper free factors.

We like to build Abelian groups (or R-modules) which on the one hand are quite free, say $\aleph_{\omega + 1}$-free, and on the other hand, are complicated in suitable sense. We choose as our test problem having no non-trivial homomorphism…

Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and let $\mathbb{K}_{C}[[x_{1},...,x_{e}]]$ be the ring of formal power series in several variables with exponents in a line free cone $C$. We consider irreducible…

The mainstream theory of hypothesis testing in high-dimensional regression typically assumes the underlying true model is a low-dimensional linear regression model, yet the Box-Cox transformation is a regression technique commonly used to…

The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the input-output behavior of an experiment? How many of the…

In [20] Goldwasser, Grossman and Holden introduced pseudo-deterministic interactive proofs for search problems where a powerful prover can convince a probabilistic polynomial time verifier that a solution to a search problem is canonical.…

Let $C$ be an arithmetic circuit of $poly(n)$ size given as input that computes a polynomial $f\in\mathbb{F}[X]$, where $X=\{x_1,x_2,\ldots,x_n\}$ and $\mathbb{F}$ is any field where the field arithmetic can be performed efficiently. We…

In many experimental designs -- split-plots, blocked or nested layouts, fractional factorials, and studies with missing or unequal replication -- standard ANOVA procedures no longer tell us exactly how many independent pieces of information…

We present an algorithm for testing halfspaces over arbitrary, unknown rotation-invariant distributions. Using $\tilde O(\sqrt{n}\epsilon^{-7})$ random examples of an unknown function $f$, the algorithm determines with high probability…

The Bogoliubov recursion is a particular procedure appearing in the process of renormalization in perturbative quantum field theory. It provides convergent expressions for otherwise divergent integrals. We develop here a theory of…

In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…

The representation theory of finite groups began with Frobenius's factorization of Dedekind's group determinant. In this paper, we consider the case of the semigroup determinant. The semigroup determinant is nonzero if and only if the…

Let $f$ and $g$ be Boolean functions over a finite Abelian group $\mathcal{G}$, where $g$ is fully known, and we have {\em query access} to $f$, that is, given any $x \in \mathcal{G}$ we can get the value $f(x)$. We study the tolerant…

We show that the Identity Problem is decidable in polynomial time for finitely generated sub-semigroups of the group $\mathsf{UT}(4, \mathbb{Z})$ of $4 \times 4$ unitriangular integer matrices. As a byproduct of our proof, we also show the…

We investigate the computational complexity of the discrete logarithm, the computational Diffie-Hellman and the decisional Diffie-Hellman problems in some identity black-box groups G_{p,t}, where p is a prime number and t is a positive…

Let $U^N = (U_1^N,\dots, U^N_p)$ be a d-tuple of $N\times N$ independent Haar unitary matrices and $Z^{NM}$ be any family of deterministic matrices in $\mathbb{M}_N(\mathbb{C})\otimes \mathbb{M}_M(\mathbb{C})$. Let $P$ be a self-adjoint…

The main theme of this dissertation is the study of the lattice points in a rational convex polyhedron and their encoding in terms of Barvinok's short rational functions. The first part of this thesis looks into theoretical applications of…