Conceptio › Archive › Europe PMC
Europe PMC open access CC BY 4.0

Universal dense-open windows for generic conservative surface semigroups and graph-directed local systems

Shmalo Y · europe_pmc
Europe PMC · Papers · License: CC BY 4.0
Open Source ↗
biomedicallife-science
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.

Universal dense-open windows for generic conservative surface semigroups and graph-directed local systems | Research Square Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Universal dense-open windows for generic conservative surface semigroups and graph-directed local systems Yitzchak Shmalo This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-9222043/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract We prove a universal dense-open window theorem for generic conservative pairs on a closed orientable surface: there exists a residual set of area-preserving pairs $(g_0,g_1)$ such that for \emph{every} choice of dense open sets $D_0,D_1$, the restrictions $g_0|_{D_0}$ and $g_1|_{D_1}$ already generate an open-set transitive pseudosemigroup admitting a residual set of dense admissible branches. The residual set of pairs does not depend on the windows. We then prove a deterministic propagation theorem for graph-directed local systems: once a distinguished core atom carries a transitive pair and every other atom is connected to and from the core through dense open transport windows, dense admissible branches propagate throughout the network. Combining these results with a fibered genericity argument yields a universal parameter theorem for conservative graph-directed systems equipped with two loop words having private single-use edges, removing both the dependence on prescribed windows and any simplicity requirement on the loop words. Finally, we also state a conditional corollary for Hamiltonian window networks realized by Poincaré and scattering maps. Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information

Related documents

Record · ID 4821 · SHA-256 6223a2e8ace44ba9
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