Related papers: Bounding quantification in parametric expansions o…

A number of authors have proven explicit versions of Lehmer's conjecture for polynomials whose coefficients are all congruent to 1 modulo m. We prove a similar result for polynomials f(X) that are divisible in (Z/mZ)[X] by a polynomial of…

We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…

We first extend the Peierls algebra of gauge invariant functions from the space ${\cal S}$ of classical solutions to the space ${\cal H}$ of histories used in path integration and some studies of decoherence. We then show that it may be…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

We study complexity of short sentences in Presburger arithmetic (Short-PA). Here by "short" we mean sentences with a bounded number of variables, quantifiers, inequalities and Boolean operations; the input consists only of the integers…

We entirely classify definable sets up to definable bijections in $\mathbb{Z}$-groups, where the language is the one of ordered abelian groups. From this, we deduce, among others, a classification of definable families of bounded definable…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

Incremental determinization is a recently proposed algorithm for solving quantified Boolean formulas with one quantifier alternation. In this paper, we formalize incremental determinization as a set of inference rules to help understand the…

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…

Symmetrical subdivisions in the space of Jager Pairs for continued fractions-like expansions will provide us with bounds on their difference. Results will also apply to the classical regular and backwards continued fractions expansions,…

We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

Solving non-linear Diophantine systems lies at the mathematical core of integer optimization and cryptography. While the general unbounded problem is undecidable, even over bounded integer domains it remains classically intractable in the…

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…

Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m,$ and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…

We study VC-dimension of short formulas in Presburger Arithmetic, defined to have a bounded number of variables, quantifiers and atoms. We give both lower and upper bounds, which are tight up to a polynomial factor in the bit length of the…

We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwal, Schaeffer and Shallit, we prove that the first-order…

We sharpen in this work the tools of paracontrolled calculus in order to provide a complete analysis of the parabolic Anderson model equation and Burgers system with multiplicative noise, in a $3$-dimensional Riemannian setting, in either…

We propose a new analytical method to solve for nonexactly soluble Schrodinger equation via expansions through some existing quantum numbers. Successfully, it is applied to the rational non-polynomial oscillator potential. Moreover, a…

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…