Bounds for the eventual positivity of difference functions of partitions into prime powers.
Dohmen [4] gives a simple inductive proof of Whitney’s famous broken circuits theorem. We generalise his inductive proof to the case of matroids
Forniamo un calcolo esplicito della funzione di partizione di Kostant per algebre di Lie complesse di rango . La tecnica principale consiste nella riduzione a casi più semplici ed all'uso di funzioni generatrici.
We deal with rectangular m×n boards of square cells, using the cut technics of the height function. We investigate combinatorial properties of this function, and in particular we give lower and upper bounds for the number of essentially different cuts. This number turns out to be the cardinality of the height function’s range, in case the height function has maximally many rectangular islands.
Rauzy classes form a partition of the set of irreducible permutations. They were introduced as part of a renormalization algorithm for interval exchange transformations. We prove an explicit formula for the cardinality of each Rauzy class. Our proof uses a geometric interpretation of permutations and Rauzy classes in terms of translation surfaces and moduli spaces.