Related papers: Minimal horizontal triods: Analysis and computatio…
We give a short and elementary proof of the boundedness of triangular Hilbert transform along non-flat curves definable in a polynomially bounded o-minimal structure. We also provide a criterion on the multiplier to determine whether the…
Let $G$ be a strongly connected directed graph. We consider the following three problems, where we wish to compute the smallest strongly connected spanning subgraph of $G$ that maintains respectively: the $2$-edge-connected blocks of $G$…
Nodes in networks that exhibit high connectivity, also called ``hubs'', play a critical role in determining the structural and functional properties of networked systems. However, there is no clear definition of what constitutes a hub node…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…
In this paper we study horizontal curvatures for surfaces embedded in three-dimensional contact sub-Riemannian Lie groups. Using a Riemannian approximation scheme, we derive explicit formulas for horizontal Gauss curvature, horizontal mean…
Motivated by the algorithmic study of 3-dimensional manifolds, we explore the structural relationship between the JSJ decomposition of a given 3-manifold and its triangulations. Building on work of Bachman, Derby-Talbot and Sedgwick, we…
A topologically minimal surface may be isotoped into a normal form with respect to a fixed triangulation. If the intersection with each tetrahedron is simply connected, then the pieces of this normal form are triangles, quadrilaterals, and…
In this paper we investigate H-minimal graphs of lower regularity. We show that noncharactersitic C^1 H-minimal graphs whose components of the unit horizontal Gauss map are in W^{1,1} are ruled surfaces with C^2 seed curves. In a different…
Previous work of the authors studies minimal triangulations of closed 3-manifolds using a characterisation of low degree edges, embedded layered solid torus subcomplexes and 1-dimensional $\mathbb{Z}_2$-cohomology. The underlying blueprint…
A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a…
Timelike surfaces in the three-dimensional Heisenberg group with left invariant semi-Riemannian metric are studied. In particular, non-vertical timelike minimal surfaces are characterized by the non-conformal Lorentz harmonic maps into the…
(NOTE: per referee comments, this article has been split; it is now superseded by "Existence of thread-wire minimizers" and "Near-wire thread-wire minimizers"; please see http://www.bkstephens.net.) Alt's thread problem asks for least-area…
In this paper together with the preceding Part I \cite{CHR}, we develop a framework for tame geometry on Henselian valued fields of characteristic zero, called Hensel minimality. It adds to \cite{CHR} the treatment of the mixed…
By using the support function on the $xy$-plane, we show the necessary and sufficient conditions for the existence of envelopes of horizontal lines in the 3D-Heisenberg group. A method to construct horizontal envelopes from the given ones…
We list all the possible fundamental groups of the complements of real conic-line arrangements with two conics which are tangent to each other at two points, with up to two additional lines. For the computations we use the topological local…
This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we…
With applications in distribution systems and communication networks, the minimum stretch spanning tree problem is to find a spanning tree T of a graph G such that the maximum distance in T between two adjacent vertices is minimized. The…
Working over a field of characteristic zero, we give structure theorems for all grade three licci ideals and their minimal free resolutions. In particular, we completely classify such ideals up to deformation. The descriptions of their…
How to observe the state of a network from a limited number of measurements has become an important issue in complex networks, engineering, communication, epidemiology, etc. Under some scenarios, it is neither unfeasible nor unnecessary to…