Rigorous analytic combinatorics in several variables in SageMath

MaRDI QIDQ6926402zbMATH OpenFDO

Authors Benjamin Hackl, Andrew Luo, Stephen Melczer, Jesse Selover, Elaine Wong

Publication date 24 September 2025

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL https://www.mat.univie.ac.at/~slc/wpapers/FPSAC2023/90.html

zbMATH Keywords

ACSVanalytic combinatoricsasymptoticscomputer algebragenerating functions

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Exact enumeration problems, generating functions (05A15) Symbolic computation and algebraic computation (68W30)

Cites work

• A Gröbner free alternative for polynomial system solving
• An invitation to analytic combinatorics. From one to several variables
• Analytic combinatorics
• Analytic combinatorics in several variables.
• Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract)
• Asymptotics of multivariate sequences. I: Smooth points of the singular variety
• Asymptotics of multivariate sequences. III: Quadratic points
• Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
• Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
• msolve. A library for solving polynomial systems
• New software for computing asymptotics of multivariate generating functions
• Twenty Combinatorial Examples of Asymptotics Derived from Multivariate Generating Functions

Cited in

(1)

• Maximal number of subword occurrences in a word

This page was built for publication: Rigorous analytic combinatorics in several variables in SageMath

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926402)