Sciweavers

86 search results - page 4 / 18
» Combinatorics of generalized q-Euler numbers
Sort
View
87
Voted
COMBINATORICS
2006
102views more  COMBINATORICS 2006»
14 years 11 months ago
Identifying X-Trees with Few Characters
Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T , there is a set of four characters that define T . Here we deal with the general ca...
Magnus Bordewich, Charles Semple, Mike A. Steel
COMBINATORICS
2007
118views more  COMBINATORICS 2007»
14 years 11 months ago
On the Quantum Chromatic Number of a Graph
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
Peter J. Cameron, Ashley Montanaro, Michael W. New...
CORR
2004
Springer
106views Education» more  CORR 2004»
14 years 11 months ago
Why Delannoy numbers?
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
Cyril Banderier, Sylviane R. Schwer
COMBINATORICS
2000
107views more  COMBINATORICS 2000»
14 years 11 months ago
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
Martin Klazar
COMBINATORICS
1998
80views more  COMBINATORICS 1998»
14 years 11 months ago
Increasing Subsequences and the Classical Groups
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...
Eric M. Rains