Related papers: True complexity and iterated Cauchy--Schwarz
We show that the parity of more than three non-target input bits cannot be computed by QAC-circuits of depth-2, not even uncleanly, regardless of the number of ancilla qubits. This result is incomparable with other recent lower bounds on…
A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…
We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…
We derive B\'ezout identities for the minimal polynomials of a finite sequence and use them to prove a theorem of Wang and Massey on binary sequences with a perfect linear complexity profile. We give a new proof of Rueppel's conjecture and…
A central tool in the study of systems of linear equations with integer coefficients is the Generalised von Neumann Theorem of Green and Tao. This theorem reduces the task of counting the weighted solutions of these equations to that of…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
In this paper we give an Immerman's Theorem for real-valued computation. We define circuits operating over real numbers and show that families of such circuits of polynomial size and constant depth decide exactly those sets of vectors of…
We consider the defocusing nonlinear Schr{\"o}dinger equation in several space dimensions, in the presence of an external potential depending on only one space vari-able. This potential is bounded from below, and may grow arbitrarily fast…
We consider the problem of computing the second elementary symmetric polynomial S^2_n(X) using depth-three arithmetic circuits of the form "sum of products of linear forms". We consider this problem over several fields and determine EXACTLY…
We target the problem of provably computing the equivalence between two complex expression trees. To this end, we formalize the problem of equivalence between two such programs as finding a set of semantics-preserving rewrite rules from one…
Let $a=(a_1,a_2,...c,a_n)$ for $n\in\mathbb{N}$ be a given sequence of positive numbers. In the paper, the authors establish, by using Cauchy's integral formula in the theory of complex functions, an integral representation of the principal…
Recently a new family of enumerative invariants called leaky Hurwitz numbers was introduced by Cavalieri-Markwig-Ranganathan in the context of logarithmic intersection theory. They admit an interpretation via tropical covers where the…
Let $\hil$ be a finite dimensional (real or complex) Hilbert space and let $\{a_i\}_{i=1}^\infty$ be a non-increasing sequence of positive numbers. Given a finite sequence of vectors $\f$ in $\hil$ we find necessary and sufficient…
This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic…
In this paper, we study the Cauchy problem for an integrable multi-component (2N-component) peakon system which is involved in an arbitrary polynomial function. Based on a generalized Ovsyannikov type theorem, we first prove the existence…
We give an algorithm to compute the integer cohomology groups of any real partial flag manifold, by computing the incidence coefficients of the Schubert cells. For even flag manifolds we determine the integer cohomology groups, by proving…
The theorem of three circles in real algebraic geometry guarantees the termination and correctness of an algorithm of isolating real roots of a univariate polynomial. The main idea of its proof is to consider polynomials whose roots belong…
We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger…
There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…