English
Related papers

Related papers: NP vs PSPACE

200 papers

We consider the perturbation of parabolic operators of the form $\partial_t+P(x,D)$ by large-amplitude highly oscillatory spatially dependent potentials modeled as Gaussian random fields. The amplitude of the potential is chosen so that the…

Mathematical Physics · Physics 2015-05-13 Guillaume Bal

Motivated by the similarities between the theory of spherical $t$-designs and that of $t$-designs in $Q$-polynomial association schemes, we study two versions of relative $t$-designs, the counterparts of Euclidean $t$-designs for $P$-…

Combinatorics · Mathematics 2021-11-02 Eiichi Bannai , Etsuko Bannai , Sho Suda , Hajime Tanaka

We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…

Combinatorics · Mathematics 2026-01-26 Elia Bisi , Piotr Dyszewski , Nina Gantert , Samuel G. G. Johnston , Joscha Prochno , Dominik Schmid

We introduce the notion of $n$-pure geometric morphism between Grothendieck toposes, over a Grothendieck base topos $\mathcal{T}$. This is a higher-dimensional analogue of the concepts of dense and pure geometric morphism. We extend the…

Category Theory · Mathematics 2025-10-14 Jens Hemelaer

Presburger Arithmetic is the true theory of natural numbers with addition. We study interpretations of Presburger Arithmetic in itself. The main result of this paper is that all self-interpretations are definably isomorphic to the trivial…

Logic · Mathematics 2020-04-08 Fedor Pakhomov , Alexander Zapryagaev

We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…

Computational Complexity · Computer Science 2022-07-21 Hunter Monroe

The partial derivatives and Laplacians of the Zernike circle polynomials occur in various places in the literature on computational optics. In a number of cases, the expansion of these derivatives and Laplacians in the circle polynomials…

Mathematical Physics · Physics 2015-06-19 Augustus J. E. M Janssen

The mathematical basis of p-adic Higgs mechanism discussed in papers [email protected] 9410058-62 is considered in this paper. The basic properties of p-adic numbers, of their algebraic extensions and the so called canonical…

High Energy Physics - Theory · Physics 2008-02-03 M. Pitkänen

The purpose of this paper is to give an easy to understand with step-by-step explanation to allow interested people to fully appreciate the power of natural deduction for first-order logic. Natural deduction as a proof system can be used to…

Logic in Computer Science · Computer Science 2021-08-16 Alrubyli , Yazeed

In this article we develop a new version of the intuitionist existential graphs presented by Arnol Oostra [4]. The deductive rules presented in this article have the same meaning as those described in the work of Yuri Poveda [5], because…

Logic · Mathematics 2017-05-30 Yuri A. Poveda , Steven Zuluaga

We revisit Haagerup's enigmatic reduction theorem \cite[Theorems 2.1 \& 3.1]{HJX} showing how that theorem may be extended to general von Neumann algebras $\M$ equipped with an arbitrary faithful normal semifinite weight in a manner which…

Operator Algebras · Mathematics 2025-06-10 Louis Labuschagne , Quanhua Xu

Subatomic logic is a recent innovation in structural proof theory where atoms are no longer the smallest entity in a logical formula, but are instead treated as binary connectives. As a consequence, we can give a subatomic proof system for…

Logic in Computer Science · Computer Science 2025-05-27 Victoria Barrett , Alessio Guglielmi , Benjamin Ralph , Lutz Straßburger

Tree-decompositions and treewidth are of fundamental importance in structural and algorithmic graph theory. The "spread" of a tree-decomposition is the minimum integer $s$ such that every vertex lies in at most $s$ bags. A…

Combinatorics · Mathematics 2026-04-08 Marc Distel , Neel Kaul , Raj Kaul , David R. Wood

Inference problems with conjectured statistical-computational gaps are ubiquitous throughout modern statistics, computer science and statistical physics. While there has been success evidencing these gaps from the failure of restricted…

Computational Complexity · Computer Science 2020-06-30 Matthew Brennan , Guy Bresler

We provide the directed counterpart of a slight extension of Katoh and Tanigawa's result on rooted-tree decompositions with matroid constraints. Our result characterises digraphs having a packing of arborescences with matroid constraints.…

Combinatorics · Mathematics 2012-07-10 Olivier Durand de Gevigney , Viet-Hang Nguyen , Zoltán Szigeti

For a graph $G$, the parameter treedepth measures the minimum depth among all forests $F$, called elimination forests, such that $G$ is a subgraph of the ancestor-descendant closure of $F$. We introduce a logic, called neighborhood operator…

Data Structures and Algorithms · Computer Science 2025-10-23 Benjamin Bergougnoux , Vera Chekan , Giannos Stamoulis

A well-known conjecture of Gross and Zagier states that the values of the higher automorphic Green's function at pairs of points with complex multiplication in the upper half-plane are proportional to the logarithm of an algebraic number.…

Number Theory · Mathematics 2025-08-19 Francis Brown , Tiago J. Fonseca

In Part I we gave a polynomial growth lower-bound for the number of nodal domains of a Hecke-Maass cuspform in a compact part of the modular surface, assuming a Lindel\"of hypothesis. That was a consequence of a topological argument and…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Andre Reznikov , Peter Sarnak

Many geometric and analytic properties of sets hinge on the properties of harmonic measure, notoriously missing for sets of higher co-dimension. The aim of this manuscript is to develop a version of elliptic theory, associated to a linear…

Analysis of PDEs · Mathematics 2023-09-26 Guy R. David , Joseph Feneuil , Svitlana Mayboroda

One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…

Logic · Mathematics 2025-10-14 Oscar Ramírez