Related papers: Nearly Optimal Embeddings of Flat Tori

In this article, we prove several results about the extension to the boundary of conformal immersions from an open subset $\Omega$ of a Riemannian manifold $L$, into another Riemannian manifold $N$ of the same dimension. In dimension $n…

The famous Johnson-Lindenstrauss lemma states that for any set of n vectors, there is a linear transformation into a space of dimension O(log n) that approximately preserves all their lengths. In fact, a Haar random unitary transformation…

This is the second paper of a series of papers on a version of categories $\mathcal{O}$ for root-reductive Lie algebras. Let $\mathfrak{g}$ be a root-reductive Lie algebra over an algebraically closed field $\mathbb{K}$ of characteristic…

We present a strategy for proving an asymptotic upper bound on the number of defects (non-hexagonal Voronoi cells) in the $n$ generator optimal quantizer on a closed surface (i.e., compact 2-manifold without boundary). The program is based…

We show that the space of Lagrangians which are Hamiltonian isotopic to the Clifford torus in a complex projective space or in the four-dimensional quadric, taken with Chekanov's Lagrangian Hofer metric, contains a quasi-isometric copy of…

The moduli space of flat SL(2,R)-connections modulo gauge transformations on the torus may be described by ordered pairs of commuting SL(2,R) matrices modulo simultaneous conjugation by SL(2,R) matrices. Their spectral properties allow a…

For $n\in \mathbb{N}$ consider the $n$-dimensional hypercube as equal to the vector space $\mathbb{F}_2^n$, where $\mathbb{F}_2$ is the field of size two. Endow $\mathbb{F}_2^n$ with the Hamming metric, i.e., with the metric induced by the…

In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum Spanning Tree problem on a complete graph with $n$ nodes. The…

The Hamiltonian shape invariant of a domain $X \subset \mathbb R^4$, as a subset of $\mathbb R^2$, describes the product Lagrangian tori which may be embedded in $X$. We provide necessary and sufficient conditions to determine whether or…

We present an optimal O*(n^2) time algorithm for deciding if a metric space (X,d) on n points can be isometrically embedded into the plane endowed with the l_1-metric. It improves the O*(n^2 log^2 n) time algorithm of J. Edmonds (2008).…

It is known that the surface of a cone over the unit disc with large height has smaller distortion than the standard embedding of the 2-sphere in $\mathbb R^3$. In this note we show that distortion minimisers exist among convex embedded…

Locally Checkable Labeling (LCL) problems include essentially all the classic problems of $\mathsf{LOCAL}$ distributed algorithms. In a recent enlightening revelation, Chang and Pettie [arXiv 1704.06297] showed that any LCL (on bounded…

Given a set of pairwise disjoint polygonal obstacles in the plane, finding an obstacle-avoiding Euclidean shortest path between two points is a classical problem in computational geometry and has been studied extensively. The previous best…

We study high-dimensional analogues of spaces of long knots. These are spaces of compactly-supported embeddings (modulo immersions) of $\mathbb{R}^m$ into $\mathbb{R}^n$. We view the space of embeddings as the value of a certain functor at…

The optimal $L^4$-Strichartz estimate for the Schr{\"o}dinger equation on the two-dimensional rational torus $\mathbb{T}^2$ is proved, which improves an estimate of Bourgain. A new method based on incidence geometry is used. The approach…

We review some aspects of logarithmic conformal field theories which might shed some light on the geometrical meaning of logarithmic operators. We consider an approach, put forward by V. Knizhnik, where computation of correlation functions…

The metric sketching problem is defined as follows. Given a metric on $n$ points, and $\epsilon>0$, we wish to produce a small size data structure (sketch) that, given any pair of point indices, recovers the distance between the points up…

Despite their empirical success, the internal mechanism by which transformer models align tokens during language processing remains poorly understood. This paper provides a mechanistic and theoretical explanation of token alignment in LLMs.…

Lying at the intersection of Ado's theorem and the Nash embedding theorem, we consider the problem of finding faithful representations of Lie groups which are simultaneously isometric embeddings. Such special maps are found for a certain…

We revisit a standard polygon containment problem: given a convex $k$-gon $P$ and a convex $n$-gon $Q$ in the plane, find a placement of $P$ inside $Q$ under translation and rotation (if it exists), or more generally, find the largest copy…