English
Related papers

Related papers: Hasse theorem -- an elementary approach

200 papers

For Fatou's interpolation theorem of 1906 we suggest a new elementary proof.

Complex Variables · Mathematics 2020-03-19 Arthur A. Danielyan

We prove a local version of the Mazur-Ulam theorem.

Functional Analysis · Mathematics 2009-05-12 Osamu Hatori

Standard proofs of Lusin's theorem, using simple functions, are sometimes quite elaborate. Here, we give a one-sentence proof of Lusin's theorem. We do not believe our approach, by way of inverse images, is new. However, this particular…

Classical Analysis and ODEs · Mathematics 2018-11-01 Samuel J. Ferguson , Tianqi Wu

Our goal in the present paper is to give a new ergodic proof of a well-known Veech's result, build upon our previous works.

Dynamical Systems · Mathematics 2017-03-07 Panagiotis Georgopoulos

This article presents an elementary proof of Zorn's Lemma under the Axiom of Choice, simplifying and supplying necessary details in the original proof by Paul R. Halmos in his book, Naive Set Theory. Also provided, is a preamble to Zorn's…

Logic · Mathematics 2012-07-31 Arjun Jain

We propose a simple proof of the vertical half-space theorem for Heisenberg space.

Differential Geometry · Mathematics 2016-03-09 Tristan Alex

A more detailed derivation of the Heisenberg uncertainty principle from the certainty principle is given.

Quantum Physics · Physics 2007-05-23 D. A. Arbatsky

Employing Br\"udern's and Wooley's new complification method, we establish an asymptotic Hasse principle for the number of solutions to a system of r_3 cubic and r_2 quadratic diagonal forms, when the number of cubic equations is at least…

Number Theory · Mathematics 2016-12-05 Julia Brandes

We provide new sufficient conditions under which Ryser's conjecture holds.

Number Theory · Mathematics 2025-09-03 Antun Domic , Luis H. Gallardo

We present here a simple and direct proof of the classic geometric version of Hahn-Banach Theorem from its analitic version, in the real case. The reciprocal implication, and the direct proofs of both versions, are already well kown, but…

Functional Analysis · Mathematics 2019-08-28 Fidel José Fernández y Fernández Arroyo

We prove an analytic KAM-Theorem, which is used in [1], where the differential part of KAM-theory is discussed. Related theorems on analytic KAM-theory exist in the literature (e. g., among many others, [7], [8], [13]). The aim of the…

Symplectic Geometry · Mathematics 2007-05-23 Joachim Albrecht

In this paper, we present a short proof of Halin's grid theorem.

Combinatorics · Mathematics 2025-09-16 Ye Chern

A short and elementary proof is given of a celebrated eigenvalue-perturbation result due to Alfred Brauer.

Spectral Theory · Mathematics 2021-10-05 Judith J. McDonald , Pietro Paparella

In this note, we propose a conjecture stating that some series involving primitive sequences are convergent. Then, we show (by a counterexample) that the analogue of a conjecture of Erd\H{o}s, for those series, is false.

Number Theory · Mathematics 2017-09-25 Bakir Farhi

In the current note, we present a new, short proof of the famous AM-GM-HM inequality using only induction and basic calculus.

General Mathematics · Mathematics 2022-06-06 Konstantinos Gaitanas

We prove Union-Closed sets conjecture.

Combinatorics · Mathematics 2024-09-13 Vladimir Blinovsky , Llohann D Speranca

Using geometric homology and cohomology we give a simple and conceptual proof of the Thom isomorphism theorem.

Algebraic Topology · Mathematics 2007-05-23 Martin Jakob

Conditions for Bayesian posterior robustness have been examined in recent literature. However, many of the proofs seem to be long and complicated. In this paper, we first summarize some basic lemmas that have been applied implicitly or…

Statistics Theory · Mathematics 2023-11-06 Yasuyuki Hamura

We present a theory of lazy imperative timing.

Programming Languages · Computer Science 2018-10-24 Eric C. R. Hehner

The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method.

Computational Complexity · Computer Science 2007-05-23 Tao Jiang , Ming Li , Paul Vitanyi
‹ Prev 1 8 9 10 Next ›