English
Related papers

Related papers: Proof compression and NP versus PSPACE. Part 2

200 papers

The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…

Logic · Mathematics 2026-02-03 Roman Feller , Michael Pinsker

In this paper, we investigate the proof complexity of a wide range of substructural systems. For any proof system $\mathbf{P}$ at least as strong as Full Lambek calculus, $\mathbf{FL}$, and polynomially simulated by the extended Frege…

Logic · Mathematics 2020-08-21 Raheleh Jalali

We identify a few conditions $X$ such that $(P=NP \wedge X) \;\Rightarrow\; P=PSPACE$.

Computational Complexity · Computer Science 2026-02-11 Ismael Rodriguez

The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…

Number Theory · Mathematics 2025-11-25 Chenghui Ren

Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…

Logic · Mathematics 2019-07-12 Marta Bílková , Almudena Colacito

In this paper we attack the Erdos-Straus conjecture by means of the structure of its solutions, extending and improving the results of a previous paper. Using previous results and supported by the works of Elsholtz and Tao and Monks and…

Number Theory · Mathematics 2024-04-17 Miguel Angel Lopez

We give a counterexample to a conjecture made by Cigler, Jerman and Wojciechowski stating that all posets are conclusive. We also provide combinatorial characterizations for conclusiveness of finite posets and the existence of outer…

Combinatorics · Mathematics 2026-01-26 Bekir Danış , İsmail Alperen Öğüt

After reviewing the entropy power, the McKean, and the Gaussian completely monotone conjectures, we prove that the first implies the second, for each order of the time-derivative. The proof is elementary and is based on manipulating the…

Information Theory · Computer Science 2024-08-27 Guillaume Wang

A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…

Computational Complexity · Computer Science 2026-04-14 Jan Krajicek

We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.

Number Theory · Mathematics 2007-06-11 Vladimir Shevelev

This paper shows that P = NP = PSPACE. It also tackles Graph Isomorphism.

Computational Complexity · Computer Science 2022-12-13 Latif Salum

In this short note I restate and simplify the proof of the impossibility of probabilistic induction from Popper (1992). Other proofs are possible (cf. Popper (1985)).

Artificial Intelligence · Computer Science 2021-07-05 Vaden Masrani

If S is a smooth compact surface in $\mathbb{R}^{3}$ with strictly positive second fundamental form, and $E_S$ is the corresponding extension operator, then we prove that for all $p > 3$, $\left\|E_S f\right\|_{L^p\left(\mathbb{R}^3\right)}…

Classical Analysis and ODEs · Mathematics 2023-04-05 Hoyoung Song

In this paper proof of the twin prime conjecture is going to be presented. Originally very difficult problem (in observational space) has been transformed into a simpler one (in generative space) that can be solved. It will be shown that…

General Mathematics · Mathematics 2022-06-03 Marko V. Jankovic

MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic are related by a series of inference permutations. It is also known as the word problem for star-autonomous categories. Previous work has…

Logic in Computer Science · Computer Science 2017-01-11 Willem Heijltjes , Robin Houston

We prove the Invariant Subspace Conjecture for separable Hilbert spaces.

Functional Analysis · Mathematics 2023-07-24 Charles W. Neville

It is a longstanding conjecture that for a finite group $G$, the exponent of the second homology group $H_2(G, \mathbb{Z})$ divides the exponent of $G$. In this paper, we prove this conjecture for $p$-groups of class at most $p$, finite…

Group Theory · Mathematics 2020-05-05 Ammu E Antony , Komma Patali , Viji Z Thomas

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

General Mathematics · Mathematics 2023-07-31 Mbakiso Fix Mothebe

We investigate the (co)homological properties of two classes of Lie algebras that are constructed from any finite poset: the solvable class $\frak{gl}^\preceq$ and the nilpotent class $\frak{gl}^\prec$. We confirm the conjecture of…

Algebraic Topology · Mathematics 2018-09-03 Leon Lampret , Aleš Vavpetič

In the paper are proved theorems, which amplify the results of my paper "On the difference equation of Poincare type (Part 3)", Max-Plank-Institut fuer Mathematik, Bonn, Preprint Series, 2004, 09, 1-34.

Number Theory · Mathematics 2007-05-23 L. A. Gutnik