Related papers: Formalizing Pick's Theorem, efficiently
This paper explores and proves the one-seventh area triangle using a purely algebraic approach as opposed to a geometric one. A triangle set purely in the complex plane is used so that we can utilise features of the complex number system to…
This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…
In this article I conduct a short review of the proofs of the area inside a circle. These include intuitive as well as rigorous analytic proofs. This discussion is important not just from mathematical view point but also because…
We present a formalization, in the theorem prover Lean, of the classification of solvable Lie algebras of dimension at most three over arbitrary fields. Lie algebras are algebraic objects which encode infinitesimal symmetries, and as such…
In this paper we introduce a new kind of topological space, called 'structured space', which locally resembles various kinds of algebraic structures. This can be useful, for instance, to locally study a space that cannot be globally endowed…
In this paper, we prove that the set of triangulations of a polygon can be equipped with an order to become a lattice. First, we define this order. In [HN99], authors defined the flip operator and then prove some properties of the graph of…
We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…
We present an algebraic characterization of the complexity classes Logspace and Nlogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is rooted in proof theory…
We revisit the geometric foundations of mesh representation through the lens of Plane-based Geometric Algebra (PGA), questioning its efficiency and expressiveness for discrete geometry. We find how $k$-simplices (vertices, edges, faces,…
In this paper we will do the following: (1) show how to geometrically define multiplication, using only basic plane geometry, independently of area and any notion of similar triangles; (2) prove all the properties of multiplication using…
We implement methods from the geometry of numbers to give explicit estimates for the number of integral ideals in a number field. We pay particular attention to minimising the effect of the degree $n$ of the number field on the error term…
With this chapter we provide a compact yet complete survey of two most remarkable "representation theorems": every arguesian projective geometry is represented by an essentially unique vector space, and every arguesian Hilbert geometry is…
Regions-based theories of space aim -- among others -- to define points in a geometrically appealing way. The most famous definition of this kind is probably due to Whitehead. However, to conclude that the objects defined are points indeed,…
Chemical theory can be made more rigorous using the Lean theorem prover, an interactive theorem prover for complex mathematics. We formalize the Langmuir and BET theories of adsorption, making each scientific premise clear and every step of…
In this paper we introduce a natural model for the realization space of a polytope up to projective equivalence which we call the slack realization space of the polytope. The model arises from the positive part of an algebraic variety…
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be used to represent and manipulate field-theory expressions,…
The famous pancake theorem states that for every finite set $X$ in the plane, there exist two orthogonal lines that divide $X$ into four equal parts. We propose an algorithm whose running time is linear in the number of points in $X$ and…
We prove the existence of infinitely many solutions to an elliptic problem by borrowing the techniques from algebraic topology. The solution(s) thus obtained will also be proved to be bounded.
We consider the expansion of the real field by the group of rational points of an elliptic curve over the rational numbers. We prove a completeness result, followed by a quantifier elimination result. Moreover we show that open sets…