Add to ORKGWe describe a model of random links based on random 4-valent maps, which can be sampled due to the w...
Abstract: We consider a light-like Wilson loop in N = 4 SYM evaluated on a regular n-polygon contour...
AbstractWe consider β-Plancherel measures [J. Baik, E. Rains, The asymptotics of monotone subsequenc...
A way to study, theoretically and computationally, the number and the form of linked polygons config...
chapter of the book Random Matrix Theory, Eds Akemann, Baik and Di FrancescoThe large size limit of ...
AbstractWe introduce the notion of the asymptotic connectivity of a graph by generalizing to infinit...
This article deals with limit theorems for certain loop variables for loop soups whose intensity app...
We shall explain how knot, link and tangle enumeration problems can be expressed as matrix integrals...
revised, final version to be publishedWe present a conjecture for the power-law exponent in the asym...
International audienceThe loop O(n) model is a model for a random collection of non-intersecting loo...
Let X be a finite simply connected CW complex of dimension n. The loop space homology H-*(Omega X;Q)...
International audienceWe enumerate the connected graphs that contain a linear number of edges with r...
We find the asymptotic number of connected graphs with k vertices and k-1+l edges when k,l approach ...
Betti numbers of configuration spaces of mechanical linkages (known also as polygon spaces) depend o...
AbstractWe find the asymptotic number of connected graphs with k vertices and k−1+l edges when k,l a...
We describe a model of random links based on random 4-valent maps, which can be sampled due to the w...
Abstract: We consider a light-like Wilson loop in N = 4 SYM evaluated on a regular n-polygon contour...
AbstractWe consider β-Plancherel measures [J. Baik, E. Rains, The asymptotics of monotone subsequenc...
A way to study, theoretically and computationally, the number and the form of linked polygons config...
chapter of the book Random Matrix Theory, Eds Akemann, Baik and Di FrancescoThe large size limit of ...
AbstractWe introduce the notion of the asymptotic connectivity of a graph by generalizing to infinit...
This article deals with limit theorems for certain loop variables for loop soups whose intensity app...
We shall explain how knot, link and tangle enumeration problems can be expressed as matrix integrals...
revised, final version to be publishedWe present a conjecture for the power-law exponent in the asym...
International audienceThe loop O(n) model is a model for a random collection of non-intersecting loo...
Let X be a finite simply connected CW complex of dimension n. The loop space homology H-*(Omega X;Q)...
International audienceWe enumerate the connected graphs that contain a linear number of edges with r...
We find the asymptotic number of connected graphs with k vertices and k-1+l edges when k,l approach ...
Betti numbers of configuration spaces of mechanical linkages (known also as polygon spaces) depend o...
AbstractWe find the asymptotic number of connected graphs with k vertices and k−1+l edges when k,l a...
We describe a model of random links based on random 4-valent maps, which can be sampled due to the w...
Abstract: We consider a light-like Wilson loop in N = 4 SYM evaluated on a regular n-polygon contour...
AbstractWe consider β-Plancherel measures [J. Baik, E. Rains, The asymptotics of monotone subsequenc...