Related papers: Polylogarithmic Cuts in Models of V^0

This paper studies the restriction multiplicities of half-diagram modules for the partition algebra and their geometric interpretations. By specializing the Bowman-De Visscher-Orellana formula [BVC, Theorem 4.3] for restriction…

A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…

Outer approximation methods have long been employed to tackle a variety of optimization problems, including linear programming, in the 1960s, and continue to be effective for solving variational inequalities, general convex problems, as…

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

We connect learning algorithms and algorithms automating proof search in propositional proof systems: for every sufficiently strong, well-behaved propositional proof system $P$, we prove that the following statements are equivalent, 1.…

Let $V\subset\R^m$ be a centrally symmetric convex body and let $V^*\subset\R^m$ be its polar. We prove limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities for algebraic polynomials…

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…

One of the central open questions in bounded arithmetic is whether Buss' hierarchy of theories of bounded arithmetic collapses or not. In this paper, we reformulate Buss' theories using free logic and conjecture that such theories are…

We classify the Lie algebras of infinitesimal CR automorphisms of weakly pseudoconvex hypersurfaces of finite multitype in $\mathbb C^N$. In particular, we prove that such manifolds admit neither nonlinear rigid automorphisms, nor real or…

This Paper investigate sequent calculi for certain weak subintuitionistic logics. We establish that weakening and contraction are height-preserving admissible for each of these calculi, and we provide a syntactic proof for the admissibility…

We reformulate several known results about continued fractions in combinatorial terms. Among them the theorem of Conway and Coxeter and that of Series, both relating continued fractions and triangulations. More general polygon dissections…

We demonstrate two applications of Fourier decoupling theorems over non-Archimedean local fields to real-variable problems. These include short mean value estimates for exponential sums, canonical-scale mean value estimates for exponential…

Valiant's famous VP vs. VNP conjecture states that the symbolic permanent polynomial does not have polynomial-size algebraic circuits. However, the best upper bound on the size of the circuits computing the permanent is exponential.…

This article presents a technique for proving problems hard for classes of the polynomial hierarchy or for PSPACE. The rationale of this technique is that some problem restrictions are able to simulate existential or universal quantifiers.…

We investigate the proof complexity of a class of propositional formulas expressing a combinatorial principle known as the Kneser-Lov\'{a}sz Theorem. This is a family of propositional tautologies, indexed by an nonnegative integer parameter…

We classify real and complex infinite-dimensional narrow positively graded Lie algebras ${\mathfrak g}=\oplus_{i=1}^{{+}\infty}{\mathfrak g}_i$ with properties $$ [{\mathfrak g}_1, {\mathfrak g}_i]={\mathfrak g}_{i{+}1}, \; \dim{{\mathfrak…

We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times. We show that…

We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…

We present explicit representations in terms of hypergeometric functions for the scaling functions in the $C^0$ orthogonal multiresolution analyses associated with piecewise continuous polynomials. Closed formulas for the Mellin transform…

We consider the semiconjugate factorization and reduction of order for non-autonomous, nonlinear, higher order difference equations containing linear arguments. These equations have appeared in several mathematical models in biology and…