Christoph Koutschan

A PROOF OF GEORGE ANDREWS ’ AND DAVE ROBBINS’ q-TSPP CONJECTURE (MODULO A FINITE AMOUNT OF ROUTINE CALCULATIONS) (2009)

Manuel Kauers, Christoph Koutschan, Doron Zeilberger

In the historic conference Combinatoire Énumérative [6] wonderfully organized by Gilbert Labelle and Pierre Leroux there were many stimulating lectures, including a very interesting one by Pierre...

Eliminating Human Insight: An Algorithmic Proof of Stembridge's TSPP Theorem (2009)

Koutschan, Christoph

We present a new proof of Stembridge's theorem about the enumeration of totally symmetric plane partitions using the methodology suggested in the recent Koutschan-Kauers-Zeilberger semi-rigorous...

A Proof of George Andrews' and Dave Robbins' q-TSPP Conjecture (modulo a finite amount of routine calculations) (2008)

Kauers, Manuel, Koutschan, Christoph, Zeilberger, Doron

In the historic conference Combinatoire Enumerative[LL] wonderfully organized by Gilbert Labelle and Pierre Leroux there were many stimulating lectures, including a very interesting one by Pierre...

Proof of Ira Gessel's Lattice Path Conjecture (2008)

Kauers, Manuel, Koutschan, Christoph, Zeilberger, Doron

We present a computer-aided, yet fully rigorous, proof of Ira Gessel's tantalizingly simply-stated conjecture that the number of ways of walking $2n$ steps in the region $x+y \geq 0, y \geq 0$ of the...

A MATHEMATICA PACKAGE FOR q-HOLONOMIC SEQUENCES AND POWER SERIES (2008)

Manuel Kauers, Christoph Koutschan

Abstract. We describe a Mathematica package for dealing with q-holonomic sequences and power series. The package is intended as a q-analogue of the Maple package gfun and the Mathematica package...

LINEAR RECURRENCES AND POWER SERIES DIVISION (2008)

Herwig Hauser, Christoph Koutschan

Abstract. Bousquet-Mélou and Petkovˇsek investigated the generating functions of multivariate linear recurrences with constant coefficients. We will give a reinterpretation of their theory by means...

Regular languages and their generating functions: The inverse problem. Diplomarbeit, Friedrich-Alexander-Universität Erlangen-Nürnberg, August 2005. http://www.risc.uni-linz.ac.at/people/ckoutsch/research/en da.html (2008)

Christoph Koutschan

Abstract. The technique of determining a generating function for an unambiguous context-free language is known as the Schützenberger methodology. For regular languages, Elena Barcucci et al....

LINEAR RECURRENCES AND POWER SERIES DIVISION (2008)

Herwig Hauser, Christoph Koutschan

Abstract. Bousquet-Mélou and Petkovˇsek investigated the generating functions of multivariate linear recurrences with constant coefficients. We will give a reinterpretation of their theory by means...

A MATHEMATICA PACKAGE FOR q-HOLONOMIC SEQUENCES AND POWER SERIES (2008)

Manuel Kauers, Christoph Koutschan

Abstract. We describe a Mathematica package for dealing with q-holonomic sequences and power series. The package is intended as a q-analogue of the Maple package gfun and the Mathematica package...

Das inverse Problem Friedrich-Alexander-Universität Erlangen-Nürnberg (2005)

Reguläre Sprachen, Lehrstuhl Für Informatik, Christoph Koutschan, Betreuer Prof, Dr. Volker Strehl, ...

Ich versichere, dass ich die Arbeit ohne fremde Hilfe und ohne Benutzung anderer als der angegebenen Quellen angefertigt habe und dass die Arbeit in gleicher oder ähnlicher Form noch keiner anderen...