Related papers: On Use of an Explicit Congruence Predicate in Boun…

We prove the first unconditional consistency result for superpolynomial circuit lower bounds with a relatively strong theory of bounded arithmetic. Namely, we show that the theory V$^0_2$ is consistent with the conjecture that NEXP…

Here we prove the following result. Let $A = \{a_{ij}\}_{i,j\in \mathbb{N}}$ be a bounded operator. Then there exists a signing of $A$ such that $$||A\circ S||_2 < 2||A||_{l_\infty(l_2)},$$ where $A\circ S$ denotes the matrix generated by…

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…

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

In this paper, we consider a continuum class of continuous nowhere monotonic functions that generalize certain non-differentiable functions, including the Bush function, Wunderlich function, continuous Cantor projectors, Tribin function,…

We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…

We attack the question of E_2-formality of differential graded algebras over prime fields via obstruction theory. We are able to prove that E_2-algebras whose cohomology ring is a polynomial algebra on even degree classes are intrinsically…

In this paper, we study the almost sure boundedness and the convergence of the stochastic approximation (SA) algorithm. At present, most available convergence proofs are based on the ODE method, and the almost sure boundedness of the…

For uniformly expanding maps on the interval, analogous versions of the Berry-Ess\'een theorem are known but only with an unexplicit upper bound in $O(1/\sqrt{n})$ without any constants being specified. In this paper, we use the recent…

Given a bounded domain $\Omega \subset {\Bbb R}^d$ with positive measure and a finite set $A=\{a^1, a^2, \dots, a^d\}$, we say that the set ${\mathcal E}(A)={\{e^{2 \pi i x \cdot a^j}\}}_{a^j \in A}$ is a complete exponential system if for…

We propose the existence theorem for bounded solutions to the system of 2-nd order ODE. Dynamical applications have been considered.

The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…

We introduce the BIN_COUNTS constraint, which deals with the problem of counting the number of decision variables in a set which are assigned values that lie in given bins. We illustrate a decomposition and a filtering algorithm that…

We formalize the notion of Herbrand Consistency in an appropriate way for bounded arithmetics, and show the existence of a finite fragment of ${\rm I\Delta_0}$ whose Herbrand Consistency is not provable in the thoery ${\rm I\Delta_0}$. We…

We explore the relation between various versions of Ramsey theorem and bounding schemes in model ${N}$ of a fragment of arithmetic $F$. Our goal is to recast, in a different framework, and extend some results of Hirst \cite{Hirst-1987}, see…

Let $A_1$ and $A_2$ be randomly chosen subsets of the first $n$ integers of cardinalities $s_2\geq s_1 = \Omega(s_2)$, such that their sumset $A_1+A_2$ has size $m$. We show that asymptotically almost surely $A_1$ and $A_2$ are almost fully…

This paper treats the strict semi-stability of the symmetric powers $S^k E$ of a stable vector bundle $E$ of rank $2$ with even degree on a smooth projective curve $C$ of genus $g \geq 2$. The strict semi-stability of $S^2 E$ is equivalent…

We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory \`a la Buss (expressed in this new language) precisely capture polytime random functions. Then, we…

We present a combinatorial proof for the existence of the sign refined grid homology in lens spaces, and a self contained proof that $\partial_{\mathbb{Z}}^2 = 0$. We also present a Sage program that computes $\widehat{\mathrm{GH}}…

Sign-Perturbed Sums (SPS) is a system identification method that constructs confidence regions for the unknown system parameters. In this paper, we study SPS for ARX systems, and establish that the confidence regions are guaranteed to…