Alin Bostan ; Manuel Kauers - Automatic Classification of Restricted Lattice Walks

dmtcs:2724 - Discrete Mathematics & Theoretical Computer Science, January 1, 2009, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) - https://doi.org/10.46298/dmtcs.2724
Automatic Classification of Restricted Lattice Walks

Authors: Alin Bostan 1; Manuel Kauers 2

  • 1 Algorithms
  • 2 Research Institute for Symbolic Computation

We propose an $\textit{experimental mathematics approach}$ leading to the computer-driven $\textit{discovery}$ of various conjectures about structural properties of generating functions coming from enumeration of restricted lattice walks in 2D and in 3D.

https://doi.org/10.46298/dmtcs.2724
Source: HAL:hal-00780428v1
Volume: DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
Section: Proceedings
Published on: January 1, 2009
Imported on: January 31, 2017
Keywords: Automated guessing,lattice paths,generating functions,computer algebra,enumeration,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
    Source : OpenAIRE Graph
  • Symbolic Integration and Special Functions; Funder: Austrian Science Fund (FWF); Code: P 20162
  • Summation//Integration and Algebraic Relations; Funder: Austrian Science Fund (FWF); Code: P 19462

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo ARXIV 1506.05645
Source : ScholeXplorer IsRelatedTo DOI 10.1145/2755996.2756674
Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1506.05645
  • 10.1145/2755996.2756674
  • 10.1145/2755996.2756674
  • 1506.05645
  • 10.48550/arxiv.1506.05645
A Fast Algorithm for Computing the p-Curvature

8 Documents citing this article

Share and export

Consultation statistics

This page has been seen 203 times.
This article's PDF has been downloaded 172 times.