Related papers: Trading GRH for algebra: algorithms for factoring …

In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for testing zeroness of $\Sigma^{[3]}\Pi\Sigma\Pi^{[2]}$…

This article surveys results on graded algebras and their Hilbert series. We give simple constructions of finitely generated graded associative algebras $R$ with Hilbert series $H(R,t)$ very close to an arbitrary power series $a(t)$ with…

We present a simple randomized polynomial time algorithm to approximate the mixed discriminant of $n$ positive semidefinite $n \times n$ matrices within a factor $2^{O(n)}$. Consequently, the algorithm allows us to approximate in randomized…

The goal of invariant theory is to find all the generators for the algebra of representations of a group that leave the group invariant. Such generators will be called \emph{basic invariants}. In particular, we set out to find the set of…

We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is elementary. In some cases, the…

We consider deterministic algorithms for the well-known hidden subgroup problem ($\mathsf{HSP}$): for a finite group $G$ and a finite set $X$, given a function $f:G \to X$ and the promise that for any $g_1, g_2 \in G, f(g_1) = f(g_2)$ iff…

We develop a general theory of Cartesian and non-Cartesian polynomials on products of complex spaces $\mathbb{C}^{n_1} \times \cdots \times \mathbb{C}^{n_k}$. We prove that, for any fixed degree $d \ge 2$, a (Zariski) generic polynomial is…

This paper is the fourth and the last part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the Geometric…

This paper develops from scratch a theory of Galois rings and orders over arbitrary fields. Our approach is different from others in the literature in that there is no non-modularity assumption. We prove, when the field is algebraically…

We consider the Hypergraph-$k$-cut problem. The input consists of a hypergraph $G=(V,E)$ with non-negative hyperedge-costs $c: E\rightarrow R_+$ and a positive integer $k$. The objective is to find a least-cost subset $F\subseteq E$ such…

The deterministic recursive pivot-free algorithms for the computation of generalized Bruhat decomposition of the matrix in the field and for the computation of the inverse matrix are presented. This method has the same complexity as…

Given a finite transitive permutation group $G$, we investigate number fields $F/\mathbb{Q}$ of Galois group $G$ whose discriminant is only divisible by small prime powers. This generalizes previous investigations of number fields with…

An integer $a$ is a quadratic nonresidue for a prime $p$ if $x^2 \equiv a \bmod p$ has no solution. Quadratic nonresidues may be found by probabilistic methods in polynomial time. However, without assuming the Generalized Riemann…

We give a computationally efficient method for constructing the linear differential operator with polynomial coefficients whose space of holomorphic solutions is spanned by all the branches of a function defined by a generic algebraic…

Let $\epsilon>0$. In this article we will present a deterministic algorithm which does the following. The input is a hyperelliptic curve $C$ of genus $g$ over a finite field $k$ of cardinality $q$ given by $y^2+h(x)y=f(x)$ such that the…

The starting point of our work is a decade-old open question concerning the subexponential parameterized complexity of \textsc{2-Layer Crossing Minimization}. In this problem, the input is an $n$-vertex graph $G$ whose vertices are…

Let $g(X)$ be a polynomial over a finite field ${\mathbb F}_q$ with degree $o(q^{1/2})$, and let $\chi$ be the quadratic residue character. We give a polynomial time algorithm to recover $g(X)$ (up to perfect square factors) given the…

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…

Hilbert's Nullstellensatz is a fundamental result in algebraic geometry that gives a necessary and sufficient condition for a finite collection of multivariate polynomials to have a common zero in an algebraically closed field. Associated…