--- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '14278' abstract: - lang: eng text: 'The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely, integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of almost every ellipse that preserves integrability near the boundary, is itself an ellipse. We apply this result to study local spectral uniqueness of ellipses using the connection between the wave trace of the Laplacian and the dynamics near the boundary and establish local uniqueness for almost all of them.' acknowledgement: 'The author acknowledges the partial support of the European Research Council Grant #885707. He also thanks Vadim Kaloshin for proposing the idea of the project and greatly aiding the implementation. The author is also grateful to Hamid Hezari, Amir Vig, Steve Zelditch, Comlan E. Koudjinan, Corentin Fierobe, Ngo Nhok Tkhai Shon and Roman Sarapin for useful discussions. The author also acknowledges partial support of ISTern summer program. The project started in the summer of 2021, when the author was an intern at ISTA. Open access funding provided by Institute of Science and Technology (IST Austria).' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Illya full_name: Koval, Illya id: 2eed1f3b-896a-11ed-bdf8-93c7c4bf159e last_name: Koval citation: ama: Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. Inventiones Mathematicae. 2026;244:221-298. doi:10.1007/s00222-025-01397-y apa: Koval, I. (2026). Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. Inventiones Mathematicae. Springer Nature. https://doi.org/10.1007/s00222-025-01397-y chicago: Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” Inventiones Mathematicae. Springer Nature, 2026. https://doi.org/10.1007/s00222-025-01397-y. ieee: I. Koval, “Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse,” Inventiones Mathematicae, vol. 244. Springer Nature, pp. 221–298, 2026. ista: Koval I. 2026. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. Inventiones Mathematicae. 244, 221–298. mla: Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” Inventiones Mathematicae, vol. 244, Springer Nature, 2026, pp. 221–98, doi:10.1007/s00222-025-01397-y. short: I. Koval, Inventiones Mathematicae 244 (2026) 221–298. corr_author: '1' das_tickbox: '0' date_created: 2023-09-06T08:35:43Z date_published: 2026-04-01T00:00:00Z date_updated: 2026-07-23T10:58:59Z day: '01' ddc: - '510' department: - _id: GradSch - _id: VaKa doi: 10.1007/s00222-025-01397-y ec_funded: 1 external_id: arxiv: - '2111.12171' file: - access_level: open_access checksum: 487fa9113e1bbf32a6c70e6d1e8f63bc content_type: application/pdf creator: dernst date_created: 2026-07-23T10:55:24Z date_updated: 2026-07-23T10:55:24Z file_id: '22394' file_name: 2026_InventionesMath_Koval.pdf file_size: 2256345 relation: main_file success: 1 file_date_updated: 2026-07-23T10:55:24Z fulldoi: https://doi.org/10.1007/s00222-025-01397-y has_accepted_license: '1' intvolume: ' 244' language: - iso: eng mathsc: - 37C83 - 35J05 - 37J70 - 74J25 month: '04' oa: 1 oa_version: Published Version page: 221-298 project: - _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A call_identifier: H2020 grant_number: '885707' name: Spectral rigidity and integrability for billiards and geodesic flows publication: Inventiones Mathematicae publication_identifier: eissn: - 1432-1297 issn: - 0020-9910 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 244 year: '2026' ... --- OA_place: repository OA_type: green _id: '21720' abstract: - lang: eng text: "We present an exact fully-dynamic minimum cut algorithm that runs in \U0001D45B\U0001D45C⁡(1) deterministic update time when the minimum cut size is at most 2Θ⁡(log3/4−\U0001D450⁡\U0001D45B) for any \U0001D450 >0, improving on the previous algorithm of Jin, Sun, and Thorup (SODA 2024) whose minimum cut size limit is (log⁡\U0001D45B)\U0001D45C⁡(1). Combined with graph sparsification, we obtain the first (1 +\U0001D716)-approximate fully-dynamic minimum cut algorithm on weighted graphs, for any \U0001D716 ≥2−Θ⁡(log3/4−\U0001D450⁡\U0001D45B), in \U0001D45B\U0001D45C⁡(1) randomized update time.\r\nOur main technical contribution is a deterministic local minimum cut algorithm, which replaces the randomized LocalKCut procedure from El-Hayek, Henzinger, and Li (SODA 2025)." acknowledgement: Funded by the European union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/I5982. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission. article_processing_charge: No arxiv: 1 author: - first_name: Antoine full_name: El-Hayek, Antoine id: 888a098e-fcac-11ee-aff7-d347be57b725 last_name: El-Hayek orcid: 0000-0003-4268-7368 - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Jason full_name: Li, Jason last_name: Li citation: ama: 'El-Hayek A, Henzinger M, Li J. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In: Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Vol 2026. Society for Industrial and Applied Mathematics; 2026:613-663. doi:10.1137/1.9781611978971.25' apa: 'El-Hayek, A., Henzinger, M., & Li, J. (2026). Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms (Vol. 2026, pp. 613–663). Vancouver, Canada: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978971.25' chicago: El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, 2026:613–63. Society for Industrial and Applied Mathematics, 2026. https://doi.org/10.1137/1.9781611978971.25. ieee: A. El-Hayek, M. Henzinger, and J. Li, “Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time,” in Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Vancouver, Canada, 2026, vol. 2026, pp. 613–663. ista: 'El-Hayek A, Henzinger M, Li J. 2026. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2026, 613–663.' mla: El-Hayek, Antoine, et al. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, vol. 2026, Society for Industrial and Applied Mathematics, 2026, pp. 613–63, doi:10.1137/1.9781611978971.25. short: A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2026, pp. 613–663. conference: end_date: 2026-01-14 location: Vancouver, Canada name: 'SODA: Symposium on Discrete Algorithms' start_date: 2026-01-11 date_created: 2026-04-12T22:01:51Z date_published: 2026-01-07T00:00:00Z date_updated: 2026-07-24T12:48:29Z day: '07' department: - _id: MoHe - _id: GradSch doi: 10.1137/1.9781611978971.25 ec_funded: 1 external_id: arxiv: - '2512.13105' fulldoi: https://doi.org/10.1137/1.9781611978971.25 intvolume: ' 2026' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2512.13105 month: '01' oa: 1 oa_version: Preprint page: 613-663 project: - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: bda196b2-d553-11ed-ba76-8e8ee6c21103 grant_number: I05982 name: Static and Dynamic Hierarchical Graph Decompositions publication: Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms publication_identifier: eisbn: - '9781611978971' eissn: - 1557-9468 issn: - 1071-9040 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' related_material: record: - id: '22281' relation: dissertation_contains status: public scopus_import: '1' status: public title: Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2026 year: '2026' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold PlanS_conform: '1' _id: '22403' abstract: - lang: eng text: Linear phase‐contrast scanning transmission electron microscopy (STEM) techniques compatible with high‐throughput 4D‐STEM acquisition are widely used to enhance phase contrast in weakly scattering and beam‐sensitive materials. In these modalities, contrast transfer is often suppressed at low spatial frequencies, resulting in a characteristic contrast gap that limits contrast. Approaches that retain low‐frequency phase contrast exist but typically require substantially increased experimental complexity, restricting routine use. Dark‐field STEM imaging captures this missing low‐frequency information through electrons scattered outside the bright‐field disk, but discards a large fraction of the scattered signal and is therefore dose‐inefficient. Fused Full‐field STEM (FF‐STEM) is introduced as a 4D‐STEM imaging modality that overcomes these limitations by combining ptychographic phase reconstruction with tilt‐corrected dark‐field imaging within a single acquisition. Bright‐field data are used to estimate probe aberrations and reconstruct a high‐resolution phase image, while dark‐field data provide complementary low‐frequency contrast. The two channels are fused in Fourier space using Wiener‐band weighting based on the spectral signal‐to‐noise ratio, yielding transfer‐gap‐free images with high contrast. FF‐STEM preserves the upsampling and depth‐sectioning capabilities of ptychography, adds robust low‐frequency contrast characteristic of dark‐field imaging, and enables dose‐efficient, near–real‐time reconstruction. acknowledgement: 'We thank Tadahiro Yokosawa for support and discussions during the experiments. This project has received funding from the European Research Council (ERC) under the European Union''s Horizon 2020 research and innovation programme (Project HyperScaleEM, Grant agreement No. 101164581) and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Research Training Group GRK 3103 CorMic: Korrelative Materialmikroskopie – Von nanostrukturierten funktionalen Filmen zu hierarchischen Funktionsmaterialien (project number 537140136). B.Z. and X.Y. were supported by the U.S. National Science Foundation under award CHE-2404338. X.Y. also thanks the Principal Investigator Development in Sustainability Grant from the American Chemical Society.' article_number: e76620 article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Shengbo full_name: You, Shengbo last_name: You - first_name: Georgios full_name: Varnavides, Georgios last_name: Varnavides - first_name: Sagar full_name: Khavnekar, Sagar last_name: Khavnekar - first_name: Nikita full_name: Palatkin, Nikita last_name: Palatkin - first_name: Sihan full_name: Shao, Sihan last_name: Shao - first_name: Mingjian full_name: Wu, Mingjian last_name: Wu - first_name: Daniel full_name: Stroppa, Daniel last_name: Stroppa - first_name: Darya full_name: Chernikova, Darya id: 7dbaf460-fa9e-11eb-b0ca-bc7c7ff21ad0 last_name: Chernikova - first_name: Baixu full_name: Zhu, Baixu last_name: Zhu - first_name: Ricardo full_name: Egoavil, Ricardo last_name: Egoavil - first_name: Stefano full_name: Vespucci, Stefano last_name: Vespucci - first_name: Dileep full_name: Krishnan, Dileep last_name: Krishnan - first_name: Xingchen full_name: Ye, Xingchen last_name: Ye - first_name: Florian KM full_name: Schur, Florian KM id: 48AD8942-F248-11E8-B48F-1D18A9856A87 last_name: Schur orcid: 0000-0003-4790-8078 - first_name: Erdmann full_name: Spiecker, Erdmann last_name: Spiecker - first_name: Philipp full_name: Pelz, Philipp last_name: Pelz citation: ama: You S, Varnavides G, Khavnekar S, et al. Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels. Advanced Science. 2026. doi:10.1002/advs.76620 apa: You, S., Varnavides, G., Khavnekar, S., Palatkin, N., Shao, S., Wu, M., … Pelz, P. (2026). Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels. Advanced Science. Wiley. https://doi.org/10.1002/advs.76620 chicago: You, Shengbo, Georgios Varnavides, Sagar Khavnekar, Nikita Palatkin, Sihan Shao, Mingjian Wu, Daniel Stroppa, et al. “Gap‐free Information Transfer in 4D‐STEM via Fusion of Complementary Scattering Channels.” Advanced Science. Wiley, 2026. https://doi.org/10.1002/advs.76620. ieee: S. You et al., “Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels,” Advanced Science. Wiley, 2026. ista: You S, Varnavides G, Khavnekar S, Palatkin N, Shao S, Wu M, Stroppa D, Chernikova D, Zhu B, Egoavil R, Vespucci S, Krishnan D, Ye X, Schur FK, Spiecker E, Pelz P. 2026. Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels. Advanced Science., e76620. mla: You, Shengbo, et al. “Gap‐free Information Transfer in 4D‐STEM via Fusion of Complementary Scattering Channels.” Advanced Science, e76620, Wiley, 2026, doi:10.1002/advs.76620. short: S. You, G. Varnavides, S. Khavnekar, N. Palatkin, S. Shao, M. Wu, D. Stroppa, D. Chernikova, B. Zhu, R. Egoavil, S. Vespucci, D. Krishnan, X. Ye, F.K. Schur, E. Spiecker, P. Pelz, Advanced Science (2026). das_tickbox: '1' dataavailabilitystatement: The data that support the findings of this study are openly available in Zenodo at https://doi.org/10.5281/zenodo.18008901. The reconstruction code is available as an open-source repository at the scatterem github repo. date_created: 2026-07-26T19:01:34Z date_published: 2026-07-23T00:00:00Z date_updated: 2026-07-27T06:04:57Z day: '23' ddc: - '570' - '600' department: - _id: FlSc - _id: GradSch doi: 10.1002/advs.76620 external_id: arxiv: - '2512.19460' fulldoi: https://doi.org/10.1002/advs.76620 has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1002/advs.76620 month: '07' oa: 1 oa_version: Published Version publication: Advanced Science publication_identifier: eissn: - 2198-3844 publication_status: epub_ahead publisher: Wiley quality_controlled: '1' researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: yes title: Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '21006' abstract: - lang: eng text: Modern experimental methods in programmable self-assembly make it possible to precisely design particle concentrations, shapes and interactions. However, more physical insight is needed before we can take full advantage of this vast design space to assemble nanostructures with complex form and function. Here we show how a substantial part of this design space can be quickly and comprehensively understood by identifying a class of thermodynamic constraints that act on it. These thermodynamic constraints form a high-dimensional convex polyhedron that determines which nanostructures can be assembled at high equilibrium yield and reveals limitations that govern the coexistence of structures. We validate our predictions through detailed, quantitative assembly experiments of nanoscale particles synthesized using DNA origami. Our results uncover physical relationships underpinning many-component programmable self-assembly in equilibrium and form the basis for robust inverse design, applicable to various systems from biological protein complexes to synthetic nanomachines. acknowledgement: We thank B. Isaac and A. Tiano for their technical support with the electron microscopy and S. Waitukaitis for helpful comments on the manuscript. The TEM images were prepared and imaged at the Brandeis Electron Microscopy facility. This work was supported by the Gesellschaft für Forschungsförderung Niederösterreich under project FTI23-G-011 (M.C.H. and C.P.G.), the Brandeis University Materials Research Science and Engineering Center (MRSEC) under grant number NSF DMR-2011846 (T.E.V., D.H. and W.B.R.) and the Smith Family Foundation (W.B.R.). Open access funding provided by Institute of Science and Technology (IST Austria). article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Maximilian full_name: Hübl, Maximilian id: 5eb8629e-15b2-11ec-abd3-e6f3e5e01f32 last_name: Hübl - first_name: Thomas E. full_name: Videbæk, Thomas E. last_name: Videbæk - first_name: Daichi full_name: Hayakawa, Daichi last_name: Hayakawa - first_name: W. Benjamin full_name: Rogers, W. Benjamin last_name: Rogers - first_name: Carl Peter full_name: Goodrich, Carl Peter id: EB352CD2-F68A-11E9-89C5-A432E6697425 last_name: Goodrich orcid: 0000-0002-1307-5074 citation: ama: Hübl M, Videbæk TE, Hayakawa D, Rogers WB, Goodrich CP. A polyhedral structure controls programmable self-assembly. Nature Physics. 2026;22:294-301. doi:10.1038/s41567-025-03120-3 apa: Hübl, M., Videbæk, T. E., Hayakawa, D., Rogers, W. B., & Goodrich, C. P. (2026). A polyhedral structure controls programmable self-assembly. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-025-03120-3 chicago: Hübl, Maximilian, Thomas E. Videbæk, Daichi Hayakawa, W. Benjamin Rogers, and Carl Peter Goodrich. “A Polyhedral Structure Controls Programmable Self-Assembly.” Nature Physics. Springer Nature, 2026. https://doi.org/10.1038/s41567-025-03120-3. ieee: M. Hübl, T. E. Videbæk, D. Hayakawa, W. B. Rogers, and C. P. Goodrich, “A polyhedral structure controls programmable self-assembly,” Nature Physics, vol. 22. Springer Nature, pp. 294–301, 2026. ista: Hübl M, Videbæk TE, Hayakawa D, Rogers WB, Goodrich CP. 2026. A polyhedral structure controls programmable self-assembly. Nature Physics. 22, 294–301. mla: Hübl, Maximilian, et al. “A Polyhedral Structure Controls Programmable Self-Assembly.” Nature Physics, vol. 22, Springer Nature, 2026, pp. 294–301, doi:10.1038/s41567-025-03120-3. short: M. Hübl, T.E. Videbæk, D. Hayakawa, W.B. Rogers, C.P. Goodrich, Nature Physics 22 (2026) 294–301. corr_author: '1' das_tickbox: '1' dataavailabilitystatement: "Design files and folding conditions of DNA origami used in this work are provided in the repository Nanobase68 and are accessible at https://nanobase.org/structures/247. All the TEM images and associated experimental data are available via Zenodo at https://doi.org/10.5281/zenodo.17314727 (ref. 70).\r\nStructure enumeration was performed using the Roly.jl27,71 (v.0.1.0) package developed by M.C.H. and C.P.G., which is available via GitHub at https://github.com/mxhbl/Roly.jl. Polyhedral computation and linear programming were performed using the freely available Convex.jl72 (v.0.16.4) package, Polyhedra.jl73 (v.0.7.8) package and cddlib63 (v.0.9.4) library. The example code reproducing the calculations done on the three rings and reconfigurable squares is available via GitHub at https://github.com/mxhbl/PolyhedralStructureOfSelfAssembly. An implementation of the lattice Monte Carlo sampler is available via GitHub at https://github.com/mxhbl/LatticeSampler. Fitting of the yield curves was achieved using the freely available Optim.jl74 (v.1.12.0) package." date_created: 2026-01-20T10:02:19Z date_published: 2026-02-01T00:00:00Z date_updated: 2026-07-27T10:59:15Z day: '01' ddc: - '570' - '540' department: - _id: CaGo - _id: GradSch doi: 10.1038/s41567-025-03120-3 file: - access_level: open_access checksum: f4e3123d5d9dfcd22324e2c2de02e9a2 content_type: application/pdf creator: dernst date_created: 2026-07-27T10:57:57Z date_updated: 2026-07-27T10:57:57Z file_id: '22417' file_name: 2026_NaturePhysics_Huebl.pdf file_size: 2802534 relation: main_file success: 1 file_date_updated: 2026-07-27T10:57:57Z fulldoi: https://doi.org/10.1038/s41567-025-03120-3 has_accepted_license: '1' intvolume: ' 22' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 294-301 project: - _id: 8dd93da8-16d5-11f0-9cad-d2c70200d9a5 grant_number: FTI23-G-011 name: Dynamically reconfigurable self-assembly with triangular DNA-origami bricks publication: Nature Physics publication_identifier: eissn: - 1745-2481 issn: - 1745-2473 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - description: News on ISTA website relation: press_release url: https://ista.ac.at/en/news/behind-natures-blueprints/ researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: yes title: A polyhedral structure controls programmable self-assembly tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 22 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '21295' abstract: - lang: eng text: 'Depending on the type of flow, the transition to turbulence can take one of two forms: either turbulence arises from a sequence of instabilities or from the spatial proliferation of transiently chaotic domains, a process analogous to directed percolation. The former scenario is commonly referred to as a supercritical transition and frequently encountered in flows destabilized by body forces, whereas the latter subcritical transition is common in shear flows. Both cases are inherently continuous in a sense that the transformation from ordered laminar to fully turbulent fluid motion is only accomplished gradually with flow speed. Here we show that these established transition types do not account for the more general setting of shear flows subject to body forces. The combination of the two continuous scenarios leads to the attenuation of spatial coupling; with increasing forcing amplitude, the transition becomes increasingly sharp and eventually discontinuous. We argue that the suppression of laminar–turbulent coexistence and the approach towards a discontinuous phase transition potentially apply to a broad range of situations including flows subject to, for example, buoyancy, centrifugal or electromagnetic forces.' acknowledgement: The work was supported by the Simons Foundation (grant number 662960, to B.H.). Open access funding provided by Institute of Science and Technology (IST Austria). article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Bowen full_name: Yang, Bowen id: 71b6ff4b-15b2-11ec-abd3-aef6b028cf7e last_name: Yang orcid: 0000-0002-4843-6853 - first_name: Yi full_name: Zhuang, Yi id: 3677B57C-F248-11E8-B48F-1D18A9856A87 last_name: Zhuang - first_name: Gökhan full_name: Yalniz, Gökhan id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425 last_name: Yalniz orcid: 0000-0002-8490-9312 - first_name: Mukund full_name: Vasudevan, Mukund id: 3C5A959A-F248-11E8-B48F-1D18A9856A87 last_name: Vasudevan - first_name: Elena full_name: Marensi, Elena id: 0BE7553A-1004-11EA-B805-18983DDC885E last_name: Marensi orcid: 0000-0001-7173-4923 - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Yang B, Zhuang Y, Yalniz G, Vasudevan M, Marensi E, Hof B. Discontinuous transition to shear flow turbulence. Nature Physics. 2026;22:424-429. doi:10.1038/s41567-025-03166-3 apa: Yang, B., Zhuang, Y., Yalniz, G., Vasudevan, M., Marensi, E., & Hof, B. (2026). Discontinuous transition to shear flow turbulence. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-025-03166-3 chicago: Yang, Bowen, Yi Zhuang, Gökhan Yalniz, Mukund Vasudevan, Elena Marensi, and Björn Hof. “Discontinuous Transition to Shear Flow Turbulence.” Nature Physics. Springer Nature, 2026. https://doi.org/10.1038/s41567-025-03166-3. ieee: B. Yang, Y. Zhuang, G. Yalniz, M. Vasudevan, E. Marensi, and B. Hof, “Discontinuous transition to shear flow turbulence,” Nature Physics, vol. 22. Springer Nature, pp. 424–429, 2026. ista: Yang B, Zhuang Y, Yalniz G, Vasudevan M, Marensi E, Hof B. 2026. Discontinuous transition to shear flow turbulence. Nature Physics. 22, 424–429. mla: Yang, Bowen, et al. “Discontinuous Transition to Shear Flow Turbulence.” Nature Physics, vol. 22, Springer Nature, 2026, pp. 424–29, doi:10.1038/s41567-025-03166-3. short: B. Yang, Y. Zhuang, G. Yalniz, M. Vasudevan, E. Marensi, B. Hof, Nature Physics 22 (2026) 424–429. corr_author: '1' das_tickbox: '1' dataavailabilitystatement: Source data are available via Zenodo at https://doi.org/10.5281/zenodo.17514317 (ref. 51). The numerical simulations were carried out using the open-source codes openpipeflow41 and nsPipeflow45. date_created: 2026-02-17T11:38:41Z date_published: 2026-03-01T00:00:00Z date_updated: 2026-07-27T11:13:48Z day: '01' ddc: - '532' department: - _id: GradSch - _id: BjHo doi: 10.1038/s41567-025-03166-3 external_id: arxiv: - '2311.11474' file: - access_level: open_access checksum: 0636abba74896c467a7237411fa2369b content_type: application/pdf creator: dernst date_created: 2026-07-27T11:12:46Z date_updated: 2026-07-27T11:12:46Z file_id: '22420' file_name: 2026_NaturePhysics_Yang.pdf file_size: 5152735 relation: main_file success: 1 file_date_updated: 2026-07-27T11:12:46Z fulldoi: https://doi.org/10.1038/s41567-025-03166-3 has_accepted_license: '1' intvolume: ' 22' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 424-429 project: - _id: 238598C6-32DE-11EA-91FC-C7463DDC885E grant_number: '662960' name: Revisiting the Turbulence Problem Using Statistical Mechanics publication: Nature Physics publication_identifier: eissn: - 1745-2481 issn: - 1745-2473 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: yes title: Discontinuous transition to shear flow turbulence tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 22 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '21483' abstract: - lang: eng text: 'Embryogenesis in the model plant Arabidopsis thaliana provides a framework for understanding how cell polarity and patterning coordinate with hormonal signalling to establish the plant body plan. Following fertilisation, the zygote divides asymmetrically to generate apical and basal lineages, establishing the apical–basal axis that defines future shoot and root poles. Genetic and molecular analyses of classical mutants including gnom, monopteros (mp), bodenlos (bdl) and topless revealed that localised auxin biosynthesis, directional transport and downstream transcriptional responses are central to apical–basal axis establishment and organ initiation. The main components of this regulation are polarly localised PIN auxin transporters and downstream modules involving MONOPTEROS and WUSCHEL-RELATED HOMEOBOX transcription factors. Advances in microscopy have transformed the study of Arabidopsis embryogenesis: fluorescence-compatible clearing reagents and three-dimensional reconstructions now permit quantitative analyses of cell geometry, division orientation, and cytoskeletal dynamics. Live ovule imaging setups with confocal laser scanning and multiphoton microscopes enable real-time observation of embryo development, while laser-assisted cell ablation can be used to probe cell-to-cell communication and fate plasticity. Together, these methodological breakthroughs position Arabidopsis embryos as a prime model for dissecting the chemical and biophysical cues that shape plant development.' acknowledgement: The authors would like to acknowledge the many colleagues whose valuable contributions to the field could not be included in this review due to space limitations and reference constraints. Open Access funding provided by Institute of Science and Technology Austria/KEMÖ. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: David full_name: Babic, David id: db566d23-f6e0-11ea-865d-e6f270e968e7 last_name: Babic - first_name: Milan full_name: Zupunski, Milan id: f6a21fce-573e-11f0-a150-a8d96aee2539 last_name: Zupunski - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Babic D, Zupunski M, Friml J. Imaging and genetic toolbox to study Arabidopsis embryogenesis. New Phytologist. 2026;250(3):1483-1491. doi:10.1111/nph.71072 apa: Babic, D., Zupunski, M., & Friml, J. (2026). Imaging and genetic toolbox to study Arabidopsis embryogenesis. New Phytologist. Wiley. https://doi.org/10.1111/nph.71072 chicago: Babic, David, Milan Zupunski, and Jiří Friml. “Imaging and Genetic Toolbox to Study Arabidopsis Embryogenesis.” New Phytologist. Wiley, 2026. https://doi.org/10.1111/nph.71072. ieee: D. Babic, M. Zupunski, and J. Friml, “Imaging and genetic toolbox to study Arabidopsis embryogenesis,” New Phytologist, vol. 250, no. 3. Wiley, pp. 1483–1491, 2026. ista: Babic D, Zupunski M, Friml J. 2026. Imaging and genetic toolbox to study Arabidopsis embryogenesis. New Phytologist. 250(3), 1483–1491. mla: Babic, David, et al. “Imaging and Genetic Toolbox to Study Arabidopsis Embryogenesis.” New Phytologist, vol. 250, no. 3, Wiley, 2026, pp. 1483–91, doi:10.1111/nph.71072. short: D. Babic, M. Zupunski, J. Friml, New Phytologist 250 (2026) 1483–1491. corr_author: '1' das_tickbox: '0' date_created: 2026-03-23T14:59:06Z date_published: 2026-05-01T00:00:00Z date_updated: 2026-07-27T11:47:24Z day: '01' ddc: - '580' department: - _id: JiFr - _id: GradSch doi: 10.1111/nph.71072 external_id: pmid: - '41808651' file: - access_level: open_access checksum: 67513dde983631bed9613fdaadbbee06 content_type: application/pdf creator: dernst date_created: 2026-07-27T11:46:25Z date_updated: 2026-07-27T11:46:25Z file_id: '22424' file_name: 2026_NewPhytologist_Babic.pdf file_size: 1708392 relation: main_file success: 1 file_date_updated: 2026-07-27T11:46:25Z fulldoi: https://doi.org/10.1111/nph.71072 has_accepted_license: '1' intvolume: ' 250' issue: '3' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 1483-1491 pmid: 1 publication: New Phytologist publication_identifier: eissn: - 1469-8137 issn: - 0028-646X publication_status: published publisher: Wiley quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: Imaging and genetic toolbox to study Arabidopsis embryogenesis tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 250 year: '2026' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '21486' abstract: - lang: eng text: Sex-chromosome systems are highly variable across animals, but how they transition from one to another is not well understood. Diptera have undergone multiple sex-chromosome turnovers and expansions while maintaining their general chromosomal content, which makes them an ideal clade to study such transitions. We analyzed more than 100 dipteran whole-genome assemblies and identified 4 new lineages that underwent sex-chromosome turnover (in addition to the 5 previously reported). We find that the majority of turnovers happened in the group Schizophora, which tend to have fewer genes on Muller element F (the chromosome homologous to the ancestral insect X chromosome) than lower dipterans, a factor previously hypothesized to facilitate turnover. Most derived X chromosomes have higher GC content than autosomes, consistent with a high prevalence of male achiasmy in Diptera. In addition, an excess of gene movement out of the X is detected for most of these new X chromosomes, and many of these moved genes have high testis expression in Drosophila, suggesting that out-of-X gene movement contributes to the long-term demasculinization of X chromosomes. acknowledged_ssus: - _id: ScienComp acknowledgement: This work was supported by a grant from the Austrian Science Fund (FWF, grant number PAT 8748323) to B.V. We thank the Vicoso group for their feedback on an early version of the manuscript. We are grateful to Kamil Jaron and Julia Gries for helpful discussions and for sharing their unpublished work. Computational resources and support were provided by the Scientific Computing Unit at ISTA. article_number: qrag003 article_processing_charge: Yes article_type: original author: - first_name: Lorena Alexandra full_name: Layana Franco, Lorena Alexandra id: 02814589-eb8f-11eb-b029-a70074f3f18f last_name: Layana Franco orcid: 0000-0002-1253-6297 - first_name: Melissa A full_name: Toups, Melissa A id: 4E099E4E-F248-11E8-B48F-1D18A9856A87 last_name: Toups orcid: 0000-0002-9752-7380 - first_name: Beatriz full_name: Vicoso, Beatriz id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87 last_name: Vicoso orcid: 0000-0002-4579-8306 citation: ama: Layana Franco LA, Toups MA, Vicoso B. Causes and consequences of sex-chromosome turnovers in Diptera. Evolution Letters. 2026;10(3). doi:10.1093/evlett/qrag003 apa: Layana Franco, L. A., Toups, M. A., & Vicoso, B. (2026). Causes and consequences of sex-chromosome turnovers in Diptera. Evolution Letters. Oxford University Press. https://doi.org/10.1093/evlett/qrag003 chicago: Layana Franco, Lorena Alexandra, Melissa A Toups, and Beatriz Vicoso. “Causes and Consequences of Sex-Chromosome Turnovers in Diptera.” Evolution Letters. Oxford University Press, 2026. https://doi.org/10.1093/evlett/qrag003. ieee: L. A. Layana Franco, M. A. Toups, and B. Vicoso, “Causes and consequences of sex-chromosome turnovers in Diptera,” Evolution Letters, vol. 10, no. 3. Oxford University Press, 2026. ista: Layana Franco LA, Toups MA, Vicoso B. 2026. Causes and consequences of sex-chromosome turnovers in Diptera. Evolution Letters. 10(3), qrag003. mla: Layana Franco, Lorena Alexandra, et al. “Causes and Consequences of Sex-Chromosome Turnovers in Diptera.” Evolution Letters, vol. 10, no. 3, qrag003, Oxford University Press, 2026, doi:10.1093/evlett/qrag003. short: L.A. Layana Franco, M.A. Toups, B. Vicoso, Evolution Letters 10 (2026). corr_author: '1' dataavailabilitystatement: Scripts, Supplementary Datasets 1–7, and Tables S1, S2, S5 and S6 are also available at https://doi.org/10.15479/AT-ISTA-21116. Pipelines are available at https://git.ista.ac.at/llayanaf/transitions_diptera. date_created: 2026-03-23T15:05:42Z date_published: 2026-06-01T00:00:00Z date_updated: 2026-07-27T12:00:11Z day: '01' ddc: - '570' department: - _id: BeVi - _id: GradSch doi: 10.1093/evlett/qrag003 file: - access_level: open_access checksum: 7c929e78c369a5e6e064bcf263e955ad content_type: application/pdf creator: dernst date_created: 2026-07-27T11:59:40Z date_updated: 2026-07-27T11:59:40Z file_id: '22426' file_name: 2026_EvolutionLetters_Layana.pdf file_size: 1895786 relation: main_file success: 1 file_date_updated: 2026-07-27T11:59:40Z fulldoi: https://doi.org/10.1093/evlett/qrag003 has_accepted_license: '1' intvolume: ' 10' issue: '3' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 8ed82125-16d5-11f0-9cad-fbcae312235b grant_number: PAT 8748323 name: Sex chromosomes in evolution and development publication: Evolution Letters publication_identifier: eissn: - 2056-3744 publication_status: published publisher: Oxford University Press quality_controlled: '1' researchdata_availability: yes status: public supplementarymaterial: yes title: Causes and consequences of sex-chromosome turnovers in Diptera tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2026' ... --- OA_place: publisher OA_type: green _id: '21857' abstract: - lang: eng text: "The availability of powerful open-source large language models (LLMs) opens exciting use cases, such as using personal data to fine-tune these models to imitate a user’s unique writing style. Two key requirements for this functionality are personalization–in the sense that the output should recognizably reflect the user’s own writing style—and privacy–users may justifiably be wary of uploading extremely personal data, such as their email archive, to a third-party service. In this paper, we demonstrate the feasibility of training and running such an assistant, which we call Panza, on commodity hardware, for the specific use case of email generation. Panza’s personalization features are based on a combination of parameter-efficient fine-tuning using a variant of the Reverse Instructions technique [1] and Retrieval-Augmented Generation (RAG) [2]. We demonstrate that this combination allows us to fine-tune an LLM to reflect a user’s writing style using limited data, while executing on extremely limited resources, e.g. on a free Google Colab instance. Our key methodological contribution is the first detailed study of evaluation metrics for this task, and\r\nof how different choices of system components–the use of RAG and of different fine-tuning approaches–impact the system’s performance. Additionally, we demonstrate that very little data - under 100 email samples - are sufficient to create models that convincingly imitate humans, showcasing a previously unknown attack vector in language models. We are releasing the full Panza code as well as three new email datasets licensed for research use." article_number: '81' article_processing_charge: No author: - first_name: Armand full_name: Nicolicioiu, Armand last_name: Nicolicioiu - first_name: Eugenia B full_name: Iofinova, Eugenia B id: f9a17499-f6e0-11ea-865d-fdf9a3f77117 last_name: Iofinova orcid: 0000-0002-7778-3221 - first_name: Andrej full_name: Jovanovic, Andrej last_name: Jovanovic - first_name: Eldar full_name: Kurtic, Eldar id: 47beb3a5-07b5-11eb-9b87-b108ec578218 last_name: Kurtic - first_name: Mahdi full_name: Nikdan, Mahdi id: 66374281-f394-11eb-9cf6-869147deecc0 last_name: Nikdan - first_name: Andrei full_name: Panferov, Andrei id: 2c18daae-4dbe-11ef-8491-98ce2d960f09 last_name: Panferov - first_name: Ilia full_name: Markov, Ilia id: D0CF4148-C985-11E9-8066-0BDEE5697425 last_name: Markov - first_name: Nir full_name: Shavit, Nir last_name: Shavit - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Nicolicioiu A, Iofinova EB, Jovanovic A, et al. Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation. OpenReview; 2026.' apa: 'Nicolicioiu, A., Iofinova, E. B., Jovanovic, A., Kurtic, E., Nikdan, M., Panferov, A., … Alistarh, D.-A. (2026). Panza: Investigating the feasibility of fully-local personalized text generation. Third Conference on Parsimony and Learning (Proceedings Track). Tübíngen, Germany: OpenReview.' chicago: 'Nicolicioiu, Armand, Eugenia B Iofinova, Andrej Jovanovic, Eldar Kurtic, Mahdi Nikdan, Andrei Panferov, Ilia Markov, Nir Shavit, and Dan-Adrian Alistarh. Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation. Third Conference on Parsimony and Learning (Proceedings Track). OpenReview, 2026.' ieee: 'A. Nicolicioiu et al., Panza: Investigating the feasibility of fully-local personalized text generation. OpenReview, 2026.' ista: 'Nicolicioiu A, Iofinova EB, Jovanovic A, Kurtic E, Nikdan M, Panferov A, Markov I, Shavit N, Alistarh D-A. 2026. Panza: Investigating the feasibility of fully-local personalized text generation, OpenReview,p.' mla: 'Nicolicioiu, Armand, et al. “Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation.” Third Conference on Parsimony and Learning (Proceedings Track), 81, OpenReview, 2026.' short: 'A. Nicolicioiu, E.B. Iofinova, A. Jovanovic, E. Kurtic, M. Nikdan, A. Panferov, I. Markov, N. Shavit, D.-A. Alistarh, Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation, OpenReview, 2026.' conference: end_date: 2026-03-26 location: Tübíngen, Germany name: 'CPAL: Conference on Parsimony and Learning' start_date: 2026-03-23 corr_author: '1' date_created: 2026-05-11T08:50:28Z date_published: 2026-03-06T00:00:00Z date_updated: 2026-07-27T12:50:03Z day: '06' department: - _id: GradSch - _id: DaAl keyword: - LLMs - PEFT - LoRA - personalization - efficient ML language: - iso: eng main_file_link: - open_access: '1' url: https://openreview.net/pdf?id=soFWnTqd23 month: '03' oa: 1 oa_version: Accepted Version publication: Third Conference on Parsimony and Learning (Proceedings Track) publication_status: published publisher: OpenReview quality_controlled: '1' related_material: record: - id: '21854' relation: dissertation_contains status: public status: public title: 'Panza: Investigating the feasibility of fully-local personalized text generation' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference_poster user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: repository OA_type: green _id: '21859' abstract: - lang: eng text: As artificial neural networks, and specifically large language models, have improved rapidly in capabilities and quality, they have increasingly been deployed in real-world applications, from customer service to Google search, despite the fact that they frequently make factually incorrect or undesirable statements. This trend has inspired practical and academic interest in model editing, that is, in adjusting the weights of the model to modify its likely outputs for queries relating to a specific fact or set of facts. This may be done either to amend a fact or set of facts, for instance, to fix a frequent error in the training data, or to suppress a fact or set of facts entirely, for instance, in case of dangerous knowledge. Multiple methods have been proposed to do such edits. However, at the same time, it has been shown that such model editing can be brittle and incomplete. Moreover the effectiveness of any model editing method necessarily depends on the data on which the model is trained, and, therefore, a good understanding of the interaction of the training data distribution and the way it is stored in the network is necessary and helpful to reliably perform model editing. However, working with large language models trained on real-world data does not allow us to understand this relationship or fully measure the effects of model editing. We therefore propose Behemoth, a fully synthetic data generation framework. To demonstrate the practical insights from the framework, we explore model editing in the context of simple tabular data, demonstrating surprising findings that, in some cases, echo real-world results, for instance, that in some cases restricting the update rank results in a more effective update. acknowledged_ssus: - _id: ScienComp acknowledgement: "EI thanks Weiwei Yang, Janardhan Kulkani, and Kate Lytvynets for their advice and support in\r\ndeveloping an earlier version of the Behemoth library. This research was supported by the Scientific\r\nService Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).\r\nEI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35.\r\n" article_processing_charge: No arxiv: 1 author: - first_name: Eugenia B full_name: Iofinova, Eugenia B id: f9a17499-f6e0-11ea-865d-fdf9a3f77117 last_name: Iofinova orcid: 0000-0002-7778-3221 - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Iofinova EB, Alistarh D-A. Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. arXiv. doi:10.48550/arXiv.2601.23153' apa: 'Iofinova, E. B., & Alistarh, D.-A. (n.d.). Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. arXiv. https://doi.org/10.48550/arXiv.2601.23153' chicago: 'Iofinova, Eugenia B, and Dan-Adrian Alistarh. “Behemoth: Benchmarking Unlearning in LLMs Using Fully Synthetic Data.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2601.23153.' ieee: 'E. B. Iofinova and D.-A. Alistarh, “Behemoth: Benchmarking unlearning in LLMs using fully synthetic data,” arXiv. .' ista: 'Iofinova EB, Alistarh D-A. Behemoth: Benchmarking unlearning in LLMs using fully synthetic data. arXiv, 10.48550/arXiv.2601.23153.' mla: 'Iofinova, Eugenia B., and Dan-Adrian Alistarh. “Behemoth: Benchmarking Unlearning in LLMs Using Fully Synthetic Data.” ArXiv, doi:10.48550/arXiv.2601.23153.' short: E.B. Iofinova, D.-A. Alistarh, ArXiv (n.d.). corr_author: '1' date_created: 2026-05-11T08:58:07Z date_published: 2026-01-30T00:00:00Z date_updated: 2026-07-27T12:50:03Z day: '30' department: - _id: GradSch - _id: DaAl doi: 10.48550/arXiv.2601.23153 external_id: arxiv: - '2601.23153' fulldoi: https://doi.org/10.48550/arXiv.2601.23153 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2601.23153 month: '01' oa: 1 oa_version: Preprint project: - _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A grant_number: W1260-N35 name: Vienna Graduate School on Computational Optimization publication: arXiv publication_status: draft related_material: record: - id: '21854' relation: dissertation_contains status: public status: public title: 'Behemoth: Benchmarking unlearning in LLMs using fully synthetic data' type: preprint user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher _id: '21957' abstract: - lang: eng text: "This thesis investigates algorithmic certification and approximation methods for degenerate semidefinite programs (SDPs) and the singular roots of polynomial systems. In the first part, we present a hybrid symbolic-numeric algorithm for certifying the feasibility of weakly feasible, degenerate SDPs. By reformulating linear matrix inequalities (LMIs) into a structured polynomial system via facial reduction and incidence varieties, we guarantee the existence of an isolated exact solution. This algebraic reduction enables the certification of maximum-rank numerical approximations using methods from algebraic geometry.\r\n\r\nIn the second part, we address the severe ill-conditioning and loss of quadratic convergence that plague standard path-tracking methods near isolated singular roots. To overcome this, we propose tracking algorithms that achieve superlinear convergence without the computational bloat characteristic of classical deflation techniques. By modeling the solution path as a generalized fractional Puiseux series, our approach combines an explicitly derived algebraic predictor with a localized hyperplane desingularization phase during the corrector step. Furthermore, we introduce a continuous path-limit method and an extension of the geometric sequence rule to directly extract exact fractional exponents. This bypasses traditional heuristic trial-and-error methods and explicitly accommodates sparse series expansions. Numerical experiments confirm that our method significantly reduces the cumulative number of matrix inversions while achieving high-accuracy root approximations, even for heavily degenerate systems exhibiting higher coranks." acknowledgement: 'Funding: Vienna Graduate School on Computational Optimization (FWF), grant DOI: 10.55776/W1260.' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Jeferson full_name: Zapata, Jeferson id: 00223538-AF8F-11E9-A4C7-F729E6697425 last_name: Zapata citation: ama: 'Zapata J. Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. 2026. doi:10.15479/AT-ISTA-21957' apa: 'Zapata, J. (2026). Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21957' chicago: 'Zapata, Jeferson. “Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21957.' ieee: 'J. Zapata, “Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames,” Institute of Science and Technology Austria, 2026.' ista: 'Zapata J. 2026. Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames. Institute of Science and Technology Austria.' mla: 'Zapata, Jeferson. Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21957.' short: 'J. Zapata, Overcoming Degeneracy and Singularity: Techniques for Semidefinite Programs and Homotopy Continuation Endgames, Institute of Science and Technology Austria, 2026.' corr_author: '1' das_tickbox: '1' date_created: 2026-06-08T13:29:52Z date_published: 2026-06-09T00:00:00Z date_updated: 2026-07-27T14:30:42Z day: '09' ddc: - '500' degree_awarded: PhD department: - _id: GradSch - _id: VlKo doi: 10.15479/AT-ISTA-21957 doi_confirm: '1' file: - access_level: closed checksum: b11a959e99d3dcf61040282b5c837141 content_type: application/zip creator: jzapata date_created: 2026-06-08T13:20:02Z date_updated: 2026-06-08T13:20:02Z file_id: '21958' file_name: istaustriathesis_JZapata.zip file_size: 40811933 relation: source_file - access_level: open_access checksum: edf1e5899b2e31505cd1aa3fe8bd4b7f content_type: application/pdf creator: jzapata date_created: 2026-06-10T13:33:25Z date_updated: 2026-06-10T13:33:25Z file_id: '21992' file_name: 4_Final_Thesis_JZapata_REX.pdf file_size: 2207892 relation: main_file success: 1 file_date_updated: 2026-06-10T13:33:25Z fulldoi: https://doi.org/10.15479/AT-ISTA-21957 has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '89' project: - _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A grant_number: W1260-N35 name: Vienna Graduate School on Computational Optimization publication_identifier: isbn: - 978-3-99078-079-4 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21144' relation: part_of_dissertation status: public status: public supervisor: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov title: 'Overcoming degeneracy and singularity: Techniques for semidefinite programs and homotopy continuation endgames' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: repository _id: '21360' acknowledged_ssus: - _id: LifeSc - _id: Bio acknowledgement: "I would like to acknowledge the Austrian Academy of Sciences (ÖAW) and European\r\nResearch Executive Agency (REA) for funding my research (DOC ÖAW Fellowship\r\n26130, Horizon Europe BOLERO Project 101060393). " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Stefan full_name: Riegler, Stefan id: FF6018E0-D806-11E9-8E43-0B14E6697425 last_name: Riegler orcid: 0000-0003-3413-1343 citation: ama: 'Riegler S. Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea  species. 2026. doi:10.15479/AT-ISTA-21360' apa: 'Riegler, S. (2026). Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea  species. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21360' chicago: 'Riegler, Stefan. “Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea  Species.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21360.' ieee: 'S. Riegler, “Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea  species,” Institute of Science and Technology Austria, 2026.' ista: 'Riegler S. 2026. Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea  species. Institute of Science and Technology Austria.' mla: 'Riegler, Stefan. Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea  Species. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21360.' short: 'S. Riegler, Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea  Species, Institute of Science and Technology Austria, 2026.' corr_author: '1' das_tickbox: '1' date_created: 2026-02-27T09:08:14Z date_published: 2026-02-26T00:00:00Z date_updated: 2026-07-27T14:30:08Z day: '26' ddc: - '570' - '575' - '583' degree_awarded: PhD department: - _id: GradSch - _id: EvBe doi: 10.15479/AT-ISTA-21360 doi_confirm: '1' file: - access_level: closed checksum: 2f1f44e8536c2538f94a440217452c9f content_type: application/x-zip-compressed creator: sriegler date_created: 2026-03-02T10:59:50Z date_updated: 2026-03-02T10:59:50Z file_id: '21386' file_name: 2026_Riegler_Stefan_Thesis.zip file_size: 31430022 relation: source_file - access_level: closed checksum: 2e8dc39640bc26ae5684c944c619719b content_type: application/pdf creator: sriegler date_created: 2026-03-02T10:59:49Z date_updated: 2026-03-02T10:59:49Z embargo: 2027-02-27 embargo_to: open_access file_id: '21387' file_name: 2026_Riegler_Stefan_Thesis.pdf file_size: 11635090 relation: main_file file_date_updated: 2026-03-02T10:59:50Z fulldoi: https://doi.org/10.15479/AT-ISTA-21360 has_accepted_license: '1' language: - iso: eng month: '02' oa_version: Published Version page: '185' project: - _id: 34afa094-11ca-11ed-8bc3-a375845a59fb grant_number: '101060393' name: Breeding for coffee and cocoa root resilience in low input farming systems based on improved rootstocks publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21363' relation: research_data status: public status: public supervisor: - first_name: Eva full_name: Benková, Eva id: 38F4F166-F248-11E8-B48F-1D18A9856A87 last_name: Benková orcid: 0000-0002-8510-9739 title: 'Root system plasticity under nutrient limitation: Investigating hormonal and molecular drivers in Arabidopsis thaliana and Coffea species' tmp: image: /images/cc_by_sa.png legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0) short: CC BY-SA (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- _id: '21363' abstract: - lang: eng text: The data contains information on coffee differential gene expression as well as co-expression and trait correlations in two separate experiments. First, contrasting nitrogen supply, second, intra- and interspecific grafting. article_processing_charge: No author: - first_name: Stefan full_name: Riegler, Stefan id: FF6018E0-D806-11E9-8E43-0B14E6697425 last_name: Riegler orcid: 0000-0003-3413-1343 citation: ama: 'Riegler S. Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis thaliana and Coffea  species. 2026. doi:10.15479/AT-ISTA-21363' apa: 'Riegler, S. (2026). Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis thaliana and Coffea  species. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21363' chicago: 'Riegler, Stefan. “Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea  Species.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21363.' ieee: 'S. Riegler, “Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis thaliana and Coffea  species.” Institute of Science and Technology Austria, 2026.' ista: 'Riegler S. 2026. Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis thaliana and Coffea  species, Institute of Science and Technology Austria, 10.15479/AT-ISTA-21363.' mla: 'Riegler, Stefan. Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis Thaliana and Coffea  Species. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21363.' short: S. Riegler, (2026). contributor: - contributor_type: supervisor first_name: Eva id: 38F4F166-F248-11E8-B48F-1D18A9856A87 last_name: Benková orcid: 0000-0002-8510-9739 corr_author: '1' date_created: 2026-02-27T09:18:41Z date_published: 2026-02-27T00:00:00Z date_updated: 2026-07-27T14:30:07Z day: '27' ddc: - '575' department: - _id: GradSch - _id: EvBe doi: 10.15479/AT-ISTA-21363 file: - access_level: closed checksum: de9145fa166a28c588b5184a2d3d4fee content_type: application/vnd.openxmlformats-officedocument.spreadsheetml.sheet creator: sriegler date_created: 2026-02-27T09:11:33Z date_updated: 2026-02-27T09:11:33Z embargo: 2027-02-27 embargo_to: open_access file_id: '21364' file_name: SupplementaryTables.xlsx file_size: 63749444 relation: main_file - access_level: closed checksum: ce1f163551c96cee45943a8ea29720b6 content_type: text/plain creator: sriegler date_created: 2026-02-27T09:13:11Z date_updated: 2026-02-27T09:13:11Z embargo: 2027-02-27 embargo_to: open_access file_id: '21365' file_name: ReadMe.txt file_size: 124 relation: main_file file_date_updated: 2026-02-27T09:13:11Z fulldoi: https://doi.org/10.15479/AT-ISTA-21363 has_accepted_license: '1' month: '02' oa_version: Published Version publisher: Institute of Science and Technology Austria related_material: record: - id: '21360' relation: used_in_publication status: public status: public title: 'Thesis Data for Root System Plasticity under Nutrient Limitation: Investigating Hormonal and Molecular Drivers in Arabidopsis thaliana and Coffea species' tmp: image: /images/cc_by_sa.png legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0) short: CC BY-SA (4.0) type: research_data user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '21980' abstract: - lang: eng text: Despite significant progress in the field of molecular electronics over the last two decades, the quantitative prediction of metal-molecule-metal junction conductance remains a challenge. The standard computational framework combines density functional theory (DFT) with nonequilibrium Green’s functions (NEGF) using low-rung exchange-correlation functionals such as PBE, which overestimate the conductances. More advanced correction methods exist but require complex workflows and high computational cost, limiting their accessibility. Here, we introduce a physically motivated approach that approximates results obtained with high-rung functionals. Our method fits the PBE-calculated transmission to a Breit-Wigner form and subsequently refines the fit parameters using molecular orbital energies and metal densities of states computed for the isolated subsystems with high-rung functionals. This approach is applicable to a broad range of molecular junctions yielding conductance values in quantitative agreement with experiments. Our approach is simple, low-cost, and accurate, making it well-suited for routine and large-scale prediction of single-molecule junction conductance. acknowledgement: This work was supported primarily by the Institute of Science and Technology Austria. L.V. was supported in part by the National Science Foundation (No. NSF-DMR 2241180). Z.-F.L. was supported by an NSF CAREER Award, No. DMR-2044552 and an Alfred P. Sloan Research Fellowship, No. FG-2024-21750. article_processing_charge: Yes (via OA deal) article_type: letter_note author: - first_name: Artem full_name: Gulyaev, Artem id: 83ed7901-7380-11f0-bf20-a0788d5e654d last_name: Gulyaev - first_name: Jyotisman full_name: Hazarika, Jyotisman id: d87714c4-663d-11f0-bd06-caece19833e5 last_name: Hazarika orcid: 0009-0007-2542-7878 - first_name: Zhen-Fei full_name: Liu, Zhen-Fei last_name: Liu - first_name: Latha full_name: Venkataraman, Latha id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf last_name: Venkataraman orcid: 0000-0002-6957-6089 chemrxivid: 1 citation: ama: Gulyaev A, Hazarika J, Liu Z-F, Venkataraman L. A computationally efficient and accurate method for predicting conductance of single-molecule junctions. Nano Letters. 2026;26(22):7429–7434. doi:10.1021/acs.nanolett.6c01462 apa: Gulyaev, A., Hazarika, J., Liu, Z.-F., & Venkataraman, L. (2026). A computationally efficient and accurate method for predicting conductance of single-molecule junctions. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.6c01462 chicago: Gulyaev, Artem, Jyotisman Hazarika, Zhen-Fei Liu, and Latha Venkataraman. “A Computationally Efficient and Accurate Method for Predicting Conductance of Single-Molecule Junctions.” Nano Letters. American Chemical Society, 2026. https://doi.org/10.1021/acs.nanolett.6c01462. ieee: A. Gulyaev, J. Hazarika, Z.-F. Liu, and L. Venkataraman, “A computationally efficient and accurate method for predicting conductance of single-molecule junctions,” Nano Letters, vol. 26, no. 22. American Chemical Society, pp. 7429–7434, 2026. ista: Gulyaev A, Hazarika J, Liu Z-F, Venkataraman L. 2026. A computationally efficient and accurate method for predicting conductance of single-molecule junctions. Nano Letters. 26(22), 7429–7434. mla: Gulyaev, Artem, et al. “A Computationally Efficient and Accurate Method for Predicting Conductance of Single-Molecule Junctions.” Nano Letters, vol. 26, no. 22, American Chemical Society, 2026, pp. 7429–7434, doi:10.1021/acs.nanolett.6c01462. short: A. Gulyaev, J. Hazarika, Z.-F. Liu, L. Venkataraman, Nano Letters 26 (2026) 7429–7434. corr_author: '1' das_tickbox: '1' date_created: 2026-06-10T07:27:19Z date_published: 2026-06-01T00:00:00Z date_updated: 2026-07-28T09:57:28Z day: '01' ddc: - '540' department: - _id: LaVe - _id: GradSch doi: 10.1021/acs.nanolett.6c01462 external_id: chemrxivid: - 10.26434/chemrxiv.15001696 pmid: - '42223342' file: - access_level: open_access checksum: 897551374cac28e0db26dcb0b676b8e7 content_type: application/pdf creator: dernst date_created: 2026-06-16T09:11:35Z date_updated: 2026-06-16T09:11:35Z file_id: '22013' file_name: 2026_NanoLetters_Gulyaev.pdf file_size: 3362800 relation: main_file success: 1 file_date_updated: 2026-06-16T09:11:35Z fulldoi: https://doi.org/10.1021/acs.nanolett.6c01462 has_accepted_license: '1' intvolume: ' 26' issue: '22' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 7429–7434 pmid: 1 publication: Nano Letters publication_identifier: eissn: - 1530-6992 issn: - 1530-6984 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: A computationally efficient and accurate method for predicting conductance of single-molecule junctions tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 26 year: '2026' ... --- OA_place: repository OA_type: green _id: '22404' abstract: - lang: eng text: We consider a class of two-dimensional tight binding models displaying conical intersections of the Bloch bands at the Fermi level. The setting includes the case of generic transitions between quantum Hall phases. We consider the longitudinal conductivity, as given by Kubo formula, describing the variation of the current after introducing a space-homogeneous electric field, in an adiabatic way. We obtain an explicit expression for the longitudinal conductivity, completely determined by the number of conical intersections and by the shape of the cones. In particular, the formula reproduces the known quantized values found for graphene and for the critical Haldane model. Furthermore, we discuss the validity of Kubo formula in presence of conical intersections in the spectrum, starting from the time-dependent Schrödinger equation. For electric fields which are weak and slowly varying in space and in time, we prove the validity of linear response from quantum dynamics. acknowledgement: G. M. and M. P. acknowledge support by the European Research Council through the ERC-StG MaMBoQ, n. 802901. G. M. acknowledges financial support from the Independent Research Fund Denmark–Natural Sciences, grant DFF–10.46540/2032-00005B and from the European Research Council through the ERC CoG UniCoSM, grant agreement n.724939. M. P. acknowledges support from the MUR, PRIN 2022 project MaIQuFi cod. 20223J85K3. This work has been carried out under the auspices of the GNFM of INdAM. We thank the anonymous referees for comments on a previous version of this manuscript. article_number: '82' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Giovanna full_name: Marcelli, Giovanna last_name: Marcelli - first_name: Lorenzo full_name: Pigozzi, Lorenzo id: efb8f850-3208-11ee-ac71-8c4f5803b9c6 last_name: Pigozzi - first_name: Marcello full_name: Porta, Marcello last_name: Porta citation: ama: Marcelli G, Pigozzi L, Porta M. Longitudinal conductivity at integer quantum Hall transitions. Letters in Mathematical Physics. 2026;116(4). doi:10.1007/s11005-026-02087-3 apa: Marcelli, G., Pigozzi, L., & Porta, M. (2026). Longitudinal conductivity at integer quantum Hall transitions. Letters in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s11005-026-02087-3 chicago: Marcelli, Giovanna, Lorenzo Pigozzi, and Marcello Porta. “Longitudinal Conductivity at Integer Quantum Hall Transitions.” Letters in Mathematical Physics. Springer Nature, 2026. https://doi.org/10.1007/s11005-026-02087-3. ieee: G. Marcelli, L. Pigozzi, and M. Porta, “Longitudinal conductivity at integer quantum Hall transitions,” Letters in Mathematical Physics, vol. 116, no. 4. Springer Nature, 2026. ista: Marcelli G, Pigozzi L, Porta M. 2026. Longitudinal conductivity at integer quantum Hall transitions. Letters in Mathematical Physics. 116(4), 82. mla: Marcelli, Giovanna, et al. “Longitudinal Conductivity at Integer Quantum Hall Transitions.” Letters in Mathematical Physics, vol. 116, no. 4, 82, Springer Nature, 2026, doi:10.1007/s11005-026-02087-3. short: G. Marcelli, L. Pigozzi, M. Porta, Letters in Mathematical Physics 116 (2026). das_tickbox: '1' dataavailabilitystatement: Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study. date_created: 2026-07-26T22:01:40Z date_published: 2026-08-01T00:00:00Z date_updated: 2026-07-29T10:51:55Z day: '01' department: - _id: RoSe - _id: GradSch doi: 10.1007/s11005-026-02087-3 external_id: arxiv: - '2503.01381' fulldoi: https://doi.org/10.1007/s11005-026-02087-3 intvolume: ' 116' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2503.01381 mathsc: - 81V70 month: '08' oa: 1 oa_version: Preprint publication: Letters in Mathematical Physics publication_identifier: eissn: - 1573-0530 issn: - 0377-9017 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: not applicable scopus_import: '1' status: public supplementarymaterial: no title: Longitudinal conductivity at integer quantum Hall transitions type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 116 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '22607' abstract: - lang: eng text: "Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over linearly ordered fields in Lean 4. Furthermore, we extend duality theory to the case when some coefficients are allowed to take \"infinite values\".\r\nCode: https://github.com/madvorak/duality/tree/v3.2.0" acknowledgement: "We would like to thank David Bartl and Jasmin Blanchette for frequent consultations.\r\nWe would also like to express gratitude to Henrik Böving for a help with generalization\r\nfrom extended rationals to extended linearly ordered fields and to Andrew Yang for the\r\nproof of Finset.univ_sum_of_zero_when_not. We would also like to acknowledge Antoine\r\nChambert-Loir, Apurva Nakade, Yaël Dillies, Richard Copley, Edward van de Meent, Markus\r\nHimmel, Mario Carneiro, and Kevin Buzzard." article_number: '14253' article_processing_charge: Yes (in subscription journal) article_type: original arxiv: 1 author: - first_name: Martin full_name: Dvorak, Martin id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425 last_name: Dvorak orcid: 0000-0001-5293-214X - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov citation: ama: Dvorak M, Kolmogorov V. Duality theory in linear optimization and its extensions -- formally verified. Annals of Formalized Mathematics. 2026;2. doi:10.46298/afm.14253 apa: Dvorak, M., & Kolmogorov, V. (2026). Duality theory in linear optimization and its extensions -- formally verified. Annals of Formalized Mathematics. EPI Sciences. https://doi.org/10.46298/afm.14253 chicago: Dvorak, Martin, and Vladimir Kolmogorov. “Duality Theory in Linear Optimization and Its Extensions -- Formally Verified.” Annals of Formalized Mathematics. EPI Sciences, 2026. https://doi.org/10.46298/afm.14253. ieee: M. Dvorak and V. Kolmogorov, “Duality theory in linear optimization and its extensions -- formally verified,” Annals of Formalized Mathematics, vol. 2. EPI Sciences, 2026. ista: Dvorak M, Kolmogorov V. 2026. Duality theory in linear optimization and its extensions -- formally verified. Annals of Formalized Mathematics. 2, 14253. mla: Dvorak, Martin, and Vladimir Kolmogorov. “Duality Theory in Linear Optimization and Its Extensions -- Formally Verified.” Annals of Formalized Mathematics, vol. 2, 14253, EPI Sciences, 2026, doi:10.46298/afm.14253. short: M. Dvorak, V. Kolmogorov, Annals of Formalized Mathematics 2 (2026). corr_author: '1' das_tickbox: '0' date_created: 2026-07-29T09:06:55Z date_published: 2026-03-13T00:00:00Z date_updated: 2026-07-29T10:50:17Z day: '13' ddc: - '500' department: - _id: VlKo - _id: GradSch doi: 10.46298/afm.14253 external_id: arxiv: - '2409.08119' fulldoi: https://doi.org/10.46298/afm.14253 has_accepted_license: '1' intvolume: ' 2' keyword: - Farkas lemma - linear programming - extended reals - calculus of inductive constructions language: - iso: eng mathsc: - 68V20 - 15A39 - 90C05 month: '03' oa_version: Published Version publication: Annals of Formalized Mathematics publication_identifier: eissn: - 3117-4604 publication_status: published publisher: EPI Sciences quality_controlled: '1' related_material: record: - id: '20071' relation: earlier_version status: public researchdata_availability: no status: public supplementarymaterial: no title: Duality theory in linear optimization and its extensions -- formally verified tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2026' ... --- OA_place: repository _id: '21393' abstract: - lang: eng text: "This thesis documents a voyage towards truth and beauty via formal verification of theorems. To this end, we develop libraries in Lean 4 that present definitions and results from diverse areas of MathematiCS (i.e., Mathematics and Computer Science). The aim is to create code that is understandable, believable, useful, and elegant. The code should stand for itself as much as possible without a need for documentation; however, this text redundantly documents our code artifacts and provides additional context that isn’t present in the code. This thesis is written for readers who know Lean 4 but are not familiar with any of the topics presented. We manifest truth and beauty in three formalized areas of MathematiCS.\r\n\r\nWe formalize general grammars in Lean 4 and use grammars to show closure of the class of type-0 languages under four operations; union, reversal, concatenation, and the Kleene star.\r\n\r\nOur second stop is the theory of optimization. Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over linearly ordered fields in Lean 4. Furthermore, we extend duality theory to the case when some coefficients are allowed to take “infinite values”. Additionally, we develop the basics of the theory of optimization in terms of the framework called General-Valued Constraint Satisfaction Problems, and we prove that, if a Rational-Valued Constraint Satisfaction Problem template has symmetric fractional polymorphisms of all arities, then its basic LP relaxation is tight.\r\n\r\nOur third stop is matroid theory. Seymour’s decomposition theorem is a hallmark result in matroid theory, presenting a structural characterization of the class of regular matroids. We aim to formally verify Seymour’s theorem in Lean 4. First, we build a library for working with totally unimodular matrices. We define binary matroids and their standard representations, and we prove that they form a matroid in the sense how Mathlib defines matroids. We define regular matroids to be matroids for which there exists a full representation rational matrix that is totally unimodular, and we prove that all regular matroids are binary. We define 1-sum, 2-sum, and 3 sum of binary matroids as specific ways to compose their standard representation matrices. We prove that the 1-sum, the 2-sum, and the 3-sum of regular matroids are a regular matroid, which concludes the composition direction of the Seymour’s theorem. The (more difficult) decomposition direction remains unproved.\r\n\r\nIn the pursuit of truth, we focus on identifying the trusted code in each project and presenting it faithfully. We emphasize the readability and believability of definitions rather than choosing definitions that are easier to work with. In search for beauty, we focus on the philosophical framework of Roger Scruton, who emphasizes that beauty is not a mere decoration but, most importantly, beauty is the means for shaping our place in the world and a source of redemption, where it can be viewed as a substitute for religion." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Martin full_name: Dvorak, Martin id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425 last_name: Dvorak orcid: 0000-0001-5293-214X citation: ama: 'Dvorak M. Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. 2026. doi:10.15479/AT-ISTA-21393' apa: 'Dvorak, M. (2026). Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21393' chicago: 'Dvorak, Martin. “Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21393.' ieee: 'M. Dvorak, “Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids,” Institute of Science and Technology Austria, 2026.' ista: 'Dvorak M. 2026. Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. Institute of Science and Technology Austria.' mla: 'Dvorak, Martin. Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21393.' short: 'M. Dvorak, Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids, Institute of Science and Technology Austria, 2026.' corr_author: '1' date_created: 2026-03-04T09:26:46Z date_published: 2026-03-04T00:00:00Z date_updated: 2026-07-29T12:56:52Z day: '04' ddc: - '511' - '000' degree_awarded: PhD department: - _id: GradSch - _id: VlKo doi: 10.15479/AT-ISTA-21393 doi_confirm: '1' file: - access_level: open_access checksum: cface6dc18152680962b5361575f6e4f content_type: application/pdf creator: mdvorak date_created: 2026-03-04T08:56:15Z date_updated: 2026-03-04T08:56:15Z file_id: '21394' file_name: 2026_Dvorak_Martin_Thesis.pdf file_size: 1771231 relation: main_file success: 1 - access_level: closed checksum: 290ddfacfb7e07fb07e6f0b334e67c90 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: mdvorak date_created: 2026-03-04T09:03:37Z date_updated: 2026-03-04T09:03:37Z file_id: '21395' file_name: 2026_Dvorak_Martin_Thesis.docx file_size: 864585 relation: source_file file_date_updated: 2026-03-04T09:03:37Z fulldoi: https://doi.org/10.15479/AT-ISTA-21393 has_accepted_license: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: '160' publication_identifier: isbn: - 978-3-99078-074-9 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: link: - description: Full version of all definitions, statements, and proofs for Chapter 3.1 (Linear duality) relation: software url: https://github.com/madvorak/duality/tree/v3.5.0 - description: Full version of all definitions, statements, and proofs for Chapter 3.2 (Valued Constraint Satisfaction Problems) relation: software url: https://github.com/madvorak/vcsp/tree/v8.2.0 - description: Full version of all definitions, statements, and proofs for Chapter 4 (Seymour project) relation: software url: https://github.com/Ivan-Sergeyev/seymour/tree/v1.2.0 - description: Full version of all definitions, statements, and proofs for Chapter 5 (Theory of grammars) relation: software url: https://github.com/madvorak/chomsky/tree/v1.2.0 - description: Old version (Lean 3) of the project about grammars relation: software url: https://github.com/madvorak/grammars - description: Demonstration of (minimal) requirements for selected algebraic classes used in my Ph.D. thesis relation: software url: https://github.com/madvorak/preliminaries/blob/main/Preliminaries.lean record: - id: '13120' relation: part_of_dissertation status: public - id: '20071' relation: part_of_dissertation status: public - id: '21398' relation: part_of_dissertation status: public status: public supervisor: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Jasmin full_name: Blanchette, Jasmin last_name: Blanchette title: 'Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '22406' abstract: - lang: eng text: "It is known that for a uniform morphic sequence \U0001D496 =⟨\U0001D462\U0001D45B⟩∞\r\n\U0001D45B=0 and an algebraic number \U0001D6FD such that |\U0001D6FD| >1, the number [[\U0001D496]]\U0001D6FD :=∑∞\r\n\U0001D45B=0(\U0001D462\U0001D45B/\U0001D6FD\U0001D45B) either lies in ℚ⁡(\U0001D6FD) or is transcendental. In this paper, we show a similar rational–transcendental dichotomy for sequences defined by irreducible Pisot morphisms on binary alphabets. Subject to the Pisot conjecture (an irreducible Pisot morphism has pure discrete spectrum), we generalise the latter result to arbitrary finite alphabets. In certain cases, we are able to show transcendence of [[\U0001D496]]\U0001D6FD outright. In particular, for \U0001D458 ≥2, if \U0001D496 is the k-Bonacci word, then [[\U0001D496]]\U0001D6FD is transcendental." acknowledgement: "We thank the anonymous referee for identifying an error in an earlier\r\nversion of the paper. We gratefully acknowledge support from UKRI Frontier Research\r\nGrant EP/X033813/1, ERC grant DynAMiCS (101167561) and DFG grant 389792660 as\r\npart of TRR 248. J.O. is also affiliated with Keble College, Oxford as an Emmy Network\r\nfellow." article_processing_charge: Yes (in subscription journal) article_type: original arxiv: 1 author: - first_name: Pavol full_name: Kebis, Pavol id: 2e0132b3-4e98-11ef-b275-cf7281c2802a last_name: Kebis - first_name: FLORIAN full_name: LUCA, FLORIAN last_name: LUCA - first_name: JOEL full_name: OUAKNINE, JOEL last_name: OUAKNINE - first_name: ANDREW full_name: SCOONES, ANDREW last_name: SCOONES - first_name: JAMES full_name: WORRELL, JAMES last_name: WORRELL citation: ama: Kebis P, LUCA F, OUAKNINE J, SCOONES A, WORRELL J. Transcendence for Pisot morphic words over an algebraic base. Ergodic Theory and Dynamical Systems. 2026:1-22. doi:10.1017/etds.2026.10324 apa: Kebis, P., LUCA, F., OUAKNINE, J., SCOONES, A., & WORRELL, J. (2026). Transcendence for Pisot morphic words over an algebraic base. Ergodic Theory and Dynamical Systems. Cambridge University Press. https://doi.org/10.1017/etds.2026.10324 chicago: Kebis, Pavol, FLORIAN LUCA, JOEL OUAKNINE, ANDREW SCOONES, and JAMES WORRELL. “Transcendence for Pisot Morphic Words over an Algebraic Base.” Ergodic Theory and Dynamical Systems. Cambridge University Press, 2026. https://doi.org/10.1017/etds.2026.10324. ieee: P. Kebis, F. LUCA, J. OUAKNINE, A. SCOONES, and J. WORRELL, “Transcendence for Pisot morphic words over an algebraic base,” Ergodic Theory and Dynamical Systems. Cambridge University Press, pp. 1–22, 2026. ista: Kebis P, LUCA F, OUAKNINE J, SCOONES A, WORRELL J. 2026. Transcendence for Pisot morphic words over an algebraic base. Ergodic Theory and Dynamical Systems., 1–22. mla: Kebis, Pavol, et al. “Transcendence for Pisot Morphic Words over an Algebraic Base.” Ergodic Theory and Dynamical Systems, Cambridge University Press, 2026, pp. 1–22, doi:10.1017/etds.2026.10324. short: P. Kebis, F. LUCA, J. OUAKNINE, A. SCOONES, J. WORRELL, Ergodic Theory and Dynamical Systems (2026) 1–22. das_tickbox: '0' date_created: 2026-07-27T05:53:25Z date_published: 2026-07-10T00:00:00Z date_updated: 2026-08-03T06:17:50Z day: '10' ddc: - '000' department: - _id: ToHe - _id: GradSch doi: 10.1017/etds.2026.10324 external_id: arxiv: - '2405.05279' fulldoi: https://doi.org/10.1017/etds.2026.10324 has_accepted_license: '1' keyword: - balanced-pair algorithm - Cobham’s conjecture - k-Bonacci words - Pisot conjecture - subspace theorem language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1017/etds.2026.10324 mathsc: - 11J81 - 37B10 - 11J87 month: '07' oa: 1 oa_version: Published Version page: 1-22 publication: Ergodic Theory and Dynamical Systems publication_identifier: eissn: - 1469-4417 issn: - 0143-3857 publication_status: epub_ahead publisher: Cambridge University Press quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: Transcendence for Pisot morphic words over an algebraic base tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2026' ... --- OA_place: repository OA_type: green _id: '22619' abstract: - lang: eng text: Planar germanium is currently the only semiconducting platform where high-coherence spin qubits and proximity-induced superconductivity have each been demonstrated. Recent research into spin qubits in Ge/SiGe heterostructures has focused on increasing the thickness of the SiGe capping layer, reporting improvements in the electrostatic noise levels. Meanwhile, heterostructures with thinner capping layers remain rather unexplored, despite the potential advantages for proximity-induced superconductivity. Here, we study a Ge/SiGe heterostructure with a thin SiGe cap d - 4nm and investigate its viability to host low-noise quantum dots. To keep the thermal budget compatible with superconducting layers, low-temperature oxide deposition processes were developed and implemented for the gate dielectrics. The charge noise level of the fabricated devices is estimated to be 1.8  +- 1.0 μeV/ square HZ⁠, comparable to devices fabricated on shallow heterostructures (⁠ d - 20nm⁠) with high-temperature deposited oxides. Low charge noise levels, together with the straightforward integration of superconductors, make this heterostructure an attractive platform for prototyping hybrid semiconducting–superconducting devices. acknowledged_ssus: - _id: M-Shop - _id: NanoFab acknowledgement: 'We sincerely thank Nick van Loo, Greg Mazur, Dhananjay Joshi, and Srijit Goswami for their inputs on low-temperature HfOx deposition; Matias Urdampilleta and Daniel Jirovec for discussions; and Kristen Léonard for the careful reading of the manuscript. This research was supported by the Scientific Service Units of ISTA through resources provided by the Miba Machine Shop and the Nanofabrication facility. The authors acknowledge support from the NOMIS Foundation; the European Innovation Council Pathfinder Grant No. 101115315 (QuKiT); the FWF Projects with DOI:10.55776/F86, DOI:10.55776/PAT7682124, and DOI:10.55776/P36507; and the HE-MSCA-PF project with DOI:10.3030/101150858. ICN2 is supported by the Severo Ochoa Program from Spanish MCIN/AEI (Grant No.: CEX2021-001214-S) and is funded by the CERCA Program/Generalitat de Catalunya. ICN2 acknowledges funding from Generalitat de Catalunya (No. 2021SGR00457). We acknowledge support from the CSIC Interdisciplinary Thematic Platform (PTI+) on Quantum Technologies (PTI-QTEP+).' article_number: '033505' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Maksim full_name: Borovkov, Maksim id: 1fd0975f-8b61-11ed-b69e-d149334f28c5 last_name: Borovkov - first_name: Yona A full_name: Schell, Yona A id: fe39122d-06bb-11ec-a33b-9e22b40e40a5 last_name: Schell - first_name: Dina full_name: Sokolova, Dina id: 2d2d62f8-72f0-11ef-b75a-8ec3e8a60032 last_name: Sokolova - first_name: Kevin Etienne Robert full_name: Roux, Kevin Etienne Robert id: 53f93ea2-803f-11ed-ab7e-b283135794ef last_name: Roux - first_name: Paul full_name: Falthansl-Scheinecker, Paul id: 85b43b21-15b2-11ec-abd3-e2c252cc2285 last_name: Falthansl-Scheinecker - first_name: Giorgio full_name: Fabris, Giorgio id: 298cf6f3-1ff6-11ee-9fa6-d94cfa0b3352 last_name: Fabris - first_name: Devashish C full_name: Shah, Devashish C id: de191434-4e7e-11ef-bf4b-9a056fc19fc3 last_name: Shah orcid: 0009-0007-5829-7707 - first_name: Jaime full_name: Saez Mollejo, Jaime id: e0390f72-f6e0-11ea-865d-862393336714 last_name: Saez Mollejo - first_name: Rodolfo full_name: Previdi, Rodolfo id: bc4ea1dc-00ce-11ec-8a4e-b325ca8b9876 last_name: Previdi - first_name: Inas full_name: Taha, Inas last_name: Taha - first_name: Aziz full_name: Genç, Aziz last_name: Genç - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Stefano full_name: Calcaterra, Stefano last_name: Calcaterra - first_name: Afonso De Cerdeira full_name: Oliveira, Afonso De Cerdeira last_name: Oliveira - first_name: Daniel full_name: Chrastina, Daniel last_name: Chrastina - first_name: Giovanni full_name: Isella, Giovanni last_name: Isella - first_name: Anton full_name: Bubis, Anton id: 1f6212b5-f795-11ec-9c0c-de4780302890 last_name: Bubis - first_name: Georgios full_name: Katsaros, Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros orcid: 0000-0001-8342-202X citation: ama: Borovkov M, Schell YA, Sokolova D, et al. Low-noise quantum dots in ultra-shallow Ge/SiGe heterostructures for prototyping hybrid semiconducting–superconducting devices. Applied Physics Letters. 2026;129(3). doi:10.1063/5.0333142 apa: Borovkov, M., Schell, Y. A., Sokolova, D., Roux, K. E. R., Falthansl-Scheinecker, P., Fabris, G., … Katsaros, G. (2026). Low-noise quantum dots in ultra-shallow Ge/SiGe heterostructures for prototyping hybrid semiconducting–superconducting devices. Applied Physics Letters. AIP Publishing. https://doi.org/10.1063/5.0333142 chicago: Borovkov, Maksim, Yona A Schell, Dina Sokolova, Kevin Etienne Robert Roux, Paul Falthansl-Scheinecker, Giorgio Fabris, Devashish C Shah, et al. “Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting–Superconducting Devices.” Applied Physics Letters. AIP Publishing, 2026. https://doi.org/10.1063/5.0333142. ieee: M. Borovkov et al., “Low-noise quantum dots in ultra-shallow Ge/SiGe heterostructures for prototyping hybrid semiconducting–superconducting devices,” Applied Physics Letters, vol. 129, no. 3. AIP Publishing, 2026. ista: Borovkov M, Schell YA, Sokolova D, Roux KER, Falthansl-Scheinecker P, Fabris G, Shah DC, Saez Mollejo J, Previdi R, Taha I, Genç A, Arbiol J, Calcaterra S, Oliveira ADC, Chrastina D, Isella G, Bubis A, Katsaros G. 2026. Low-noise quantum dots in ultra-shallow Ge/SiGe heterostructures for prototyping hybrid semiconducting–superconducting devices. Applied Physics Letters. 129(3), 033505. mla: Borovkov, Maksim, et al. “Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting–Superconducting Devices.” Applied Physics Letters, vol. 129, no. 3, 033505, AIP Publishing, 2026, doi:10.1063/5.0333142. short: M. Borovkov, Y.A. Schell, D. Sokolova, K.E.R. Roux, P. Falthansl-Scheinecker, G. Fabris, D.C. Shah, J. Saez Mollejo, R. Previdi, I. Taha, A. Genç, J. Arbiol, S. Calcaterra, A.D.C. Oliveira, D. Chrastina, G. Isella, A. Bubis, G. Katsaros, Applied Physics Letters 129 (2026). corr_author: '1' das_tickbox: '1' dataavailabilitystatement: The data that support the findings of this study are openly available in Institute of Science and Technology repository at http://doi.org/10.15479/AT-ISTA-22242, Ref. 50. date_created: 2026-08-02T22:01:53Z date_published: 2026-07-20T00:00:00Z date_updated: 2026-08-03T11:08:39Z day: '20' department: - _id: GeKa - _id: GradSch - _id: NanoFab doi: 10.1063/5.0333142 external_id: arxiv: - '2602.21363' fulldoi: https://doi.org/10.1063/5.0333142 intvolume: ' 129' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2602.21363 month: '07' oa: 1 oa_version: Preprint project: - _id: bdc2ca30-d553-11ed-ba76-cf164a5bb811 grant_number: '101115315' name: Quantum bits with Kitaev Transmons - _id: 34a66131-11ca-11ed-8bc3-a31681c6b03e grant_number: F8606 name: 'Center for Correlated Quantum Materials and Solid State Quantum Systems: Conventional and unconventional topological superconductors' - _id: 5b9e579c-ab3d-11f0-914f-88754c5b5a3f grant_number: PAT 7682124 name: Superconducting spin qubits in planar Ge - _id: bd8bd29e-d553-11ed-ba76-f0070d4b237a grant_number: P36507 name: Merging spin and superconducting qubits in planar Ge - _id: 8ea8abf7-16d5-11f0-9cad-c41e56ec8bb3 grant_number: '101150858' name: Realization and Manipulation of a Planar hybrid superconducting Andreev spin qubit in Germanium publication: Applied Physics Letters publication_identifier: eissn: - 1077-3118 issn: - 0003-6951 publication_status: published publisher: AIP Publishing quality_controlled: '1' related_material: record: - id: '22242' relation: research_data status: public researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: yes title: Low-noise quantum dots in ultra-shallow Ge/SiGe heterostructures for prototyping hybrid semiconducting–superconducting devices type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 129 year: '2026' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold PlanS_conform: '1' _id: '22618' abstract: - lang: eng text: "We use a function field version of the circle method to prove that a positive proportion of elements in \U0001D53D\U0001D45E⁡[\U0001D461] are representable as a sum of three cubes of minimal degree from \U0001D53D\U0001D45E⁡[\U0001D461], assuming a suitable form of the Ratios Conjecture and that char⁡(\U0001D53D\U0001D45E) >3. The analogue of this conjecture for quadratic Dirichlet L-functions is known for large fixed q, via recent developments in homological stability." acknowledgement: While working on this paper the first two authors were supported by FWF grant (DOI 10.55776/P36278) and the third author was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413, and by the National Science and Technology Council Project Grant 114-2115-M-001-010-MY2. article_number: e112 article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Jakob full_name: Glas, Jakob id: d6423cba-dc74-11ea-a0a7-ee61689ff5fb last_name: Glas - first_name: Victor full_name: Wang, Victor id: 76096395-aea4-11ed-a680-ab8ebbd3f1b9 last_name: Wang orcid: 0000-0002-0704-7026 citation: ama: Browning TD, Glas J, Wang V. Sums of three cubes over a function field. Forum of Mathematics Sigma. 2026;14. doi:10.1017/fms.2026.10259 apa: Browning, T. D., Glas, J., & Wang, V. (2026). Sums of three cubes over a function field. Forum of Mathematics Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2026.10259 chicago: Browning, Timothy D, Jakob Glas, and Victor Wang. “Sums of Three Cubes over a Function Field.” Forum of Mathematics Sigma. Cambridge University Press, 2026. https://doi.org/10.1017/fms.2026.10259. ieee: T. D. Browning, J. Glas, and V. Wang, “Sums of three cubes over a function field,” Forum of Mathematics Sigma, vol. 14. Cambridge University Press, 2026. ista: Browning TD, Glas J, Wang V. 2026. Sums of three cubes over a function field. Forum of Mathematics Sigma. 14, e112. mla: Browning, Timothy D., et al. “Sums of Three Cubes over a Function Field.” Forum of Mathematics Sigma, vol. 14, e112, Cambridge University Press, 2026, doi:10.1017/fms.2026.10259. short: T.D. Browning, J. Glas, V. Wang, Forum of Mathematics Sigma 14 (2026). corr_author: '1' das_tickbox: '0' date_created: 2026-08-02T22:01:52Z date_published: 2026-07-22T00:00:00Z date_updated: 2026-08-03T12:13:59Z day: '22' ddc: - '500' department: - _id: TiBr - _id: GradSch doi: 10.1017/fms.2026.10259 ec_funded: 1 external_id: arxiv: - '2402.07146' file: - access_level: open_access checksum: e92a762e03f832bdca8c106a9a88ef9b content_type: application/pdf creator: dernst date_created: 2026-08-03T12:12:03Z date_updated: 2026-08-03T12:12:03Z file_id: '22636' file_name: 2026_ForumMathematics_Browning.pdf file_size: 810718 relation: main_file success: 1 file_date_updated: 2026-08-03T12:12:03Z fulldoi: https://doi.org/10.1017/fms.2026.10259 has_accepted_license: '1' intvolume: ' 14' language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: bd8a4fdc-d553-11ed-ba76-80a0167441a3 grant_number: P36278 name: Rational curves via function field analytic number theory - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: Forum of Mathematics Sigma publication_identifier: eissn: - 2050-5094 publication_status: published publisher: Cambridge University Press quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: Sums of three cubes over a function field tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 14 year: '2026' ... --- OA_place: repository _id: '22242' abstract: - lang: eng text: This deposit contains the data and analysis code accompanying the publication "Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting–Superconducting Devices" (Borovkov et al.). The deposit includes the raw transport and current-noise measurements of three gate-defined quantum-dot devices as QCodes SQLite databases, the master table of the charge-noise (flank-method) analysis with the pointers linking every analyzed PSD trace to the raw data, the toy-model noise simulation datasets behind the supplementary figures, the archived analysis figures (PSD fits and lever-arm extractions), and the Python code reproducing the full analysis and all figures. The code is also maintained at https://github.com/ISTA-Nanoelectronics/noise_paper_public; instructions are provided in the README files. acknowledged_ssus: - _id: M-Shop - _id: NanoFab article_processing_charge: No author: - first_name: Maksim full_name: Borovkov, Maksim id: 1fd0975f-8b61-11ed-b69e-d149334f28c5 last_name: Borovkov citation: ama: Borovkov M. Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices. 2026. doi:10.15479/AT-ISTA-22242 apa: Borovkov, M. (2026). Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22242 chicago: Borovkov, Maksim. “Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22242. ieee: M. Borovkov, “Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices.” Institute of Science and Technology Austria, 2026. ista: Borovkov M. 2026. Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices, Institute of Science and Technology Austria, 10.15479/AT-ISTA-22242. mla: Borovkov, Maksim. Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22242. short: M. Borovkov, (2026). contributor: - contributor_type: contact_person first_name: Maksim id: 1fd0975f-8b61-11ed-b69e-d149334f28c5 last_name: Borovkov corr_author: '1' date_created: 2026-07-04T17:32:27Z date_published: 2026-07-04T00:00:00Z date_updated: 2026-08-03T11:08:38Z day: '04' ddc: - '530' department: - _id: GradSch - _id: GeKa doi: 10.15479/AT-ISTA-22242 doi_confirm: '1' file: - access_level: open_access checksum: 2a1ea297e01a7a202a6b144d69a46eef content_type: application/x-zip-compressed creator: mborovko date_created: 2026-07-04T17:28:49Z date_updated: 2026-07-04T17:28:49Z file_id: '22243' file_name: noise_paper_public_deposit.zip file_size: 3082596099 relation: main_file success: 1 file_date_updated: 2026-07-04T17:28:49Z fulldoi: https://doi.org/10.15479/AT-ISTA-22242 has_accepted_license: '1' month: '07' oa: 1 oa_version: Published Version project: - _id: bdc2ca30-d553-11ed-ba76-cf164a5bb811 grant_number: '101115315' name: Quantum bits with Kitaev Transmons - _id: 34a66131-11ca-11ed-8bc3-a31681c6b03e grant_number: F8606 name: 'Center for Correlated Quantum Materials and Solid State Quantum Systems: Conventional and unconventional topological superconductors' - _id: bd8bd29e-d553-11ed-ba76-f0070d4b237a grant_number: P36507 name: Merging spin and superconducting qubits in planar Ge - _id: 8ea8abf7-16d5-11f0-9cad-c41e56ec8bb3 grant_number: '101150858' name: Realization and Manipulation of a Planar hybrid superconducting Andreev spin qubit in Germanium - _id: 5b9e579c-ab3d-11f0-914f-88754c5b5a3f grant_number: PAT 7682124 name: Superconducting spin qubits in planar Ge publisher: Institute of Science and Technology Austria related_material: link: - relation: research_data url: https://github.com/ISTA-Nanoelectronics/noise_paper_public record: - id: '22619' relation: used_in_publication status: public status: public title: Low-Noise Quantum Dots in Ultra-Shallow Ge/SiGe Heterostructures for Prototyping Hybrid Semiconducting-Superconducting Devices tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: research_data user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d year: '2026' ...