𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Interlace Polynomial of Graphs at  −  1

✍ Scribed by P.N. Balister; B. Bollobás; J. Cutler; L. Pebody

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
168 KB
Volume
23
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we give an explicit formula for the interlace polynomial at x = -1 for any graph, and as a result prove a conjecture of Arratia et al. that states that it is always of the form ±2 s . We also give a description of the graphs for which s is maximal.

📜 SIMILAR VOLUMES

Characterizations of PG(n − 1,
Characterizations of PG(n − 1, q)PG(k − 1, q) by Numerical and Polynomial Invariants
✍ Rachelle M. Ankney; Joseph E. Bonin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 122 KB

We show that the simple matroid PG n -1 q \PG k -1 q , for n ≥ 4 and 1 ≤ k ≤ n -2, is characterized by a variety of numerical and polynomial invariants. In particular, any matroid that has the same Tutte polynomial as PG n -

Stability of the Recursive Sequence xn&#
Stability of the Recursive Sequence xn + 1 = (α − βxn)/(γ + xn − 1)
✍ Mona T. Aboutaleb; M.A. El-Sayed; Alaa E. Hamza 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 69 KB

In this paper we investigate the global asymptotic stability of the recursive , n s 0, 1, . . . , where ␣, ␤, ␥ G 0. We show that the unique positive equilibrium point of the equation is a global attractor with a basin that depends on the conditions posed on the coefficients.

Calculating the Galois Group of Y′ 
Calculating the Galois Group of Y′ =   =   =  AY +   +   +  B,Y′ =   =   =  AY Completely Reducible
✍ Peter Berman 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 291 KB

We consider a special case of the problem of computing the Galois group of a system of linear ordinary differential equations Y = M Y , M ∈ C(x) n×n . We assume that C is a computable, characteristic-zero, algebraically closed constant field with a factorization algorithm. There exists a decision pr