Related papers: Slicing the Sierpi\'nski gasket

The study of "random segments" is a classic issue in geometrical probability, whose complexity depends on how it is defined. But in apparently simple models, the random behavior is not immediate. In the present manuscript the following…

This is an expository article detailing results concerning large arcs in finite projective spaces, which attempts to cover the most relevant results on arcs, simplifying and unifying proofs of known old and more recent theorems. The article…

Motivated by the statistical and computational challenges of computing Wasserstein distances in high-dimensional contexts, machine learning researchers have defined modified Wasserstein distances based on computing distances between…

Optimal transport and the Wasserstein distance $\mathcal{W}_p$ have recently seen a number of applications in the fields of statistics, machine learning, data science, and the physical sciences. These applications are however severely…

A set of points $S \subseteq \mathbb{F}_p^n$ is called \emph{$p$-divisible} if every affine hyperplane in $\mathbb{F}_p^n$ intersects $S$ in $0 \pmod p$ points. The Strong Cylinder Conjecture of Ball asserts that if $S$ is a $p$-divisible…

In this paper, we study the geometry of trisections on certain rational elliptic surfaces. We utilize Mumford representations of semi-reduced divisors in order to construct trisections and related plane curves with interesting properties…

We study a class of semialgebraic convex bodies called discotopes. These are instances of zonoids, objects of interest in real algebraic geometry and random geometry. We focus on the face structure and on the boundary hypersurface of…

For a geodesic ball with non-negative Ricci curvature and almost maximal volume, without using compactness argument, we construct an $\epsilon$-splitting map on a concentric geodesic ball with uniformly small radius. There are two new…

It has been known for almost 200 years that some angles cannot be trisected by straightedge and compass alone. This paper studies the set of such angles as well as its complement $\mathcal{T}$, both regarded as subsets of the unit circle…

There are various notions of dimension in fractal geometry to characterise (random and non-random) subsets of $\mathbb R^d$. In this expository text, we discuss their analogues for infinite subsets of $\mathbb Z^d$ and, more generally, for…

We apply multifractal analysis to an experimentally obtained quasi-two-dimensional crystal with fourfold symmetry, in order to characterize the sidebranch structure of a dendritic pattern. In our analysis, the stem of the dendritic pattern…

The Wasserstein distance has been an attractive tool in many fields. But due to its high computational complexity and the phenomenon of the curse of dimensionality in empirical estimation, various extensions of the Wasserstein distance have…

We give exact formulas for the number of distinct triangular patterns (or subtriangles) of a given size that occur in the Sierpi\'{n}ski Triangle.

Multi-marginal optimal transport enables one to compare multiple probability measures, which increasingly finds application in multi-task learning problems. One practical limitation of multi-marginal transport is computational scalability…

We study the relation between the diameter, the first positive eigenvalue of the discrete $p$-Laplacian and the $\ell_p$-distortion of a finite graph. We prove an inequality relating these three quantities and apply it to families of Cayley…

A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…

Wasserstein distances are widely used in modern data analysis but pose significant computational and statistical challenges in high dimensions. The sliced Wasserstein distance alleviates these challenges by leveraging one-dimensional…

The separately continuity topology is considered and some its properties are investigated. With help of these properties a generalization of Sierpinski theorem on determination of real separately continuous function by its values on an…

As has been known since the time of Gromov's Nonsqueezing Theorem, symplectic embedding questions lie at the heart of symplectic geometry. After surveying some of the most important ways of measuring the size of a symplectic set, these…

Given S_1, a finite set of points in the plane, we define a sequence of point sets S_i as follows: With S_i already determined, let L_i be the set of all the line segments connecting pairs of points of the union of S_1,...,S_i, and let…