Related papers: Covering a supermodular-like function in a mixed h…
A mixed graph is a graph with some directed edges and some undirected edges. We introduce the notion of mixed matroids as a generalization of mixed graphs. A mixed matroid can be viewed as an oriented matroid in which the signs over a fixed…
In this article we introduce the mixed Hodge structure of the Brieskorn module of a polynomial $f$ in $\C^{n+1}$, where $f$ satisfies a certain regularity condition at infinity (and hence has isolated singularities). We give an algorithm…
A graph $H$ is an immersion of a graph $G$ if $H$ can be obtained by some sugraph $G$ after lifting incident edges. We prove that there is a polynomial function $f:\Bbb{N}\times\Bbb{N}\rightarrow\Bbb{N}$, such that if $H$ is a connected…
We prove that if $M$ is a maximal $k$-edge-colorable subgraph of a multigraph $G$ and if $F = \{v \in V(G) : d_M(v) \leq k-\mu(v)\}$, then $d_F(v) \leq d_M(v)$ for all $v \in F$. (When $G$ is a simple graph, the set $F$ is just the set of…
Fundamental to many applications in data analysis are the decompositions of a graph, i.e. partitions of the node set into component-inducing subsets. One way of encoding decompositions is by multicuts, the subsets of those edges that…
The vector-valued mock modular forms of umbral moonshine may be repackaged into meromorphic Jacobi forms of weight one. In this work we constructively solve two cases of the meromorphic module problem for umbral moonshine. Specifically, for…
Given a family $X$ of complex varieties degenerating over a punctured disc, one is interested in computing related invariants called the motivic nearby fiber and the refined limit mixed Hodge numbers, both of which contain information about…
For a hypergraph $H=(V,\mathcal E)$, a subfamily $\mathcal C\subseteq \mathcal E$ is called a cover of the hypergraph if $\bigcup\mathcal C=\bigcup\mathcal E$. A cover $\mathcal C$ is called minimal if each cover $\mathcal…
An arborescence in a digraph is an acyclic arc subset in which every vertex execpt a root has exactly one incoming arc. In this paper, we reveal the reconfigurability of the union of $k$ arborescences for fixed $k$ in the following sense:…
This paper is about the orbifold theory for vertex operator superalgebras. Given a vertex operator superalgebra V and a finite automorphism group G of V, we show that the trace functions associated to the twisted sectors are holomorphic in…
We prove that the complement of a very general pair of hypersurfaces of total degree $2n$ in $\mathbb{P}^n$ is algebraically hyperbolic modulo a proper closed subvariety. This provides evidence towards conjectures of Lang-Vojta and…
Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a combinatorial analog of the classic Helmholz-Hodge decomposition of a smooth vector field. Specifically, we show that for every polyhedral…
We deepen the link between two classic areas of combinatorial optimization: augmentation and packing arborescences. We consider the following type of questions: What is the minimum number of arcs to be added to a digraph so that in the…
We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…
This paper studies Bernstein--Sato polynomials $b_{f,0}$ for homogeneous polynomials $f$ of degree $d$ with $n$ variables. It is open to know when $-{n\over d}$ is a root of $b_{f,0}$. For essential indecomposable hyperplane arrangements,…
Drawing parallels with hyperplane arrangements, we develop the theory of arrangements of submanifolds. Given a smooth, finite dimensional, real manifold $X$ we consider a finite collection $\mathcal{A}$ of locally flat, codimension-1…
Let f be a transcendental entire map that is subhyperbolic, i.e., the intersection of the Fatou set F(f) and the postsingular set P(f) is compact and the intersection of the Julia set J(f) and P(f) is finite. Assume that no asymptotic value…
The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…
This paper is concerned with two conjectures which are intimately related. The first is a generalization to hypergraphs of Vizing's Theorem on the chromatic index of a graph and the second is the well-known conjecture of Erd\H{o}s, Faber…
Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P,…