相关论文: Lower bounds for h-vectors of k-CM, independence a…

Let M be a matroid on E, representable over a field of characteristic zero. We show that h-vectors of the following simplicial complexes are log-concave: 1. The matroid complex of independent subsets of E. 2. The broken circuit complex of…

One of the major open questions in matroid theory asks whether the $h$-vector $(h_0,h_1,\ldots,h_s)$ of the broken circuit complex of a matroid $M$ satisfies the following inequalities: $$ h_0\leq h_1\leq \cdots\leq h_{\lfloor s/2\rfloor}…

We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…

We study the behavior of $h$-vectors associated to matroid complexes under weak maps, or inclusions of matroid polytopes. Specifically, we show that the $h$-vector of the order complex of the lattice of flats of a matroid is component-wise…

Let K be the face ring of the independence complex of a matroid. We show that if T is a generic linear system of parameters, then K/T satisfies a weak form of the Hard Lefschetz Theorem. As a result, the first half of the h-vector of the…

The components of K*-vectors associated to a simple oriented matroid M are the numbers of general or special tope committees for M. Using the principle of inclusion-exclusion, we determine how the reorientations of M on one-element subsets…

We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…

We give two proofs that the $h$-vector of any paving matroid is a pure O-sequence, thus answering in the affirmative a conjecture made by R. Stanley, for this particular class of matroids. We also investigate the problem of obtaining good…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…

Boundary conditions compatible with integrability are obtained for two dimensional models by solving the factorizability equations for the reflection matrices $K^{\pm}(\theta)$. For the six vertex model the general solution depending on…

In this article, for singular hermitian metrics on holomorphic vector bundles, we consider minimal $L^2$ integrals on sublevel sets of plurisubharmonic functions on weakly pseudoconvex K\"ahler manifolds related to modules at boundary…

Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…

This paper proposes hybrid high-order eigensolvers for the computation of guaranteed lower eigenvalue bounds. These bounds display higher order convergence rates and are accessible to adaptive mesh-refining algorithms. The involved…

We verify the Upper Bound Conjecture (UBC) for a class of odd-dimensional simplicial complexes that in particular includes all Eulerian simplicial complexes with isolated singularities. The proof relies on a new invariant of simplicial…

It is known that there are finitely many simplicial complexes (up to isomorphism) with a given number of vertices. Translating to the language of $h$-vectors, there are finitely many simplicial complexes of bounded dimension with $h_1=k$…

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…