Related papers: Lagrangian Matroids associated with Maps on Orient…
We show that branched coverings of surfaces of large enough genus arise as characteristic maps of braided surfaces that is, lift to embeddings in the product of the surface with $\mathbb R^2$. This result is nontrivial already for…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
In this paper we systematically describe relations between various structure sets which arise naturally for pairs of compact topological manifolds with boundary. Our consideration is based on a deep analogy between the case of a compact…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
We prove that for any parameter r an r-locally 2-connected graph G embeds r-locally planarly in a surface if and only if a certain matroid associated to the graph G is co-graphic. This extends Whitney's abstract planar duality theorem from…
A zigzag in a map (a $2$-cell embedding of a connected graph in a connected closed $2$-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a…
Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of generically rigid structures. We define a new family called {\bf graded sparse graphs}, arising from generically…
In this paper, we prove various results on the topology of the Grassmannian of oriented 3-planes in Euclidean 6-space and compute its cohomology ring. We give self-contained proofs. These spaces come up when studying submanifolds of…
In this article, we show that a flat morphism of $k$-varieties ($\mathop{\mathrm{char}} k=0$) with locally constant geometric fibers becomes finite \'etale after reduction. When $k$ is a real closed field, we prove that such a morphism…
Given a hypersurface coamoeba of a Laurent polynomial f, it is an open problem to describe the structure of its set of connected complement components. In this paper we approach this problem by introducing the lopsided coamoeba. We show…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…
Locally variational systems of differential equations on smooth manifolds, having certain de Rham cohomology group trivial, automatically possess a global Lagrangian. This important result due to Takens is, how-ever, of sheaf-theoretic…
We present a novel preconditioning technique for proximal optimization methods that relies on graph algorithms to construct effective preconditioners. Such combinatorial preconditioners arise from partitioning the graph into forests. We…
For a given spatial graph $\mathcal{G} \subset \mathbb{R}^3$, we would like to find a closed orientable surface $\mathcal{S}$ embedded in $\mathbb{R}^3$ in which $\mathcal{G}$ is cellular embedded. However, for general $\mathcal{G}$ this is…
We present an algorithm that covers any given rational ruled surface with two rational parametrizations. In addition, we present an algorithm that transforms any rational surface parametrization into a new rational surface parametrization…
Determinantal point processes (DPPs) are popular probabilistic models that arise in many machine learning tasks, where distributions of diverse sets are characterized by matrix determinants. In this paper, we develop fast algorithms to find…
Motivated by the strong nearby Lagrangian conjecture, we constrain the parametrised Whitehead torsion of a family of closed exact Lagrangian submanifolds in a cotangent bundle. We prove the parametrised Whitehead torsion admits a…
Graphs and hypergraphs combine expressive modeling power with algorithmic efficiency for a wide range of applications. Hedgegraphs generalize hypergraphs further by grouping hyperedges under a color/hedge. This allows hedgegraphs to model…
Efficient deterministic algorithms to construct representations of lattice path matroids over finite fields are presented. They are built on known constructions of hierarchical secret sharing schemes, a recent characterization of…