Related papers: Proof Compression and NP Versus PSPACE II: Addendu…

In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+\alpha)n$…

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

We extend to natural deduction the approach of Linear Nested Sequents and of 2-sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deduction -- only one…

We introduce a discrete dynamical system on the integers, defined by moving a composite $m$ forward to $m+\pi(m)$ and a prime $p$ backward to $p-\mathrm{prevprime}(p)$. This map produces trajectories whose contraction properties are closely…

The purpose of this paper is to study motivic aspects of the Hitchin system for $\mathrm{GL}_n$. Our results include the following. (a) We prove the motivic decomposition conjecture of Corti-Hanamura for the Hitchin system; in particular,…

We prove the $l^2$ Decoupling Conjecture for compact hypersurfaces with positive definite second fundamental form and also for the cone. This has a wide range of important consequences. One of them is the validity of the Discrete…

Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…

We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and…

We prove a conjecture of Teissier asserting that if $f$ has an isolated singularity at $P$ and $H$ is a smooth hypersurface through $P$, then $\widetilde{\alpha}_P(f)\geq \widetilde{\alpha}_P(f\vert_H)+\frac{1}{\theta_P(f)+1}$, where…

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…

We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specified graphs, many of which are PSPACE-complete. Assuming P != PSPACE, the existence or nonexistence of such efficient…

A theorem of L. Caffarelli implies the existence of a map pushing forward a source Gaussian measure to a target measure which is more log-concave than the source one, which contracts Euclidean distance (in fact, Caffarelli showed that the…

In the nineties Immerman and Medina initiated the search for syn- tactic tools to prove NP-completeness. In their work, amongst several results, they conjecture that the NP-completeness of a problem defined by the conjunction of a sentence…

The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

In this paper, we use purely complex analytic techniques to prove two results of the first author which were hitherto given only probabilistic proofs. A general form of the Phragm\'en-Lindel\"of principle states that if the…

We prove a Simons-type holonomy theorem for totally skew 1-forms with values in a Lie algebra of linear isometries. The only transitive case, for this theorem, is the full orthogonal group. We only use geometric methods and we do not use…

This article precisely defines huge proofs within the system of Natural Deduction for the Minimal implicational propositional logic \mil. This is what we call an unlimited family of super-polynomial proofs. We consider huge families of…

We show that every $(n,d,\lambda)$-graph contains a Hamilton cycle for sufficiently large $n$, assuming that $d\geq \log^{6}n$ and $\lambda\leq cd$, where $c=\frac{1}{70000}$. This significantly improves a recent result of Glock, Correia…

Abstract notions of convexity over the vertices of a graph, and corresponding notions of halfspaces, have recently gained attention from the machine learning community. In this work we study monophonic halfspaces, a notion of graph…