Ordered Construction of Combinatorial Objects
نویسنده
چکیده
The generating function method for counting species of combinatorial objects is applied to the construction of the objects in order. The species considered are those described using context-free grammars with additional group-invariant operators. Some species constructible with this method are integer partitions, rooted trees of specified or unbounded degree including binary and ordered trees, and derivations of words in a context free language. Bijections, algorithms, and decidability results are presented.
منابع مشابه
All realizability is relative
We introduce a category of basic combinatorial objects, encompassing PCAs and locales. Such a basic combinatorial object is to be thought of as a pre-realizability notion. To each such object we can associate an indexed preorder, generalizing the construction of triposes for various notions of realizability. There are two main results: first, the characterization of triposes which arise in this...
متن کاملSome t-Homogeneous Sets of Permutations
Perpendicular Arrays are ordered combinatorial structures, which recently have found applications in cryptography. A fundamental construction uses as ingredients combinatorial designs and uniformly t-homogeneous sets of permutations. We study the latter type of objects. These may also be viewed as generalizations of t-homogeneous groups of permutations. Several construction techniques are given...
متن کاملCommutative combinatorial Hopf algebras
We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general construction based on graphs, and its noncommutative dual is realized in three different ways, in particular, as the Grossman–Larson algebra of heap-ordered trees. ...
متن کاملPartially Ordered Patterns and Their Combinatorial Interpretations
This paper is a continuation of the study of partially ordered patterns (POPs) introduced recently. We provide a general approach to code combinatorial objects using (POP-)restricted permutations. We give several examples of relations between permutations restricted by POPs and other combinatorial structures, such as labeled graphs, walks, binary vectors, and others. Also, we show how restricte...
متن کاملPartially Ordered Generalized Patterns and Their Combinatorial Interpretations
This paper is a continuation of the study of partially ordered generalized patterns (POGPs) considered in [6, 7, 8]. We provide two general approaches: one to obtain connections between restricted permutations and other combinatorial structures, and one to treat the avoidance problems for words in case of segmented patterns. The former approach is related to coding combinatorial objects in term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007