Sciweavers

134 search results - page 15 / 27
» Combinatorics of diagrams of permutations
Sort
View
COMBINATORICS
2007
81views more  COMBINATORICS 2007»
13 years 9 months ago
The m-Colored Composition Poset
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
Brian Drake, T. Kyle Petersen
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
13 years 9 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey
COMBINATORICS
2000
129views more  COMBINATORICS 2000»
13 years 9 months ago
Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
We define type-B analogues of combinatorial statistics previously studied on noncrossing partitions and show that analogous equidistribution and symmetry properties hold in the ca...
Rodica Simion
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
14 years 4 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 4 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...