Related papers: On a simple proof the Poincare Conjecture
This manuscript contains a detailed proof of the Poincare Conjecture. The arguments we present here are expanded versions of the ones given by Perelman in his three preprints posted in 2002 and 2003. This is a revised version taking in…
Analyzing complex fluid flow problems that involve multiple coupled domains, each with their respective set of governing equations, is not a trivial undertaking. Even more complicated is the elaborate and tedious task of specifying the…
In this short note, we mimic the proof of the simplicity of the theory ACFA of generic difference fields in order to provide a criterion, valid for certain theories of pure fields and fields equipped with operators, which shows that a…
We present a streamlined and simplified proof of the Kakeya set conjecture in $\mathbb{R}^3$.
We present modeling of the incompressible viscous flows in the domain containing an unconfined fluid and a porous medium. For such setting a rigorous derivation of the Beavers-Joseph-Saffman interface condition was undertaken by J\"ager and…
We present a symmetry result regarding stationary solutions of the 2D Euler equations in a disk. We prove that in a disk, a steady flow with only one stagnation point and tangential boundary conditions is a circular flow, which confirms a…
In this paper we prove convergence results for homogenization problem for solutions of partial differential system with rapidly oscillating Dirichlet data. Our method is based on analysis of oscillatory integrals. In the uniformly convex…
We consider the following inference problem: Given a set of edge-flow signals observed on a graph, lift the graph to a cell complex, such that the observed edge-flow signals can be represented as a sparse combination of gradient and curl…
We revisit the Kahn-Kalai conjecture, recently proved in striking fashion by Park and Pham, and present a slightly reformulated simple proof which has a few advantages: (1) it works for non-uniform product measures, (2) it gives…
In this short exposition we provide a simplified proof of Buser's result for Cheeger's isoperimetric constant.
Based on various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.
We give an elementary, Fourier-free proof of Roth's theorem. The proof follows Roth's original density-increment strategy, but replaces the usual Fourier-analytic step with a direct combinatorial argument involving averages over…
In this article we extend an unknottedness theorem for compact self shrinkers to the mean curvature flow to shrinkers with one asymptotically conical end, which conjecturally comprises the entire set of self shrinkers with finite topology…
This note presents a proof of P\'olya's random walk theorem using classical methods from special function theory and asymptotic analysis.
We give a relatively easy proof of the Erd\H os-Kac theorem via computing moments. We show how this proof extends naturally in a sieve theory context, and how it leads to several related results in the literature.
In this expository article, we introduce the topological ideas and context central to the Poincare Conjecture. Our account is intended for a general audience, providing intuitive definitions and spatial intuition whenever possible. We…
In the past decade, sparse principal component analysis has emerged as an archetypal problem for illustrating statistical-computational tradeoffs. This trend has largely been driven by a line of research aiming to characterize the…
We present an alternative cyclic proof system for Peano arithmetic that could be simpler than the existing ones and well-adapted both for proof analysis and for automatizing inductive proof search. In addition, we will show how various…
In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.
We prove that a connected graph contains a circuit---a closed walk that repeats no edges---through any $k$ prescribed edges if and only if it contains no odd cut of size at most $k$.