Related papers: Truth and Feasible Reducibility
Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…
We present and discuss general techniques for proving inapproximability results for truthful mechanisms. We make use of these techniques to prove lower bounds on the approximability of several non-utilitarian multi-parameter problems. In…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…
Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the most well-known being ML-polymorphism). In this paper we…
In this paper, we give a rigorous proof of the renormalizability of the massive $\phi_4^4$ theory on a half-space, using the renormalization group flow equations. We find that five counter-terms are needed to make the theory finite, namely…
We show the following hold, unconditionally unless otherwise stated, relative to a random oracle: - There are NP search problems solvable by quantum polynomial-time machines but not classical probabilistic polynomial-time machines. - There…
Let $f=a_0+ a_{1}x+\cdots+a_m x^m\in \Bbb{Z}[x]$ be a primitive polynomial. Suppose that there exists a positive real number $\alpha$ such that $|a_m| \alpha^m>|a_0|+|a_1|\alpha+\cdots+|a_{m-1}|\alpha^{m-1}$. We prove that if there exist…
The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the Straight-Line Program (SLP) complexity of f. A consequence of the truth of this conjecture is that, for the…
"Theorems for Free!" (Wadler, FPCA 1989) is a slogan for a technique that allows to derive statements about functions just from their types. So far, the statements considered have always had a purely extensional flavor: statements relating…
For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…
We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…
We introduce the theory $\mathrm{PF}^{+,\times}$ of pseudofinite fields with generic additive and multiplicative character added as continuous logic predicates. Using the Weil bounds on character sums over finite fields as well as the…
We combine dependent types with linear type systems that soundly and completely capture polynomial time computation. We explore two systems for capturing polynomial time: one system that disallows construction of iterable data, and one,…
In this paper, we show how the finite formulation of QFT based on Callan-Symanzik equations can be generalised to the case of non-renormalizable theories. We derive an equation for effective action for an arbitrary single scalar field…
A practical criterion for the irreducibility (with respect to integration by part identities) of a particular Feynman integral to a given set of integrals is presented. The irreducibility is shown to be related to the existence of stable…
We study cyclic proof systems for $\mu\mathsf{PA}$, an extension of Peano arithmetic by positive inductive definitions that is arithmetically equivalent to the (impredicative) subsystem of second-order arithmetic $\Pi^1_2$-$\mathsf{CA}_0$…
We compare the conceptual strength of two axiomatic theories of truth: KF and WKF. The first one has been designed to capture Kripke's fixed-point construction based on Strong Kleene logic. The second one is based on the Weak Kleene…
Advancements in mathematical programming have made it possible to efficiently tackle large-scale real-world problems that were deemed intractable just a few decades ago. However, provably optimal solutions may not be accepted due to the…
Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…