Algorithmic and Symbolic Combinatorics

DOI10.1007/978-3-030-67080-1zbMath1468.05002OpenAlexW3113793467MaRDI QIDQ4965169

Stephen Melczer

Publication date: 25 February 2021

Published in: Texts & Monographs in Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-67080-1

zbMATH Keywords

asymptotic behaviorgenerating functionlimit theoremhyperplane arrangementsanalytic combinatoricslattice-path enumeration

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Exact enumeration problems, generating functions (05A15) Other combinatorial number theory (11B75) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (10)

Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs ⋮ Sequence positivity through numeric analytic continuation: uniqueness of the Canham model for biomembranes ⋮ Order bounds for C2-finite sequences ⋮ Hardinian arrays ⋮ Coefficient asymptotics of algebraic multivariable generating functions ⋮ Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract) ⋮ Computing error bounds for asymptotic expansions of regular P-recursive sequences ⋮ Asymptotics of multivariate sequences. IV: Generating functions with poles on a hyperplane arrangement ⋮ Spectral density functions of bivariable stable polynomials ⋮ Stationary points at infinity for analytic combinatorics

Uses Software

• Maple
• SageMath

This page was built for publication: Algorithmic and Symbolic Combinatorics