output
20022005
most citedQuantum entanglement enhances the capacity of bosonic channels with memory

71 citations

researchers with a paper here
collaborating institutions
Showing math.COShow all

6 papers · 1 filter

math.CO2007

Culminating paths

Mireille Bousquet-Mélou, Yann Ponty

Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest…

math.CO2005

An Orlik-Solomon type algebra for matroids with a fixed linear class of circuits

Raul Cordovil, David Forge

A family C of circuits of a matroid M is a linear class if, given a modular pair of circuits in C}, any circuit contained in the union of the pair is also in C. The pair (M,C) can…

math.CO2005★ 3 cited

Crossings and alignments of permutations

Sylvie Corteel

We derive the continued fraction form of the generating function of some new -analogs of the Eulerian numbers introduced by Lauren Williams building on work o…

math.CO2004

Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice

Dominique Gouyou-Beauchamps, Pierre Leroux

Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity a…

math.CO2002

How is a Chordal Graph like a Supersolvable Binary Matroid?

Raul Cordovil, David Forge, Sulamita Klein

Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable iff G is chordal (rigid): this is another way to…

math.CO2002★ 1 cited

Random Planar Lattices and Integrated SuperBrownian Excursion

Philippe Chassaing, Gilles Schaeffer

In this paper, a surprising connection is described between a specific brand of random lattices, namely planar quadrangulations, and Aldous' Integrated SuperBrownian Excursion (ISE…