相关论文: Combinatorics hidden in hyperbolic polynomials and…
Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…
Polymatroids are combinatorial abstractions of subspace arrangements in the same way that matroids are combinatorial abstractions of hyperplane arrangements. By introducing augmented Chow rings of polymatroids, modeled after augmented…
The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. Hyperbolic polynomials give rise to a class of (hyperbolic) matroids which properly contains the class of…
In this work, we are concerned with hierarchically hyperbolic spaces and hierarchically hyperbolic groups. Our main result is a wide generalization of a combination theorem of Behrstock, Hagen, and Sisto. In particular, as a consequence, we…
We develop certain combinatorial tools for the study of discriminants of general systems of polynomial equations. Applying these tools in a sequel paper, we completely classify components of such discriminants, generalizing the classical…
Delta-matroids are "type B" generalizations of matroids in the same way that maximal orthogonal Grassmannians are generalizations of Grassmannians. A delta-matroid analogue of the Tutte polynomial of a matroid is the interlace polynomial.…
Hyperbolic polynomials are real polynomials whose real hypersurfaces are nested ovaloids, the inner most of which is convex. These polynomials appear in many areas of mathematics, including optimization, combinatorics and differential…
We introduce the intersection cohomology module of a matroid and prove that it satisfies Poincar\'e duality, the hard Lefschetz theorem, and the Hodge-Riemann relations. As applications, we obtain proofs of Dowling and Wilson's Top-Heavy…
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)…
Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…
The main goal of this paper is to study the discretization problem for the hyperbolic cross trigonometric polynomials. This important problem turns out to be very difficult. In this paper we begin a systematic study of this problem and…
The Erd\H{o}s--Ko--Rado theorem is extended to designs in semilattices with certain conditions. As an application, we show the intersection theorems for the Hamming schemes, the Johnson schemes, bilinear forms schemes, Grassmann schemes,…
We report on various results, conjectures, and open problems related to Kazhdan-Lusztig polynomials of matroids. We focus on conjectures about the roots of these polynomials, all of which appear here for the first time.
Matroid intersection is one of the most powerful frameworks of matroid theory that generalizes various problems in combinatorial optimization. Edmonds' fundamental theorem provides a min-max characterization for the unweighted setting,…
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and…
In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set $E$ into $k$ common independent sets, where $E$ can be partitioned into $k$ independent sets in each of…
We develop the relation between hyperbolic geometry and arithmetic equidistribution problems that arises from the action of arithmetic groups on real hyperbolic spaces, especially in dimension up to 5. We prove generalisations of Mertens'…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
We introduce a notion of duality (due to Brylawski) that generalizes matroid duality to arbitrary rank functions. This generalized duality allows for generalized operations (deletion and contraction) and a generalized polynomial based on…
This paper shows a polynomial-time algorithm, that given a general matroid $M_1 = (X, \mathcal{I}_1)$ and $k-1$ partition matroids $ M_2, \ldots, M_k$, produces a coloring of the intersection $M = \cap_{i=1}^k M_i$ using at most…