Sciweavers

9 search results - page 1 / 2
» Enumeration Schemes for Restricted Permutations
Sort
View
CPC
2008
86views more  CPC 2008»
13 years 3 months ago
Enumeration Schemes for Restricted Permutations
Abstract. Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply...
Vincent Vatter
DM
2006
91views more  DM 2006»
13 years 4 months ago
Restricted Dumont permutations, Dyck paths, and noncrossing partitions
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some ...
Alexander Burstein, Sergi Elizalde, Toufik Mansour
IJNSEC
2006
111views more  IJNSEC 2006»
13 years 4 months ago
Ideal Secret Sharing Schemes from Permutations
The work presents a new method for the design of ideal secret sharing. The method uses regular mappings that are well suited for construction of perfect secret sharing. The restri...
Josef Pieprzyk, Xian-Mo Zhang
GC
2007
Springer
13 years 4 months ago
Gray Code Enumeration of Plane Straight-Line Graphs
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...
EJC
2006
13 years 4 months ago
Old and young leaves on plane trees
Abstract. A leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and it is called a young leaf otherwise. In this paper we enumerate plane trees wi...
William Y. C. Chen, Emeric Deutsch, Sergi Elizalde