Algorithmic Lattice Path Counting Using the Kernel Method [FWF SFB F050-04]

@techreport{RISC5102,
author = {Shaoshi Chen and Hui Huang and Manuel Kauers and Ziming Li},
title = {{An Improved Abramov-Petkovsek Reduction and Creative Telescoping for Hypergeometric Terms}},
language = {english},
abstract = { The Abramov-Petkovsek reduction computes an additive decomposition of ahypergeometric term, which extends the functionality of the Gosper algorithmfor indefinite hypergeometric summation. We improve the Abramov-Petkovsekreduction so as to decompose a hypergeometric term as the sum of a summableterm and a non-summable one. The improved reduction does not solve anyauxiliary linear difference equation explicitly. It is also moreefficient thanthe original reduction according to computational experiments.Based on thisreduction, we design a new algorithm to compute minimal telescopers forbivariate hypergeometric terms. The new algorithm can avoid the costlycomputation of certificates.},
number = {1501.04668},
year = {2015},
institution = {arxiv},
length = {8}
}

@techreport{RISC5101,
author = {Manuel Kauers and Christoph Koutschan},
title = {{Integral D-Finite Functions}},
language = {english},
abstract = { We propose a differential analog of the notion of integral closure ofalgebraic function fields. We present an algorithm for computing theintegralclosure of the algebra defined by a linear differential operator. Ouralgorithmis a direct analog of van Hoeij's algorithm for computing integral bases ofalgebraic function fields.},
number = {1501.03691},
year = {2015},
institution = {arxiv},
length = {8}
}

@techreport{RISC5041,
author = {Manuel Kauers},
title = {{Bounds for D-Finite Closure Properties}},
language = {english},
number = {1408.5514},
year = {2014},
institution = {arxiv},
length = {8}
}

@techreport{RISC5042,
author = {Shaoshi Chen and Manuel Kauers and Michael F. Singer},
title = {{Desingularization of Ore Operators}},
language = {english},
number = {1408.5512},
year = {2014},
institution = {arxiv},
length = {11}
}

@techreport{RISC5054,
author = {Alin Bostan and Mireille Bousquet-Mélou and Manuel Kauers and Stephen Melczer},
title = {{On 3-dimensional lattice walks confined to the positive octant}},
language = {english},
abstract = {Many recent papers deal with the enumeration of 2-dimensional walks with prescribed steps confined to the positive quadrant. The classification is now complete for walks with steps in {0,±1}2: the generating function is D-finite if and only if a certain group associated with the step set is finite.We explore in this paper the analogous problem for 3-dimensional walks confined to the positive octant. The first difficulty is their number: there are 11074225 non-trivial and non-equivalent step sets in {0,±1}3 (instead of 79 in the quadrant case). We focus on the 35548 that have at most six steps.We apply to them a combined approach, first experimental and then rigorous. On the experimental side, we try to guess differential equations. We also try to determine if the associated group is finite. The largest finite groups that we find have order 48 -- the larger ones have order at least 200 and we believe them to be infinite. No differential equation has been detected in those cases.On the rigorous side, we apply three main techniques to prove D-finiteness. The algebraic kernel method, applied earlier to quadrant walks, works in many cases. Certain, more challenging, cases turn out to have a special Hadamard structure, which allows us to solve them via a reduction to problems of smaller dimension. Finally, for two special cases, we had to resort to computer algebra proofs. We prove with these techniques all the guessed differential equations.This leaves us with exactly 19 very intriguing step sets for which the group is finite, but the nature of the generating function still unclear. },
number = {1409.3669},
year = {2014},
institution = {Arxiv},
length = {36}
}

@techreport{RISC5075,
author = {M. Kauers and R. Yatchak},
title = {{Walks in the Quarter Plane with Multiple Steps}},
language = {english},
abstract = {We extend the classification of nearest neighbour walks in the quarter planeto models in which multiplicities are attached to each direction in the stepset. Our study leads to a small number of infinite families that completelycharacterize all the models whose associated group is D4, D6, or D8. Thesefamilies cover all the models with multiplicites 0, 1, 2, or 3, which wereexperimentally found to be D-finite --- with three noteworthy exceptions.},
year = {2014},
month = {November},
howpublished = {arXiv:1411.3537},
institution = {RISC},
length = {12},
url = {http://arxiv.org/abs/1411.3537}
}

@techreport{RISC4849,
author = {Manuel Kauers and Lily Yen},
title = {{On the length of integers in telescopers for proper hypergeometric terms}},
language = {english},
abstract = {We show that the number of digits in the integers of a creative telescopingrelation of expected minimal order for a bivariate proper hypergeometric termhas essentially cubic growth with the problem size. For telescopers of higherorder but lower degree we obtain a quintic bound. Experiments suggest thatthese bounds are tight. As applications of our results, we give an improvedbound on the maximal possible integer root of the leading coefficient of atelescoper, and the first discussion of the bit complexity of creativetelescoping.},
number = {1311.3720},
year = {2013},
institution = {ArXiv},
length = {20}
}