On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs

Related Items (only showing first 100 items - show all)

Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Chip-firing game and a partial Tutte polynomial for Eulerian digraphs ⋮ Sharp Bounds for the Number of Regions of Maxout Networks and Vertices of Minkowski Sums ⋮ Divisors on graphs, binomial and monomial ideals, and cellular resolutions ⋮ FPT algorithms to enumerate and count acyclic and totally cyclic orientations ⋮ The Kazhdan-Lusztig polynomial of a matroid ⋮ Toppleable permutations, excedances and acyclic orientations ⋮ Criterion for a graph to admit a good orientation in terms of leaf blocks ⋮ Generalised chromatic polynomials of graphs from heaps of pieces ⋮ The number of nowhere-zero flows on graphs and signed graphs ⋮ Sign-Coherent Identities for Characteristic Polynomials of Matroids ⋮ EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model ⋮ Geometric bijections between spanning trees and break divisors ⋮ Kazhdan-Lusztig polynomials of fan matroids, wheel matroids, and whirl matroids ⋮ Enumerating degree sequences in digraphs and a cycle--cocycle reversing system ⋮ Extremal graphs for the Tutte polynomial ⋮ Fourientation activities and the Tutte polynomial ⋮ Fourientations and the Tutte polynomial ⋮ Principal \(\Gamma\)-cone for a tree ⋮ Orientations, lattice polytopes, and group arrangements. II: Modular and integral flow polynomials of graphs ⋮ Dualities and reciprocities on graphs on surfaces ⋮ Projections and angle sums of belt polytopes and permutohedra ⋮ Unimodality of a refinement of Lassalle's sequence ⋮ Some new characterizations of graph colorability and of blocking sets of projective spaces ⋮ Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids ⋮ A flag Whitney number formula for matroid Kazhdan-Lusztig polynomials ⋮ Root multiplicities for Borcherds algebras and graph coloring ⋮ The entropic discriminant ⋮ Hyperplane arrangements with a lattice of regions ⋮ Combinatorics and Algebra of Geometric Subdivision Operations ⋮ Combinatorial aspects of sandpile models on wheel and Fan graphs ⋮ Biased graphs IV: Geometrical realizations ⋮ Projection volumes of hyperplane arrangements ⋮ Dual complementary polynomials of graphs and combinatorial-geometric interpretation on the values of Tutte polynomial at positive integers ⋮ Laplacian ideals, arrangements, and resolutions ⋮ Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids ⋮ Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs ⋮ Set maps, umbral calculus, and the chromatic polynomial ⋮ Orientation of signed graphs ⋮ Ehrhart theory, modular flow reciprocity, and the Tutte polynomial ⋮ Lovász-Saks-Schrijver ideals and coordinate sections of determinantal varieties ⋮ Möbius conjugation and convolution formulae ⋮ The active bijection for graphs ⋮ A bivariate chromatic polynomial for signed graphs ⋮ Decomposing recurrent states of the Abelian sandpile model ⋮ Toric arrangements associated to graphs ⋮ Partial graph orientations and the Tutte polynomial ⋮ Orientations, lattice polytopes, and group arrangements. III: Cartesian product arrangements and applications to Tutte type polynomials ⋮ Tutte polynomials for counting and classifying orbits ⋮ Baxter permutations and plane bipolar orientations ⋮ An inequality for Tutte polynomials ⋮ \(G\)-parking functions, acyclic orientations and spanning trees ⋮ Nowhere-zero \(\vec{k}\)-flows on graphs ⋮ A chromatic symmetric function in noncommuting variables ⋮ Notes on acyclic orientations and the shelling lemma ⋮ Counting colored planar maps: algebraicity results ⋮ Complexity and algorithms for computing Voronoi cells of lattices ⋮ Acyclic orientations and the chromatic polynomial ⋮ The topology of the coloring complex ⋮ Toric partial orders ⋮ Interpretations of the Tutte and characteristic polynomials of matroids ⋮ Inside-out polytopes ⋮ Combinatorial properties of poly-Bernoulli relatives ⋮ Polynomial algorithms for canonical forms of orientations ⋮ Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions ⋮ Relations between cumulants in noncommutative probability ⋮ Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions ⋮ A combinatorial analysis of topological dissections ⋮ Chromatic posets ⋮ A bijection for Eulerian-equivalence classes of totally cyclic orientations ⋮ Affine and toric hyperplane arrangements ⋮ Combinatorial and Geometric View of the System Reliability Theory ⋮ Topological bijections for oriented matroids ⋮ Characteristic elements for real hyperplane arrangements ⋮ The homology of the cyclic coloring complex of simple graphs ⋮ The Tutte polynomial as a growth function ⋮ Friends and strangers walking on graphs ⋮ A bijection for the Boolean numbers of Ferrers graphs ⋮ Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs ⋮ Study of exponential growth constants of directed heteropolygonal Archimedean lattices ⋮ Explicit expressions for the extremal excedance set statistics ⋮ Stack-sorting, set partitions, and Lassalle's sequence ⋮ The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: the fully optimal basis of a bounded region ⋮ Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids ⋮ Activity preserving bijections between spanning trees and orientations in graphs ⋮ A geometric approach to acyclic orientations ⋮ Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function ⋮ The Tutte polynomial of a morphism of matroids. I: Set-pointed matroids and matroid perspectives ⋮ Bipolar orientations revisited ⋮ The connectivity of acyclic orientation graphs ⋮ A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements ⋮ A Möbius identity arising from modularity in a matroid bilinear form ⋮ Combinatorial properties of Farey graphs ⋮ Syzygies of oriented matroids ⋮ Sinks in acyclic orientations of graphs ⋮ A combinatorial perspective on the non-Radon partitions ⋮ Divisors on graphs, orientations, syzygies, and system reliability ⋮ Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs ⋮ Troupes, cumulants, and stack-sorting ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams

Cites Work

This page was built for publication: On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs