Related papers: NP vs PSPACE

We study in this series of articles the Kardar-Parisi-Zhang (KPZ) equation $$ \partial_t h(t,x)=\nu\Delta h(t,x)+\lambda V(|\nabla h(t,x)|) +\sqrt{D}\, \eta(t,x), \qquad x\in{\mathbb{R}}^d $$ in $d\ge 1$ dimensions. The forcing term $\eta$…

We prove that P = NP implies #P = FP by exploiting the topological structure of 3SAT solution spaces. The argument proceeds via a dichotomy: any polynomial-time algorithm for 3SAT either operates without global knowledge of the…

We introduce a modal logic, called Cone Logic, whose formulas describe properties of points in the plane and spatial relationships between them. Points are labelled by proposition letters and spatial relations are induced by the four…

Thanks to earlier work of Koiran, it is known that the truth of the Generalized Riemann Hypothesis (GRH) implies that the dimension of algebraic sets over the complex numbers can be determined within the polynomial-hierarchy. The truth of…

We study the module $C^r(\mathcal{P})$ of piecewise polynomial functions of smoothness $r$ on a pure $n$-dimensional polytopal complex $\mathcal{P}\subset\mathbb{R}^n$, via an analysis of certain subcomplexes $\mathcal{P}_W$ obtained from…

In these notes we give a brief introduction to decomposition theory and we summarize some classical and well-known results. The main question is that if a partitioning of a topological space (in other words a decomposition) is given, then…

We introduce some generalized topological concepts to deal with union-closed families, and show that one can reduce the proof of Frankl's conjecture to some families of so-called supratopological spaces. We prove some results on the…

We prove that several natural graph classes have tree-decompositions with minimum width such that each bag has bounded treewidth. For example, every planar graph has a tree-decomposition with minimum width such that each bag has treewidth…

This is the first paper that provides a systematic treatment of the $r$-dimensional PTE problem in additive number theory, abbreviated by PTE$_r$, through its connection with combinatorial design theory, the branch of combinatorial…

Subclasses of TFNP (total functional NP) are usually defined by specifying a complete problem, which is necessarily in TFNP, and including all problems many-one reducible to it. We study two notions of how a TFNP problem can be reducible to…

Let $p(n)$ denote the number of partitions of a natural number $n$. As $ n \to \infty$, the $n$th root of $p(n)$ tends to $1$, which is related to the Cauchy--Hadamard test for power series. Andrews also discovered an elementary proof. Sun…

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

We present an approach (the biroot method) for nth root approximation that yields closed-form rational functions with coefficients derived from binomial structures, Gaussian functions, or qualifying DAG structures. The method emerges from…

Let $\operatorname{Con}(\mathbf T)\!\restriction\!x$ denote the finite consistency statement "there are no proofs of contradiction in $\mathbf T$ with $\leq x$ symbols". For a large class of natural theories $\mathbf T$, Pudl\'ak has shown…

The Hasse principle and weak approximation is established for equations of the shape P(t)=N(x_1,x_2,x_3,x_4), where P is an irreducible quadratic polynomial in one variable and N is a norm form associated to a quartic extension of the…

We extend dynamic logic of propositional assignments by adding an operator of parallel composition that is inspired by separation logics. We provide an axiomatisation via reduction axioms, thereby establishing decidability. We also prove…

Tree-decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. The main property of tree-decompositions is the width (the maximum size of a bag minus 1). We show that every graph has a…

The transcendental Hodge lattice of a projective manifold $M$ is the smallest Hodge substructure in $p$-th cohomology which contains all holomorphic $p$-forms. We prove that the direct sum of all transcendental Hodge lattices has a natural…

Let $X = G/\Gamma$, where $G$ is a Lie group and $\Gamma$ is a lattice in $G$, let $U$ be an open subset of $X$, and let $\{g_t\}$ be a one-parameter subgroup of $G$. Consider the set of points in $X$ whose $g_t$-orbit misses $U$; it has…

We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula $F$, 1) It is NP-hard to find a CP refutation of $F$ in time polynomial in the length of the shortest such refutation; and 2)unless Gap-Hitting-Set…