Related papers: The farthest point map on the 4-cube
We perform an exhaustive search for the minimum 4-regular unit distance graph resulting in a lower bound of 34 vertices.
A simplified trisection is a trisection map on a 4-manifold such that, in its critical value set, there is no double point and cusps only appear in triples on innermost fold circles. We give a necessary and sufficient condition for a…
Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine plane $\mathbb{F}_q^2$ over a finite field $\mathbb{F}_q$,…
A submanifold of the standard symplectic space determines a partially defined, multi-valued symplectic map, the outer symplectic billiard correspondence. Two points are in this correspondence if the midpoint of the segment connecting them…
The orthogonal projection of a 4-cube onto a uniform random 3-subspace in R^4 is a convex 3-polyhedron P with 14 vertices almost surely. Three numerical characteristics of P -- volume, surface area and mean width -- are studied. These…
This is an incomplete attempt to show that the upper bound of $\lesssim n^\frac{4}{3}$ on the number unit distances determined by a large finite set of $n$ points in the plane is not sharp. The methods also say something about sets of $n$…
In discrete differential geometry, it is widely believed that the discrete Gaussian curvature of a polyhedral vertex star equals the algebraic area of its Gauss image. However, no complete proof has yet been described. We present an…
Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine plane $\mathbb{F}_q^2$ over a finite field $\mathbb{F}_q$,…
Among the nondegenerate C^4 hypersurfaces M in R^n, we characterize the rational quadrics as the hypersurfaces that are the least well approximated by rational points. Given M other than a rational quadric, we prove a heuristically sharp…
The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let…
The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. The orbit of a convex polygon under this map is a sequence of polygons which converges…
We consider polyhedral cones, associated with quasi-semi-metrics (oriented distances), in particular, with oriented multi-cuts, on n points. We computed the number of facets and of extreme rays, their adjacencies, and incidences of the…
Let $Rat_d$ denote the space of holomorphic self-maps of ${\bf P}^1$ of degree $d\geq 2$, and $\mu_f$ the measure of maximal entropy for $f\in Rat_d$. The map of measures $f\mapsto\mu_f$ is known to be continuous on $Rat_d$, and it is shown…
It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Such polytopes are called conditionally decomposable. We show…
We study trisections of smooth, compact non-orientable 4-manifolds, and introduce trisections of non-orientable 4-manifolds with boundary. In particular, we prove a non-orientable analogue of a classical theorem of Laudenbach-Po\'enaru. As…
Consider the continuum of points along the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
We consider the question of how well points in a quadric hypersurface $M\subset\mathbb R^d$ can be approximated by rational points of $\mathbb Q^d\cap M$. This contrasts with the more common setup of approximating points in a manifold by…
We consider the classical minimum and maximum cut problems: find a partition of vertices of a graph into two disjoint subsets that minimize or maximize the sum of the weights of edges with endpoints in different subsets. It is known that if…
Given a non-singular diagonal cubic hypersurface $X\subset\mathbb{P}^{n-1}$ over $\mathbb{F}_q(t)$ with $\mathrm{char} (\mathbb{F}_q)\neq 3$, we show that the number of rational points of height at most $|P|$ is $O(|P|^{3+\varepsilon})$ for…