English
Related papers

Related papers: Formalizing Pick's Theorem, efficiently

200 papers

An algorithm for embedding finite dimensional Lie algebras into Lie algebras of vector fields (and Lie superalgebras into Lie superalgebras of vector fields) is offered in a way applicable over ground fields of any characteristic. The…

Representation Theory · Mathematics 2009-11-11 Irina Shchepochkina

Roughly speaking, Buckingham's $\Pi$-Theorem provides a method to "guess" the structure of physical formulas simply by studying the dimensions (the physical units) of the involved quantities. Here we will prove a quantitative version of…

Mathematical Physics · Physics 2019-12-19 Jan-David Hardtke

This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…

Algebraic Geometry · Mathematics 2011-11-30 Yongbi Li

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

Logic in Computer Science · Computer Science 2019-07-19 Mario Carneiro

Let $A$ be the product of an abelian variety and a torus defined over a number field $K$. Fix some prime number $\ell$. If $\alpha \in A(K)$ is a point of infinite order, we consider the set of primes $\mathfrak p$ of $K$ such that the…

Number Theory · Mathematics 2023-06-22 Davide Lombardo , Antonella Perucca

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

Number Theory · Mathematics 2019-04-11 Gary McGuire , John Sheekey

LLM-generated explanations can make technical content more accessible, but there is a ceiling on what they can support interactively. Because LLM outputs are static text, they cannot be executed or stepped through. We argue that grounding…

Human-Computer Interaction · Computer Science 2026-04-13 Hita Kambhamettu , Will Crichton , Sean Welleck , Harrison Goldstein , Andrew Head

The challenges of examining random partitions of space are a significant class of problems in the theory of geometric transformations. Richard Miles calculated moments of areas and perimeters of any order (including expectation) of the…

Probability · Mathematics 2022-08-02 Alexei Kanel-Belov , Mehdi Golafshan , Sergey Malev , Roman Yavich

We consider the problem of explaining the predictions of an arbitrary blackbox model $f$: given query access to $f$ and an instance $x$, output a small set of $x$'s features that in conjunction essentially determines $f(x)$. We design an…

Machine Learning · Computer Science 2021-11-03 Guy Blanc , Jane Lange , Li-Yang Tan

Linear Geometry studies geometric properties which can be expressed via the notion of a line. All information about lines is encoded in a ternary relation called a line relation. A set endowed with a line relation is called a liner. So,…

Algebraic Geometry · Mathematics 2026-04-08 Taras Banakh

We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…

Algebraic Geometry · Mathematics 2026-01-21 Alejandro González Nevado

In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…

History and Overview · Mathematics 2011-11-30 Sultan Hussain , Usman Ali

Let $p$ be a prime number. Motivated by the local lifting problem for $(\mathbb{Z}/p\mathbb{Z})^n$ with $n>1$, we prove several new results on certain $\mathbb{F}_p$-vector spaces of logarithmic differential forms on the projective line in…

Number Theory · Mathematics 2026-01-06 Michel Matignon , Guillaume Pagot , Daniele Turchetti

A polygon is derived that contains the numerical range of a bounded linear operator on a complex Hilbert space, using only norms. In its most general form, the polygon is an octagon, symmetric with respect to the origin, and tangent to the…

Functional Analysis · Mathematics 2021-02-10 Aaron Melman

For any Inonu-Wigner contraction of a three dimensional Lie algebra we construct the corresponding contractions of representations. Our method is quite canonical in the sense that in all cases we deal with realizations of the…

Mathematical Physics · Physics 2015-06-03 E. M. Subag , E. M. Baruch , J. L. Birman , A. Mann

In this paper we show how to use elementary methods to prove that the volume of Sl_k R / Sl_k Z is zeta(2) * zeta(3) * ... * zeta(k) / k. Using a version of reduction theory presented in this paper, we can compute the volumes of certain…

Number Theory · Mathematics 2009-09-02 Henri Gillet , Daniel R. Grayson

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…

Algebraic Geometry · Mathematics 2007-05-23 Alexei G. Gorinov

The lattice definition of the two-dimensional topological quantum field theory [Fukuma, {\em et al}, Commun.~Math.~Phys.\ {\bf 161}, 157 (1994)] is generalized to arbitrary (not necessarily orientable) compact surfaces. It is shown that…

High Energy Physics - Theory · Physics 2009-10-28 Vahid Karimipour , Ali Mostafazadeh

Geometric algebra is the natural outgrowth of the concept of a vector and the addition of vectors. After reviewing the properties of the addition of vectors, a multiplication of vectors is introduced in such a way that it encodes the famous…

General Mathematics · Mathematics 2018-02-23 Sergio Ramos Ramirez , Jose Alfonso Juarez Gonzalez , Garret Sobczyk

Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…

Computational Geometry · Computer Science 2025-09-05 Mikkel Abrahamsen , Jack Stade , Shuyi Yan , Hanwen Zhang