Search arXivSearch

arXiv · 2408.17232

Bubbles in Linear Chord Diagrams: Bridges and Crystallized Diagrams

Abstract

In a linear chord diagram a short chord joins adjacent vertices while a bubble is a region devoid of short chords. We define a bridge to be a chord joining a vertex interior to a bubble to one exterior to it. Building on earlier work, we investigate the distribution of bridges in the limit of large bubbles and diagrams, and show that the number of bridges is asymptotically normal, obtaining expressions for the associated mean and variance as a function of bubble size. We introduce the notion of a crystallized diagram, defined by the criteria that all its chords are either short or are bridges. We count the number of crystallized diagrams by the number of short chords they contain, and provide the asymptotic distribution in the limit of large crystallized diagrams. We show that for very large diagrams, the number of short chords is normal, and sharply peaked at $\sqrt{2n/\log n}$, where $n$ is the total number of chords in the diagram.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Donovan Young. 2024-08-30. Bubbles in Linear Chord Diagrams: Bridges and Crystallized Diagrams. https://arxiv.org/abs/2408.17232

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO