Tootfinder

Torus knots in adjoint representation and Vogel's universality
Liudmila Bishler, Andrei Mironov
https://arxiv.org/abs/2506.06219 https://

Torus knots in adjoint representation and Vogel's universality
Vogel's universality gives a unified description of the adjoint sector of representation theory for simple Lie algebras in terms of three parameters $α,β,γ$, which are homogeneous coordinates of Vogel's plane. It is associated with representation theory within the framework of Chern-Simons theory only, and gives rise to universal knot invariants. We extend the list of these latter further, and explain how to deal with the adjoint invariants for the torus knots $T[m,n]$ considering the case o…

A necessary condition for liftings of positive characteristic varieties with finite fundamental groups
Ruida Di, Runjie Hu, Siqing Zhang
https://arxiv.org/abs/2506.07914

A necessary condition for liftings of positive characteristic varieties with finite fundamental groups
In this paper, we introduce a necessary condition for the existence of characteristic zero liftings of certain smooth, proper varieties in positive characteristic, using étale homotopy theory and Wall's finiteness obstruction. For a variety with finite étale fundamental group pi, we define a notion of mod-l finite dominatedness based on the F_l-chain complex of the universal cover of its l-profinite étale homotopy type. We prove that such a variety can be lifted to characteristic zero only i…

Deep reinforcement learning for near-deterministic preparation of cubic- and quartic-phase gates in photonic quantum computing
Amanuel Anteneh L\'eandre Brunel, Carlos Gonz\'alez-Arciniegas, Olivier Pfister
https://arxiv.org/abs/2506.07859

Deep reinforcement learning for near-deterministic preparation of cubic- and quartic-phase gates in photonic quantum computing
Cubic-phase states are a sufficient resource for universal quantum computing over continuous variables. We present results from numerical experiments in which deep neural networks are trained via reinforcement learning to control a quantum optical circuit for generating cubic-phase states, with an average success rate of 96%. The only non-Gaussian resource required is photon-number-resolving measurements. We also show that the exact same resources enable the direct generation of a quartic-phase…

Universal Mass Equation for Equal-Quantum Excited-States Sets II
L. David Roper (VTech), Igor Strakovsky (GWU)
https://arxiv.org/abs/2506.06496 https://

Universal Mass Equation for Equal-Quantum Excited-States Sets II
We extend our recent study of the universal mass equation for equal-quantum excited-states sets reported by Roper and Strakovsky~\cite{Roper:2024ovj}. The masses of twelve baryon sets and sixteen meson sets, with only two equal-quantum excited states in each set, using Breit-Wigner PDG2024 masses and their uncertainties at fixed $J^P$ for baryons and $J^{PC}$ for mesons, are fitted by a simple one-parameter logarithmic function, $M_n = αLn(n) + M_1$, where $n$ is the level of radial excitation…

Electrically reconfigurable extended lasing state in an organic liquid-crystal microcavity
Dmitriy Dovzhenko (School of Physics and Astronomy, University of Southampton, Southampton, United Kingdom), Luciano Siliano Ricco (Science Institute, University of Iceland, Reykjavik, Iceland), Krzysztof Sawicki (School of Physics and Astronomy, University of Southampton, Southampton, United Kingdom), Marcin Muszy\'nski (Institute of Experimental Physics, Faculty of Physics, University of Wa…

Electrically reconfigurable extended lasing state in an organic liquid-crystal microcavity
Small-footprint, low-power arrays of coupled coherent emitters with the capability of near- and far-field engineering and coherence control are highly sought after to meet modern nanophotonics evolving needs. Between existing solutions based on vertical-cavity surface-emitting lasers, phase masks in bulk traditional cavity-based systems, and lattices of exciton-polariton condensates, only the strongly light-matter coupled systems were shown to be capable of controlled on-chip interaction betwee…

Not sure if those work with a prepaid sim card on a modem (nor if it’s legal to setup such an answering machine on one of them here), but I’ll do some research on it
As for voip numbers, no idea how those work and if they’re universal or if I have to get one from a provider explicitly made for Asterisk compatibility, but they seem quite expensive (specially since the prepaid ones would be basically free since it’s only for receiving calls from nerds, not making calls) anyway.

Low-Resource Domain Adaptation for Speech LLMs via Text-Only Fine-Tuning
Yangui Fang, Jing Peng, Xu Li, Yu Xi, Chengwei Zhang, Guohui Zhong, Kai Yu
https://arxiv.org/abs/2506.05671

Low-Resource Domain Adaptation for Speech LLMs via Text-Only Fine-Tuning
Recent advances in automatic speech recognition (ASR) have combined speech encoders with large language models (LLMs) through projection, forming Speech LLMs with strong performance. However, adapting them to new domains remains challenging, especially in low-resource settings where paired speech-text data is scarce. We propose a text-only fine-tuning strategy for Speech LLMs using unpaired target-domain text without requiring additional audio. To preserve speech-text alignment, we introduce a …

SpeechVerifier: Robust Acoustic Fingerprint against Tampering Attacks via Watermarking
Lingfeng Yao (University of Houston), Chenpei Huang (University of Houston), Shengyao Wang (Waseda University), Junpei Xue (Waseda University), Hanqing Guo (University of Hawaii at M\=anoa), Jiang Liu (Waseda University), Xun Chen (Independent Researcher), Miao Pan (University of Houston)

SpeechVerifier: Robust Acoustic Fingerprint against Tampering Attacks via Watermarking
With the surge of social media, maliciously tampered public speeches, especially those from influential figures, have seriously affected social stability and public trust. Existing speech tampering detection methods remain insufficient: they either rely on external reference data or fail to be both sensitive to attacks and robust to benign operations, such as compression and resampling. To tackle these challenges, we introduce SpeechVerifer to proactively verify speech integrity using only the …

Only the Ambidextrous Can Flock: Two-dimensional Chiral Malthusian Flocks, Time crystals, and the KPZ Equation
Leiming Chen, Chiu Fan Lee, John Toner
https://arxiv.org/abs/2506.03488

Only the Ambidextrous Can Flock: Two-dimensional Chiral Malthusian Flocks, Time crystals, and the KPZ Equation
We study two-dimensional chiral dry Malthusian flocks; that is, chiral polar-ordered active matter with neither number nor momentum conservation. In the absence of fluctuations, these form a "time crystal", in which the velocity rotates uniformly at a fixed frequency. Fluctuations are described by the (2+1)-Kardar-Parisi-Zhang (KPZ) equation, which implies short-ranged orientational order. For weak chirality, the system is in the linear regime of the KPZ equation for a wide range of length scal…

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
Jakub {\L}\k{a}cki, Slobodan Mitrovi\'c, Srikkanth Ramachandran, Wen-Horng Sheu
https://arxiv.org/abs/2506.04524

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
We study the allocation problem in the Massively Parallel Computation (MPC) model. This problem is a special case of $b$-matching, in which the input is a bipartite graph with capacities greater than $1$ in only one part of the bipartition. We give a $(1+ε)$ approximate algorithm for the problem, which runs in $\tilde{O}(\sqrt{\log λ})$ MPC rounds, using sublinear space per machine and $\tilde{O}(λn)$ total space, where $λ$ is the arboricity of the input graph. Our result is obtained by pro…