15,501 research outputs found
A Complete Grammar for Decomposing a Family of Graphs into 3-connected Components
Tutte has described in the book "Connectivity in graphs" a canonical
decomposition of any graph into 3-connected components. In this article we
translate (using the language of symbolic combinatorics)
Tutte's decomposition into a general grammar expressing any family of graphs
(with some stability conditions) in terms of the 3-connected subfamily. A key
ingredient we use is an extension of the so-called dissymmetry theorem, which
yields negative signs in the grammar.
As a main application we recover in a purely combinatorial way the analytic
expression found by Gim\'enez and Noy for the series counting labelled planar
graphs (such an expression is crucial to do asymptotic enumeration and to
obtain limit laws of various parameters on random planar graphs). Besides the
grammar, an important ingredient of our method is a recent bijective
construction of planar maps by Bouttier, Di Francesco and Guitter.Comment: 39 page
Structure and enumeration of (3+1)-free posets
A poset is (3+1)-free if it does not contain the disjoint union of chains of
length 3 and 1 as an induced subposet. These posets play a central role in the
(3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have
enumerated (3+1)-free posets in the graded case by decomposing them into
bipartite graphs, but until now the general enumeration problem has remained
open. We give a finer decomposition into bipartite graphs which applies to all
(3+1)-free posets and obtain generating functions which count (3+1)-free posets
with labelled or unlabelled vertices. Using this decomposition, we obtain a
decomposition of the automorphism group and asymptotics for the number of
(3+1)-free posets.Comment: 28 pages, 5 figures. New version includes substantial changes to
clarify the construction of skeleta and the enumeration. An extended abstract
of this paper appears as arXiv:1212.535
Relating ordinary and fully simple maps via monotone Hurwitz numbers
A direct relation between the enumeration of ordinary maps and that of fully
simple maps first appeared in the work of the first and last authors. The
relation is via monotone Hurwitz numbers and was originally proved using
Weingarten calculus for matrix integrals. The goal of this paper is to present
two independent proofs that are purely combinatorial and generalise in various
directions, such as to the setting of stuffed maps and hypermaps. The main
motivation to understand the relation between ordinary and fully simple maps is
the fact that it could shed light on fundamental, yet still not
well-understood, problems in free probability and topological recursion.Comment: 19 pages, 7 figure
Dynamic User Equilibrium (DUE)
The quantitative analysis of road network traffic performed through static
assignment models yields the transport demand-supply equilibrium under
the assumption of within-day stationarity. This implies that the relevant
variables of the system (i.e. user flows, travel times, costs) are assumed to
be constant over time within the reference period. Although static
assignment models satisfactorily reproduce congestion effects on traffic flow
and cost patterns, they do not allow to represent the variation over time of
the demand flows (i.e. around the rush hour) and of the network
performances (i.e. in presence of time varying tolls, lane usage, signal plans,
link usage permission); most importantly, they cannot reproduce some
important dynamic phenomena, such as the formation and dispersion of
vehicle queues due to the temporary over-saturation of road sections, and
the spillback, that is queues propagation towards upstream roads
An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
We count mxn non-negative integer matrices (contingency tables) with
prescribed row and column sums (margins). For a wide class of smooth margins we
establish a computationally efficient asymptotic formula approximating the
number of matrices within a relative error which approaches 0 as m and n grow.Comment: 57 pages, results strengthened, proofs simplified somewha
- …