Saved in:
Bibliographic Details
Main Author: Gonzalez, David
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.14255
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908967529086976
author Gonzalez, David
author_facet Gonzalez, David
contents We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates $sp-$homogeneity, a notion recently uncovered in [2] to have important computability theoretic properties. Explicit formulas are derived for both of the quantities in question, along with asymptotic bounds. The objects being counted are generally infinite, and it is not obvious that there are even only finitely many. This fact, along with the more precise counting, is demonstrated by corresponding the linear orderings with finite objects.
format Preprint
id arxiv_https___arxiv_org_abs_2604_14255
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Enumerative Combinatorics of Homogeneous Linear Orderings
Gonzalez, David
Combinatorics
We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates $sp-$homogeneity, a notion recently uncovered in [2] to have important computability theoretic properties. Explicit formulas are derived for both of the quantities in question, along with asymptotic bounds. The objects being counted are generally infinite, and it is not obvious that there are even only finitely many. This fact, along with the more precise counting, is demonstrated by corresponding the linear orderings with finite objects.
title Enumerative Combinatorics of Homogeneous Linear Orderings
topic Combinatorics
url https://arxiv.org/abs/2604.14255