English
Related papers

Related papers: On Theodorus' lesson in the Theaetetus 147d-e

200 papers

Fundamental duality is a concept which refers to two irreducible, heterogeneous principles which are in opposite and complementary of each other. The complementary principle in quantum mechanics is also praised by Bohr. This important…

General Physics · Physics 2023-01-31 B. T. T. Wong

After a brief introduction to the classical theory of binary quadratic forms we use these results for proving (most of) the claims made by P\'epin in a series of articles on unsolvable quartic diophantine equations, and for constructing…

Number Theory · Mathematics 2011-08-30 Franz Lemmermeyer

Erd\"{o}s proved that for every infinite $X \subseteq \mathbb{R}^d$ there is $Y \subseteq X$ with $|Y|=|X|$, such that all pairs of points from $Y$ have distinct distances, and he gave partial results for general $a$-ary volume. In this…

Logic · Mathematics 2018-07-19 William Gasarch , Douglas Ulrich

In this paper, we reconstruct Euclid's theory of similar triangles, as developed in Book VI of the \textit{Elements}, along with its 20th-century counterparts, formulated within the systems of Hilbert, Birkhoff, Borsuk and Szmielew, Millman…

History and Overview · Mathematics 2025-03-24 Piotr Błaszczyk , Anna Petiurenko

Consider a finite field $\mathbb F_q$, $q=p^d$, where $p$ is an odd number. Let $M=(E,r)$ be a regular matroid; denote by ${\mathcal B}$ the family of its bases, $\bar s(M;\alpha)=\sum_{B\in {\mathcal B}}\prod_{e\not\in B} \alpha_e$, where…

Combinatorics · Mathematics 2025-03-25 Eduard Lerner

Kronecker's 1856 paper contains a solvability theorem that is useful to construct unsolvable algebraic equations. We show how Kronecker's solvability theorem can be derived naturally via a polynomial complete decomposition method. This…

Rings and Algebras · Mathematics 2025-04-14 Yan Pan , Yuzhen Chen

In the context of incompressible fluids, the observation that turbulent singular structures fail to be space filling is known as ``intermittency'' and it has strong experimental foundations. Consequently, as first pointed out by Landau,…

Analysis of PDEs · Mathematics 2023-12-19 Luigi De Rosa , Philip Isett

Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…

Information Theory · Computer Science 2009-10-13 Thomas Britz , Bård Heiseldel , Trygve Johnsen , Dillon Mayhew , Keisuke Shiromoto

In 2016 J. Koenigsmann refined a celebrated theorem of J. Robinson by proving that $\mathbb Q\setminus\mathbb Z$ is diophantine over $\mathbb Q$, i.e., there is a polynomial $P(t,x_1,\ldots,x_{n})\in\mathbb Z[t,x_1,\ldots,x_{n}]$ such that…

Number Theory · Mathematics 2023-05-12 Geng-Rui Zhang , Zhi-Wei Sun

Consider the following story: A teacher announces to her students a test for the following week, such that the test will be ``surprising''. The students use this as the basis for a ``logical derivation'' and reach a contradiction, which…

Logic · Mathematics 2026-02-04 Martin Dietzfelbinger

We analyze some of the main approaches in the literature to the method of `adequality' with which Fermat approached the problems of the calculus, as well as its source in the parisotes of Diophantus, and propose a novel reading thereof.…

History and Overview · Mathematics 2020-10-20 Mikhail G. Katz , David M. Schaps , Steven Shnider

In this paper we present an approach towards the comprehensive analysis of the non-integrability of differential equations in the form $\ddot x=f(x,t)$ which is analogous to Hamiltonian systems with 1+1/2 degree of freedom. In particular,…

Mathematical Physics · Physics 2012-02-29 Primitivo B. Acosta-Humanez

There is a striking relationship between a three hundred years old Political Science theorem named "Condorcet's jury theorem" (1785), which states that majorities are more likely to choose correctly when individual votes are often correct…

Machine Learning · Computer Science 2020-02-17 Hanan Shteingart , Eran Marom , Igor Itkin , Gil Shabat , Michael Kolomenkin , Moshe Salhov , Liran Katzir

Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…

Logic · Mathematics 2015-08-04 Brent Cody , Sean Cox

We consider the problem of online fair division of indivisible goods to players when there are a finite number of types of goods and player values are drawn from distributions with unknown means. Our goal is to maximize social welfare…

Computer Science and Game Theory · Computer Science 2024-12-10 Ariel D. Procaccia , Benjamin Schiffer , Shirley Zhang

Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…

Logic in Computer Science · Computer Science 2019-03-14 Antti Kuusisto , Jeremy Meyers , Jonni Virtema

This paper gives a counterexample to the impossibility, by G\"odel's second incompleteness theorem, of proving a formula expressing the consistency of arithmetic in a fragment of arithmetic on the assumption that the latter is consistent.…

Logic · Mathematics 2007-05-23 Alexander S. Yessenin-Volpin , Christer Hennix

I discuss three connections between Dummett's writings about time and philosophical aspects of physics. The first connection (Section 2) arises from remarks of Dummett's about the different relations of observation to time and to space. The…

History and Philosophy of Physics · Physics 2014-06-19 Jeremy Butterfield

Translated from the Latin original, "Observationes circa bina biquadrata quorum summam in duo alia biquadrata resolvere liceat" (1772). E428 in the Enestroem index. This paper is about finding A,B,C,D such that $A^4+B^4=C^4+D^4$. In sect.…

History and Overview · Mathematics 2009-08-10 Leonhard Euler , Jordan Bell

This chapter provides a hands-on tutorial on the important technique known as self-reducibility. Through a series of "Challenge Problems" that are theorems that the reader will---after being given definitions and tools---try to prove, the…

Computational Complexity · Computer Science 2019-03-18 Lane A. Hemaspaandra
‹ Prev 1 3 4 5 6 7 10 Next ›