Tootfinder

Packaging of Low-Environmental-Sensitivity WGM Resonators for Practical Applications
Jiajun Wu, Xuanqi Wang, Chengyu Zhang, Chenghong Li, Shan Zhong, Songbai Kang
https://arxiv.org/abs/2510.10939

Packaging of Low-Environmental-Sensitivity WGM Resonators for Practical Applications
We present a prism-coupled packaging strategy for whispering-gallery mode resonators (WGMRs). Utilizing an all-solid-state optical adhesive process with active temperature control and hermetic sealing, the package exhibits exceptional long-term stability and environmental robustness. A standalone WGMR module was characterized, demonstrating a temperature sensitivity below 10^-7 /°C and a low-frequency Z-axis acceleration sensitivity below 10^-10 /g. The module was applied as a stable optical f…

Protoplanetary disc population synthesis I. Constraining disc parameters to reproduce disc observations
Jose L. Gomez, Octavio M. Guilera, Marcelo M. Miller Bertolami, Elisa Castro-Mart\'inez, Mar\'ia Paula Ronco
https://arxiv.org/abs/2510.06978

Protoplanetary disc population synthesis I. Constraining disc parameters to reproduce disc observations
Context. Protoplanetary discs are the birthplaces of planets. Recent studies highlight the role of stellar mass sampling in determining disc lifetimes from the observed fraction of stars with discs. Low-mass stars tend to host longer-lived discs, allowing planet formation via solid accretion. Observations also reveal a strong correlation between stellar (and substellar) mass and accretion rate, typically following $\dot{M}\propto M_\star^2$. Aims. We aim to identify the optimal parameters of a …

Some bounds on the number of non isomorphic cyclic k-cycle systems of the complete graph
Lotrenzo Mella, Gloria Rinaldi
https://arxiv.org/abs/2509.24015 https://

Some bounds on the number of non isomorphic cyclic k-cycle systems of the complete graph
In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod $6$). For each odd $k > 3$ we also find lower bounds for the number of non isomorphic cyclic $k$-cycle systems of a complete graph.