English
Related papers

Related papers: An elementary proof that P =/= NP

200 papers

We establish an equivalent condition to the validity of the Collatz conjecture, using elementary methods. We derive some conclusions and show several examples of our results. We also offer a variety of exercises, problems and conjectures.

Dynamical Systems · Mathematics 2007-05-23 Diego Dominici

Let N, N' and N'' be point processes such that N' is obtained from N by homogeneous independent thinning and N''= N- N'. We give a new elementary proof that N' and N'' are independent if and only if N is a Poisson point process. We present…

Probability · Mathematics 2011-11-10 Renato M. Assuncao , Pablo A. Ferrari

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

Numerical Analysis · Mathematics 2025-10-20 H. Hakopian

The strong recurrence is equivalent to the Riemann hypothesis. In the present paper, we give a simple proof of the generalized strong recurrence for all non-zero parameters.

Number Theory · Mathematics 2010-09-23 Takashi Nakamura

Let A be an asymptotic basis for N_0 of some order. By an essentiality of A one means a subset P such that A\P is no longer an asymptotic basis of any order and such that P is minimal among all subsets of A with this property. A finite…

Number Theory · Mathematics 2008-04-15 Peter Hegarty

We show, using the trace formula, that any Newton stratum of a Shimura variety of PEL-type of types (A) and (C) is non-empty at the primes of good reduction. Furthermore we prove conditionally the non-emptiness for Shimura data associated…

Number Theory · Mathematics 2013-06-11 Arno Kret

We show that if a non-trivial measure in the plane admits, at almost every point, positive and finite $\alpha$-dimensional density with respect to some norm, then $\alpha$ must be an integer.

Classical Analysis and ODEs · Mathematics 2025-08-22 Giacomo Del Nin , Andrea Merlo

We show that we can assume graphs that do not have the edge-Erd\H{o}s-P\'{o}sa property to be connected. Then we strengthen this result to $2$-connectivity under the additional assumptions of a minor-closed property and a generic…

Combinatorics · Mathematics 2023-07-24 Raphael Steck

It is well known that the kind of P systems involved in the definition of the P conjecture is able to solve problems in the complexity class $\mathbf{P}$ by leveraging the uniformity condition. Here we show that these systems are indeed…

Computational Complexity · Computer Science 2020-08-05 Alberto Leporati , Luca Manzoni , Giancarlo Mauri , Antonio E. Porreca , Claudio Zandron

We provide a permutation-invariant version of the Koml\'os' theorem for non-negative random variables. The proof is quite elementary in the sense that it did not use the Axiom of Choice, and was based on a recent result in [3].

Functional Analysis · Mathematics 2022-08-23 Abdessamad Dehaj , Mohamed Guessous , Noureddine Sabiri

We present a short proof, relaying on the divergence theorem, verifying that minimal sets in the plane are trivial.

Classical Analysis and ODEs · Mathematics 2013-09-26 Ido Bright

Interpretation of a structure $\mathbb A$ in $\mathbb B$ allows to produce structures elementarily equivalent to $\mathbb A$ given those elementarily equivalent to $\mathbb B$. In particular, interpretation of the free group in $\mathbb N$…

Group Theory · Mathematics 2026-02-04 Alexei Miasnikov , Andrey Nikolaev

We classify nonconstant morphisms $\mathbb{P}^m \to G/P$ for $m \le 4$ when $G = SL(n,\mathbb{C})$ (type~$A$) for a minimal parabolic subgroup $P$. Using the Borel presentation of cohomology and explicit Schubert intersection identities, we…

Algebraic Geometry · Mathematics 2026-03-17 Sarjick Bakshi , A J Parameswaran

The P=?NP problem is philosophically solved by showing P is equal to NP in the random access with unit multiply (MRAM) model. It is shown that the MRAM model empirically best models computation hardness. The P=?NP problem is shown to be a…

General Literature · Computer Science 2016-03-22 Steven Meyer

A long standing open problem in the computational complexity theory is to separate NE from BPP, which is a subclass of $NP_T(NP\cap P/poly)$. In this paper, we show that $NE\not\subseteq NP_(NP \cap$ Nonexponentially-Dense-Class), where…

Computational Complexity · Computer Science 2010-12-14 Bin Fu

We consider the thesis that an arithmetical relation, which holds for any, given, assignment of natural numbers to its free variables, is Turing-decidable if, and only if, it is the standard representation of a PA-provable formula. We show…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size…

Number Theory · Mathematics 2021-01-06 Sarah Peluse

An brief unconventional review of Standard Model physics, containing no plots.

High Energy Physics - Phenomenology · Physics 2008-11-26 Joseph D. Lykken

We construct a consistent example of a topological space $Y=X \cup \{\infty\}$ such that: 1) $Y$ is regular. 2) Every $G_\delta$ subset of $Y$ is open. 3) The point $\infty$ is not isolated, but it is not in the closure of any discrete…

General Topology · Mathematics 2024-03-05 Santi Spadaro , Paul Szeptycki

We study elementary submodels of a stable homogeneous structure. We improve the independence relation defined in [T. Hyttinen, On nonstructure of elementary submodels of a stable homogeneous structure, Fundamenta Mathematicae, 156(1998):…

Logic · Mathematics 2007-05-23 Tapani Hyttinen , Saharon Shelah