Cumulants of the q-semicircular law, Tutte polynomials, and heaps

The q-semicircular law as introduced by Bożejko and Speicher interpolates between the Gaussian law and the semicircular law, and its moments have a combinatorial interpretation in terms of matchings and crossings. We prove that the cumulants of this law are, up to some factor, polynomials in q with...

Full description

Bibliographic Details
Published in:	Discrete Mathematics & Theoretical Computer Science
Main Author:	Matthieu Josuat-Vergès
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2012-01-01
Subjects:	moments cumulants matchings tutte polynomials heaps [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/3074/pdf

Similar Items

Arithmetic matroids and Tutte polynomials
by: Michele D'Adderio, et al.
Published: (2012-01-01)

Cayley and Tutte polytopes
by: Matjaž Konvalinka, et al.
Published: (2012-01-01)

Computing Tutte Polynomials
by: Michael Monagan
Published: (2012-01-01)

The multivariate arithmetic Tutte polynomial
by: Petter Brändèn, et al.
Published: (2012-01-01)

Renormalization group-like proof of the universality of the Tutte polynomial for matroids
by: G. Duchamp, et al.
Published: (2013-01-01)

Colored Tutte polynomials and composite knots
by: Gábor Hetyei, et al.
Published: (2009-01-01)

Polynomial-time normalizers
by: Eugene M. Luks, et al.
Published: (2011-12-01)

Automaticity of primitive words and irreducible polynomials
by: Anne Lacroix, et al.
Published: (2013-01-01)

On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01)

Recursions and divisibility properties for combinatorial Macdonald polynomials
by: Nicholas A. Loehr, et al.
Published: (2011-02-01)

An expected polynomial time algorithm for coloring 2-colorable 3-graphs
by: Yury Person, et al.
Published: (2011-05-01)

Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01)

The arithmetic Tutte polynomials of the classical root systems
by: Federico Ardila, et al.
Published: (2014-01-01)

Bijections for lattice paths between two boundaries
by: Sergi Elizalde, et al.
Published: (2012-01-01)

Flows on Simplicial Complexes
by: Matthias Beck, et al.
Published: (2012-01-01)

Moment graphs and KL-polynomials
by: Martina Lanini
Published: (2012-01-01)

q-Enumeration of words by their total variation
by: Ligia Loreta Cristea, et al.
Published: (2011-01-01)

On the evaluation of the Tutte polynomial at the points (1,-1) and (2,-1)
by: Andrew Goodall, et al.
Published: (2011-01-01)

On the degree-chromatic polynomial of a tree
by: Diego Cifuentes
Published: (2012-01-01)

The Eulerian distribution on centrosymmetric involutions
by: Marilena Barnabei, et al.
Published: (2009-01-01)

Number of connected spanning subgraphs on the Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2009-01-01)

Coding partitions
by: Fabio Burderi, et al.
Published: (2007-01-01)

Interaction properties of relational periods
by: Vesa Halava, et al.
Published: (2008-01-01)

Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
by: Gregory Nuel
Published: (2008-01-01)

On economical set representations of graphs
by: Jing Kong, et al.
Published: (2009-01-01)

Recurrence among trees with most numerous efficient dominating sets
by: Dorota Bród, et al.
Published: (2008-01-01)

Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)

Ambiguity in the m-bonacci numeration system
by: Petra Kocábová, et al.
Published: (2007-01-01)

Simultaneous generation for zeta values by the Markov-WZ method
by: Khodabakhsh Hessami Pilehrood, et al.
Published: (2008-01-01)

Gray code order for Lyndon words
by: Vincent Vajnovszki
Published: (2007-01-01)

The distribution of ascents of size d or more in compositions
by: Charlotte Brennan, et al.
Published: (2009-01-01)

On hereditary Helly classes of graphs
by: Marina Groshaus, et al.
Published: (2008-01-01)

On-line extensible bin packing with unequal bin sizes
by: Deshi Ye, et al.
Published: (2009-01-01)

Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System
by: Valerie Berthe, et al.
Published: (2009-03-01)

Counting descents, rises, and levels, with prescribed first element, in words
by: Sergey Kitaev, et al.
Published: (2008-01-01)

A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
by: David Callan
Published: (2008-01-01)

The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)

List edge and list total colorings of planar graphs without non-induced 7-cycles
by: Aijun Dong, et al.
Published: (2013-03-01)

Immersion containment and connectivity in color-critical graphs
by: Faisal N. Abu-Khzam, et al.
Published: (2012-10-01)

Acyclic chromatic index of fully subdivided graphs and Halin graphs
by: Manu Basavaraju
Published: (2012-10-01)