AI for Science

Equitable access to essential urban services is a pillar of modern planning, yet most accessibility models rely strictly on static residential locations, ignoring how demand shifts throughout the daily loop. This study introduces a population-based, temporally differentiated framework to examine the resulting "moving target" of urban equity, focusing on medical facilities and green spaces in Hefei, China. Utilising large-scale mobile phone GPS data, we construct dynamic residential and workplace population exposure surfaces to capture shifting hourly demand. We then evaluate accessibility via network-based travel times paired with a novel per-capita provision metric that accounts for real-time demand competition. We define \textit{double disadvantage} as the co-occurrence of poor spatial accessibility and insufficient per-capita service availability. Counterintuitively, the results reveal that double-disadvantaged areas cluster primarily along the inner suburban belt rather than the remote periphery, where per-capita service provision remains relatively sufficient. Furthermore, temporal shifts drastically alter equity landscapes: daytime workplace concentrations intensely exacerbate demand competition in urban job centres. These findings demonstrate that urban inequality depends heavily on spatiotemporal population flows rather than just the fixed location of services. Ultimately, achieving true urban equity requires dynamic planning interventions that address time-varying demand rather than focusing solely on static, home-based metrics.

Increasing optical communication capacity without proportionally increasing receiver complexity remains a key challenge for direct-detection links. Conventional systems typically assign wavelength, polarization and intensity to fixed, separately recovered functions, so that alphabet expansion is accompanied by additional demultiplexing, polarization handling, receiver branches and electronic processing. Here we introduce a unified resource-pool architecture for high-dimensional direct-detection optical communication, in which wavelength, polarization and intensity are jointly organized as a composite optical symbol space and recovered through optical-domain joint projection rather than dimension-by-dimension separation. The receiver is implemented with an integrated disordered photonic processor that transforms each composite optical state into a reproducible multi-output electrical fingerprint for single-shot direct recovery. In a dual-wavelength transmission experiment, the system resolves 4096 composite symbols, corresponding to 12 bits per symbol slot, with a bit error rate of 4.25e-4 after 10 km standard-fiber transmission. Additional experiments demonstrate dense polarization alphabets, wavelength-indexed state-space expansion and high-launch-power operation over hollow-core fiber. These results establish disorder-enabled joint projection in an integrated photonic processor as a route to hardware-efficient high-dimensional direct-detection communication beyond conventional dimension-partitioned receiver architecture.

In the last years, an anomalously high spreading of West Nile virus (WNV) has been observed in Italy, with particularly high peaks of infections in southern Lazio, Campania and Veneto regions. The main disease vector for WNV is represented by Culex pipiens mosquitoes, which spread human infections through their bites. Here, we investigate WNV fever epidemic diffusion during summer season 2025 in Italy through a computational approach based on a quantum version of the Game of Life (GOL) cellular automaton model. Specifically, human dynamics evolves according to the GOL rules, while stochastic dynamics of disease vectors, i.e., mosquitoes, as well as their interaction with humans, simultaneously occur. We show that this model fits the curves of cumulative infected individuals with high accuracy, either at local and average-regional level, with only optimization of mosquito birth and removal rates parameters. Furthermore, leveraging model flexibility, we show that changes in model parameters values elucidate system response to environmental variations. For instance, we quantify, e.g., the impact of mosquito spreading containment measures or sudden mosquito increasing abundance due to climatic and ecological changes. Overall, we provide a general, quantitative description of WNV infection spreading in Italy which could represent a supportive tool to test different environmental scenarios and could be useful to devise strategies for decision makers to monitor disease vector dynamics and to control consequent virus diffusion.

Superconductors are many-body quantum states in which current flows without dissipation. Theory predicts that supercurrents follow a relatively simple spatial pattern in both conventional and unconventional superconductors. Recent studies into the AV3Sb5 (A = Cs, K, Rb) family of Kagome superconductors indicate that CsV3Sb5 has unconventional transport properties that cannot be accounted for with these simple theories, including reports of intrinsic Josephson junctions, higher order Cooper pairing and the zero field diode effect. Attempts to interpret these findings have focused on the interplay of superconductivity with the unconventional charge density wave (CDW) order in these materials, with which superconductivity competes. A current roadblock to understanding how these kagome superconductors give rise to their intriguing properties is the lack of spatially resolved information about transport. Here we show, using a recently developed superconducting quantum interference device (SQUID) microscope, that flakes of CsV3Sb5-xSnx host a network of narrow supercurrent channels. These supercurrent channels emerge at the critical temperature and remain stable for all temperatures and currents. Their non-linear behaviour is consistent with a network of Josephson junctions linked by narrow supercurrent filaments, which naturally leads to the observed transport anomalies. Intriguingly, these observations are much weaker in undoped samples, which suggests links to the physics of charge density waves, disorder, and electronic correlations, all of which are greatly influenced by the doping strength. These results establish new frontiers for the local investigation of charge transport and competing orders in strongly correlated electron systems, and shine a new light on the anomalous transport properties of the AV3Sb5 kagome superconductors.

We investigate terahertz (THz) harmonic generation in the InSb/CdTe heterostructure, demonstrating, for the first time, efficient in-plane magnetic field-induced second-harmonic generation (SHG). We also achieve significant third-harmonic generation (THG), rivalling Dirac materials such as graphene and Cd3As2. Our theoretical analysis identifies the primary SHG mechanism as the orbital-Zeeman correction to Drude conductivity, while the dominant THG contribution also shows Drude-like behavior. The results provide a general route to efficient THz harmonic generation in high mobility materials.

We propose a scheme for realizing thermal logic gates at the nanoscale using a phononic ring system. Two atomic sites, placed in close proximity to the ring, serve as the inputs for two-input logic operations, while a single proximity site is employed for single-input logic functionality. The logic output is encoded in the phonon transmission probability, which is calculated within the framework of non-equilibrium Green's function formalism. By appropriately tuning the ring-electrode junction configuration, all seven standard logic gates, comprising three fundamental and four combinatorial operations, are successfully realized in different phonon frequency regimes. Our results suggest that the proposed logic operations remain valid over a broad range of phonon frequencies, highlighting the generality and reliability of the proposed approach.

A magnetic skyrmion tube is a three-dimensional topological soliton formed by stacking two-dimensional skyrmions along the out-of-plane direction. Recent real-space observations of skyrmion tubes have stimulated growing interest in their dynamics and emergent properties. Here, we go beyond simple skyrmion stacking and investigate how a ``twist" introduced along the tube direction affects the dynamics and emergent responses of skyrmion tubes. We find that such a twist can be created as a localized texture, termed a twist soliton, through thermal quench dynamics. By complementarily combining large-scale numerical simulations with analytical calculations based on collective coordinates, we clarify its current-driven nonlinear motions that depend on its twist chirality. Remarkably, its velocity can be substantially enhanced by a magnetic-field component perpendicular to the tube. Furthermore, the associated emergent electric field enables identification of the twist soliton, including the sign of its chirality, through Hall measurements. Our results reveal the twist degree of freedom as an essential ingredient of skyrmion-tube physics and pave the way for the development of spintronic devices exploiting the three-dimensional nature of spin textures.

For a non-zero parameter $q$, we define Hermite trace polynomials, which are multivariate polynomials indexed by permutations. We prove several combinatorial properties for them, such as expansions and product formulas. The linear functional determined by these trace polynomials is a state for $q = \frac{1}{N}$ for $N$ a non-zero integer. For such $q$, Hermite trace polynomials of different degrees are orthogonal. The product formulas extend to the closure with respect to the state. The state can be identified with the expectation induced by the $N \times N$ Hermitian Brownian motion. Hermite trace polynomials are martingales for this Brownian motion, while the elements in the closure can be interpreted as stochastic integrals with respect to it. Using the grading on the algebra, we prove several chaos decompositions for such integrals, as well as analyze corresponding creation and annihilation operators. In the univariate, pure trace polynomial case, trace Hermite polynomials can be identified with the Hermite polynomials of matrix argument.

The sparse analogue of Szemerédi's regularity method has played a central role in the development of extremal results for random graphs. While the sparse embedding lemma (the KLR conjecture) has been resolved, the corresponding sparse counting lemma remains widely open. The conjecture, formulated by Gerke, Marciniszyn, and Steger, states that for every fixed graph $H$ and any $β>0$, there exists $\varepsilon>0$ such that the following holds. Consider a balanced blow-up of $H$ with vertex classes of size $n$, where each pair corresponding to an edge of $H$ forms an $(\varepsilon)$-regular bipartite graph with exactly $m$ edges. Assume that $m$ is above the natural threshold $m \gg n^{2-1/m_2(H)}$, then all but a $β^m$ proportion of such graphs contain at least $(1-δ)$ times the expected number of copies of $H$. In this paper, we establish the $H=K_4$ case of the conjecture.

We develop the theory of transfer and norm maps for finite group schemes, extending classical results from finite group theory to a context where induction and restriction are not necessarily bi-adjoint. In the additive setting, we construct a transfer map for both modules and $\rm Ext $ groups and prove that its surjectivity characterizes relative projectivity, establishing a generalization of Higman's criterion. In the multiplicative setting, we define a relative norm map for algebras with a group scheme action. We compare this norm with other versions in the literature, proving that it coincides with Mumford's norm for finite morphisms and on fields is a power of the classical field norm.

Given a closed, oriented Lagrangian submanifold $L$ in a Liouville domain $\overline{M}$, one can define a Maurer-Cartan element with respect to a certain $L_\infty$-structure on the string homology $\widehat{H}_\ast^{S^1}(\mathcal{L}L;\mathbb{R})$, completed with respect to the action filtration. When the first Gutt-Hutchings capacity of $\overline{M}$ is finite, and $L$ is a $K(π,1)$ space, we show that $L$ bounds a pseudoholomorphic disc of Maslov index 2. This confirms a general form of Audin's conjecture and generalizes the works of Fukaya and Irie in the case of $\mathbb{C}^n$ to a wide class of Liouville manifolds, which includes low degree smooth affine hypersurfaces in $\mathbb{C}^{n+1}$. In particular, when $\dim_\mathbb{R}(\overline{M})=6$, every closed, orientable, prime Lagrangian 3-manifold $L\subset\overline{M}$ is diffeomorphic either to a spherical space form, or $S^1\timesΣ_g$, where $Σ_g$ is a closed oriented surface.

Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this paper, we consider the problem of comparing two merge trees via the notion of interleaving distance in the metric space setting. We investigate various theoretical properties of such a metric. In particular, we show that the interleaving distance is intrinsic on the space of labeled merge trees and provide an algorithm to construct metric 1-centers for collections of labeled merge trees. We further prove that the intrinsic property of the interleaving distance also holds for the space of unlabeled merge trees. Our results are a first step toward performing statistics on graph-based topological summaries.

We study the probabilistic convergence between the mapper graph and the Reeb graph of a topological space $\mathbb{X}$ equipped with a continuous function $f: \mathbb{X} \rightarrow \mathbb{R}$. We first give a categorification of the mapper graph and the Reeb graph by interpreting them in terms of cosheaves and stratified covers of the real line $\mathbb{R}$. We then introduce a variant of the classic mapper graph of Singh et al.~(2007), referred to as the enhanced mapper graph, and demonstrate that such a construction approximates the Reeb graph of $(\mathbb{X}, f)$ when it is applied to points randomly sampled from a probability density function concentrated on $(\mathbb{X}, f)$. Our techniques are based on the interleaving distance of constructible cosheaves and topological estimation via kernel density estimates. Following Munch and Wang (2018), we first show that the mapper graph of $(\mathbb{X}, f)$, a constructible $\mathbb{R}$-space (with a fixed open cover), approximates the Reeb graph of the same space. We then construct an isomorphism between the mapper of $(\mathbb{X},f)$ to the mapper of a super-level set of a probability density function concentrated on $(\mathbb{X}, f)$. Finally, building on the approach of Bobrowski et al.~(2017), we show that, with high probability, we can recover the mapper of the super-level set given a sufficiently large sample. Our work is the first to consider the mapper construction using the theory of cosheaves in a probabilistic setting. It is part of an ongoing effort to combine sheaf theory, probability, and statistics, to support topological data analysis with random data.

Estimation-of-distribution algorithms (EDAs) are a powerful class of evolutionary methods for black-box optimization, especially when little is known about the structure of the objective. Whereas classical evolutionary algorithms rely on hand-designed mutation and crossover operators, hard to devise for unknown problem structures, and a source of bias, EDAs sidestep operator design entirely: they fit a probability distribution to the best individuals and sample the next generation from it. EDAs are well established on continuous parameter spaces, but they have not previously been generalized to sparse ones, in which most coefficients of a good solution are exactly zero. Existing sparse black-box optimizers therefore reintroduce exactly what EDAs were designed to avoid: hand-crafted sparsity operators, bi-level schemes alternating between support set and active values, zeroing thresholds, and other baked-in assumptions. We close this gap by proposing multivariate zero-inflated Gaussian (ZIG) distributions as EDA sampling laws. A latent Gaussian model with separate indicator and value dimensions represents sparsity patterns, correlations among active parameters, and the interactions between the two, so sparsity patterns and active values are optimized jointly, hierarchy-free. We show that the latent parameters of this model are identifiable from observed samples, unlike in the missing-data settings where related constructions originate, and introduce practical amortized inversion-based estimators for them. The estimators accurately recover latent correlation structures, and on the Lunar Lander benchmark the resulting ZIG-EDA converges faster and reaches higher final returns than a dense Gaussian EDA, a hand-crafted sparse evolutionary algorithm, and an ad-hoc sparse EDA, while finding controllers with only a small fraction of parameters active.

This manuscript contains preprint of a chapter under consideration for inclusion in the forthcoming third edition of {\em Cover and Thomas's Elements of Information Theory}, posted with permission from Wiley. The table of contents EIT-3 ToC of the new edition can be found at: https://docs.google.com/document/d/1L-m4oQEJw1PJhoxBeMwrrBD8S_HmvzMEkPbYvS24980/edit?usp=sharing . For feedback, please contact abbas@ee.stanford.edu Learning and information theory intersect in both model training and the characterization of fundamental performance limits. This manuscript provides a concise and accessible treatment of the first intersection, requiring only basic background in information theory and statistics at the senior undergraduate or first-year graduate level. End-of-chapter exercises make the material well suited for classroom use as well as self-study. The chapter focuses on the role of divergence measures in model training, with examples ranging from linear and logistic regression to autoregressive models, variational autoencoders, diffusion models, generative adversarial networks, and score-based models. It introduces the evidence lower bound (ELBO), f-divergences, and the Fisher divergence. In particular, the treatment of the generative diffusion model provides a more systematic and explicit derivation than is typical in the literature.

Integrated Sensing and Communication (ISAC) refers to the capability for the network to provide communications services whilst also being able to sense the environment in a scalable manner. One of the key functions of ISAC is the accurate localization of passive and mobile sensing targets. This paper introduces a novel hybrid TRP-UE sensing mechanism that improves network-based sensing performance. Evaluation results are provided using 3GPP-compliant ISAC channel models. The results demonstrate the significant benefit in complimenting TRP-based sensing with UE-assisted sensing in challenging propagation environments such as indoor factory.

Classical approximation theorems ask for a new neural network whenever the target accuracy is improved. This paper studies the opposite possibility: can the network be chosen once and for all, and can accuracy be bought only by letting it run longer? We prove that this is possible for every continuous function on [-1,1]. More precisely, each such function is uniformly approximated by the time evolution of a single ReLU recurrent neural network with fixed weights and fixed hidden dimension. The mechanism behind the construction is a new intermediate model, the Turing machine with neural units (TMNU). This model retains the algorithmic freedom needed to implement polynomial approximation schemes, while remaining rigid enough to be simulated by RNNs with explicit bounds on hidden dimension and weight magnitude. The resulting convergence rates reflect the underlying polynomial approximation rates. We complement the construction with minimax lower bounds showing that runtime is not merely a proof artifact, but an unavoidable resource in this fixed-network approximation paradigm.

Randomized sketching is a core primitive in randomized numerical linear algebra. On modern hardware architectures, in particular on GPUs, the performance of sparse sketches is limited by memory traffic and atomic accumulation rather than floating-point throughput. This makes sketching a natural target for mixed precision, provided that low-precision accumulation does not degrade the embedding quality. We study mixed-precision GPU implementations of sparse oblivious subspace embeddings, focusing on a SparseStack generalization of the GPU CountSketch kernel of Higgins et al. SparseStack improves embedding quality relative to CountSketch on coherent inputs, but its additional nonzeros per column increase atomic-update contention and reduce throughput. We therefore implement FP16 SparseStack variants using deterministic round-to-nearest, exact stochastic rounding, and dithered rounding, and compare them with FP32 SparseStack, CountSketch, mixed-precision CountSketch, and FlashSketch. Our main empirical finding is that, for the tested regimes, SparseStack embedding quality is insensitive to the FP16 rounding rule. Deterministic, stochastic, and dithered rounding FP16 SparseStack produce nearly identical subspace distortion and sketch-and-solve least-squares accuracy across incoherent, coherent, and adversarial test problems. The dominant accuracy factor is the sketch distribution rather than the quantization rule: SparseStack variants substantially improve distortion on coherent inputs, while all methods behave similarly on incoherent inputs. Since deterministic rounding has the lowest overhead, it provides the best performance--accuracy tradeoff among the FP16 SparseStack variants.

Semantic-aware communication has emerged as a transformative paradigm for next-generation communication systems, shifting the fundamental goal from transmitting bit-level symbols to reliably recovering and understanding the semantic meaning of information. Previous studies have demonstrated that representing the semantic content of source messages as graph-based structures can significantly improve communication efficiency and the accuracy of semantic inference at the receiver. However, existing solutions typically employ graphs that capture only pairwise relationships, thereby neglecting higher-order implicit correlations commonly observed in real-world scenarios, such as group interactions, multi-entity associations, and complex relational contexts. This limitation reduces semantic expressiveness and makes semantic inference susceptible to ambiguity and performance degradation, particularly under noisy or corrupted channel conditions. To address these issues, this paper proposes a novel hypergraph-based implicit semantic reasoning framework, HISR, which leverages hypergraphs to represent complex multi-entity relationships among semantic knowledge entities. In HISR, entities and their associated higher-order relations are mapped into dedicated semantic subspaces tailored to distinct relational contexts. This design not only disentangles diverse semantic interactions to mitigate the over-smoothing effects commonly found in traditional graph embedding methods but also enables robust semantic inference even when partial information loss occurs during transmission. Numerical results show that the proposed HISR achieves up to a 36.6% improvement in implicit semantic interpretation accuracy over the state-of-the-art benchmarks.

This paper investigates radio stripes (RSs) as a practical realization of generalized pinching antennas and proposes an RS-based generalized pinching-antenna (RS-GPA) framework. Unlike dielectric-waveguide-based passive pinching antennas that rely on passive coupling from a guided wave into free space, RSs employ active antenna processing units (APUs) deployed along a shared cable for local transmission, reception, and signal processing. This cable-like active architecture offers flexible installation and broad frequency applicability, while allowing selected APUs to act as discrete and controllable radiation or reception points for location-flexible wireless access. Based on the proposed RS-GPA framework, we establish the system and channel models by accounting for the distance-dependent APU-user channels. For downlink transmission, we formulate a circuit-power-aware sparse APU activation and beamforming problem and develop a reweighted group-sparse beamforming algorithm. To reveal the activation principle, we analyze the single-user downlink case and characterize when an additional APU should be activated by balancing transmit-power saving and circuit-power cost. Inspired by this insight, a geometry-guided low-complexity multiuser algorithm is proposed. For uplink transmission, we formulate a joint APU activation and user power control problem and develop a geometry-guided sparse activation design. Numerical results show that the proposed RS-GPA framework substantially reduces the total consumed power compared with benchmark schemes, while the geometry-guided algorithm achieves near-identical consumed-power performance to the group-sparse design with significantly lower runtime.

In this paper we introduce "graph linear notation" -- a complete graph invariant -- which is positioned as an alternative definition for the finite graphs. This invariant is constructed using an algorithm similar to the algorithm of finding canonical forms of graphs. Storing graph linear notation instead of a regular graph allows us to greatly simplify two major problems: the construction of illustrations for graphs with regards to possible graph symmetries, and the comparison of two graphs for isomorphism. We also demonstrate the transferability to the graph linear notations such classical graph theory concepts as colourings and graph paths.

Throughout this work, we will carry out a rigorous mathematical analysis of a class of control systems that is widely used in applications but still lacks a consistent theoretical foundation for describing the types of limit sets that may arise from its dynamics. There are applications in which, for example, a treatment for a given disease is administered until the level of diseased cells falls below a prescribed threshold C1. At that point, the treatment is suspended in order to allow the patient's organism to recover from its side effects. Subsequently, when the level of diseased cells reaches a second threshold C2 bigger than C1, the treatment is resumed, and the protocol is repeated. To the best of our knowledge, there is not a mathematical classification of such models. In this paper, we initiate what is intended to become a consistent body of literature aimed at determining the limit sets of such models. We begin with the planar case, in which two linear vector fields are active and two switching boundaries are considered. Naturally, in future developments, control systems in higher dimensions, featuring additional vector fields and more general switching manifolds, should also be considered.

The \emph{minimum positive codegree} $δ^+_{k-1}(G)$ of a $k$-graph $G$ is the minimum, over all $(k-1)$-sets that lie in at least one edge, of the number of edges containing that set. The \emph{positive codegree Turán density} of a $k$-graph family $\mathcal{F}$ is the asymptotically maximum value of $δ^+_{k-1}(G)/n$ over all $\mathcal{F}$-free $k$-graphs $G$ with $n\to\infty$ vertices. In this note, we establish a strong version of non-principality with respect to this density by proving that for every $k\ge3$ there exist two $k$-graphs $F_1$ and $F_2$ such that $$ 0<γ^+(F_1, F_2) < \min\{γ^+(F_1), γ^+(F_2)\}. $$

Nonlinear geotechnical analysis often involves complex geometries, staged construction, local failure, and mesh-dependent stress and plastic strain responses. This study develops a polygonal cell-based smoothed finite element method (CS-FEM) for nonlinear geotechnical analysis and implements it in ABAQUS through the user element subroutine. The proposed method combines Wachspress interpolation with cell-based strain smoothing, in which the smoothed strain--displacement matrix is evaluated by boundary integration over polygonal smoothing subcells. This formulation avoids direct calculation of shape-function derivatives inside polygonal elements and enables standard polygonal meshes and hybrid quadtree meshes with hanging nodes to be handled in a unified framework. Nonlinear geomaterial behavior is incorporated through incremental elasto-plastic constitutive updates, including the Mohr--Coulomb model and the Duncan--Chang model. Several benchmark and engineering examples, including a perforated plate, strip footing, core rockfill dam, tunnel excavation, and slope stability problems, are presented for verification. The results show that the proposed method accurately predicts displacement, stress, plastic strain, bearing capacity, and factor of safety, while providing improved mesh flexibility and computational efficiency for nonlinear geotechnical analysis.

Imaging flow cytometry (IFC) enables high-throughput single-cell analysis but largely relies on fluorescence labeling to obtain molecular specificity. Label-free vibrational imaging can provide intrinsic chemical contrast, yet coherent Raman-based methods interrogate only a limited axial volume, which restricts quantitative whole-cell analysis under flow. Mid-infrared photothermal (MIP) microscopy offers a promising route to overcome this limitation by combining linear mid-infrared (MIR) absorption-based chemical contrast with visible-light detection, allowing chemical imaging of a broader axial volume of each cell in a wide-field configuration. However, applying MIP microscopy to rapidly flowing cells has been difficult because conventional frame-sequential acquisition of MIR-ON and MIR-OFF images is highly susceptible to motion-induced subtraction artifacts. Here we demonstrate MIP-IFC, a label-free imaging flow cytometry platform based on single-shot nanosecond-dual-pulse MIP (SNAP-MIP) microscopy. SNAP-MIP encodes the MIR-ON and MIR-OFF states into separate holographic channels within a single camera exposure, reducing their temporal separation to 20 ns. This single-shot acquisition suppresses motion artifacts and increases the allowable sample velocity for artifact-free MIP imaging by five orders of magnitude compared with conventional frame-sequential MIP imaging. Leveraging this capability, MIP-IFC acquired chemical images at 500 frames per second and achieved a cellular event rate up to ~70 events s^-1. We demonstrate quantitative chemical discrimination of flowing microbeads and apply MIP-IFC to single-cell profiling of oleic-acid-induced lipid accumulation, adipocyte differentiation, and confluence-dependent cellular heterogeneity. These results establish MIP-IFC as a high-throughput, quantitative, label-free chemical imaging platform for single-cell phenotyping under flow.

Optical forces in focused-beam traps are generally nonconservative, yet the controlled use of this nonconservative component for airborne single-particle dynamics remains limited. We demonstrate a dual-beam optical trap in which a single aerosol can be switched between localized confinement and sustained orbital motion by tuning the relative positions of two counter-propagating foci. The axial separation controls the onset of nonconservative circulation, while the lateral offset tunes the projected orbit size and causes a monotonic change in the rotation frequency. T-matrix optical force calculations and Langevin simulations support this interpretation by showing that finite axial misalignment activates a circulating force component, whereas near-zero axial separation gives a confinement-dominated force field. Experiments confirm the predicted switching behavior through mean-square displacement and frequency measurements. We further show that the projected orbit geometry provides a particle-dependent observable, with the orbit anisotropy Ay/Ax varying systematically with aerosol diameter. The results provide a compact, low-power platform for controlled orbital dynamics of single airborne particles and for future aerosol measurements based on nonequilibrium trajectory observables.

Modeling the circadian impact of seasonal clock changing requires precise synchronization between solar and social time. This report critiques a recent study that associated disease prevalence in the United States with seasonal clock exposure. We identify a fundamental computational error in which a sign reversal of the longitudinal offset effectively inverted the US East-West axis, cross-correlating local health data with the circadian burden of hypothetical locations on the opposite side of a time zone. We outline the methodology for a correct modelization of the circadian process in the context of US geography.

Tropes are recurring narrative devices in television and film. We carry out a computational analysis of tropes in the sitcom Friends, using human-curated trope annotations from TVTropes, episode transcripts, and IMDb ratings. Because automatic trope detection remains challenging, we treat existing trope annotations as a curated analytical layer and focus on their downstream narrative and semantic functions. We first examine the relationship between episode-level trope frequency and audience reception. We find a statistically significant positive association between trope count and weighted IMDb ratings, although the modest explanatory power suggests that more than trope density alone explains audience evaluation. We then connect trope annotations to dialogue transcripts and represent trope-related dialogue using TF-IDF-based semantic features. Using PCA and k-means clustering, we group 1,954 distinct tropes into 15 semantically interpretable clusters. Chi-square analyses show that the six main characters are unevenly distributed across these clusters, with character-specific trope profiles that are broadly consistent with their established narrative identities. Finally, we project trope clusters into the ousiometric power-danger space to examine their semantic organization. The results show that "Physical and Sexual Comedy" occupies a region associated with relatively high danger, while "Revelation, Surprise, and Reaction" occupies a region associated with relatively high power. Overall, our work demonstrates a way to operationalize trope measurement and shows that identifiable trope clusters can provide holistic "distant reading" descriptions of characters and stories.

According to Born (\emph{Atomic Physics, page 103}), spectra are \emph{``quantum phenomena, which from a classical standpoint are perfectly unintelligible''}. However we illustrate results on classical calculations of infrared spectra of ionic crystals (actually LiF) which show that the situation is much more complex. Indeed it turns out that: 1) At room temperature and at higher ones (up to 1060 K) the classical computations reproduce the experimental data, even better than the \emph{presently available} quantum ones do; 2) At lower temperatures (even at 7.5 K), the classical computations reproduce pretty well the data, if one accepts the idea advanced in 1916 by Nernst (the inventor of the third principle) that zero-point energy has room in classical physics too. It is eventually pointed out that the mentioned results might be regarded as a first step towards an implementation of the Einstein Classical Program, which aims at deducing quantum physics (admittedly the correct theory) from a realistic theory. In fact, we are considering the Einstein classical program in the extreme version in which the realistic theory is just (\emph{essentially, see below}) classical electrodynamics of matter in bulk, involving phase space orbits, solutions of Newton equations. An Appendix is devoted to illustrate the Nernst approach, which concerns also the relation between equipartition and Planck's law.

We study the time-dependent triplet configuration, appearing under nonequilibrium conditions in a nanoscopic junction with two quantum dots coupled in series between superconductor and normal metallic lead. We show that in the situation, when both quantum dots are singly occupied by identical spin electrons, the on-dot electron pairing is suppressed what substantially affects the subgap charge transport. We investigate processes in which such configuration can be temporarily encountered, either due to the initial conditions or by imposing the external magnetic field. Our analytical and numerical calculations provide estimations for the temporal scales, characterizing evolution of the triplet configuration which could be manifested in the time-resolved tunneling measurements. Such nonequilibrium features of the triplet configuration might be relevant to operations on superconducting qubits, in their conventional and/or topological realizations.