Related papers: Multigraph Hyperplane Arrangements and Parking Fun…

Weighted cup-length calculations in singular cohomology led Farber and Grant in 2008 to general lower bounds for the topological complexity of lens spaces. We replace singular cohomology by K-theory, and weighted cup-length arguments by…

We introduce a class of labeled graphs (with legs) which contains two classes of GKM graphs of $4n$-dimensional manifolds with $T^{n}\times S^{1}$-actions, i.e., GKM graphs of the toric hyperK${\rm\ddot{a}}$hler manifolds and of the…

For any irreducible real reflection group $W$ with Coxeter number $h$, Armstrong, Reiner, and the author introduced a pair of $W \times \ZZ_h$-modules which deserve to be called {\sf $W$-parking spaces} which generalize the type A notion of…

We prove that the combinatorial side of the "Rational Shuffle Conjecture" provides a Schur-positive symmetric polynomial. Furthermore, we prove that the contribution of a given rational Dyck path can be computed as a certain skew LLT…

A characteristic polynomial is an important invariant in the field of hyperplane arrangement. For the Linial arrangement of any irreducible root system, Postnikov and Stanley conjectured that all roots of the characteristic polynomial have…

For each $k \geq 5$ we give a counterexample to a conjecture of Movasati on the dimension of certain Hodge loci of cubic hypersurfaces in $\mathbf{P}^{2k+1}$ containing two $k$-planes intersecting in dimension $k-3$. We give similar…

We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…

We prove that the partition function for tripartite double-dimer configurations of a planar bipartite graph satisfies a recurrence related to the Desnanot-Jacobi identity from linear algebra. A similar identity for the dimer partition…

It was recently shown \cite{STV} that satisfiability is polynomially solvable when the incidence graph is an interval bipartite graph (an interval graph turned into a bipartite graph by omitting all edges within each partite set). Here we…

We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…

Arithmetic duality theorems over a local field $k$ are delicate to prove if $\mathrm{char} k > 0$. In this case, the proofs often exploit topologies carried by the cohomology groups $H^n(k, G)$ for commutative finite type $k$-group schemes…

In this paper we consider the hyperplane arrangement in $\mathbb{R}^n$ whose hyperplanes are $\{x_i + x_j = 1\mid 1\leq i < j\leq n\}\cup \{x_i=0,1\mid 1\leq i\leq n\}$. We call it the \emph{boxed threshold arrangement} since we show that…

In 2024, Bellamy, Craw, Rayan, Schedler, and Weiss introduced a particular family of real hyperplane arrangements stemming from hyperpolygonal spaces associated with certain quiver varieties which we thus call hyperpolygonal arrangements…

The balanced hypergraph partitioning problem (HGP) is to partition the vertex set of a hypergraph into k disjoint blocks of bounded weight, while minimizing an objective function defined on the hyperedges. Whereas real-world applications…

In the first part of this paper, we consider, in the context of an arbitrary hyperplane arrangement, the map between compactly supported cohomology to the usual cohomology of a local system. A formula (i.e., an explicit algebraic de Rham…

Farkas and Ortega found counterexamples to Mercat's conjecture by restricting to a hyperplane section $C$ some suitable rank-two vector bundles on a $K3$ surface whose Picard group is generated by $C$ and another very ample divisor. We…

Exploiting label correlations is important to multi-label classification. Previous methods capture the high-order label correlations mainly by transforming the label matrix to a latent label space with low-rank matrix factorization.…

This paper deals with the $\lambda$-labeling and $L(2,1)$-coloring of simple graphs. A $\lambda$-labeling of a graph $G$ is any labeling of the vertices of $G$ with different labels such that any two adjacent vertices receive labels which…

Graph polytopes arising from vertex-weighted graphs were first introduced by B\'ona, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is…

We classify one-element extensions of a hyperplane arrangement by the induced adjoint arrangement. Based on the classification, several kinds of combinatorial invariants including Whitney polynomials, characteristic polynomials, Whitney…