Arrangements, channel assignments, and associated polynomials
DOI10.1006/AAMA.1999.0660zbMATH Open0942.05063OpenAlexW2047371574MaRDI QIDQ1961908FDOQ1961908
Authors: D. J. A. Welsh, Geoff Whittle
Publication date: 31 July 2000
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:761348b8-d6d4-4769-93e8-71360427a7d7
Recommendations
- Publication:3209735
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- scientific article; zbMATH DE number 4025458
- The slimmest arrangements of hyperplanes. I: Geometric lattices and projective arrangements
- A generalization of the Whitney rank generating function
intersection theorygraph colouringarrangementchannel assignmentconfigurationrank functiongeometric latticeWhitney polynomialRedei functionsTutte-Grothendieck invariant
Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Enumerative problems (combinatorial problems) in algebraic geometry (14N10) Questions of classical algebraic geometry (51N35)
Cites Work
- Intersection theory for graphs
- Chromatic invariants for finite graphs: Theme and polynomial variations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A geometric theory of hypergraph colouring
- Star chromatic number
- Graph labeling and radio channel assignment
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Redei function of a relation
- Characteristic polynomials of subspace arrangements and finite fields
- Characteristic and Ehrhart polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intersection Theory for Embeddings of Matroids into Uniform Geometries
- Characteristic polynomials of weighted lattices
- THE CRITICAL PROBLEM FOR POLYMATROIDS
Cited In (6)
- An exact algorithm for the channel assignment problem
- On the span in channel assignment problems: Bounds, computing and counting
- Powerful sets: a generalisation of binary matroids
- The multivariate arithmetic Tutte polynomial
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- A MacWilliams type identity for matroids
This page was built for publication: Arrangements, channel assignments, and associated polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961908)