Counting with two-level polynomials

DOI10.37236/14617MaRDI QIDQ7307932zbMATH OpenFDO

Authors Tristram Bogart, Kevin M. Woods

Publication date 3 August 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/14617

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graph polynomials (05C31)

Cites work

• A $q$-Queens Problem. III. Nonattacking Partial Queens
• A \(q\)-queens problem IV. Attacking configurations and their denominators
• A q-queens problem. I: General theory
• A \(q\)-queens problem. II: The square board
• A \(q\)-queens problem. V: Some of our favorite pieces: queens, bishops, rooks, and nightriders
• A \(q\)-queens problem. VI. The bishops' period
• A \(q\)-queens problem. VII: combinatorial types of nonattacking chess riders
• A complete annotated bibliography of work related to Sidon sequences
• A note on the number of partitions of n into k parts
• Chromatic polynomials and representations of the symmetric group
• Computing the Continuous Discretely
• Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen
• Enumeration of Golomb rulers and acyclic orientations of mixed graphs
• Enumerative Combinatorics
• Erdős-Ko-Rado theorems. Algebraic approaches
• Graph polynomials and their applications. I: The Tutte polynomial
• Graph polynomials and their applications. II: Interrelations and interpretations
• Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 4091530 (Why is no real title available?)
• scientific article; zbMATH DE number 3691421 (Why is no real title available?)
• scientific article; zbMATH DE number 3747179 (Why is no real title available?)
• Inside-out polytopes
• Kneser's conjecture, chromatic number, and homotopy
• On the chromatic number, colorings, and codes of the Johnson graph
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• On the foundations of combinatorial theory. VIII: Finite operator calculus
• Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
• The Chromatic Polynomial of a Complete Bipartite Graph
• The Ehrhart polynomial of the Birkhoff polytope
• The polynomial part of a restricted partition function related to the Frobenius problem
• Transfer-matrix methods meet Ehrhart theory

This page was built for publication: Counting with two-level polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307932)