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

A remarkable conjecture of Feige (2006) asserts that for any collection of $n$ independent non-negative random variables $X_1, X_2, \dots, X_n$, each with expectation at most $1$, $$ \mathbb{P}(X < \mathbb{E}[X] + 1) \geq \frac{1}{e}, $$…

A generalized positive energy theorem for spaces with asymptotic SUSY compactification involving non-symmetric data is proved. This work is motivated by the work of Dai [D1][D2], Hertog-Horowitz-Maeda [HHM], and Zhang [Z].

Extending Sellers' result, Das et al. recently proved some congruence results for generalized overcubic partitions using theta functions and posed some related conjectures. In this paper, we provide a combinatorial proof of a result in…

Recent work of Lacey-Sawyer-Shen-Uriarte-Tuero and Lacey have established a conjecture of Nazarov-Treil-Volberg, giving a real-variable characterization of the two weight inequality for the Hilbert transform, provided the pair of weights do…

This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P…

We give a probalistic proof of the famous Meinardus' asymptotic formula for the number of weighted partitions with weakened one of the three Meinardus' conditions, and extend the resulting version of the theorem to other two classis types…

The paper contains a proof for the P != NP hypothesis with the help of the two "natural" postulates. The postulates restrict capacity of the Turing machines and state that each independent and necessary condition of the problem should be…

We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.

We prove a recent conjecture by Ulas on reducible polynomial substitutions.

This is the continuation of the article by the author that proves a broader class of families admitting the theorem of restriction of sections other than Abelian varieties and gives new examples of pseudo-N\'eron models. In this work, we…

We study the compressibility of enumerations in the context of Kolmogorov complexity, focusing on strong and weak forms of compression and their gain: the amount of auxiliary information embedded in the compressed enumeration. The existence…

The Kneser--Poulsen Conjecture states that if the centers of a family of $N$ unit balls in ${\mathbb E}^d$ is contracted, then the volume of the union (resp., intersection) does not increase (resp., decrease). We consider two types of…

In [1], Theorem 3, the authors proved, in one dimension, a generalization of the Hopf Lemma, and the question arose if it could be extended to higher dimensions. In this paper we present two conjectures as possible extensions, and give a…

A short proof of the classic Hardy inequality is presented for $p$-norms with $p>1$. Along the lines of this proof a sharpened version is proved of a recent generalization of Hardy's inequality in the terminology of probability theory. A…

The paper contains a proof of the Fontaine-Jannsen conjecture based on a crystalline version of the p-adic Poincar'e lemma (different proofs were found earlier by Faltings, Niziol and Tsuji).

We present an elementary and explicit proof of the separability criterion for continuous variable two-party Gaussian systems. Our proof is based on an elementary formulation of uncertainty relations and an explicit determination of…

The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M. For string compression, straight-line programs, i.e., context-free grammars that…

This note complements the paper "The quest for optimal sampling: Computationally efficient, structure-exploiting measurements for compressed sensing" [2]. Its purpose is to present a proof of a result stated therein concerning the recovery…

We prove that the partition function $p(n)$ is log-concave for all $n>25$. We then extend the results to resolve two related conjectures by Chen. The proofs are based on Lehmer's estimates on the remainders of the Hardy--Ramanujan and the…

We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…