Related papers: Intersection of paraboloids and application to Min…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
We give a recipe to compute the geometric intersection number of an integral lamination with a particular type of integral lamination on an n-times punctured disk. This provides a way to find the geometric intersection number of two…
We have calculated elastic and state-resolved inelastic cross sections for cold and ultracold collisions in the Rb($^1 S$) + OH($^2 \Pi_{3/2}$) system, including fine-structure and hyperfine effects. We have developed a new set of five…
A variational formula is derived by combining the Gaussian volume of the epigraph of a convex function $\varphi$ and the perturbation of $\varphi$ via the infimal convolution. This formula naturally leads to a Borel measure on…
Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of $n$ points in strictly convex normed planes can be constructed in $O(n \log n)$ time. In addition, we confirm that,…
Coulomb integrals, i.e., matrix elements of bare or screened Coulomb interaction between one-electron orbitals, are fundamental objects in many approaches developed to tackle the challenging problem of calculating the electronic structure…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
To determine the relative position of any two surfaces in a system, one approach is to useoperations (Minkowski sum and intersection) on sets of constraints. These constraints aremade compliant with half-spaces of R^n where each set of…
The expected meeting time of two random walkers on an undirected graph of size $N$, where at each time step one walker moves and the process stops when they collide, satisfies a system of $\binom{N}{2}$ linear equations. Na\"{i}vely,…
We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…
In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given…
We show that the detection of geometric intersection in an arbitrary representation of the mapping class group of surface implies the injectivity of that representation up to center, and vice versa. As an application, we discuss the…
We present a mathematical and algorithmic scheme for learning the principal geometric elements in an image or 3D object. We build on recent work that convexifies the basic problem of finding a combination of a small number shapes that…
Consider a Jacobian elliptic surface $E \to C$ with a section $P$ of infinite order. Previous work of the first author and Urz\'ua over the complex numbers gives a bound on the number of tangencies between $P$ and a torsion section of $E$…
It is a classical fact, that given an arbitrary n-dimensional convex body, there exists an appropriate sequence of Minkowski symmetrizations (or Steiner symmetrizations), that converges in Hausdorff metric to a Euclidean ball. Here we…
In this article, we bypass the detailed symmetry breaking pathways established in [1]. Instead, a direct route from the Spin(10) model to the Standard Model is enabled via a single algebraic constraint. This single constraint, however, may…
Based on Nielsen fixed point theory and Gr\"{o}bner-Shirshov basis, we obtain a simple method to compute geometric intersection numbers and self-intersection geometric numbers of loops on surfaces.
In previous work we computed the symplectic volume of the symplectic reduced space of the product of N adjoint orbits of a compact Lie group. In this paper we compute the intersection pairings of the same object.
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If…
A polygon C is an intersecting polygon for a set O of objects in the plane if C intersects each object in O, where the polygon includes its interior. We study the problem of computing the minimum-perimeter intersecting polygon and the…