activity
20072022
most citedA method for determining the mod- behaviour of recursive sequences

9 citations · 19 across the 11 of their papers we have counts for

collaborators
Showing math.COShow all

6 papers · 1 filter

math.CO2016

Motzkin numbers and related sequences modulo powers of

Christian Krattenthaler, Thomas W. Müller

We show that the generating function for Motzkin numbers , when coefficients are reduced modulo a given power of , can be expressed as a polynomial i…

math.CO2015★ 9 cited

A method for determining the mod- behaviour of recursive sequences

Christian Krattenthaler, Thomas W. Müller

We present a method for obtaining congruences modulo powers of a prime number~ for combinatorial sequences whose generating function satisfies an algebraic differential equation…

math.CO2011

A method for determining the mod- behaviour of recursive sequences, with applications to subgroup counting

Manuel Kauers, Christian Krattenthaler, Thomas W. Müller

We present a method to obtain congruences modulo powers of 2 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan number…

math.CO2010

Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type - the details

Christian Krattenthaler, Thomas W. Müller

We prove that the generalised non-crossing partitions associated to well-generated complex reflection groups of exceptional type obey two different cyclic sieving phenomena, as con…

math.CO2010★ 1 cited

Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type

Christian Krattenthaler, Thomas W. Müller

We present the proof of the cyclic sieving conjectures for generalised non-crossing partitions associated to well-generated complex reflection groups due to Armstrong, respectively…

math.CO2007★ 6 cited

Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions

Christian Krattenthaler, Thomas Müller

Given a finite irreducible Coxeter group , a positive integer , and types (in the sense of the classification of finite Coxeter groups), we compute the numb…