Limit of normalized quadrangulations: the Brownian map
JF Marckert, A Mokkadem - 2006 - projecteuclid.org
Consider qna random pointed quadrangulation chosen equally likely among the pointed
quadrangulations with n faces. In this paper we show that, when n goes to+∞, qn suitably …
quadrangulations with n faces. In this paper we show that, when n goes to+∞, qn suitably …
Relax, but don't be too lazy
J Van der Hoeven - Journal of Symbolic Computation, 2002 - Elsevier
Assume that we wish to expand the product h= fg of two formal power series f and g.
Classically, there are two types of algorithms to do this: zealous algorithms first expand f and …
Classically, there are two types of algorithms to do this: zealous algorithms first expand f and …
Rational and algebraic series in combinatorial enumeration
M Bousquet-Mélou - arxiv preprint arxiv:0805.0588, 2008 - arxiv.org
Let A be a class of objects, equipped with an integer size such that for all n the number a (n)
of objects of size n is finite. We are interested in the case where the generating fucntion …
of objects of size n is finite. We are interested in the case where the generating fucntion …
Computation of several power indices by generating functions
In this paper we propose methods to compute the Deegan-Packel, the Public Good, and the
Shift power indices by generating functions for the particular case of weighted voting games …
Shift power indices by generating functions for the particular case of weighted voting games …
[PDF][PDF] Hardness of approximation of the balanced complete bipartite subgraph problem
Hardness of approximation of the Balanced Complete Bipartite Subgraph problem Page 1
Hardness of approximation of the Balanced Complete Bipartite Subgraph problem Uriel Feige …
Hardness of approximation of the Balanced Complete Bipartite Subgraph problem Uriel Feige …
[HTML][HTML] A unified approach to word occurrence probabilities
M Régnier - Discrete applied mathematics, 2000 - Elsevier
Evaluation of the expected frequency of occurrences of a given set of patterns in a DNA
sequence has numerous applications and has been extensively studied recently. We …
sequence has numerous applications and has been extensively studied recently. We …
Lexicographic unranking of combinations revisited
In the context of combinatorial sampling, the so-called “unranking method” can be seen as a
link between a total order over the objects and an effective way to construct an object of …
link between a total order over the objects and an effective way to construct an object of …
Enumeration and random generation of accessible automata
F Bassino, C Nicaud - Theoretical Computer Science, 2007 - Elsevier
We present a bijection between the set An of deterministic and accessible automata with n
states on a k-letters alphabet and some diagrams, which can themselves be represented as …
states on a k-letters alphabet and some diagrams, which can themselves be represented as …
Rare events and conditional events on random strings
Some strings-the texts-are assumed to be randomly generated, according to a probability
model that is either a Bernoulli model or a Markov model. A rare event is the over or under …
model that is either a Bernoulli model or a Markov model. A rare event is the over or under …
Combinatorial properties of RNA secondary structures
ME Nebel - Journal of Computational Biology, 2002 - liebertpub.com
The secondary structure of an RNA molecule is of great importance and possesses
influence, eg, on the interaction of tRNA molecules with proteins or on the stabilization of …
influence, eg, on the interaction of tRNA molecules with proteins or on the stabilization of …