@article{13237,
  abstract     = {The formation of amyloid fibrils is a general class of protein self-assembly behaviour, which is associated with both functional biology and the development of a number of disorders, such as Alzheimer and Parkinson diseases. In this Review, we discuss how general physical concepts from the study of phase transitions can be used to illuminate the fundamental mechanisms of amyloid self-assembly. We summarize progress in the efforts to describe the essential biophysical features of amyloid self-assembly as a nucleation-and-growth process and discuss how master equation approaches can reveal the key molecular pathways underlying this process, including the role of secondary nucleation. Additionally, we outline how non-classical aspects of aggregate formation involving oligomers or biomolecular condensates have emerged, inspiring developments in understanding, modelling and modulating complex protein assembly pathways. Finally, we consider how these concepts can be applied to kinetics-based drug discovery and therapeutic design to develop treatments for protein aggregation diseases.},
  author       = {Michaels, Thomas C.T. and Qian, Daoyuan and Šarić, Anđela and Vendruscolo, Michele and Linse, Sara and Knowles, Tuomas P.J.},
  issn         = {2522-5820},
  journal      = {Nature Reviews Physics},
  pages        = {379–397},
  publisher    = {Springer Nature},
  title        = {{Amyloid formation as a protein phase transition}},
  doi          = {10.1038/s42254-023-00598-9},
  volume       = {5},
  year         = {2023},
}

@inproceedings{13238,
  abstract     = {We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u, v) is determined by how much nodes u and v allocate for this link. Specifically, the input is a finite ordered sequence of packets that arrive in both directions along a link. Given (u, v) and a packet of weight x going from u to v, node u can either accept or reject the packet. If u accepts the packet, the capacity on link (u, v) decreases by x. Correspondingly, v’s capacity on (u, v) increases by x. If a node rejects the packet, this will entail a cost affinely linear in the weight of the packet. A link is “rechargeable” in the sense that the total capacity of the link has to remain constant, but the allocation of capacity at the ends of the link can depend arbitrarily on the nodes’ decisions. The goal is to minimise the sum of the capacity injected into the link and the cost of rejecting packets. We show that the problem is NP-hard, but can be approximated efficiently with a ratio of (1+ε)⋅(1+3–√) for some arbitrary ε>0.
.},
  author       = {Schmid, Stefan and Svoboda, Jakub and Yeo, Michelle X},
  booktitle    = {SIROCCO 2023: Structural Information and Communication Complexity },
  isbn         = {9783031327322},
  issn         = {1611-3349},
  location     = {Alcala de Henares, Spain},
  pages        = {576--594},
  publisher    = {Springer Nature},
  title        = {{Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation}},
  doi          = {10.1007/978-3-031-32733-9_26},
  volume       = {13892},
  year         = {2023},
}

@article{13251,
  abstract     = {A rotating organic cation and a dynamically disordered soft inorganic cage are the hallmark features of organic-inorganic lead-halide perovskites. Understanding the interplay between these two subsystems is a challenging problem, but it is this coupling that is widely conjectured to be responsible for the unique behavior of photocarriers in these materials. In this work, we use the fact that the polarizability of the organic cation strongly depends on the ambient electrostatic environment to put the molecule forward as a sensitive probe of the local crystal fields inside the lattice cell. We measure the average polarizability of the C/N–H bond stretching mode by means of infrared spectroscopy, which allows us to deduce the character of the motion of the cation molecule, find the magnitude of the local crystal field, and place an estimate on the strength of the hydrogen bond between the hydrogen and halide atoms. Our results pave the way for understanding electric fields in lead-halide perovskites using infrared bond spectroscopy.},
  author       = {Wei, Yujing and Volosniev, Artem and Lorenc, Dusan and Zhumekenov, Ayan A. and Bakr, Osman M. and Lemeshko, Mikhail and Alpichshev, Zhanybek},
  issn         = {1948-7185},
  journal      = {The Journal of Physical Chemistry Letters},
  keywords     = {General Materials Science, Physical and Theoretical Chemistry},
  number       = {27},
  pages        = {6309--6314},
  publisher    = {American Chemical Society},
  title        = {{Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites}},
  doi          = {10.1021/acs.jpclett.3c01158},
  volume       = {14},
  year         = {2023},
}

@article{13256,
  abstract     = {The El Niño-Southern Oscillation (ENSO) and the Indian summer monsoon (ISM, or monsoon) are two giants of tropical climate. Here we assess the future evolution of the ENSO-monsoon teleconnection in climate simulations with idealized forcing of CO2 increment at a rate of 1% year-1 starting from a present-day condition (367 p.p.m.) until quadrupling. We find a monotonous weakening of the ENSO-monsoon teleconnection with the increase in CO2. Increased co-occurrences of El Niño and positive Indian Ocean Dipoles (pIODs) in a warmer climate weaken the teleconnection. Co-occurrences of El Niño and pIOD are attributable to mean sea surface temperature (SST) warming that resembles a pIOD-type warming pattern in the Indian Ocean and an El Niño-type warming in the Pacific. Since ENSO is a critical precursor of the strength of the Indian monsoon, a weakening of this relation may mean a less predictable Indian monsoon in a warmer climate.},
  author       = {Goswami, Bidyut B and An, Soon Il},
  issn         = {2397-3722},
  journal      = {npj Climate and Atmospheric Science},
  publisher    = {Springer Nature},
  title        = {{An assessment of the ENSO-monsoon teleconnection in a warming climate}},
  doi          = {10.1038/s41612-023-00411-5},
  volume       = {6},
  year         = {2023},
}

@article{13257,
  abstract     = {The magnetotropic susceptibility is the thermodynamic coefficient associated with the rotational anisotropy of the free energy in an external magnetic field and is closely related to the magnetic susceptibility. It emerges naturally in frequency-shift measurements of oscillating mechanical cantilevers, which are becoming an increasingly important tool in the quantitative study of the thermodynamics of modern condensed-matter systems. Here we discuss the basic properties of the magnetotropic susceptibility as they relate to the experimental aspects of frequency-shift measurements, as well as to the interpretation of those experiments in terms of the intrinsic properties of the system under study.},
  author       = {Shekhter, A. and Mcdonald, R. D. and Ramshaw, B. J. and Modic, Kimberly A},
  issn         = {2469-9969},
  journal      = {Physical Review B},
  number       = {3},
  publisher    = {American Physical Society},
  title        = {{Magnetotropic susceptibility}},
  doi          = {10.1103/PhysRevB.108.035111},
  volume       = {108},
  year         = {2023},
}

@article{13258,
  abstract     = {Many human interactions feature the characteristics of social dilemmas where individual actions have consequences for the group and the environment. The feedback between behavior and environment can be studied with the framework of stochastic games. In stochastic games, the state of the environment can change, depending on the choices made by group members. Past work suggests that such feedback can reinforce cooperative behaviors. In particular, cooperation can evolve in stochastic games even if it is infeasible in each separate repeated game. In stochastic games, participants have an interest in conditioning their strategies on the state of the environment. Yet in many applications, precise information about the state could be scarce. Here, we study how the availability of information (or lack thereof) shapes evolution of cooperation. Already for simple examples of two state games we find surprising effects. In some cases, cooperation is only possible if there is precise information about the state of the environment. In other cases, cooperation is most abundant when there is no information about the state of the environment. We systematically analyze all stochastic games of a given complexity class, to determine when receiving information about the environment is better, neutral, or worse for evolution of cooperation.},
  author       = {Kleshnina, Maria and Hilbe, Christian and Simsa, Stepan and Chatterjee, Krishnendu and Nowak, Martin A.},
  issn         = {2041-1723},
  journal      = {Nature Communications},
  publisher    = {Springer Nature},
  title        = {{The effect of environmental information on evolution of cooperation in stochastic games}},
  doi          = {10.1038/s41467-023-39625-9},
  volume       = {14},
  year         = {2023},
}

@article{13260,
  abstract     = {Experimental evolution studies are powerful approaches to examine the evolutionary history of lab populations. Such studies have shed light on how selection changes phenotypes and genotypes. Most of these studies have not examined the time course of adaptation under sexual selection manipulation, by resequencing the populations’ genomes at multiple time points. Here, we analyze allele frequency trajectories in Drosophila pseudoobscura where we altered their sexual selection regime for 200 generations and sequenced pooled populations at 5 time points. The intensity of sexual selection was either relaxed in monogamous populations (M) or elevated in polyandrous lines (E). We present a comprehensive study of how selection alters population genetics parameters at the chromosome and gene level. We investigate differences in the effective population size—Ne—between the treatments, and perform a genome-wide scan to identify signatures of selection from the time-series data. We found genomic signatures of adaptation to both regimes in D. pseudoobscura. There are more significant variants in E lines as expected from stronger sexual selection. However, we found that the response on the X chromosome was substantial in both treatments, more pronounced in E and restricted to the more recently sex-linked chromosome arm XR in M. In the first generations of experimental evolution, we estimate Ne to be lower on the X in E lines, which might indicate a swift adaptive response at the onset of selection. Additionally, the third chromosome was affected by elevated polyandry whereby its distal end harbors a region showing a strong signal of adaptive evolution especially in E lines.},
  author       = {De Castro Barbosa Rodrigues Barata, Carolina and Snook, Rhonda R. and Ritchie, Michael G. and Kosiol, Carolin},
  issn         = {1759-6653},
  journal      = {Genome biology and evolution},
  number       = {7},
  publisher    = {Oxford Academic},
  title        = {{Selection on the fly: Short-term adaptation to an altered sexual selection regime in Drosophila pseudoobscura}},
  doi          = {10.1093/gbe/evad113},
  volume       = {15},
  year         = {2023},
}

@article{13261,
  abstract     = {Chromosomes in the eukaryotic nucleus are highly compacted. However, for many functional processes, including transcription initiation, the pairwise motion of distal chromosomal elements such as enhancers and promoters is essential and necessitates dynamic fluidity. Here, we used a live-imaging assay to simultaneously measure the positions of pairs of enhancers and promoters and their transcriptional output while systematically varying the genomic separation between these two DNA loci. Our analysis reveals the coexistence of a compact globular organization and fast subdiffusive dynamics. These combined features cause an anomalous scaling of polymer relaxation times with genomic separation leading to long-ranged correlations. Thus, encounter times of DNA loci are much less dependent on genomic distance than predicted by existing polymer models, with potential consequences for eukaryotic gene expression.},
  author       = {Brückner, David and Chen, Hongtao and Barinov, Lev and Zoller, Benjamin and Gregor, Thomas},
  issn         = {1095-9203},
  journal      = {Science},
  number       = {6652},
  pages        = {1357--1362},
  publisher    = {American Association for the Advancement of Science},
  title        = {{Stochastic motion and transcriptional dynamics of pairs of distal DNA loci on a compacted chromosome}},
  doi          = {10.1126/science.adf5568},
  volume       = {380},
  year         = {2023},
}

@inproceedings{13262,
  abstract     = {Determining the degree of inherent parallelism in classical sequential algorithms and leveraging it for fast parallel execution is a key topic in parallel computing, and detailed analyses are known for a wide range of classical algorithms. In this paper, we perform the first such analysis for the fundamental Union-Find problem, in which we are given a graph as a sequence of edges, and must maintain its connectivity structure under edge additions. We prove that classic sequential algorithms for this problem are well-parallelizable under reasonable assumptions, addressing a conjecture by [Blelloch, 2017]. More precisely, we show via a new potential argument that, under uniform random edge ordering, parallel union-find operations are unlikely to interfere: T concurrent threads processing the graph in parallel will encounter memory contention O(T2 · log |V| · log |E|) times in expectation, where |E| and |V| are the number of edges and nodes in the graph, respectively. We leverage this result to design a new parallel Union-Find algorithm that is both internally deterministic, i.e., its results are guaranteed to match those of a sequential execution, but also work-efficient and scalable, as long as the number of threads T is O(|E|1 over 3 - ε), for an arbitrarily small constant ε > 0, which holds for most large real-world graphs. We present lower bounds which show that our analysis is close to optimal, and experimental results suggesting that the performance cost of internal determinism is limited.},
  author       = {Fedorov, Alexander and Hashemi, Diba and Nadiradze, Giorgi and Alistarh, Dan-Adrian},
  booktitle    = {Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures},
  isbn         = {9781450395458},
  location     = {Orlando, FL, United States},
  pages        = {261--271},
  publisher    = {Association for Computing Machinery},
  title        = {{Provably-efficient and internally-deterministic parallel Union-Find}},
  doi          = {10.1145/3558481.3591082},
  year         = {2023},
}

@article{13263,
  abstract     = {Motivation: Boolean networks are simple but efficient mathematical formalism for modelling complex biological systems. However, having only two levels of activation is sometimes not enough to fully capture the dynamics of real-world biological systems. Hence, the need for multi-valued networks (MVNs), a generalization of Boolean networks. Despite the importance of MVNs for modelling biological systems, only limited progress has been made on developing theories, analysis methods, and tools that can support them. In particular, the recent use of trap spaces in Boolean networks made a great impact on the field of systems biology, but there has been no similar concept defined and studied for MVNs to date.

Results: In this work, we generalize the concept of trap spaces in Boolean networks to that in MVNs. We then develop the theory and the analysis methods for trap spaces in MVNs. In particular, we implement all proposed methods in a Python package called trapmvn. Not only showing the applicability of our approach via a realistic case study, we also evaluate the time efficiency of the method on a large collection of real-world models. The experimental results confirm the time efficiency, which we believe enables more accurate analysis on larger and more complex multi-valued models.},
  author       = {Trinh, Van Giang and Benhamou, Belaid and Henzinger, Thomas A and Pastva, Samuel},
  issn         = {1367-4811},
  journal      = {Bioinformatics},
  number       = {Supplement_1},
  pages        = {i513--i522},
  publisher    = {Oxford Academic},
  title        = {{Trap spaces of multi-valued networks: Definition, computation, and applications}},
  doi          = {10.1093/bioinformatics/btad262},
  volume       = {39},
  year         = {2023},
}

@article{13264,
  abstract     = {We build a parametric amplifier with a Josephson field-effect transistor (JoFET) as the active element. The resonant frequency of the device is field-effect tunable over a range of 2 GHz. The JoFET amplifier has 20 dB of gain, 4 MHz of instantaneous bandwidth, and a 1-dB compression point of -125.5 dBm when operated at a fixed resonance frequency.

},
  author       = {Phan, Duc T and Falthansl-Scheinecker, Paul and Mishra, Umang and Strickland, W. M. and Langone, D. and Shabani, J. and Higginbotham, Andrew P},
  issn         = {2331-7019},
  journal      = {Physical Review Applied},
  number       = {6},
  publisher    = {American Physical Society},
  title        = {{Gate-tunable superconductor-semiconductor parametric amplifier}},
  doi          = {10.1103/PhysRevApplied.19.064032},
  volume       = {19},
  year         = {2023},
}

@article{13265,
  abstract     = {In this study, we propose a computational framework for optimizing the continuity of the toolpath in fabricating surface models on an extrusion-based 3D printer. Toolpath continuity is a critical issue that influences both the quality and the efficiency of extrusion-based fabrication. Transfer moves lead to rough and bumpy surfaces, where this phenomenon worsens for materials with large viscosity, like clay. The effects of continuity on the surface models are even more severe in terms of the quality of the surface and the stability of the model. We introduce a criterion called the one–path patch (OPP) to represent a patch on the surface of the shell that can be traversed along one path by considering the constraints on fabrication. We study the properties of the OPPs and their merging operations to propose a bottom-up OPP merging procedure to decompose the given shell surface into a minimal number of OPPs, and to generate the “as-continuous-as-possible” (ACAP) toolpath. Furthermore, we augment the path planning algorithm with a curved-layer printing scheme that reduces staircase defects and improves the continuity of the toolpath by connecting multiple segments. We evaluated the ACAP algorithm on ceramic and thermoplastic materials, and the results showed that it improves the fabrication of surface models in terms of both efficiency and surface quality.},
  author       = {Zhong, Fanchao and Xu, Yonglai and Zhao, Haisen and Lu, Lin},
  issn         = {1557-7368},
  journal      = {ACM Transactions on Graphics},
  number       = {3},
  publisher    = {Association for Computing Machinery},
  title        = {{As-Continuous-As-Possible extrusion-based fabrication of surface models}},
  doi          = {10.1145/3575859},
  volume       = {42},
  year         = {2023},
}

@article{13266,
  abstract     = {The 3′,5′-cyclic adenosine monophosphate (cAMP) is a versatile second messenger in many mammalian signaling pathways. However, its role in plants remains not well-recognized. Recent discovery of adenylate cyclase (AC) activity for transport inhibitor response 1/auxin-signaling F-box proteins (TIR1/AFB) auxin receptors and the demonstration of its importance for canonical auxin signaling put plant cAMP research back into spotlight. This insight briefly summarizes the well-established cAMP signaling pathways in mammalian cells and describes the turbulent and controversial history of plant cAMP research highlighting the major progress and the unresolved points. We also briefly review the current paradigm of auxin signaling to provide a background for the discussion on the AC activity of TIR1/AFB auxin receptors and its potential role in transcriptional auxin signaling as well as impact of these discoveries on plant cAMP research in general.},
  author       = {Qi, Linlin and Friml, Jiří},
  issn         = {1469-8137},
  journal      = {New Phytologist},
  number       = {2},
  pages        = {489--495},
  publisher    = {Wiley},
  title        = {{Tale of cAMP as a second messenger in auxin signaling and beyond}},
  doi          = {10.1111/nph.19123},
  volume       = {240},
  year         = {2023},
}

@article{13267,
  abstract     = {Three-dimensional (3D) reconstruction of living brain tissue down to an individual synapse level would create opportunities for decoding the dynamics and structure–function relationships of the brain’s complex and dense information processing network; however, this has been hindered by insufficient 3D resolution, inadequate signal-to-noise ratio and prohibitive light burden in optical imaging, whereas electron microscopy is inherently static. Here we solved these challenges by developing an integrated optical/machine-learning technology, LIONESS (live information-optimized nanoscopy enabling saturated segmentation). This leverages optical modifications to stimulated emission depletion microscopy in comprehensively, extracellularly labeled tissue and previous information on sample structure via machine learning to simultaneously achieve isotropic super-resolution, high signal-to-noise ratio and compatibility with living tissue. This allows dense deep-learning-based instance segmentation and 3D reconstruction at a synapse level, incorporating molecular, activity and morphodynamic information. LIONESS opens up avenues for studying the dynamic functional (nano-)architecture of living brain tissue.},
  author       = {Velicky, Philipp and Miguel Villalba, Eder and Michalska, Julia M and Lyudchik, Julia and Wei, Donglai and Lin, Zudi and Watson, Jake and Troidl, Jakob and Beyer, Johanna and Ben Simon, Yoav and Sommer, Christoph M and Jahr, Wiebke and Cenameri, Alban and Broichhagen, Johannes and Grant, Seth G.N. and Jonas, Peter M and Novarino, Gaia and Pfister, Hanspeter and Bickel, Bernd and Danzl, Johann G},
  issn         = {1548-7105},
  journal      = {Nature Methods},
  pages        = {1256--1265},
  publisher    = {Springer Nature},
  title        = {{Dense 4D nanoscale reconstruction of living brain tissue}},
  doi          = {10.1038/s41592-023-01936-6},
  volume       = {20},
  year         = {2023},
}

@article{13268,
  abstract     = {We give a simple argument to prove Nagai’s conjecture for type II degenerations of compact hyperkähler manifolds and cohomology classes of middle degree. Under an additional assumption, the techniques yield the conjecture in arbitrary degree. This would complete the proof of Nagai’s conjecture in general, as it was proved already for type I degenerations by Kollár, Laza, Saccà, and Voisin [10] and independently by Soldatenkov [18], while it is immediate for type III degenerations. Our arguments are close in spirit to a recent paper by Harder [8] proving similar results for the restrictive class of good degenerations.},
  author       = {Huybrechts, D. and Mauri, Mirko},
  issn         = {1945-001X},
  journal      = {Mathematical Research Letters},
  number       = {1},
  pages        = {125--141},
  publisher    = {International Press},
  title        = {{On type II degenerations of hyperkähler manifolds}},
  doi          = {10.4310/mrl.2023.v30.n1.a6},
  volume       = {30},
  year         = {2023},
}

@article{13269,
  abstract     = {This paper is a collection of results on combinatorial properties of codes for the Z-channel . A Z-channel with error fraction τ takes as input a length- n binary codeword and injects in an adversarial manner up to n τ asymmetric errors, i.e., errors that only zero out bits but do not flip 0’s to 1’s. It is known that the largest ( L - 1)-list-decodable code for the Z-channel with error fraction τ has exponential size (in n ) if τ is less than a critical value that we call the ( L - 1)- list-decoding Plotkin point and has constant size if τ is larger than the threshold. The ( L -1)-list-decoding Plotkin point is known to be L -1/L-1 – L -L/ L-1 , which equals 1/4 for unique-decoding with L -1 = 1. In this paper, we derive various results for the size of the largest codes above and below the list-decoding Plotkin point. In particular, we show that the largest ( L -1)-list-decodable code ε-above the Plotkin point, for any given sufficiently small positive constant ε > 0, has size Θ L (ε -3/2 ) for any L - 1 ≥ 1. We also devise upper and lower bounds on the exponential size of codes below the list-decoding Plotkin point.},
  author       = {Polyanskii, Nikita and Zhang, Yihan},
  issn         = {1557-9654},
  journal      = {IEEE Transactions on Information Theory},
  number       = {10},
  pages        = {6340--6357},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Codes for the Z-channel}},
  doi          = {10.1109/TIT.2023.3292219},
  volume       = {69},
  year         = {2023},
}

@article{13270,
  abstract     = {Consider a geodesic triangle on a surface of constant curvature and subdivide it recursively into four triangles by joining the midpoints of its edges. We show the existence of a uniform δ>0
 such that, at any step of the subdivision, all the triangle angles lie in the interval (δ,π−δ)
. Additionally, we exhibit stabilising behaviours for both angles and lengths as this subdivision progresses.},
  author       = {Brunck, Florestan R},
  issn         = {1432-0444},
  journal      = {Discrete and Computational Geometry},
  number       = {3},
  pages        = {1059--1089},
  publisher    = {Springer Nature},
  title        = {{Iterated medial triangle subdivision in surfaces of constant curvature}},
  doi          = {10.1007/s00454-023-00500-5},
  volume       = {70},
  year         = {2023},
}

@article{13271,
  abstract     = {In this paper, we prove the convexity of trace functionals (A,B,C)↦Tr|BpACq|s,
for parameters (p, q, s) that are best possible, where B and C are any n-by-n positive-definite matrices, and A is any n-by-n matrix. We also obtain the monotonicity versions of trace functionals of this type. As applications, we extend some results in Carlen et al. (Linear Algebra Appl 490:174–185, 2016), Hiai and Petz (Publ Res Inst Math Sci 48(3):525-542, 2012) and resolve a conjecture in Al-Rashed and Zegarliński (Infin Dimens Anal Quantum Probab Relat Top 17(4):1450029, 2014) in the matrix setting. Other conjectures in Al-Rashed and Zegarliński (Infin Dimens Anal Quantum Probab Relat Top 17(4):1450029, 2014) will also be discussed. We also show that some related trace functionals are not concave in general. Such concavity results were expected to hold in different problems.},
  author       = {Zhang, Haonan},
  issn         = {1424-0637},
  journal      = {Annales Henri Poincare},
  publisher    = {Springer Nature},
  title        = {{Some convexity and monotonicity results of trace functionals}},
  doi          = {10.1007/s00023-023-01345-7},
  year         = {2023},
}

@article{13274,
  abstract     = {Viscous flows through pipes and channels are steady and ordered until, with increasing velocity, the laminar motion catastrophically breaks down and gives way to turbulence. How this apparently discontinuous change from low- to high-dimensional motion can be rationalized within the framework of the Navier-Stokes equations is not well understood. Exploiting geometrical properties of transitional channel flow we trace turbulence to far lower Reynolds numbers (Re) than previously possible and identify the complete path that reversibly links fully turbulent motion to an invariant solution. This precursor of turbulence destabilizes rapidly with Re, and the accompanying explosive increase in attractor dimension effectively marks the transition between deterministic and de facto stochastic dynamics.},
  author       = {Paranjape, Chaitanya S and Yalniz, Gökhan and Duguet, Yohann and Budanur, Nazmi B and Hof, Björn},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  keywords     = {General Physics and Astronomy},
  number       = {3},
  publisher    = {American Physical Society},
  title        = {{Direct path from turbulence to time-periodic solutions}},
  doi          = {10.1103/physrevlett.131.034002},
  volume       = {131},
  year         = {2023},
}

@misc{13275,
  abstract     = {We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost.},
  author       = {Rammelmüller, Lukas and Huber, David and Volosniev, Artem},
  publisher    = {SciPost Foundation},
  title        = {{Codebase release 1.0 for FermiFCI}},
  doi          = {10.21468/scipostphyscodeb.12-r1.0},
  year         = {2023},
}

