arXiv (All)
open access
Longest increasing subsequences of dyadic-type chaotic orbits
This paper studies the longest increasing subsequence (LIS) problem for sequences generated by dyadic-type chaotic interval maps. Starting from a single point $x\in[0,1)$ chosen uniformly at random, we form the order pattern of the first $N$ points of its orbit, with the doubling map as the basic mo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Maximal Minimal Spacing for Random Points#926067
- Recurrence and range of the balanced excited random walk M(2,1,2)#1078116
- Limit Cycles in a Discontinuous Generalized Liénard Systems with Bivariate Perturbation#1142777
- Discrete Poincaré inequalities and universal approximators for random graphs#617836
- Discrete Poincaré inequalities and universal approximators for random graphs#617336
Record · ID 996935
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive