Geodesic
Linear chord diagrams with long chords
Everett Sullivan1
1Dartmouth College
The electronic journal of combinatorics, Tome 24 (2017) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A linear chord diagram of size $n$ is a partition of the set $\{1,2,\dots,2n\}$ into sets of size two, called chords. From a table showing the number of linear chord diagrams of degree $n$ such that every chord has length at least $k$, we observe that if we proceed far enough along the diagonals, they are given by a geometric sequence. We prove that this holds for all diagonals, and identify when the effect starts.
DOI : 10.37236/6809
Classification : 05A15, 05A18, 05C30, 05C10
Mots-clés : linear chord diagram

Everett Sullivan  1

1 Dartmouth College 
@article{10_37236_6809,
     author = {Everett Sullivan},
     title = {Linear chord diagrams with long chords},
     journal = {The electronic journal of combinatorics},
     year = {2017},
     volume = {24},
     number = {4},
     doi = {10.37236/6809},
     zbl = {1373.05013},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6809/}
}
TY  - JOUR
AU  - Everett Sullivan
TI  - Linear chord diagrams with long chords
JO  - The electronic journal of combinatorics
PY  - 2017
VL  - 24
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6809/
DO  - 10.37236/6809
ID  - 10_37236_6809
ER  - 
%0 Journal Article
%A Everett Sullivan
%T Linear chord diagrams with long chords
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/6809/
%R 10.37236/6809
%F 10_37236_6809
Everett Sullivan. Linear chord diagrams with long chords. The electronic journal of combinatorics, Tome 24 (2017) no. 4. doi: 10.37236/6809

Cité par Sources :