Related papers: Formalizing Pick's Theorem in Isabelle/HOL
In this paper we will review a recently introduced method for solving the Hamilton-Jacobi equations by the method of Separation of Variables. This method is based on the notion of pencil of Poisson brackets and on the bihamiltonian approach…
Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form $f_n(x) = x^4-nx^3-6x^2+nx+1$ with $n \neq 3$ a positive integer and we let…
This is an overview of a formalisation project in the proof assistant Isabelle/HOL of a number of research results in infinitary combinatorics and set theory (more specifically in ordinal partition relations) by Erd\H{o}s--Milner, Specker,…
We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…
The main purpose of this paper is to show that the mixed Hodge polynomial of the ``space of equations'' for smooth complete intersections of given multidegree in $\mathbb{C} P^n$ is divisible by the mixed Hodge polynomial of the group…
Formalised libraries of combinatorial mathematics have rapidly expanded over the last five years, but few use one of the most important tools: probability. How can often intuitive probabilistic arguments on the existence of combinatorial…
We show that packing axis-aligned unit squares into a simple polygon $P$ is NP-hard, even when $P$ is an orthogonal and orthogonally convex polygon with half-integer coordinates. It has been known since the early 80s that packing unit…
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…
Linear programming describes the problem of optimising a linear objective function over a set of constraints on its variables. In this paper we present a solver for linear programs implemented in the proof assistant Isabelle/HOL. This…
This paper presents a formalisation of pGCL in Isabelle/HOL. Using a shallow embedding, we demonstrate close integration with existing automation support. We demonstrate the facility with which the model can be extended to incorporate…
In differential topology and geometry, the h-principle is a property enjoyed by certain construction problems. Roughly speaking, it states that the only obstructions to the existence of a solution come from algebraic topology. We describe a…
The need for formal definition of the very basis of mathematics arose in the last century. The scale and complexity of mathematics, along with discovered paradoxes, revealed the danger of accumulating errors across theories. Although,…
We provide a closed form expression for linear Hodge integrals on the hyperelliptic locus. Specifically, we find a succinct combinatorial formula for all intersection numbers on the hyperelliptic locus with one $\lambda$-class, and powers…
In this article, we give an exposition on the Holmes-Thompson theory developed by Alvarez. The space of geodesics in Minkowski space has a symplectic structure which is induced by the projection from the sphere-bundle. we show that it can…
We show that the implicit equation of a surface in 3-dimensional projective space parametrized by bi-homogeneous polynomials of bi-degree (d,d), for a given positive integer d, can be represented and computed from the linear syzygies of its…
Starting from the well-known and elementary problem of inscribing the rectangle of the greatest area in an ellipse, we look at possible, gradually more and more complicated variants of this problem. Our goal is to demonstrate to an average…
We solve and generalize an open problem posted by James Propp (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999) on the number of tilings of quasi-hexagonal regions on the square lattice with every…
We show that the decision problem for the basic system of interpretability logic IL is PSPACE-complete. For this purpose we present an algorithm which uses polynomial space with respect to the complexity of a given formula. The existence of…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
When faced with the question of how to represent properties in a formal proof system any user has to make design decisions. We have proved three of the theorems from Maskin's 2004 survey article on Auction Theory using the Isabelle/HOL…