相关论文: Resurgence number of matroid configuration

Star configurations are certain unions of linear subspaces of projective space that have been studied extensively. We develop a framework for studying a substantial generalization, which we call matroid configurations, whose ideals…

The resurgence and asymptotic resurgence of an ideal in a polynomial ring are two statistics which measure the relationship between its regular and symbolic powers. We address two aspects of resurgence which can be studied via asymptotic…

Let $\mathbb{K}$ be a field and $R = \mathbb{K}[x_1, \ldots, x_n]$. We obtain an improved upper bound for asymptotic resurgence of squarefree monomial ideals in $R$. We study the effect on the resurgence when sum, product and intersection…

Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism…

We give explicit criteria that imply the resurgence of a self-radical ideal in a regular ring is strictly smaller than its codimension, which in turn implies that the stable version of Harbourne's conjecture holds for such ideals. This…

The theory of resurgence uniquely associates a factorially divergent formal power series with a collection of exponentially small non-perturbative corrections paired with a set of complex numbers known as Stokes constants. When the Borel…

Motivated by the \v{C}ern\'y conjecture for automata, we introduce the concept of monoidal automata, which allows the formulation of the \v{C}ern\'y conjecture for monoids. We show upper bounds on the reset threshold of monoids with certain…

We prove that all the symbolic powers of a Stanley-Reisner ideal are Cohen-Macaulay if and only if the associated simplicial complex is a matroid.

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…

We discuss how to understand the asymptotic resurgence number of a pair of graded families of ideals from combinatorial data of their associated convex bodies. When the families consist of monomial ideals, the convex bodies being considered…

Consider a linear realization of a matroid over a field. One associates with it a configuration polynomial and a symmetric bilinear form with linear homogeneous coefficients. The corresponding configuration hypersurface and its non-smooth…

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

In this paper, based on lectures by the authors at the May 2015 workshop {\it Resurgence, Physics and Numbers}, at the Centro di Ricerca Matematica Ennio De Giorgio of the Scuola Normale Superiore in Pisa, we explain the origin of resurgent…

Given a symbolic power of a homogeneous ideal in a polynomial ring, we study the problem of determining which powers of the ideal contain it. For ideals defining 0-dimensional subschemes of projective space, as an immediate corollary of our…

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.…

We prove asymptotic upper bounds on the number of $d$-partitions (paving matroids of fixed rank) and partial Steiner systems (sparse paving matroids of fixed rank), using a mixture of entropy counting, sparse encoding, and the probabilistic…

A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…

For a matroid with an ordered (or "labelled") basis, a basis exchange step removes one element with label $l$ and replaces it by a new element that results in a new basis, and with the new element assigned label $l$. We prove that one…

It is well-known that the first generalized Hamming weight of a linear code, more commonly called \textit{the minimum distance} of the linear code, corresponds to the initial degree of the Stanley-Reisner ideal of the matroid of the dual…

The Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$. This improves previous upper bounds, which were of the form an exponential times the factorial. Our upper bound comes from an explicit power sum…