Combinatorics of non-holonomous jets
نویسندگان
چکیده
منابع مشابه
Analytic Combinatorics of Non-crossing Conngurations Analytic Combinatorics of Non-crossing Conngurations Analytic Combinatorics of Non-crossing Conngurations
This paper describes a systematic approach to the enumeration of \non-crossing" geometric conngurations built on vertices of a convex n-gon in the plane. It relies on generating functions, symbolic methods, singularity analysis, and singularity perturbation. A consequence is exact and asymptotic counting results for trees, forests, graphs, connected graphs, dissections, and partitions. Limit la...
متن کاملCombinatorics of non - ambiguous trees † ‡
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by Aval, Boussicault and Nadeau. The enumeration of non-ambiguous trees satisfying some additional constraints allows us to give elegant combinatorial proofs of ide...
متن کاملThe Combinatorics of Non-determinism
A deep connection exists between the interleaving semantics of concurrent processes and increasingly labelled combinatorial structures. In this paper we further explore this connection by studying the rich combinatorics of partially increasing structures underlying the operator of non-deterministic choice. Following the symbolic method of analytic combinatorics, we study the size of the computa...
متن کاملNon-constructive proofs in Combinatorics
One of the main reasons for the fast development of Combinatorics during the recent years is certainly the widely used application of combinatorial methods in the study and the development of efficient algorithms. It is therefore somewhat surprising that many results proved by applying some of the modern combinatorial techniques, including Topological methods, Algebraic methods, and Probabilist...
متن کاملAnalytic Combinatorics of Non-crossing Conngurations
This paper describes a systematic approach to the enumeration of \non-crossing" geometric conngurations built on vertices of a convex n-gon in the plane. It relies on generating functions, symbolic methods, singularity analysis, and singularity perturbation. A consequence is exact and asymptotic counting results for trees, forests, graphs, connected graphs, dissections, and partitions. Limit la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1985
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1985.102032