Combinatorial Reciprocity Theorems

Details Combinatorial Reciprocity Theorems Combinatorial Reciprocity Theorems

2012-01-11

arxiv.org/abs/1201.2212v1

Mathematics

Combinatorics

15 pages, to appear in Jahresbericht der DMV

Scientific paper

A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane arrangements, lattice points in polyhedra, proper colorings of graphs, and $P$-partitions. We will see that in each instance we get interesting information out of a counting function when we evaluate it at a \emph{negative} integer (and so, a priori the counting function does not make sense at this number). Our goals are to convey some of the charm these "alternative" evaluations of counting functions exhibit, and to weave a unifying thread through various combinatorial reciprocity theorems by looking at them through the lens of geometry, which will include some scenic detours through other combinatorial concepts.

Affiliated with

Also associated with

No associations

Rating

Combinatorial Reciprocity Theorems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial Reciprocity Theorems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Reciprocity Theorems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-603084