Related papers: For which triangles is Pick's formula almost corre…
We extract an exact formula relating the number of lattice points in an expanding region of a complex semi-simple symmetric space and the automorphic spectrum from a spectral identity, which is obtained by producing two expressions for the…
A rational triangle $T$ (one whose angles are rational multiples of $\pi$) unfolds to a translation surface $(X_T,\omega_T)$. The lattice triangle problem asks to classify those $T$ for which $(X_T,\omega_T)$ is a Veech (lattice) surface,…
A concept of abstract inductive definition on a complete lattice is formulated and studied. As an application, a constructive and predicative version of Tarski's fixed point theorem is obtained.
We have found some patterns in some triangles.
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
We consider a geometric percolation process partially motivated by recent work of Hejda and Kala. Specifically, we start with an initial set $X \subseteq \mathbb{Z}^2$, and then iteratively check whether there exists a triangle $T \subseteq…
We prove that for any knot $K$, there exists a one-vertex triangulation of the $3$-sphere containing an edge forming $K$. The proof is constructive, and based on fully augmented links. We use our method to produce ``complicated'' simplicial…
We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…
Yet more candidates are proposed for inclusion in the Encyclopedia of Triangle Centers. Our focus is entirely on simple calculations.
We prove the 3-fold DT/PT correspondence for K-theoretic vertices via wall-crossing techniques. We provide two different setups, following Mochizuki and following Joyce; both reduce the problem to q-combinatorial identities on word…
Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…
We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…
We show that the usual fixed point for 3-d rigid string with topological term appears to be a trivial one, consisting of two decoupled conformal field theories. We further argue that by involving an additional term allowed by symmetries and…
We present a variation of the broken stick problem in which $n$ stick lengths are sampled uniformly at random. We prove that the probability that no three sticks can form a triangle is the reciprocal of the product of the first $n$…
We investigate the number of curves having a rational point of almost minimal height in the family of quadratic twists of a given elliptic curve. This problem takes its origin in the work of Hooley, who asked this question in the setting of…
Several new results on the multicritical behavior of rectangular matrix models are presented. We calculate the free energy in the saddle point approximation, and show that at the triple-scaling point, the result is the same as that derived…
The conditions determining that two triangles are congruent play a basic role in planimetry. By comparing not congruent triangles with respect to given sets of corresponding elements it is important to discover if they have any common…
We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…
It is known that certain theories with extended supersymmetry can be discretized in such a way as to preserve an exact fermionic symmetry. In the simplest model of this kind, we show that this residual supersymmetric invariance is actually…