Related papers: Eliminating higher-multiplicity intersections in t…
The article proposes a new method for finding the triangle-triangle intersection in 3D space, based on the use of computer graphics algorithms -- cutting off segments on the plane when moving and rotating the beginning of the coordinate…
For every finite collection of curves on a surface, we define an associated (semi-)norm on the first homology group of the surface. The unit ball of the dual norm is the convex hull of its integer points. We give an interpretation of these…
We extend the previous results of exact bosonization, mapping from fermionic operators to Pauli matrices, in 2d and 3d to arbitrary dimensions. This bosonization map gives a duality between any fermionic system in arbitrary $n$ spatial…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
An isovariant map is an equivariant map between $G$-spaces which strictly preserves isotropy groups. We consider an isovariant analogue of Klein--Williams equivariant intersection theory for a finite group $G$. We prove that under certain…
While classical data analysis has addressed observations that are real numbers or elements of a real vector space, at present many statistical problems of high interest in the sciences address the analysis of data that consist of more…
We show that for polytopes P_1, P_2, ..., P_r \subset \R^d, each having n_i \ge d+1 vertices, the Minkowski sum P_1 + P_2 + ... + P_r cannot achieve the maximum of \prod_i n_i vertices if r \ge d. This complements a recent result of Fukuda…
We use a local argument to prove if an $r$-dimensional torus acts isometrically and effectively on a connected $n$-dimensional manifold which has positive $k^\mathrm{th}$-intermediate Ricci curvature at some point, then $r \leq \lfloor…
The Whitney embedding theorem gives an upper bound on the smallest embedding dimension of a manifold. If a data set lies on a manifold, a random projection into this reduced dimension will retain the manifold structure. Here we present an…
For a generic degree d smooth map f: N^n -> M^n we introduce its "transverse fundamental group" \pi(f), which reduces to \pi_1(M) in the case where f is a covering, and in general admits a monodromy homomorphism \pi(f) -> S_{|d|};…
Given a real number $t>1$, a geometric $t$-spanner is a geometric graph for a point set in $\mathbb{R}^d$ with straight lines between vertices such that the ratio of the shortest-path distance between every pair of vertices in the graph…
Let $P$ be a set of $n\geq 3$ points in general position in the plane. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in…
The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…
A space curve in a Euclidean 3-space $\mathbb E^3$ is called a rectifying curve if its position vector field always lies in its rectifying plane. This notion of rectifying curves was introduced by the author in [Amer. Math. Monthly {\bf…
In this paper we propose an approach for computing multiple high-quality near-isometric dense correspondences between a pair of 3D shapes. Our method is fully automatic and does not rely on user-provided landmarks or descriptors. This…
We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…
We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…
A set of segments in the plane may form a Euclidean TSP tour or a matching, among others. Optimal TSP tours as well as minimum weight perfect matchings have no crossing segments, but several heuristics and approximation algorithms may…
Guided by the connections between hypergraphs and exterior algebras, we study Tur\'an and Ramsey type problems for alternating multilinear maps. This study lies at the intersection of combinatorics, group theory, and algebraic geometry, and…
Given $k$ pairs of vertices $(s_i,t_i)\;(1\le i\le k)$ of a digraph $G$, how can we test whether there exist vertex-disjoint directed paths from $s_i$ to $t_i$ for $1\le i\le k$? This is NP-complete in general digraphs, even for $k = 2$,…