Analytic combinatorics : functional equations, rational and algebraic functions

This report is part of a series whose aim is to present in a synthetic way the major methods and models in analytic combinatorics. Here, we detail the case of rational and algebraic functions and discuss systematically closure properties, the location of singularities, and consequences regarding combinatorial enumeration. The theory is applied to regular and context-free languages, finite state models, paths in graphs, locally constrained permutati- ons, lattice paths and walks, trees, and planar maps

Algorithms Seminar, 2001-2002

These seminar notes constitute the proceedings of a seminar devoted to the analysis of algorithms and related topics. The subjects covered include combinatorics, symbolic computation, asymptotic analysis, number theory, as well as the analysis of algorithms, data structures, and network protocols

Chord catalogs and Estrada classes: partially ordered set approach

Combinatorial properties of catalogs of chords studied according to their partially order structure

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 22nd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2019. The 29 papers presented in this volume were carefully reviewed and selected from 85 submissions. They deal with foundational research with a clear significance for software science

ENUMERATION FORMULÆ FOR PATTERN RESTRICTED STIRLING PERMUTATIONS

ABSTRACT. We classify k-Stirling permutations avoiding a set of ordered patterns of length three according to Wilf-equivalence. Moreover, we derive enumeration formulæ for all of the classes using a variety of techniques such as the kernel method, a bijection related to a classical result of Simion and Schmidt, and also structural decompositions of k-Stirling permutations via the so-called block decomposition, or via bijections with families of trees. 1

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 24th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2021, which was held during March 27 until April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The 28 regular papers presented in this volume were carefully reviewed and selected from 88 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems