相关论文: Matroid connectivity and singularities of configur…

We characterize 2-dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer…

The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…

We analyze the geometric aspects of unitary evolution of general states for a multilevel quantum system by exploiting the structure of coadjoint orbits in the unitary group Lie algebra. Using the same method in the case of SU(3) we study…

We study matroidal networks introduced by Dougherty et al. We prove the converse of the following theorem: If a network is scalar-linearly solvable over some finite field, then the network is a matroidal network associated with a…

We examine emergent properties of 2D supramolecular networks, using enumeration of configurations formed by interacting dominoes on square lattices as a simple model system. Possible ground states are identified using a convex hull…

For a real affine hyperplane arrangement, we define an integer intersection matrix with a natural $q$-deformation related to the intersections of bounded chambers of the arrangement. By connecting the integer matrix to a bilinear form of…

We prove several results about matroids and matroidal families associated with rigidity in dimension $2$. In particular, we establish new properties of the generic rigidity matroid family $\mathcal{R}$ and Kalai's hyperconnectivity matroid…

It is known that there exist hyperplane arrangements with same underlying matroid that admit non-homotopy equivalent complement manifolds. In this work we show that, in any rank, complex central hyperplane arrangements with up to 7…

We show that any infinite matroid can be reconstructed from the torsos of a tree-decomposition over its 2-separations, together with local information at the ends of the tree. We show that if the matroid is tame then this local information…

We investigate $(d+1)$-dimensional quasilinear systems which are integrable by the method of hydrodynamic reductions. In the case $d\geq 3$ we formulate a conjecture that any such system with an irreducible dispersion relation must be…

We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of…

We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurations with respect to dependency order, or equivalently, the…

We prove that the number of connected components of a smooth hypersurface in the positive orthant of $\mathbb{R}^n$ defined by a real polynomial with $d + k + 1$ monomials, where $d$ is the dimension of the affine span of the exponent…

We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…

We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…

The investigation of width parameters in both graph and algebraic contexts has attracted considerable interest. Among these parameters, the linear branch width has emerged as a crucial measure. In this concise paper, we explore the concept…

In this article we make several contributions of independent interest. First, we introduce the notion of stressed hyperplane of a matroid, essentially a type of cyclic flat that permits to transition from a given matroid into another with…

We study varieties associated to hypergraphs from the point of view of projective geometry and matroid theory. We describe their decompositions into matroid varieties, which may be reducible and can have arbitrary singularities by the…

Configuration polynomials generalize the classical Kirchhoff polynomial defined by a graph. Their study sheds light on certain polynomials appearing in Feynman integrands. Contact equivalence provides a way to study the associated…

We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…