𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Evaluations of the Circuit Partition Polynomial

✍ Scribed by Béla Bollobás

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
88 KB
Volume
85
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

used Hopf algebra techniques to prove some beautiful combinatorial interpretations of the Martin polynomial for unoriented graphs. Our aim here is to give very simple proofs of similar interpretations for a considerably wider class of values. The results look particularly simple when formulated for a trivial transform of the Martin polynomial, the circuit partition polynomial.

📜 SIMILAR VOLUMES

A polynomial dual of partitions
A polynomial dual of partitions
✍ Jacob T.B Beard Jr; Ann D Dorris 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 402 KB
Partitions of digraphs into paths or cir
Partitions of digraphs into paths or circuits
✍ W. Bienia; H. Meyniel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 178 KB

The problem of partitioning the arcs of a digraph into elementary paths has been considered first by B. Alspach and N.J. Pullman in . We consider the slightly different problem of partitioning the arcs of a digraph into elementary paths or circuits. A general conjecture is given which is solved in p

The piecewise polynomial partition of un
The piecewise polynomial partition of unity functions for the generalized finite element methods
✍ Hae-Soo Oh; June G. Kim; Won-Tak Hong 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 520 KB

element methods (PUFEM) Shepard functions Convolution partition of unity functions Condition numbers of stiffness matrices a b s t r a c t A partition of unity (PU) function is an essential component of the generalized finite element method (GFEM). The popular Shepard PU functions, which are rationa