Related papers: Formalizing Pick's Theorem, efficiently

We prove an asymptotic formula for the number of integral points of bounded log anticanonical height on a singular quartic del Pezzo surface over arbitrary number fields, with respect to the largest admissible boundary divisor. The…

In this note we classify all triples (a,b,i) such that there is a convex lattice polygon P with area a, and b respectively i lattice points on the boundary respectively in the interior. The crucial lemma for the classification is the…

This article builds on Thurston's height functions. His tiling algorithm is reinterpreted using lattice theory and then generalized in order to generate any tiling of a hole-free region. Combined with a natural encoding of tilings by words,…

When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…

After a short review of the classical Lie theorem, a finite dimensional Lie algebra of vector fields is considered and the most general conditions under which the integral curves of one of the fields can be obtained by quadratures in a…

We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…

We use the methods of empirical mathematics to show that iterative logarithmic operations will result in an attractor point on the complex plane. Moreover, we demonstrate that different bases converge onto different attractors. Finally, we…

Perfectoid spaces are sophisticated objects in arithmetic geometry introduced by Peter Scholze in 2012. We formalised enough definitions and theorems in topology, algebra and geometry to define perfectoid spaces in the Lean theorem prover.…

First we present a short overview of the long history of projectively flat Finsler spaces. We give a simple and quite elementary proof of the already known condition for the projective flatness, and we give a criterion for the projective…

This article is about the formalization of synthetic differential geometry with the Lean proof assistant and the mathematical library mathlib. The main result we prove and formalize is a Taylor theorem for functions of several variables,…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…

The theory uses methods and language of linear algebra to study nonlinear spaces. These techniques can be used particularly to describe analytic geometry of non-linear elliptic, hyperbolic, De Sitter and Anti de Sitter spaces. The main…

We prove that the Kauffman bracket skein algebra of a cylinder over a surface with boundary, defined over complex numbers, is isomorphic to the observables of an appropriate lattice gauge field theory.

This paper is a contribution to understanding what properties should a topological algebra on a Stone space satisfy to be profinite. We reformulate and simplify proofs for some known properties using syntactic congruences. We also clarify…

We contribute a new algebraic method for computing the orthogonal projections of a point onto a rational algebraic surface embedded in the three dimensional projective space. This problem is first turned into the computation of the finite…

We apply lattice point counting methods to compute the multiplicities in the plethysm of $GL(n)$. Our approach gives insight into the asymptotic growth of the plethysm and makes the problem amenable to computer algebra. We prove an old…

We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…

We construct an algorithm for solving the following problem: given a number field $K$, a positive integer $N$, and a positive real number $B$, determine all points in $\mathbb P^N(K)$ having relative height at most $B$. A theoretical…