The Zero-Free Intervals for Characteristic Polynomials of Matroids

نویسندگان

  • Hugh Edwards
  • Robert M. Hierons
  • Bill Jackson
چکیده

Let M be a loopless matroid with rank r and c components. Let P (M, t) be the characteristic polynomial of M. We shall show that (−1)P (M, t) > (1 − t) for t ∈ (−∞, 1), that the multiplicity of the zeros of P (M, t) at t = 1 is equal to c, and that (−1)r+cP (M, t) > (t− 1) for t ∈ (1, 32 27 ]. Using a result of C. Thomassen we deduce that the maximal zero-free intervals for characteristic polynomials of loopless matroids are precisely (−∞, 1) and (1, 32 27 ].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids

The chromatic polynomial PG(q) of a loopless graph G is known to be nonzero (with explicitly known sign) on the intervals (−∞, 0), (0, 1) and (1, 32/27]. Analogous theorems hold for the flow polynomial of bridgeless graphs and for the characteristic polynomial of loopless matroids. Here we exhibit all these results as special cases of more general theorems on real zero-free regions of the multi...

متن کامل

Zeros of Chromatic and Flow Polynomials of Graphs

We survey results and conjectures concerning the zero distribution of chromatic and flow polynomials of graphs, and characteristic polynomials of matroids.

متن کامل

Tutte Polynomials of Generalized Parallel Connections

We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel connections in the case in which the simplification of the maximal common restriction of the two constituent matroids is a modular flat of the simplifications of both matroids. In particular, this includes cycle matroids of graphs that are identified along complete subgraphs. We also develop formulas...

متن کامل

Bounding the coefficients of the characteristic polynomials of simple binary matroids

We give an upper bound and a class of lower bounds on the coefficients of the characteristic polynomial of a simple binary matroid. This generalizes the corresponding bounds for graphic matroids of Li and Tian (1978) [3], as well as a matroid lower bound of Björner (1980) [1] for simple binary matroids. As the flow polynomial of a graph G is the characteristic polynomial of the dual matroid M(G...

متن کامل

Lattice path matroids: enumerative aspects and Tutte polynomials

Fix two lattice paths P and Q from ð0; 0Þ to ðm; rÞ that use East and North steps with P never going above Q: We show that the lattice paths that go from ð0; 0Þ to ðm; rÞ and that remain in the region bounded by P and Q can be identified with the bases of a particular type of transversal matroid, which we call a lattice path matroid. We consider a variety of enumerative aspects of these matroid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorics, Probability & Computing

دوره 7  شماره 

صفحات  -

تاریخ انتشار 1998