✦ LIBER ✦

Rook Theory for Perfect Matchings

✍ Scribed by J. Haglund; J.B. Remmel

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 302 KB
Volume: 27
Category: Article
ISSN: 0196-8858
DOI: 10.1006/aama.2001.0744

No coin nor oath required. For personal study only.

✦ Synopsis

In classical rook theory there is a fundamental relationship between the rook numbers and the hit numbers relative to any board. In that theory the k-th hit number of a board B can be interpreted as the number of permutations whose intersection with B is of size k. In the case of Ferrers boards there are q-analogues of the hit numbers and the rook numbers developed by A.

📜 SIMILAR VOLUMES

Forbidden triples for perfect matchings

✍ Katsuhiro Ota; Michael D. Plummer;; Akira Saito 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

Let H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. Plummer and Saito [J Graph Theory 50 (2005), 1-12] and Fujita et al. [J Combin Theory Ser B 96 (2006), 315-324] characterized all H with |H| ≤ 2 such that every connected H

A compactness result for perfect matchin

A compactness result for perfect matchings

✍ Norbert Polat 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 537 KB

We show that an infinite set system (V, ~g), for which ~ is a subspace of the vector space of all finite subsets of V, has a perfect matching if and only if every finite subset of V is covered by a matching of (V, ~).

A Complementation Theorem for Perfect Ma

A Complementation Theorem for Perfect Matchings of Graphs Having a Cellular Completion

✍ Mihai Ciucu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 589 KB

A cellular graph is a graph whose edges can be partitioned into 4-cycles (called cells) so that each vertex is contained in at most two cells. We present a ``Complementation Theorem'' for the number of matchings of certain subgraphs of cellular graphs. This generalizes the main result of M. Ciucu (J

Heuristic enhancements of the search for

Heuristic enhancements of the search for the generation of all perfect matchings

✍ M.M. Balakrishnarajan; P. Venuvanalingam 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 313 KB

A search based algorithm has been introduced by us [1] to generate all perfect matchings on a graph. This paper presents a modified search that employs novel heuristics for rapid generation. This is done by an intelligent selection of edges for generating the branch nodes of the associated semantic

Perfect Bases for Equational Theories

✍ Jaroslav Ježek; George F. McNulty 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 624 KB

Perfect bases for equational theories are closely related to confluent and finitely terminating term rewrite systems. The two classes have a large overlap, but neither contains the other. The class of perfect bases is recursive. We also investigate a common generalization of both concepts; we call t

Perfect matching for regular graphs is A

Perfect matching for regular graphs is AC0-hard for the general matching problem

✍ Elias Dahlhaus; Marek Karpinski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 491 KB