PreprintCC BY 4.0arXiv
Jumps and Iterated Jumps of Perfect Subtrees of Positive Trees
Abstract
An infinite (binary) tree is \emph{positive} iff its set of paths is non-null. As an elementary observation, positives trees always have positive perfect subtrees. Given a positive tree of certain complexity, here we present several theorems concerning the distribution of the Turing jumps or iterated Turing jumps of (positive) perfect subtrees of the given tree in the universe of Turing degrees.
Related
- Extremal subtrees of critical beta-splitting trees
- First-Passage Time Problems for Jump-Diffusion Processes with Positive and Negative Jumps
- Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees
- Prescribed and simultaneous failures of log-concavity in trees with perfect matchings
- Optimal subtrees of finite metric graphs
BibTeX
@misc{wang2026jumps,
title = {{Jumps and Iterated Jumps of Perfect Subtrees of Positive Trees}},
author = {Wei Wang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.25769},
eprint = {2610.25769},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.25769},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Jumps and Iterated Jumps of Perfect Subtrees of Positive Trees
AU - Wei Wang
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2610.25769
UR - https://arxiv.org/abs/2610.25769
AB - An infinite (binary) tree is \emph{positive} iff its set of paths is non-null. As an elementary observation, positives trees always have positive perfect subtrees. Given a positive tree of certain complexity, here we present several theorems concerning the distribution of the Turing jumps or iterated Turing jumps of (positive) perfect subtrees of the given tree in the universe of Turing degrees.
ER -