8,074 research outputs found
Precise Partitions Of Large Graphs
First by using an easy application of the Regularity Lemma, we extend some known results about cycles of many lengths to include a specified edge on the cycles. The results in this chapter will help us in rest of this thesis. In 2000, Enomoto and Ota posed a conjecture on the existence of path decomposition of graphs with fixed start vertices and fixed lengths. We prove this conjecture when |G| is large. Our proof uses the Regularity Lemma along with several extremal lemmas, concluding with an absorbing argument to retrieve misbehaving vertices. Furthermore, sharp minimum degree and degree sum conditions are proven for the existance of a Hamiltonian cycle passing through specified vertices with prescribed distances between them in large graphs. Finally, we prove a sharp connectivity and degree sum condition for the existence of a subdivision of a multigraph in which some of the vertices are specified and the distance between each pair of vertices in the subdivision is prescribed (within one)
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
When can a plane graph with prescribed edge lengths and prescribed angles
(from among \}) be folded flat to lie in an
infinitesimally thin line, without crossings? This problem generalizes the
classic theory of single-vertex flat origami with prescribed mountain-valley
assignment, which corresponds to the case of a cycle graph. We characterize
such flat-foldable plane graphs by two obviously necessary but also sufficient
conditions, proving a conjecture made in 2001: the angles at each vertex should
sum to , and every face of the graph must itself be flat foldable.
This characterization leads to a linear-time algorithm for testing flat
foldability of plane graphs with prescribed edge lengths and angles, and a
polynomial-time algorithm for counting the number of distinct folded states.Comment: 21 pages, 10 figure
Large Limits in Tensor Models: Towards More Universality Classes of Colored Triangulations in Dimension
We review an approach which aims at studying discrete (pseudo-)manifolds in
dimension and called random tensor models. More specifically, we
insist on generalizing the two-dimensional notion of -angulations to higher
dimensions. To do so, we consider families of triangulations built out of
simplices with colored faces. Those simplices can be glued to form new building
blocks, called bubbles which are pseudo-manifolds with boundaries. Bubbles can
in turn be glued together to form triangulations. The main challenge is to
classify the triangulations built from a given set of bubbles with respect to
their numbers of bubbles and simplices of codimension two. While the colored
triangulations which maximize the number of simplices of codimension two at
fixed number of simplices are series-parallel objects called melonic
triangulations, this is not always true anymore when restricting attention to
colored triangulations built from specific bubbles. This opens up the
possibility of new universality classes of colored triangulations. We present
three existing strategies to find those universality classes. The first two
strategies consist in building new bubbles from old ones for which the problem
can be solved. The third strategy is a bijection between those colored
triangulations and stuffed, edge-colored maps, which are some sort of hypermaps
whose hyperedges are replaced with edge-colored maps. We then show that the
present approach can lead to enumeration results and identification of
universality classes, by working out the example of quartic tensor models. They
feature a tree-like phase, a planar phase similar to two-dimensional quantum
gravity and a phase transition between them which is interpreted as a
proliferation of baby universes
Finding an induced subdivision of a digraph
We consider the following problem for oriented graphs and digraphs: Given an
oriented graph (digraph) , does it contain an induced subdivision of a
prescribed digraph ? The complexity of this problem depends on and on
whether must be an oriented graph or is allowed to contain 2-cycles. We
give a number of examples of polynomial instances as well as several
NP-completeness proofs
Asymptotics of characters of symmetric groups, genus expansion and free probability
The convolution of indicators of two conjugacy classes on the symmetric group
S_q is usually a complicated linear combination of indicators of many conjugacy
classes. Similarly, a product of the moments of the Jucys--Murphy element
involves many conjugacy classes with complicated coefficients. In this article
we consider a combinatorial setup which allows us to manipulate such products
easily: to each conjugacy class we associate a two-dimensional surface and the
asymptotic properties of the conjugacy class depend only on the genus of the
resulting surface. This construction closely resembles the genus expansion from
the random matrix theory. As the main application we study irreducible
representations of symmetric groups S_q for large q. We find the asymptotic
behavior of characters when the corresponding Young diagram rescaled by a
factor q^{-1/2} converge to a prescribed shape. The character formula (known as
the Kerov polynomial) can be viewed as a power series, the terms of which
correspond to two-dimensional surfaces with prescribed genus and we compute
explicitly the first two terms, thus we prove a conjecture of Biane.Comment: version 2: change of title; the section on Gaussian fluctuations was
moved to a subsequent paper [Piotr Sniady: "Gaussian fluctuations of
characters of symmetric groups and of Young diagrams" math.CO/0501112
- …