English
Related papers

Related papers: Desargues and the "trait \`a preuves"

200 papers

Let G be an n-vertex graph with m edges. The degree deviation measure of G is defined as s(G)=sum v in V(G)|degG(v)-(2m/n)|, where n and m are the number of vertices and edges of G, respectively. The aim of this paper is to prove the…

Combinatorics · Mathematics 2020-02-24 Ali Ghalavand , Ali Reza Ashrafi

Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of circle". The main idea of the approximation method by…

Differential Geometry · Mathematics 2008-11-10 V. A. Garanzha

These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The…

Combinatorics · Mathematics 2016-10-18 Thomas Zaslavsky

What did "algebra" mean before the development of the algebraic theories of the 20th century ? This paper stresses the identities taken by the algebraic practices developped during the century long discussion around the equation around the…

History and Overview · Mathematics 2012-02-15 Frederic Brechenmacher

The classification of algebraic surfaces by the Italian School of algebraic geometry is universally recognized as a breakthrough in 20th-century mathematics. The methods by which it was achieved do not, however, meet the modern standard of…

History and Overview · Mathematics 2022-06-15 Silvia De Toffoli , Claudio Fontanari

The contour argument was introduced by Peierls for two dimensional Ising model. Peierls benefited from the particular symmetries of the Ising model. For non-symmetric models the argument was developed by Pirogov and Sinai. It is very…

Mathematical Physics · Physics 2007-11-01 N. N. Ganikhodjaev , U. A. Rozikov

Mathematical proofs are both paradigms of certainty and some of the most explicitly-justified arguments that we have in the cultural record. Their very explicitness, however, leads to a paradox, because the probability of error grows…

Symbolic Computation · Computer Science 2022-04-13 Scott Viteri , Simon DeDeo

According to Aristotle, a philosopher in Ancient Greece, "the whole is greater than the sum of its parts". This observation was adopted to explain human perception by the Gestalt psychology school of thought in the twentieth century. Here,…

Computer Vision and Pattern Recognition · Computer Science 2020-01-28 Oshri Halimi , Ido Imanuel , Or Litany , Giovanni Trappolini , Emanuele Rodolà , Leonidas Guibas , Ron Kimmel

A portrait is a combinatorial model for a discrete dynamical system on a finite set. We study the geometry of portrait moduli spaces, whose points correspond to equivalence classes of point configurations on the affine line for which there…

Algebraic Geometry · Mathematics 2022-12-07 Talia Blum , John R. Doyle , Trevor Hyde , Colby Kelln , Henry Talbott , Max Weinreich

Dirichlet proves the general convergence of Fourier series, after pointing out errors in an earlier attempt by Cauchy. We transcribed from Crelle's Journal (1829) with numerous typographical corrections, and added a completed bibliography.…

History and Overview · Mathematics 2008-06-10 Peter Gustav Lejeune Dirichlet

"Systems that Explain Themselves" appears a provocative wording, in particular in the context of mathematics education -- it is as provocative as the idea of building educational software upon technology from computer theorem proving. In…

Software Engineering · Computer Science 2018-03-06 Alan Krempler , Walther Neuper

Stereophotogrammetry is an established technique for scene understanding. Its origins go back to at least the 1800s when people first started to investigate using photographs to measure the physical properties of the world. Since then,…

Computer Vision and Pattern Recognition · Computer Science 2025-07-10 Vibhas K Vats , David J Crandall

Much of the recent progress in String Theory can be traced to a precise strategy: a careful study of the few models known since the beginnings of the subject, and the abstraction from them of basic properties that one would like to demand…

High Energy Physics - Theory · Physics 2007-05-23 Augusto Sagnotti

An argument can be seen as a pair consisting of a set of premises and a claim supported by them. Arguments used by humans are often enthymemes, i.e., some premises are implicit. To better understand, evaluate, and compare enthymemes, it is…

Artificial Intelligence · Computer Science 2024-11-14 Jonathan Ben-Naim , Victor David , Anthony Hunter

Deductive verification is an effective method to ensure that a given system exposes the intended behavior. In spite of its proven usefulness and feasibility in selected projects, deductive verification is still not a mainstream technique.…

Software Engineering · Computer Science 2026-01-26 Lea Salome Brugger , Xavier Denis , Peter Müller

Gentzen's 1936 proof of the consistency of Peano Arithmetic was a significant result in the foundations of mathematics. We provide here a modified version of the proof, based on G\"{o}del's reformulation, and including additional details…

Logic in Computer Science · Computer Science 2026-03-03 Aaron Bryce , Rajeev Gore'

One fundamental consequence of a scheme $X$ being proper is that the functor classifying maps from $X$ to any other suitably nice scheme or algebraic stack is representable by an algebraic stack. This result has been generalized by…

Algebraic Geometry · Mathematics 2019-07-30 Daniel Halpern-Leistner , Anatoly Preygel

We lay the groundwork for a formal framework that studies scientific theories and can serve as a unified foundation for the different theories within physics. We define a scientific theory as a set of verifiable statements, assertions that…

Artificial Intelligence · Computer Science 2019-02-20 Gabriele Carcassi , Christine A. Aidala

This article describes a formal strategy of geometric complexity theory (GCT) to resolve the {\em self referential paradox} in the $P$ vs. $NP$ and related problems. The strategy, called the {\em flip}, is to go for {\em explicit proofs} of…

Computational Complexity · Computer Science 2010-09-02 Ketan Mulmuley

This work is, in part, a generalization of the article by A.A. Bruen ,T.C Bruen and J.M.McQuillan on Desargues Theorem in arXiv:2007.09175[mathCO]July 17,2020. We prove the extension of Desargues theorem in all dimensions, using 4 different…

Combinatorics · Mathematics 2023-02-08 Aiden A Bruen
‹ Prev 1 3 4 5 6 7 10 Next ›