Related papers: Grationality, With a Spoon
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…
Pythagoras' theorem, the area of a triangle as one half the base times the height, and Heron's formula are amongst the most important and useful results of ancient Greek geometry. Here we look at all three in a new and improved light, using…
We give a language for geometry which makes curves and number fields look alike.
An idea to present a classical Lie group of positive dimension by generators and relations sounds dubious, but happens to be fruitful. The isometry groups of classical geometries admit elegant and useful presentations by generators and…
In some sense, the world is composed of shapes and words, of continuous things and discrete things. The recognition and study of continuous objects in the form of shapes occupies a significant part of the effort of unraveling many geometric…
The article introduces the concept of uniformity, which is formulated as a scheme of axioms. The connection of this concept with ordered sets is studied. The effectiveness of using axiom schemes as a convenient and short way of replacing…
Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…
Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1,2,...,c. Motivated by conjectures of Propp, we are led to consider partitions of P into k-gons which are proper in the sense that each k-gon…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
We first prove the Grinberg-Kazhdan formal arc theorem without any assumptions on the characteristic. This part of the article is equivalent to arXiv:math-AG/0203263. Then we try to clarify the geometric ideas behind the proof by…
The 2016 papers of J. Solomon and S. Tukachinsky use bounding chains in Fukaya's $A_{\infty}$-algebras to define numerical disk counts relative to a Lagrangian under certain regularity assumptions on the moduli spaces of disks. We present a…
We provide a general contractibility criterion for subsets of Riemannian metrics on the disc. For instance, this result applies to the space of metrics that have positive Gauss curvature and make the boundary circle convex (or geodesic).…
For all positive integers $k,l,n$, the Little Glaisher theorem states that the number of partitions of $n$ into parts not divisible by $k$ and occurring less than $l$ times is equal to the number of partitions of $n$ into parts not…
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…
An important problem in geometric reasoning is to find the configuration of a collection of geometric bodies so as to satisfy a set of given constraints. Recently, it has been suggested that this problem can be solved efficiently by…
Building blocks and tiles are an excellent way of learning about geometry and mathematics in general. There are several versions of tiles that are either snapped together or connected with magnets that can be used to introduce topics like…
We give several new positive finite presentations for the pure braid group that are easy to remember and simple in form. All of our presentations involve a metric on the punctured disc so that the punctures are arranged "convexly", which is…
A conjecture of Serre concerns the number of rational points of bounded height on a finite cover of projective space P^{n-1}. In this paper, we achieve Serre's conjecture in the special case of smooth cyclic covers of any degree when n is…
The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportionality and…
Selective rationalization has become a common mechanism to ensure that predictive models reveal how they use any available features. The selection may be soft or hard, and identifies a subset of input features relevant for prediction. The…