PreprintCC BY 4.0arXiv
Maximal Order Type and Width of the h-Preorder on Finite Labeled Trees
Abstract
We establish tight bounds for the width and maximal order type of the h-preorder on Q-labeled trees in terms of the corresponding invariants of well-quasi-order Q.
Related
- On Finite Groups with Element Order Set of Width 3
- On a finite group in which every maximal subgroup of order divisible by p containing the normalizer of some Sylow subgroup is nilpotent
- On a finite group in which every non-nilpotent maximal invariant subgroup of order divisible by p is normal
- Training with ML-labeled Data via Stochastic First- and Zeroth-Order Optimization
- F-sets of arbitrary finite width
BibTeX
@misc{smirnov2026maximal,
title = {{Maximal Order Type and Width of the h-Preorder on Finite Labeled Trees}},
author = {Ilya Smirnov},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.12513},
eprint = {2610.12513},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.12513},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Maximal Order Type and Width of the h-Preorder on Finite Labeled Trees
AU - Ilya Smirnov
PY - 2026
DA - 2026/10/07
PB - arXiv
DO - 10.48550/arxiv.2610.12513
UR - https://arxiv.org/abs/2610.12513
AB - We establish tight bounds for the width and maximal order type of the h-preorder on Q-labeled trees in terms of the corresponding invariants of well-quasi-order Q.
ER -