Related papers: Algorithmic Polynomial Freiman-Ruzsa Theorems
Recently, Corvaja and Zannier obtained an extension of the Subspace Theorem with arbitrary homogeneous polynomials of arbitrary degreee instead of linear forms. Their result states that the set of solutions in P^n(K) (K number field) of the…
We give two quantum algorithms for computing (twisted) Kloosterman sums attached to a finite field $\mathbf{F}$ of $q$ elements. The first algorithm computes a quantum state containing, as its coefficients with respect to the standard…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.
In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…
We prove several results related to a Logvinenko-Sereda type theorem on dominating sets for generalized doubling Fock spaces. In particular, we give a precise polynomial dependence of the sampling constant on the relative density parameter…
An effective algorithm of determining Gromov--Witten invariants of smooth hypersurfaces in any genus (subject to a degree bound) from Gromov--Witten invariants of the ambient space is proposed. The Appendix is joint with E. Schulte-Geers.
We study the packing dimension of unions of subsets of $k$-planes in $\mathbb{R}^n$ using tools from algorithmic information theory, obtaining an analog of a result of H\'era and a mild generalization of a recent result of Fraser. Along the…
Let $\K$ be an algebraic number field of degree $d$ and discriminant $\Delta$ over $\Q$. Let $\A$ be an associative algebra over $\K$ given by structure constants such that $\A\cong M_n(\K)$ holds for some positive integer $n$. Suppose that…
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…
This paper is partly a survey of certain kinds of results and proofs in additive combinatorics, and partly a discussion of how useful the finite-dimensional Hahn-Banach theorem can be. The most interesting single result is probably a…
We develop a probabilistic algorithm of Kronecker type for computing a Kronecker representation of a zero-dimensional linear section of an algebraic variety $V$ defined over a perfect field $k$. The variety $V$ is the Zariski closure of the…
Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific…
In this paper, we study different cryptographically significant spectra of Boolean functions, including the Walsh-Hadamard, cross-correlation, and autocorrelation. The $2^k$-variation by Stanica [IEEE-IT 2016] is considered here with the…
Freiman's 2.4-Theorem states that any set $A \subset \mathbb{Z}_p$ satisfying $|2A| \leq 2.4|A| - 3 $ and $|A| < p/35$ can be covered by an arithmetic progression of length at most $|2A| - |A| + 1$. A more general result of Green and Ruzsa…
Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…
In this paper, global well-posedness of the non-Markovian Unruh-Zurek and Hu-Paz-Zhang master equations with nonlinear electrostatic coupling is demonstrated. They both consist of a Wigner-Poisson like equation subjected to a dissipative…
Hoyer has given a generalisation of the Deutsch--Jozsa algorithm which uses the Fourier transform on a group G which is (in general) non-Abelian. His algorithm distinguishes between functions which are either perfectly balanced (m-to-one)…
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms…
The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of hypergeometric terms $F(n,k)$ is extended to certain nonhypergeometric terms. An expression $F(n,k)$ is called a hypergeometric term if both…