度量几何
We systematically investigate cocycle superrigidity in the setting of finite rank median spaces for product groups and Kazhdan groups. By employing a dynamical approach to superrigidity, we establish, for a median space X of finite rank,…
The Figiel-Lindenstrauss-Milman inequality is a fundamental inequality in the combinatorial theory of polytopes. It is classically obtained as a corollary of Milman's version of Dvoretzky's theorem. The goal of this paper is to provide a…
In 1959, Marcus and Ree proved that any bistochastic matrix $A$ satisfies $\Delta_n(A):= \max_{\sigma\in S_n}\sum_{i=1}^{n}A(i, \sigma(i))-\sum_{i, j=1}^n A(i, j)^2 \geq 0$. Erd\H{o}s asked to characterize the bistochastic matrices…
The field of rigid origami concerns the folding of stiff, inelastic plates of material along crease lines that act like hinges and form a straight-line planar graph, called the crease pattern of the origami. Crease pattern vertices in the…
Ollivier and Lin--Lu--Yau established the theory of graph Ricci curvature (LLY curvature) via optimal transport on graphs. Ikeda--Kitabeppu--Takai--Uehara introduced a new distance called the Kantorovich difference on hypergraphs and…
The Gilbert--Steiner problem is a generalization of the Steiner tree problem and specific optimal mass transportation, which allows the use additional (branching) point in a transport plan. A specific feature of the problem is that the cost…
We show that trees and their products meet octahedron comparison.
We introduce and study the Steiner entire function, an analytic generating function for the intrinsic volumes of a convex compact set in a Hilbert space. This function extends the classical Steiner polynomial to infinite dimensions and…
The curvature exponent $N_{\mathrm{curv}}$ of a metric measure space is the smallest number $N$ for which the measure contraction property $\mathsf{MCP}(0,N)$ holds. In this paper, we study the curvature exponent of sub-Finsler Heisenberg…
A fundamental problem in spherical distance geometry aims to recover an $n$-tuple of points on a 2-sphere in $\mathbb{R}^3$, viewed up to oriented isometry, from $O(n)$ input measurements. We solve this problem using algorithms that employ…
We study $p$-Wasserstein spaces over the branching spaces $\mathbb{R}^2$ and $[-1,1]^2$ equipped with the maximum norm metric. We show that these spaces are isometrically rigid for all $p\geq1,$ meaning that all isometries of these spaces…
Given a hyperplane $H$ cutting a compact, convex body $K$ of positive Lebesgue measure through its centroid, Gr\"unbaum proved that $$\frac{|K\cap H^+|}{|K|}\geq \left(\frac{n}{n+1}\right)^n,$$ where $H^+$ is a half-space of boundary $H$.…
For uniformly dicrete metric spaces without bounded geometry we suggest a modified version of property A based on metrics of bounded geometry greater than the given metric. We show that this version still implies coarse embeddability in…
The Kneser--Poulsen conjecture asserts that the volume of a union of balls in Euclidean space cannot be increased by bringing their centres pairwise closer. We prove that its natural information-theoretic counterpart is true. This follows…
A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…
We investigate equidecomposability in the ring of polygons with sides restricted to given directions and using only translations. Extending classical results of Dehn and Hadwiger, we prove that equidecomposability in these rings is…
We motivate the study of metric spaces with a unique convex geodesic bicombing, which we call CUB spaces. These encompass many classical notions of nonpositive curvature, such as CAT(0) spaces and Busemann-convex spaces. Groups having a…
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
We describe an algorithmic method to transform a Euclidean wallpaper pattern into a Circle Limit-style picture \`a la Escher. The design goals for the method are to be mathematically sound, aesthetically pleasing and fast to compute. It…
We characterize the surjective isometries, with respect to the Hausdorff distance, of the class of bodies given by intersections of Euclidean unit balls. We show that any such isometry is given by the composition of a rigid motion with…