Related papers: Algorithmic Polynomial Freiman-Ruzsa Theorems

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic…

We establish new bounds in the Bogolyubov-Ruzsa lemma, demonstrating that if A is a subset of a finite abelian group with density alpha, then 3A-3A contains a Bohr set of rank O(log^2 (2/alpha)) and radius Omega(log^{-2} (2/alpha)). The…

We discuss a multiplicative counterpart of Freiman's $3k-4$ theorem in the context of a function field $F$ over an algebraically closed field $K$. Such a theorem would give a precise description of subspaces $S$, such that the space $S^2$…

Given a convex set $Q \subseteq R^m$ and an integer matrix $W \in Z^{m \times n}$, we consider statements of the form $ \forall b \in Q \cap Z^m$ $\exists x \in Z^n$ s.t. $Wx \leq b$. Such statements can be verified in polynomial time with…

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…

We define the notion of {\em rational presentation of a complete metric space} in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some presentations of the space $\czu$ of uniformly…

With the aid of Hensel Lemma, we refine the 2-adic Newton polygon algorithm proposed by Magron, Koprowski, and Vaccon at ISSAC 2023 to express computationally a given positive univariate polynomial with rational coefficients as a sum of…

This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

We prove an effective version of a theorem of Dufresnoy: For any set of 2n+1 hyperplanes in general position in n-dimensional complex projective space, we find an explicit constant K such that for every holomorphic map f from the unit disc…

The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…

We describe an algorithm that, given a k-tuple of permutations representing the monodromy of a rational map, constructs an arbitrarily precise floating-point complex approximation of that map. We then explain how it has been used to study a…

The famous Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. Kratochvil et al. applied this technique to prove that a k-CNF in which…

Given a polynomial \[ f(x)=a_0x^n+a_1x^{n-1}+\cdots +a_n \] with positive coefficients $a_k$, and a positive integer $M\leq n$, we define a(n infinite) generalized Hurwitz matrix $H_M(f):=(a_{Mj-i})_{i,j}$. We prove that the polynomial…

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…

We study distribution of zeros of a complex polynomial whose coefficients has been modified. We give a new proof of the theorem of Rubinstein, and with similar method we prove a new theorem that is not generalization of the previous…

We consider a family of quantum spin systems which includes as special cases the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any…

In a recent beautiful but technical article, William Y.C. Chen, Qing-Hu Hou, and Doron Zeilberger developed an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequences,…