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

71 citations

researchers with a paper here
collaborating institutions
Showing 2002Show all

2 papers · 1 filter

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…