@article{21248,
  abstract     = {Camera-type eyes in vertebrates and cephalopods are striking examples of parallel evolution of a complex structure. While comparisons have focused on these two groups, camera-type eyes with likely high functionality are also found in other invertebrate phyla with simpler brains. Employing single-cell RNA sequencing, we identify neurogenic cells in the adult eyes and brain of the marine annelid worm Platynereis dumerilii. Distinct neural stem cells in the camera-type adult eyes, located at the edge of the cup-shaped retina, and adjacent to the glass body/lens, produce radial lines of cells, reminiscent of stem cells in ciliary marginal zones of vertebrate eyes exhibiting life-long growth. Normal proliferation in the eye depends on ambient light, a phenomenon that depends on the integrity of the photoreceptor gene c-opsin1, which is present in emerging rhabdomeric photoreceptors, and impacts on their differentiation. During reproductive maturation, proliferation in the eye as well as the entire brain sharply declines, while cells upregulate molecular characteristics of mammalian adult neural stem cell quiescence. Our data provide insights into the development and modulation of annelid head and brain cells, revealing similarities and differences to vertebrate eye development, neurogenesis and brain plasticity.},
  author       = {Milivojev, Nadja and Scaramuzza, Federico and Brum, Pedro Ozório and Velastegui Gamboa, Camila L and Andreatta, Gabriele and Raible, Florian and Tessmar-Raible, Kristin},
  issn         = {2041-1723},
  journal      = {Nature Communications},
  publisher    = {Springer Nature},
  title        = {{Light-modulated stem cells in the camera-type eye of an annelid model for adult brain plasticity}},
  doi          = {10.1038/s41467-025-65631-0},
  volume       = {16},
  year         = {2025},
}

@inproceedings{21250,
  abstract     = {We investigate the step complexity of the Leader Election problem (and implementing the corresponding test-and-set object) in asynchronous shared memory, where processes communicate through registers supporting atomic read and write and must coordinate so that a single process becomes the leader. Determining tight step complexity bounds for solving this problem is one of the key open problems in the theory of shared memory distributed computing. The best known algorithm is a randomized tournament-tree, which has worst-case expected step complexity O(log N) for N processes. There are provably no deterministic wait-free algorithms, and only restricted lower bounds are known for obstruction-free and randomized wait-free algorithms. We introduce a new lower bound that establishes an Ω((log N)/(log log N + log Q)) step complexity for any obstruction-free Leader Election algorithm, where N is the number of processes, and 2 ≤ Q ≤ N is a bound on the value contention, which we define as the maximum number of different values that processes can be simultaneously poised to write to the same register in any execution of the algorithm. Our result is strictly stronger than previous bounds based on write contention. In particular, it implies new lower bounds on step complexity that depend on register size.},
  author       = {Alistarh, Dan-Adrian and Ellen, Faith and Fedorov, Alexander},
  booktitle    = {39th International Symposium on Distributed Computing},
  location     = {Berlin, Germany},
  pages        = {3:1--3:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{An almost-logarithmic lower bound for leader election with bounded value contention}},
  doi          = {10.4230/LIPIcs.DISC.2025.3},
  volume       = {356},
  year         = {2025},
}

@inbook{21257,
  abstract     = {We investigate the problem of accurate sparse fine-tuning of large language models (LLMs), that is, fine-tuning pre-trained LLMs on specialized tasks, while inducing sparsity in their weights. Our work is motivated by experiments showing that standard loss-based fine-tuning methods are not able to achieve high accuracy in this setting, especially at high sparsity targets. To address this issue, we perform a detailed study of knowledge distillation losses for fine-tuning of sparse models. We determine an L2-based distillation approach that we term ‘SquareHead’, which enables accurate recovery even at higher sparsities. Investigating the question of efficient inference, we show that sparse LLMs can be executed faster by taking advantage of sparsity. Specifically, we exhibit end-to-end results showing speedups enabled by sparsity, while recovering accuracy, on the following models and tasks, respectively: T5 for language translation, Whisper for speech translation, and open GPT-type models such as the Mosaic Pre-Trained Transformer (MPT) and Llama-2 models for text generation. In particular, for popular generative tasks, we show for the first time that sparse fine-tuning can reach 75% sparsity without drops in accuracy, and provide notable end-to-end speedups for inference on CPUs. Moreover, we also highlight that sparsity is compatible with other compression approaches, such as quantization.},
  author       = {Kurtic, Eldar and Kuznedelev, Denis and Frantar, Elias and Goinv, Michael and Pandit, Shubhra and Agarwalla, Abhinav and Nguyen, Tuan and Marques, Alexandre and Kurtz, Mark and Alistarh, Dan-Adrian},
  booktitle    = {Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques},
  editor       = {Passban, Peyman and Way, Andy and Rezagholizadeh, Mehdi},
  isbn         = {9783031857461},
  issn         = {2522-803X},
  pages        = {83--97},
  publisher    = {Springer Nature},
  title        = {{Sparse Fine-Tuning for Inference Acceleration of Large Language Models}},
  doi          = {10.1007/978-3-031-85747-8_6},
  year         = {2025},
}

@inproceedings{21281,
  abstract     = {A strategy profile in a multi-player game is a Nash equilibrium if no player can unilaterally deviate to achieve a strictly better payoff. A profile is an ε-Nash equilibrium if no player can gain more than ε by unilaterally deviating from their strategy. In this work, we use ε-Nash equilibria to approximate the computation of Nash equilibria. Specifically, we focus on turn-based, multiplayer stochastic games played on graphs, where players are restricted to stationary strategies - strategies that use randomness but not memory.
The problem of deciding the constrained existence of stationary Nash equilibria - where each player’s payoff must lie within a given interval - is known to be ∃ℝ-complete in such a setting (Hansen and Sølvsten, 2020). We extend this line of work to stationary ε-Nash equilibria and present an algorithm that solves the following promise problem: given a game with a Nash equilibrium satisfying the constraints, compute an ε-Nash equilibrium that ε-satisfies those same constraints - satisfies the constraints up to an ε additive error. Our algorithm runs in FNP^NP time.
To achieve this, we first show that if a constrained Nash equilibrium exists, then one exists where the non-zero probabilities are at least an inverse of a double-exponential in the input. We further prove that such a strategy can be encoded using floating-point representations, as in the work of Frederiksen and Miltersen (2013), which finally gives us our FNP^NP algorithm. 
We further show that the decision version of the promise problem is NP-hard. Finally, we show a partial tightness result by proving a lower bound for such techniques: if a constrained Nash equilibrium exists, then there must be one where the probabilities in the strategies are double-exponentially small.},
  author       = {Asadi, Ali and Brice, Leonard and Chatterjee, Krishnendu and Thejaswini, K. S.},
  booktitle    = {45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
  isbn         = {9783959774062},
  location     = {Pilani, India},
  pages        = {9:1--9:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{ε-stationary Nash equilibria in multi-player stochastic graph games}},
  doi          = {10.4230/lipics.fsttcs.2025.9},
  volume       = {360},
  year         = {2025},
}

@inproceedings{21327,
  abstract     = {Proteins exist as a dynamic ensemble of multiple conformations, and these motions are often crucial for their functions. However, current structure prediction methods predominantly yield a single conformation, overlooking the conformational heterogeneity revealed by diverse experimental modalities. Here, we present a framework for building experiment-grounded protein structure generative models that infer conformational ensembles consistent with measured experimental data. The key idea is to treat stateof-the-art protein structure predictors (e.g., AlphaFold3) as sequence-conditioned structural priors, and cast ensemble modeling as posterior inference of protein structures given experimental measurements. Through extensive real-data experiments, we demonstrate the generality of our method to incorporate a variety of experimental measurements. In particular, our framework uncovers previously unmodeled conformational heterogeneity from crystallographic densities, and generates high-accuracy NMR ensembles orders of magnitude faster than the status quo. Notably, we demonstrate that our ensembles outperform AlphaFold3 (Abramson et al., 2024) and sometimes better fit experimental data than publicly deposited structures to the Protein Data Bank (PDB, Burley et al. (2017)). We believe that this approach will unlock building predictive models that fully embrace experimentally observed conformational diversity.},
  author       = {Maddipatla, Sai A and Sellam, Nadav E and Bojan, Meital I and Vedula, Sanketh and Schanda, Paul and Marx, Ailie and Bronstein, Alexander},
  booktitle    = {Proceedings of the 42nd International Conference on Machine Learning},
  issn         = {2640-3498},
  location     = {Vancouver, Canada},
  pages        = {42366 -- 42393},
  publisher    = {ML Research Press},
  title        = {{Inverse problems with experiment-guided AlphaFold}},
  volume       = {267},
  year         = {2025},
}

@article{15128,
  abstract     = {We prove a universal mesoscopic central limit theorem for linear eigenvalue statistics of a Wigner-type matrix inside the bulk of the spectrum with compactly supported twice continuously differentiable test functions. The main novel ingredient is an optimal local law for the two-point function $T(z,\zeta)$  and a general class of related quantities involving two resolvents at nearby spectral parameters.},
  author       = {Riabov, Volodymyr},
  issn         = {0246-0203},
  journal      = {Annales de l'institut Henri Poincare (B) Probability and Statistics},
  number       = {1},
  pages        = {129--154},
  publisher    = {Institute of Mathematical Statistics},
  title        = {{Mesoscopic eigenvalue statistics for Wigner-type matrices}},
  doi          = {10.1214/23-AIHP1438},
  volume       = {61},
  year         = {2025},
}

@misc{18712,
  abstract     = {This file contains the code associated with the manuscript 'Effect of assortative mating and sexual selection on polygenic barriers to gene flow'. },
  author       = {Surendranadh, Parvathy and Sachdeva, Himani},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Mathematica notebook and Fortran code for 'Effect of assortative mating and sexual selection on polygenic barriers to gene flow'}},
  doi          = {10.15479/AT:ISTA:17344},
  year         = {2025},
}

@article{18879,
  abstract     = {Our brain has remarkable computational power, generating sophisticated behaviors, storing memories over an individual’s lifetime, and producing higher cognitive functions. However, little of our neuroscience knowledge covers the human brain. Is this organ truly unique, or is it a scaled version of the extensively studied rodent brain? Combining multicellular patch-clamp recording with expansion-based superresolution microscopy and full-scale modeling, we determined the cellular and microcircuit properties of the human hippocampal CA3 region, a fundamental circuit for memory storage. In contrast to neocortical networks, human hippocampal CA3 displayed sparse connectivity, providing a circuit architecture that maximizes associational power. Human synapses showed unique reliability, high precision, and long integration times, exhibiting both species- and circuit-specific properties. Together with expanded neuronal numbers, these circuit characteristics greatly enhanced the memory storage capacity of CA3. Our results reveal distinct microcircuit properties of the human hippocampus and begin to unravel the inner workings of our most complex organ. },
  author       = {Watson, Jake and Vargas Barroso, Victor M and Morse, Rebecca and Navas Olivé, Andrea C and Tavakoli, Mojtaba and Danzl, Johann G and Tomschik, Matthias and Rössler, Karl and Jonas, Peter M},
  issn         = {1097-4172},
  journal      = {Cell},
  number       = {2},
  pages        = {501--514.e18},
  publisher    = {Elsevier},
  title        = {{Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory}},
  doi          = {10.1016/j.cell.2024.11.022},
  volume       = {188},
  year         = {2025},
}

@article{18882,
  abstract     = {Ternary liquid-like thermoelectric materials have garnered significant attention due to their ultra-low lattice thermal conductivity. Among these, Ag8SnSe6 stands out for its exceptionally low sound velocity and thermal conductivity. However, the inherent poor electrical conductivity and suboptimal thermoelectric properties of Ag8SnSe6 necessitate further improvement. Here, a novel approach is initiated to enhance the thermoelectric properties of Ag8SnSe6 by combining low-dimensionalization with intrinsic doping. For the first time, this work successfully synthesizes single-phase Ag8SnSe6 nanocrystals, ≈10 nm in size, with the correct phase and composition using a robust and reliable colloidal method. This approach represents a significant improvement over previous reports on this material. Reducing the crystal domains of Ag8SnSe6 to the nanoscale induces quantum confinement effects, increasing the density of states near the Fermi surface. It also introduces additional grain boundaries, which lower the lattice thermal conductivity and simplify structural design. Moreover, incorporating small amounts of Sn nanopowder into the Ag8SnSe6 nanocrystals before consolidation further enhances the thermoelectric performance. Sn acts as a donor dopant, increasing the electronic concentration while at the same time improving their mobility by reducing interface barriers, thus significantly improving the material transport properties. Additionally, the presence of Sn leads to the formation of point defects, dislocations, and secondary phases, which increase phonon scattering and further reduce the thermal conductivity. Through this synergistic optimization, the figure of merit  shows a significant increase across a wide temperature range. Overall, a strategy is presented for the controlled preparation of Ag8SnSe6 nanocrystals, the decoupling of their electrical and thermal transport, and the practical application of this material to thermoelectric single-leg modules.},
  author       = {Zhao, Xueke and Li, Mengyao and Jia, Mochen and Fiedler, Christine and Nan, Bingfei and Yang, Dongwen and Li, Lei and Yuan, Zicheng and Song, Hongzhang and Liu, Yu and Ibáñez, Maria and Wang, Ziyu and Shan, Chongxin and Cabot, Andreu},
  issn         = {1616-3028},
  journal      = {Advanced Functional Materials},
  number       = {24},
  publisher    = {Wiley},
  title        = {{Low-dimensional structure modulation in Ag8SnSe6 for enhanced thermoelectric performance}},
  doi          = {10.1002/adfm.202421449},
  volume       = {35},
  year         = {2025},
}

@misc{18886,
  abstract     = {Research Data for publication 'Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors'},
  author       = {Janik, Marian},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Research data for publication 'Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors'}},
  doi          = {10.15479/AT:ISTA:18886},
  year         = {2025},
}

@phdthesis{18979,
  abstract     = {Topological Data Analysis (TDA) is a discipline utilizing the mathematical field of topology to study data, most prominently collections of point sets. This thesis summarizes three projects related to computations in TDA.

The first one establishes a variant of TDA for chromatic point sets, where each point is given a color. For example, we are given positions of cells within a tumor microenvironment, and color the cancerous cells red, and the immune cells blue.

The aim is then to give a quantitative description of how the two or more sets of points spatially interact. Building on image, kernel and cokernel variants of persistent homology, we suggest six-packs of persistent diagrams as such a descriptor.

We describe a construction of a chromatic alpha complex, which enables  efficient computation of several variants of the six-packs. We give topological descriptions of natural subcomplexes of the chromatic alpha complex, and show that the radii of the simplices form a discrete Morse function. Finally, we provide an implementation of the presented chromatic TDA pipeline.

The second part aims to translate a powerful tool of sheaf theory to elementary terms using labeled matrices. The goal is to enable their use in computational settings. We show that derived categories of sheaves over finite posets have, up to isomorphism, unique objects---minimal injective resolutions---and give a concrete algorithm to compute them. We further describe simple algorithms to compute derived pushforwards and pullbacks for monotonic maps, and their proper variants for inclusions, and demonstrate their tractability by providing an implementation. Finally, we suggest a discrete definition of microsupport and show desirable properties inspired by discrete Morse theory.

In the last part, we present a collection of observations about collapses. We give a characterization of collapsibility in terms of unitriangular submatrices of the boundary matrix, a cotree-tree decomposition, and the optimal solution to a variant of the Procrustes problem. We establish relation between dual collapses and relative Morse theory and pose several open questions. Finally, focusing on complexes embedded in the three-dimensional Euclidean space, we describe a relation between the collapsibility and the triviality of a polygonal knot.},
  author       = {Draganov, Ondrej},
  issn         = {2663-337X},
  keywords     = {topological data analysis, chromatic point set, alpha complex, persistent homology, six pack, sheaf, microlocal discrete Morse, injective resolution, collapse, knot, discrete Morse theory},
  pages        = {140},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Structures and computations in topological data analysis}},
  doi          = {10.15479/at:ista:18979},
  year         = {2025},
}

@misc{18991,
  abstract     = {Research data for the article "Learning reshapes the hippocampal representation hierarchy" from Chiossi et al. (PNAS, 2025). The data includes hippocampal CA1 unit activity and behaviour tracking of 5 Long Evans rats during the learning of an associative memory task. Detailed information can be found in the 'readme.txt' file.},
  author       = {Chiossi, Heloisa},
  keywords     = {hippocampus, electrophysiology, behavior},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Research data for the publication "Learning reshapes the hippocampal representation hierarchy"}},
  doi          = {10.15479/AT:ISTA:18991},
  year         = {2025},
}

@phdthesis{19048,
  abstract     = {Rotations are found in physics problems at all scales: from spatial motion of celestial bodies, to transitions between quantum states of atoms and molecules. Mathematically, they represent a fundamental class of transformations and symmetries. Unlike spatial displacements, rotational transformations in three-dimensional space  are non-commutative: the result of applying a sequence of rotations depends on the order of these operations. This feature makes the emergent physics that involves rotations rather intricate, but instrumental for studies of highly-interconnected many-body systems. In the presence of an environment, rotational properties of an object change, due to the interaction with particles of the environment. Owing to the complexity of this interaction, it can be engineered to exhibit certain properties of interest. In this Thesis, we examine several scenarios of how the rotational behavior of an impurity can be modified by interactions with its environment.},
  author       = {Maslov, Mikhail},
  issn         = {2663-337X},
  pages        = {86},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Emergent physics of rotating quantum impurities in many-body environments}},
  doi          = {10.15479/at:ista:19048},
  year         = {2025},
}

@article{19066,
  abstract     = {We present a sample of 1956 individual stellar clumps at redshift 0.7 < z < 10, detected with JWST/NIRCam in 476 galaxies lensed by the galaxy cluster Abell2744. The lensed clumps present magnifications ranging between μ = 1.8 and μ = 300. We perform simultaneous size-photometry estimates in 20 JWST/NIRCam median and broad-band filters from 0.7 to 5 μm.
Spectral energy distribution (SED) fitting analyses enable us to recover the physical properties of the clumps. The majority of the clumps are spatially resolved and have effective radii in the range Reff = 10–700 pc. We restrict this first study to the 1751 post-reionization era clumps with redshift < 5.5. We find a significant evolution of the average clump ages, star formation rates (SFRs), SFR surface densities, and metallicity with increasing redshift, while median stellar mass and stellar mass surface densities are similar in the probed redshift range. We observe a strong correlation between the clump properties and the properties of their host galaxies, with more massive galaxies hosting more massive and older clumps. We find that clumps closer to their host galactic centre are on average more massive, while their ages do not show clear sign of migration. We find that clumps at cosmic noon sample the upper-mass end of the mass function to higher masses than at z > 3, reflecting the rapid increase towards the peak of the cosmic star formation history. We conclude that the results achieved over the studied redshift range are in agreement with expectation of in situ clump formation scenario from large-scale disc fragmentation. },
  author       = {Claeyssens, Adélaïde and Adamo, Angela and Messa, Matteo and Dessauges-Zavadsky, Miroslava and Richard, Johan and Kramarenko, Ivan and Matthee, Jorryt J and Naidu, Rohan P.},
  issn         = {1365-2966},
  journal      = {Monthly Notices of the Royal Astronomical Society},
  number       = {3},
  pages        = {2535--2558},
  publisher    = {Oxford University Press},
  title        = {{Tracing star formation across cosmic time at tens of parsec-scales in the lensing cluster field Abell 2744}},
  doi          = {10.1093/mnras/staf058},
  volume       = {537},
  year         = {2025},
}

@article{19067,
  abstract     = {Modern experimental methods enable the creation of self-assembly building blocks with tunable interactions, but optimally exploiting this tunability for the self-assembly of desired structures remains an important challenge. Many studies of this inverse problem start with the so-called fully addressable limit, where every particle in a target structure is different. This leads to clear design principles that often result in high assembly yield, but it is not a scalable approach—at some point, one must grapple with “reusing” building blocks, which lowers the degree of addressability and may cause a multitude of off-target structures to form, complicating the design process. Here, we solve a key obstacle preventing robust inverse design in the “semiaddressable regime” by developing a highly efficient algorithm that enumerates all structures that can be formed from a given set of building blocks. By combining this with established partition-function-based yield calculations, we show that it is almost always possible to find economical semiaddressable designs where the entropic gain from reusing building blocks outweighs the presence of off-target structures and even increases the yield of the target. Thus, not only does our enumeration algorithm enable robust and scalable inverse design in the semiaddressable regime, our results demonstrate that it is possible to operate in this regime while maintaining the level of control often associated with full addressability.},
  author       = {Hübl, Maximilian and Goodrich, Carl Peter},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  number       = {5},
  publisher    = {American Physical Society},
  title        = {{Accessing semiaddressable self-assembly with efficient structure enumeration}},
  doi          = {10.1103/PhysRevLett.134.058204},
  volume       = {134},
  year         = {2025},
}

@misc{19409,
  abstract     = {This .zip file contains the data to reproduce the figures and supplementary figures of "Exchange anisotropies in microwave-driven singlet-triplet qubits" by Jaime Saez-Mollejo et al.
},
  author       = {Saez Mollejo, Jaime},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Exchange anisotropies in microwave-driven singlet-triplet qubits}},
  doi          = {10.15479/AT:ISTA:19409},
  year         = {2025},
}

@article{19531,
  abstract     = {In standard quantum electrodynamics (QED), the so-called non-minimal (Pauli) coupling is suppressed for elementary particles and has no physical implications. Here, we show that the Pauli term naturally appears in a known family of Dirac materials—the lead-halide perovskites, suggesting a novel playground for the study of analog QED effects. We outline measurable manifestations of the Pauli term in the phenomena pertaining to (i) relativistic corrections to bound states (ii) the Klein paradox, and (iii) spin effects in scattering. In particular, we demonstrate that (a) the binding energy of an electron in the vicinity of a positively charged defect is noticeably decreased due to the polarizability of lead ions and the appearance of a Darwin-like term, (b) strong spin-orbit coupling due to the Pauli term affects the exciton states, and (c) scattering of an electron off an energy barrier with broken mirror symmetry produces spin polarization in the outgoing current. Our study adds to the understanding of quantum phenomena in lead-halide perovskites and paves the way for tabletop simulations of analog Dirac-Pauli equations.},
  author       = {Shiva Kumar, Abhishek and Maslov, Mikhail and Lemeshko, Mikhail and Volosniev, Artem and Alpichshev, Zhanybek},
  issn         = {2397-4648},
  journal      = {npj Quantum Materials},
  publisher    = {Springer Nature},
  title        = {{Massive Dirac-Pauli physics in lead-halide perovskites}},
  doi          = {10.1038/s41535-025-00754-7},
  volume       = {10},
  year         = {2025},
}

@phdthesis{19557,
  author       = {Schwarz, Lena A},
  issn         = {2663-337X},
  pages        = {124},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Mapping developmental dynamics of autism spectrum disorder mouse models at single-cell resolution}},
  doi          = {10.15479/AT-ISTA-19557},
  year         = {2025},
}

@article{19617,
  abstract     = {In this article, we propose a method for generating single microwave photons in superconducting circuits. We theoretically show that pure single microwave photons can be generated on demand and tuned over a large frequency band by making use of Landau-Zener transitions under a rapid sweep of a control parameter. We devise a protocol that enables fast control of the frequency of the emitted photon over two octaves, without requiring extensive calibration. Additionally, we make theoretical estimates of the generation efficiency, tunability, purity, and linewidth of the photons emitted using this method for both charge- and flux-qubit-based architectures. We also provide estimates of the optimal device parameters required for these architectures to realize the device.},
  author       = {Hawaldar, Samarth and Khaire, Siddhi Satish and Delsing, Per and Suri, Baladitya},
  issn         = {2331-7019},
  journal      = {Physical Review Applied},
  number       = {4},
  publisher    = {American Physical Society},
  title        = {{On-demand single-microwave-photon source in a superconducting circuit with wideband frequency tunability}},
  doi          = {10.1103/physrevapplied.23.044042},
  volume       = {23},
  year         = {2025},
}

@article{19621,
  abstract     = {In this paper we obtain a complete description of all indecomposable characters (central positive-definite functions) of inductive limits of the symmetric groups under block diagonal embedding. As a corollary we obtain the full classification of the isomorphism classes of these inductive limits.},
  author       = {Nessonov, Nikolay and Ngo, Nhok T},
  issn         = {1088-4165},
  journal      = {Representation Theory},
  number       = {8},
  pages        = {256--288},
  publisher    = {American Mathematical Society},
  title        = {{Indecomposable characters of inductive limits of symmetric groups}},
  doi          = {10.1090/ert/689},
  volume       = {29},
  year         = {2025},
}