Sciweavers

455 search results - page 5 / 91
» On Trees and Noncrossing Partitions
Sort
View
EJC
2007
13 years 7 months ago
On some enumerative aspects of generalized associahedra
We prove a conjecture of F. Chapoton relating certain enumerative invariants of (a) the cluster complex associated by S. Fomin and A. Zelevinsky with a finite root system and (b)...
Christos A. Athanasiadis
ECSQARU
2003
Springer
14 years 29 days ago
Computational-Workload Based Binarization and Partition of Qualitative Markov Trees for Belief Combination
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
Weiru Liu, Xin Hong, Kenneth Adamson
COMBINATORICS
1999
99views more  COMBINATORICS 1999»
13 years 7 months ago
Deformation of Chains via a Local Symmetric Group Action
A symmetric group action on the maximal chains in a finite, ranked poset is local if the adjacent transpositions act in such a way that (i, i + 1) sends each maximal chain either ...
Patricia Hersh
JCT
2010
63views more  JCT 2010»
13 years 6 months ago
Cyclic sieving, promotion, and representation theory
We prove a collection of conjectures of D. White [37], as well as some related conjectures of Abuzzahab-Korson-Li-Meyer [1] and of Reiner and White [21], [37], regarding the cyclic...
Brendon Rhoades
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
13 years 7 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca