Related papers: Singular surfaces and cusps in symmetric planar 3-…
The classical Kummer construction attaches to an abelian surface a K3 surface. As Shioda and Katsura showed, this construction breaks down for supersingular abelian surfaces in characteristic two. Replacing supersingular abelian surfaces by…
We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…
We study nonconvex quadratic problems (QPs) with quadratic separable constraints, where these constraints can be defined both as inequalities or equalities. We derive sufficient conditions for these types of problems to present the…
In the coordinated motion planning problem, we are given a graph together with the starting and destination vertices of $k$ robots. At each time step, any subset of robots may move, each traversing an edge of the graph, provided that no two…
The fundamental inverse problem in distance geometry is the one of finding positions from inter-point distances. The Discretizable Molecular Distance Geometry Problem (DMDGP) is a subclass of the Distance Geometry Problem (DGP) whose search…
The Generalized Sliding-Tile Puzzle (GSTP), allowing many square tiles on a board to move in parallel while enforcing natural geometric collision constraints on the movement of neighboring tiles, provide a high-fidelity mathematical model…
Additive manufacturing builds physical objects by accumulating layers upon layers of solidified material. This process is typically done with horizontal planar layers. However, fused filament printers have the capability to extrude material…
We study surfaces of constant positive Gauss curvature in Euclidean 3-space via the harmonicity of the Gauss map. Using the loop group representation, we solve the regular and the singular geometric Cauchy problems for these surfaces, and…
We express the finite 3D Dimer partition function as a linear combination of determinants of oriented adjacency matrices, and the finite 3D Ising partition sum as a linear combination of products over aperiodic closed walks. The methodology…
We emphasize that the stabilizing symmetry for dark matter (DM) particles does not have to be the commonly used parity (Z_2) symmetry. We therefore examine the potential of the colliders to distinguish models with parity stabilized DM from…
Quadratic programming (QP) underpins real-time robotics by enabling efficient, constrained optimization in state estimation, motion planning, and control. In legged locomotion and manipulation, essential modules like inverse dynamics, Model…
We study the classic sliding cube model for programmable matter under parallel reconfiguration in three dimensions, providing novel algorithmic and surprising complexity results in addition to generalizing the best known bounds from two to…
Navigating rigid body objects through crowded environments can be challenging, especially when narrow passages are presented. Existing sampling-based planners and optimization-based methods like mixed integer linear programming (MILP)…
A motion of a mechanism is a curve in its configuration space (c-space). Singularities of the c-space are kinematic singularities of the mechanism. Any mobility analysis of a particular mechanism amounts to investigating the c-space…
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
The Snyder-de Sitter model is an extension of the Snyder model to a de Sitter background. It is called triply special relativity (TSR) because it is based on three fundamental parameters: speed of light, Planck mass, and the cosmological…
We use normal sections to relate the curvature locus of regular (resp. singular corank 1) 3-manifolds in $\mathbb{R}^6$ (resp. $\mathbb R^5$) with regular (resp. singular corank 1) surfaces in $\mathbb R^5$ (resp. $\mathbb R^4$). For…
A new algorithm for the efficient numerical approximation of weakly singular integrals over convex polytopes is introduced. Such integrals appear in the Galerkin discretizations of integral equations and nonlocal partial differential…
Order picking travel dominates much of warehouse effort, and exact routing is especially valuable when storage is scattered so pick locations are not fixed in advance. We address the single picker routing problem (SPRP) and its…
We discuss integrable discretizations of 3-dimensional cyclic systems, that is, orthogonal coordinate systems with one family of circular coordinate lines. In particular, the underlying circle congruences are investigated in detail, and…