output
20022008
most citedSystematic identification of abundant A-to-I editing sites in the human transcriptome

781 citations

Showing math.COShow all

6 papers · 1 filter

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.CO20043 cited

(-1)-enumeration of self-complementary plane partitions

Theresia Eisenkölbl

We prove a product formula for the remaining cases of the weighted enumeration of self-complementary plane partitions contained in a given box where adding one half of an orbit of…

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

Asymptotics of the transition probabilities of the simple random walk on self-similar graphs

Bernhard Krön, Elmar Teufl

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs . This yields a larger family of graphs than the graphs obta…