activity
19992005
most citedA method for proving polynomial enumeration formulas

1 citations · 1 across the 4 of their papers we have counts for

collaborators

10 papers

math.CO2005

A new proof of the refined alternating sign matrix theorem

Ilse Fischer

In the early 1980s, Mills, Robbins and Rumsey conjectured, and in 1996 Zeilberger proved a simple product formula for the number of alternating sign matrices with a 1…

math.CO2005

The number of monotone triangles with prescribed bottom row

Ilse Fischer

We show that the number of monotone triangles with prescribed bottom row (k_1,...,k_n) is given by a simple product formula which remarkably involves (shift) operators. Monotone tr…

math.CO2004

Another refinement of the Bender-Knuth (ex-)Conjecture

Ilse Fischer

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, K…

math.CO20031 cited

A method for proving polynomial enumeration formulas

Ilse Fischer

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z.…

math.CO2002

Even circuits of prescribed clockwise parity

Ilse Fischer, C. H. C. Little

We show that a graph has an orientation under which every circuit of even length is clockwise odd if and only if the graph contains no subgraph which is, after the contraction of a…

math.CO2001

A symmetry theorem on a modified jeu de taquin

Ilse Fischer

For their bijective proof of the hook-length formula for the number of standard tableaux of a fixed shape Novelli, Pak and Stoyanovskii define a modified jeu de taquin which transf…