Tootfinder

> Let's be clear what's happening: the person is outright baiting people using this AI slop into correcting the post, incorporating said corrections without attribution to the people who corrected the post and then took the credit for said corrections silently.
https://social.treehouse.systems/@am…

Infantile
My new card's number ends in -69.

Estimating the Self-Consistency of LLMs
Robert Nowak
https://arxiv.org/abs/2509.19489 https://arxiv.org/pdf/2509.19489

Estimating the Self-Consistency of LLMs
Systems often repeat the same prompt to large language models (LLMs) and aggregate responses to improve reliability. This short note analyzes an estimator of the self-consistency of LLMs and the tradeoffs it induces under a fixed compute budget $B=mn$, where $m$ is the number of prompts sampled from the task distribution and $n$ is the number of repeated LLM calls per prompt; the resulting analysis favors a rough split $m,n\propto\sqrt{B}$.

Geometric Autoencoder Priors for Bayesian Inversion: Learn First Observe Later
Arnaud Vadeboncoeur, Gregory Duth\'e, Mark Girolami, Eleni Chatzi
https://arxiv.org/abs/2509.19929

Geometric Autoencoder Priors for Bayesian Inversion: Learn First Observe Later
Uncertainty Quantification (UQ) is paramount for inference in engineering applications. A common inference task is to recover full-field information of physical systems from a small number of noisy observations, a usually highly ill-posed problem. Critically, engineering systems often have complicated and variable geometries prohibiting the use of standard Bayesian UQ. In this work, we introduce Geometric Autoencoders for Bayesian Inversion (GABI), a framework for learning geometry-aware genera…

Experiments on geostrophic convection: the role of the Prandtl number
Hannah M. Clercx, Rudie P. J. Kunnen
https://arxiv.org/abs/2509.20126 https://arxiv.o…

Experiments on geostrophic convection: the role of the Prandtl number
Flows at planetary scales are generally driven by buoyancy and influenced by rotation. Rotating Rayleigh-Bénard convection (RRBC) is a practical and simple model that can be used to describe these systems. In RRBC, thermally induced convection occurs, which is influenced by the constant rotation it experiences. We study RRBC in a cylinder in the geostrophic regime, where the dominant force balance is between Coriolis and pressure-gradient forces. Experiments are performed to assess the depende…

Preconditioning via Randomized Range Deflation (RandRAND)
Oleg Balabanov, Caleb Ju, Kaiwen He, Aryaman Jeendgar, Michael W. Mahoney
https://arxiv.org/abs/2509.19747 https://

Preconditioning via Randomized Range Deflation (RandRAND)
We introduce RandRAND, a new class of randomized preconditioning methods for large-scale linear systems. RandRAND deflates the spectrum via efficient orthogonal projections onto random subspaces, without computing eigenpairs or low-rank approximations. This leads to advantages in computational cost and numerical stability. We establish rigorous condition number bounds that depend only weakly on the problem size and that reduce to a small constant when the dimension of the deflated subspace is c…

Yes, exactly!
https://discuss.systems/@ricci/115687153999092934

I've never used #Signal, since I don't like the idea of an app that's in any way bound to my phone number. But these days I sometimes feel like I ought to install it just to spite all the haters.
Not that I have anyone to talk to…

A Normality Conjecture on Rational Base Number Systems
M\'elodie Andrieu, Shalom Eliahou, L\'eo Vivion
https://arxiv.org/abs/2510.11723 https://arx…

A Normality Conjecture on Rational Base Number Systems
The rational base number system, introduced by Akiyama, Frougny, and Sakarovitch in 2008, is a generalization of the classical integer base number system. Within this framework two interesting families of infinite words emerge, called minimal and maximal words. We conjecture that every minimal and maximal word is normal over an appropriate subalphabet. To support this conjecture, we present extensive numerical experiments that examine the richness threshold and the discrepancy of these words. W…

How facial recognition software rejects people with facial differences, who number an estimated 100M worldwide, blocking them from accessing essential services (Matt Burgess/Wired)
https://www.wired.com/story/when-face-recognition-doesnt-know-your-face-is-…

When Face Recognition Doesn’t Know Your Face Is a Face
An estimated 100 million people live with facial differences. As face recognition tech becomes widespread, some say they’re getting blocked from accessing essential systems and services.

A New Quantum Linear System Algorithm Beyond the Condition Number and Its Application to Solving Multivariate Polynomial Systems
Jianqiang Li
https://arxiv.org/abs/2510.05588 ht…

A New Quantum Linear System Algorithm Beyond the Condition Number and Its Application to Solving Multivariate Polynomial Systems
Given a matrix $A$ of dimension $M \times N$ and a vector $\vec{b}$, the quantum linear system (QLS) problem asks for the preparation of a quantum state $|\vec{y}\rangle$ proportional to the solution of $A\vec{y} = \vec{b}$. Existing QLS algorithms have runtimes that scale linearly with the condition number $κ(A)$, the sparsity of $A$, and logarithmically with inverse precision, but often overlook structural properties of $\vec{b}$, whose alignment with $A$'s eigenspaces can greatly affec…

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.

Precoder Design in Multi-User FDD Systems with VQ-VAE and GNN
Srikar Allaparapu, Michael Baur, Benedikt B\"ock, Michael Joham, Wolfgang Utschick
https://arxiv.org/abs/2510.09495

Precoder Design in Multi-User FDD Systems with VQ-VAE and GNN
Robust precoding is efficiently feasible in frequency division duplex (FDD) systems by incorporating the learnt statistics of the propagation environment through a generative model. We build on previous work that successfully designed site-specific precoders based on a combination of Gaussian mixture models (GMMs) and graph neural networks (GNNs). In this paper, by utilizing a vector quantized-variational autoencoder (VQ-VAE), we circumvent one of the key drawbacks of GMMs, i.e., the number of …

Modeling Epidemics on Multiplex Networks: Epidemic Threshold and Basic Reproduction Number
Eric Alejandro Rozan, Mario Ignacio Simoy, Sebastian Bouzat, Marcelo Nestor Kuperman
https://arxiv.org/abs/2510.12614

Modeling Epidemics on Multiplex Networks: Epidemic Threshold and Basic Reproduction Number
Accurate epidemic forecasting requires models that account for the layered and heterogeneous nature of real social interactions. The basic reproduction number $\mathcal R_0$ calculated from models that assume homogeneous mixing or single-layer contact structures have limited applicability to complex social systems. Here, we propose an expression of $\mathcal R_0$ in the context of multiplex networks, enabling the analysis of disease transmission across multiple social layers. We adapt the Deg…

Leveraging Large Language Models for Cybersecurity Risk Assessment -- A Case from Forestry Cyber-Physical Systems
Fikret Mert G\"ultekin, Oscar Lilja, Ranim Khojah, Rebekka Wohlrab, Marvin Damschen, Mazen Mohamad
https://arxiv.org/abs/2510.06343

Leveraging Large Language Models for Cybersecurity Risk Assessment -- A Case from Forestry Cyber-Physical Systems
In safety-critical software systems, cybersecurity activities become essential, with risk assessment being one of the most critical. In many software teams, cybersecurity experts are either entirely absent or represented by only a small number of specialists. As a result, the workload for these experts becomes high, and software engineers would need to conduct cybersecurity activities themselves. This creates a need for a tool to support cybersecurity experts and engineers in evaluating vulnera…

Exponential convergence of multiagent systems with lack of connection
Fabio Ancona, Mohamed Bentaibi, Francesco Rossi
https://arxiv.org/abs/2510.11334 https://

Exponential convergence of multiagent systems with lack of connection
Finding conditions ensuring consensus, i.e. convergence to a common value, for a networked system is of crucial interest, both for theoretical reasons and applications. This goal is harder to achieve when connections between agents are temporarily lost. Here, we prove that known conditions (introduced by Moreau) ensure an exponential convergence to consensus, with explicit rate of convergence. The key result is related to the length of the graph (i.e. the number of connections to reach a comm…

QScale: Probabilistic Chained Consensus for Moderate-Scale Systems
Hasan Heydari, Alysson Bessani, Kartik Nayak
https://arxiv.org/abs/2510.01536 https://ar…

QScale: Probabilistic Chained Consensus for Moderate-Scale Systems
Existing distributed ledger protocols either incur a high communication complexity and are thus suited to systems with a small number of processes (e.g., PBFT), or rely on committee-sampling-based approaches that only work for a very large number of processes (e.g., Algorand). Neither of these lines of work is well-suited for moderate-scale distributed ledgers ranging from a few hundred to a thousand processes, which are common in production (e.g, Redbelly, Sui). The goal of this work is to des…

Limit cycles and invariant algebraic curves
Armengol Gasull, Paulo Santana
https://arxiv.org/abs/2510.11705 https://arxiv.org/pdf/2510.11705

Limit cycles and invariant algebraic curves
We give lower bounds in terms of~$n,$ for the number of limit cycles of polynomial vector fields of degree~$n,$ having any prescribed invariant algebraic curve. By applying them when the ovals of this curve are also algebraic limit cycles we obtain a new recurrent property for the Hilbert numbers. Finally, we apply our results to two important families of models: Kolmogorov systems and a general family of systems appearing in Game Theory.

Performance Analysis of Machine Learning Algorithms in Chronic Kidney Disease Prediction
Iftekhar Ahmed, Tanzil Ebad Chowdhury, Biggo Bushon Routh, Nafisa Tasmiya, Shadman Sakib, Adil Ahmed Chowdhury
https://arxiv.org/abs/2510.09493

Performance Analysis of Machine Learning Algorithms in Chronic Kidney Disease Prediction
Kidneys are the filter of the human body. About 10% of the global population is thought to be affected by Chronic Kidney Disease (CKD), which causes kidney function to decline. To protect in danger patients from additional kidney damage, effective risk evaluation of CKD and appropriate CKD monitoring are crucial. Due to quick and precise detection capabilities, Machine Learning models can help practitioners accomplish this goal efficiently; therefore, an enormous number of diagnosis systems and…

When any four solutions are independent
James Freitag
https://arxiv.org/abs/2510.08387 https://arxiv.org/pdf/2510.08387

When any four solutions are independent
We show that if any four distinct solutions of a rational difference equation are algebraically independent, then any number of distinct solutions to the equation are independent. A nontrivial variant of this result is given for autonomous difference equations or algebraic dynamical systems, where we show the degree of nonminimality is at most one. The results have a natural interpretation in terms of invariant or periodic subvarieties of algebraic dynamical systems and $σ$-varieties. Surprisi…

Some positive signs for AI coding tools. Claude-code is a $1B run rate product six month after launch. The latest Claude Opus 4.5 model is several times cheaper and faster than last month’s version and uses about a quarter of the number of tokens to get work done. My own benchmark saw over an hour of coding reduced to 17 minutes. The high rate of change continues. The boundary of what does/doesn’t work is pushing back fast.

Anthropic acquires Bun as Claude Code reaches $1B milestone
Anthropic is an AI safety and research company that's working to build reliable, interpretable, and steerable AI systems.

Or maybe modern systems use LLMs to count, and all they need to pass quality control is a plausible number, not a correct one.

A Diffusion-based Generative Machine Learning Paradigm for Contingency Screening
Quan Tran, Suresh S. Muknahallipatna, Dongliang Duan, Nga Nguyen
https://arxiv.org/abs/2510.04470

A Diffusion-based Generative Machine Learning Paradigm for Contingency Screening
Contingency screening is a crucial part of electric power systems all the time. Power systems frequently encounter multiple challenging operational dilemmas that could lead to the instability of power systems. Contingency analysis is effort-consuming by utilizing traditional numerical analysis methods. It is commonly addressed by generating a whopping number of possible contingencies or manipulating network parameters to determine the worst scenarios. This paper proposes a novel approach that d…

On the growth of Tate-Shafarevich groups of $p$-supersingular abelian varieties of ${\rm GL}_2$-type over $\mathbb{Z}_p$-extensions of number fields
Erman Isik, Antonio Lei
https://arxiv.org/abs/2510.11511

On the growth of Tate-Shafarevich groups of $p$-supersingular abelian varieties of ${\rm GL}_2$-type over $\mathbb{Z}_p$-extensions of number fields
We study the boundedness of the Mordell-Weil rank and the growth of the $v$-primary part of the Tate-Shafarevich group of $p$-supersingular abelian varieties of ${\rm GL}_2$-type with real multiplication over $\mathbb{Z}_p$-extensions of number fields, where $v$ is a prime lying above $p$. Building on the work of Iovita-Pollack in the case of elliptic curves, under precise ramification and splitting conditions on $p$, we construct explicit systems of local points using the theory of Lubin-Tate …

Psychologist: you mentioned that you think you may be on the autism spectrum if you haven't been diagnosed. What leads you to believe that?
Me: I've created featural scripts for multiple alternative number systems. I have multiple notebook pages full of math in base 12 and base 16 with custom notation I created.
Psychologist, nodding meaningfully: ahh....

Chern insulators and topological flat bands in cavity-embedded kagome systems
Hikaru Goto, Ryo Okugawa, Takami Tohyama
https://arxiv.org/abs/2510.09150 https://

Chern insulators and topological flat bands in cavity-embedded kagome systems
We investigate topological band structures of a kagome system coupled to a circularly polarized cavity mode, using a model based on a muffin-tin potential and quantum light-matter interaction. We show that Chern insulating phases emerge in the cavity-embedded kagome system due to the light-matter interaction that breaks time-reversal symmetry. We also find that a nearly flat band can be topologically nontrivial with a nonzero Chern number. By varying the light-matter interaction, we also reveal…

Construction of the Complete Set of Maximally Entangled Basis Vectors for N-Qubit Systems
Chi-Chuan Hwang
https://arxiv.org/abs/2510.02685 https://arxiv.or…

Construction of the Complete Set of Maximally Entangled Basis Vectors for N-Qubit Systems
In this study, we first use a three-qubit system as an example to demonstrate the construction of quantum circuits for the eight maximally entangled basis vectors, subsequently extending the approach to N-qubit systems. We employ a random-number approach to generate maximally entangled basis vectors and their corresponding circuits, while also detailing the required number of single-qubit and CNOT gates. This approach not only provides a solid theoretical foundation but also establishes a pract…

"""
[…] Paradoxically, the more a population grew, the more precious it became, as it offered a supply of cheap labour, and by lowering costs allowed a greater expansion of production and trade. In this infinitely open labour market, the ‘fundamental price’, which for Turgot meant a subsistence level for workers, and the price determined by supply and demand ended up as the same thing. A country was all the more commercially competitive for having at its disposal the virtual wealth that a large population represented.
Confinement was therefore a clumsy error, and an economic one at that: there was no sense in trying to suppress poverty by taking it out of the economic circuit and providing for a poor population by charitable means. To do that was merely to hide poverty, and suppress an important section of the population, which was always a given wealth. Rather than helping the poor escape their provisionally indigent situation, charity condemned them to it, and dangerously so, by putting a brake on the labour market in a period of crisis. What was required was to palliate the high cost of products with cheaper labour, and to make up for their scarcity by a new industrial and agricultural effort. The only reasonable remedy was to reinsert the population in the circuit of production, being sure to place labour in areas where manpower was most scarce. The use of paupers, vagabonds, exiles and émigrés of any description was one of the secrets of wealth in the competition between nations. […]
Confinement was to be criticised because of the effects it had on the labour market, but also because like all other traditional forms of charity, it constituted a dangerous form of finance. As had been the case in the Middle Ages, the classical era had constantly attempted to look after the needs of the poor by a system of foundations. This implied that a section of the land capital and revenues were out of circulation. In a definitive manner too, as the concern was to avoid the commercialisation of assistance to the poor, so judicial measures had been taken to ensure that this wealth never went back into circulation. But as time passed, their usefulness diminished: the economic situation changed, and so did the nature of poverty.
«Society does not always have the same needs. The nature and distribution of property, the divisions between the different orders of the people, opinions, customs, the occupations of the majority of the population, the climate itself, diseases and all the other accidents of human life are in constant change. New needs come into being, and old ones disappear.» [Turgot, Encyclopédie]
The definitive character of a foundation was in contradiction with the variable and changing nature of the accidental needs to which it was designed to respond. The wealth that it immobilised was never put back into circulation, but more wealth was to be created as new needs appeared. The result was that the proportion of funds and revenues removed from circulation constantly increased, while that of production fell in consequence. The only possible result was increased poverty, and a need for more foundations. The process could continue indefinitely, and the fear was that one day ‘the ever increasing number of foundations might absorb all private funds and all private property’. When closely examined, classical forms of assistance were a cause of poverty, bringing a progressive immobilisation that was like the slow death of productive wealth:
«If all the men who have ever lived had been given a tomb, sooner or later some of those sterile monuments would have been dug up in order to find land to cultivate, and it would have become necessary to stir the ashes of the dead in order to feed the living.» [Turgot, Lettre Š Trudaine sur le Limousin]
"""
(Michel Foucault, History of Madness)

Voice authentication???
I would not trust the basic competence of any org doing that. Facial recognition is bad enough.
Part of this is that I’m whatever the voice equivalent is to face-blindness. I don’t believe that such a thing as a “voice print” can exist. I can tell the difference between Neil Young and Bob Dylan, but any more similar and I’m lost.

Stability of non-conservative cross diffusion model and approximation by stochastic particle systems
Vincent Bansaye (CMAP, MERGE), Alexandre Bertolino (LJLL, CMAP), Ayman Moussa (LJLL)
https://arxiv.org/abs/2510.07138

Stability of non-conservative cross diffusion model and approximation by stochastic particle systems
We study the stability of non-conservative deterministic cross diffusion models and prove that they are approximated by stochastic population models when the populations become locally large. In this model, the individuals of two species move, reproduce and die with rates sensitive to the local densities of the two species. Quantitative estimates are given and convergence is obtained soon as the population per site and the number of sites go to infinity. The proofs rely on the extension of stab…

Recursive Inverse Design Enables Hyper-spectral Photonic Integrated Circuits
Hao He, Zengji Tu, Yuanlei Wang, Hongyan Zhao, Chuangxin Feng, Yongzhuo Zhou, Yujun Chen, Ruoao Yang, Lei Zhang, Jianjun Wu, Qi-Fan Yang, Lin Chang
https://arxiv.org/abs/2510.12104

Recursive Inverse Design Enables Hyper-spectral Photonic Integrated Circuits
Spectrum manipulation is central to photonic systems, where advanced computing and sensing applications often demand highly complex spectral responses to achieve high throughput. Conventional methods for enhancing spectral complexity typically rely on cascading discrete photonic components, resulting in a complexity that scales only linearly with the number of components. Here, we introduce hyper-spectral photonic integrated circuits (HS-PICs), in which spectral complexity scales exponentially …

Multihyperuniform Particle Composites Inspired by Avian Photoreceptor Patterns for Optical Applications
David Keeney, Wenlong Shi, Rohit Thomas, Yang Jiao
https://arxiv.org/abs/2510.06402

Multihyperuniform Particle Composites Inspired by Avian Photoreceptor Patterns for Optical Applications
Hyperuniform materials, characterized by anomalously suppressed long-wavelength density fluctuations, exhibit unique optical and photonic properties distinct from both crystalline and random media. While most prior studies have focused on single-species systems, we investigate the broader class of \textit{multihyperuniform} systems inspired by biological photoreceptor mosaics. Using particle-based models with varying species number, size ratios, and interaction competition, we demonstrate that …

Multi-stage robust nonlinear model predictive control of a lower-limb exoskeleton robot
Alireza Aliyari, Gholamreza Vossoughi
https://arxiv.org/abs/2509.22120 https://

Multi-stage robust nonlinear model predictive control of a lower-limb exoskeleton robot
The use of exoskeleton robots is increasing due to the rising number of musculoskeletal injuries. However, their effectiveness depends heavily on the design of control systems. Designing robust controllers is challenging because of uncertainties in human-robot systems. Among various control strategies, Model Predictive Control (MPC) is a powerful approach due to its ability to handle constraints and optimize performance. Previous studies have used linearization-based methods to implement robust…

"Residential installations lead Dutch storage boom"
#Netherlands #Energy #Batteries

Residential installations lead Dutch storage boom
The phasing out of net-metering for solar installations is incentivizing a growing number of citizens to install residential battery storage systems in the Netherlands. Analysts are predicting the upward trend will accelerate in the coming years.

Day 10: Stacey Mason
Another academic, but this time one of my compatriots; we overlapped at UC Santa Cruz as advisees of Michael Mates, and even collaborated on a Twitch stream called ScholarsPlay for a bit, although we never coauthored any papers. We did chat about our research, and I had many good discussions with her about agency in interactive fiction, a topic we both published on. Her paper "On Games and Links: Extending the Vocabulary of Agency and Immersion in Interactive Narratives" (#20AuthorsNoMen

Extending Games beyond the Finite Horizon
Kiri Sakahara, Takashi Sato
https://arxiv.org/abs/2510.08453 https://arxiv.org/pdf/2510.08453

Extending Games beyond the Finite Horizon
This paper argues that the finite horizon paradox, where game theory contradicts intuition, stems from the limitations of standard number systems in modelling the cognitive perception of infinity. To address this issue, we propose a new framework based on Alternative Set Theory (AST). This framework represents different cognitive perspectives on a long history of events using distinct topologies. These topologies define an indiscernibility equivalence that formally treats huge, indistinguishabl…

SubApSnap: Solving parameter-dependent linear systems with a snapshot and subsampling
Eleanor Jones, Yuji Nakatsukasa
https://arxiv.org/abs/2510.04825 https://

SubApSnap: Solving parameter-dependent linear systems with a snapshot and subsampling
A growing number of problems in computational mathematics can be reduced to the solution of many linear systems that are related, often depending smoothly or slowly on a parameter $p$, that is, $A(p)x(p)=b(p)$. We introduce an efficient algorithm for solving such parameter-dependent linear systems for many values of $p$. The algorithm, which we call SubApSnap (for \emph{Sub}sampled $A(p)$ times \emph{Snap}shot), is based on combining ideas from model order reduction and randomised linear algebr…

FMCache: File-System Metadata Caching in Programmable Switches
Qingxiu Liu (The Chinese University of Hong Kong), Jiazhen Cai (The Chinese University of Hong Kong), Siyuan Sheng (The Chinese University of Hong Kong), Yuhui Chen (Xiamen University), Lu Tang (Xiamen University), Zhirong Shen (Xiamen University), Patrick P. C. Lee (The Chinese University of Hong Kong)

FMCache: File-System Metadata Caching in Programmable Switches
Fast and scalable metadata management across multiple metadata servers is crucial for distributed file systems to handle numerous files and directories. Client-side caching of frequently accessed metadata can mitigate server loads, but incurs significant overhead and complexity in maintaining cache consistency when the number of clients increases. We propose FMCache, an in-switch file-system metadata caching framework that leverages programmable switches to serve file-system metadata requests f…

Explanation of the Mass Distribution of Binary Black Hole Mergers
Lei Li, Guoliang Lv, Chunhua Zhu, Sufen Guo, Hongwei Ge, Weimin Gu, Zhuowen Li, Xiaolong He
https://arxiv.org/abs/2510.08231

Explanation of the Mass Distribution of Binary Black Hole Mergers
Gravitational wave detectors are observing an increasing number of binary black hole (BBH) mergers, revealing a bimodal mass distribution of BBHs, which hints at diverse formation histories for these systems. Using the rapid binary population synthesis code MOBSE, we simulate a series of population synthesis models that include chemically homogeneous evolution (CHE). By considering metallicity-specific star formation and selection effects, we compare the intrinsic merger rates and detection rat…

A comprehensive look into the accuracy of SpEC binary black hole waveforms
Taylor Knapp, Katerina Chatziioannou, Keefe Mitman, Mark A. Scheel, Michael Boyle, Lawrence E. Kidder, Harald Pfeiffer
https://arxiv.org/abs/2510.06393

A comprehensive look into the accuracy of SpEC binary black hole waveforms
Numerical relativity simulations provide a full description of the dynamics of binary systems, including gravitational radiation. The waveforms produced by these simulations have a number of applications in gravitational-wave detection and inference. In this work, we revisit the accuracy of the waveforms produced by the Spectral Einstein Code. Motivated by the wide range of waveform applications, we propose and explore three accuracy metrics between simulation resolutions: (i) the generalized f…

Optimal Real-time Communication in 6G Ultra-Massive V2X Mobile Networks
He Huang, Zilong Liu, Zeping Sui, Wei Huang, Md. Noor-A-Rahim, Haishi Wang, Zhiheng Hu
https://arxiv.org/abs/2510.06937

Optimal Real-time Communication in 6G Ultra-Massive V2X Mobile Networks
This paper introduces a novel cooperative vehicular communication algorithm tailored for future 6G ultra-massive vehicle-to-everything (V2X) networks leveraging integrated space-air-ground communication systems. Specifically, we address the challenge of real-time information exchange among rapidly moving vehicles. We demonstrate the existence of an upper bound on channel capacity given a fixed number of relays, and propose a low-complexity relay selection heuristic algorithm. Simulation results…

Architecture of planetary systems with and without outer giant planets I. Inner planet detections around HD 23079, HD 196067, and HD 86226
J. -B. Delisle, J. P. Faria, D. S\'egransan, E. Fontanet, W. Ceva, D. Barbato, S. G. Sousa, N. Unger, A. Leleu, F. Bouchy, M. Cretignier, R. F. D\'iaz, X. Dumusque, Y. G. C. Frensch, N. C. Hara, G. Laughlin, G. Lo Curto, C. Lovis, M. Marmier, M. Mayor, L. Mignon, C. Mordasini, F. Pepe, N. C. Santos, S. Udry

Architecture of planetary systems with and without outer giant planets I. Inner planet detections around HD 23079, HD 196067, and HD 86226
Understanding the link between outer giant planets (OGPs) and inner light planets (ILPs) is key to understanding planetary system formation and architecture. The correlation between these two populations of planets is debated both theoretically -- different formation models predict either a correlation or an anticorrelation -- and observationally. Several recent attempts to constrain this correlation have yielded contradictory results, due to small-number statistics and heterogeneous samples. W…

Scaling Multi-Talker ASR with Speaker-Agnostic Activity Streams
Xiluo He, Alexander Polok, Jes\'us Villalba, Thomas Thebaud, Matthew Maciejewski
https://arxiv.org/abs/2510.03630

Scaling Multi-Talker ASR with Speaker-Agnostic Activity Streams
An increasingly common training paradigm for multi-talker automatic speech recognition (ASR) is to use speaker activity signals to adapt single-speaker ASR models for overlapping speech. Although effective, these systems require running the ASR model once per speaker, resulting in inference costs that scale with the number of speakers and limiting their practicality. In this work, we propose a method that decouples the inference cost of activity-conditioned ASR systems from the number of speake…

Investigation of Parasitic Two-Level Systems in Merged-Element Transmon Qubits
Etienne Daum, Benedikt Berlitz, Steffen Deck, Alexey V. Ustinov, J\"urgen Lisenfeld
https://arxiv.org/abs/2509.22593 …

Investigation of Parasitic Two-Level Systems in Merged-Element Transmon Qubits
In conventional transmon qubits, decoherence is dominated by a large number of parasitic two-level systems (TLS) residing at the edges of its large area coplanar shunt capacitor and junction leads. Avoiding these defects by improvements in design, fabrication and materials proved to be a significant challenge that so far led to limited progress. The merged-element transmon qubit (''mergemon''), a recently proposed paradigm shift in transmon design, attempts to address these issues by engineerin…

Crosslisted article(s) found for math.CO. https://arxiv.org/list/math.CO/new
[1/1]:
- A Normality Conjecture on Rational Base Number Systems
M\'elodie Andrieu, Shalom Eliahou, L\'eo Vivion

A Contextual Quality Reward Model for Reliable and Efficient Best-of-N Sampling
Hyung Gyu Rho
https://arxiv.org/abs/2510.04087 https://arxiv.org/pdf/2510.0…

A Contextual Quality Reward Model for Reliable and Efficient Best-of-N Sampling
Modern preference alignment techniques, such as Best-of-N (BoN) sampling, rely on reward models trained with pairwise comparison data. While effective at learning relative preferences, this paradigm fails to capture a signal of response acceptability, leaving systems vulnerable to selecting the least bad of many unacceptable options. This is particularly problematic for hard prompts, where the risk of such false acceptances increases with the number of samples. In this paper, we address this cr…

A general dark-state theory for arbitrary multilevel quantum systems
Xuan Zhao, Le-Man Kuang, Jie-Qiao Liao
https://arxiv.org/abs/2510.05561 https://arxiv.…

A general dark-state theory for arbitrary multilevel quantum systems
The dark-state effect, caused by destructive quantum interference, is an important physical effect in atomic physics and quantum optics. It not only deepens the understanding of light-atom interactions, but also has wide application in quantum physics and quantum information. Therefore, how to efficiently and conveniently determine the number and form of the dark states in multilevel quantum systems with complex transitions is an important and interesting topic in this field. In this work, we p…

(When) Should We Delegate AI Governance to AIs? Some Lessons from Administrative Law
Nicholas Caputo
https://arxiv.org/abs/2509.22717 https://arxiv.org/pdf…

(When) Should We Delegate AI Governance to AIs? Some Lessons from Administrative Law
Advanced AI systems are now being used in AI governance. Practitioners will likely delegate an increasing number of tasks to them as they improve and governance becomes harder. However, using AI for governance risks serious harms because human practitioners may not be able to understand AI decisions or determine whether they are aligned to the user's interests. Delegation may also undermine governance's legitimacy. This paper begins to develop a principled framework for when to delegate AI gove…

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
Chris Peikert, Alexandra Veliche Hostetler
https://arxiv.org/abs/2510.11453 https://

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
Reed--Solomon error-correcting codes are ubiquitous across computer science and information theory, with applications in cryptography, computational complexity, communication and storage systems, and more. Most works on efficient error correction for these codes, like the celebrated Berlekamp--Welch unique decoder and the (Guruswami--)Sudan list decoders, are focused on measuring error in the Hamming metric, which simply counts the number of corrupted codeword symbols. However, for some applica…

Defending against Stegomalware in Deep Neural Networks with Permutation Symmetry
Birk Torpmann-Hagen, Michael A. Riegler, P{\aa}l Halvorsen, Dag Johansen
https://arxiv.org/abs/2509.20399

Defending against Stegomalware in Deep Neural Networks with Permutation Symmetry
Deep neural networks are being utilized in a growing number of applications, both in production systems and for personal use. Network checkpoints are as a consequence often shared and distributed on various platforms to ease the development process. This work considers the threat of neural network stegomalware, where malware is embedded in neural network checkpoints at a negligible cost to network accuracy. This constitutes a significant security concern, but is nevertheless largely neglected b…

The R(1)W(1) Communication Model for Self-Stabilizing Distributed Algorithms
Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata, Fukuhito Ooshita
https://arxiv.org/abs/2510.04644

The R(1)W(1) Communication Model for Self-Stabilizing Distributed Algorithms
Self-stabilization is a versatile methodology in the design of fault-tolerant distributed algorithms for transient faults. A self-stabilizing system automatically recovers from any kind and any finite number of transient faults. This property is specifically useful in modern distributed systems with a large number of components. In this paper, we propose a new communication and execution model named the R(1)W(1) model in which each process can read and write its own and neighbors' local variabl…

Event-triggered control and communication for single-master multi-slave teleoperation systems with Try-Once-Discard protocol
Yuling Li, Chenxi Li, Kun Liu, Jie Dong, Rolf Johansson
https://arxiv.org/abs/2510.02072

Event-triggered control and communication for single-master multi-slave teleoperation systems with Try-Once-Discard protocol
Single-master multi-slave (SMMS) teleoperation systems can perform multiple tasks remotely in a shorter time, cover large-scale areas, and adapt more easily to single-point failures, thereby effectively encompassing a broader range of applications. As the number of slave manipulators sharing a communication network increases, the limitation of communication bandwidth becomes critical. To alleviate bandwidth usage, the Try-Once-Discard (TOD) scheduling protocol and event-triggered mechanisms are…

Adversarial Social Influence: Modeling Persuasion in Contested Social Networks
Renukanandan Tumu, Cristian Ioan Vasile, Victor Preciado, Rahul Mangharam
https://arxiv.org/abs/2510.01481

Adversarial Social Influence: Modeling Persuasion in Contested Social Networks
We present the Social Influence Game (SIG), a framework for modeling adversarial persuasion in social networks with an arbitrary number of competing players. Our goal is to provide a tractable and interpretable model of contested influence that scales to large systems while capturing the structural leverage points of networks. Each player allocates influence from a fixed budget to steer opinions that evolve under DeGroot dynamics, and we prove that the resulting optimization problem is a differ…

Bounds on the equation of state of cold nuclear matter from imaginary chemical potentials
Thomas D. Cohen
https://arxiv.org/abs/2510.07124 https://arxiv.or…

Bounds on the equation of state of cold nuclear matter from imaginary chemical potentials
The sign problem in numerical calculations of the QCD Euclidean space path integral of QCD with a chemical potential vanishes if the chemical potential is imaginary and calculations of the partition function with an imaginary chemical potentials are equivalent to calculations with Lagrange multipliers enforcing the current density. At zero temperature, Lorentz boosts allows one to deduce properties of systems with both number density and and current density from properties of systems with a cur…

Estimating the Self-Consistency of LLMs
Robert Nowak
https://arxiv.org/abs/2509.19489 https://arxiv.org/pdf/2509.19489

Estimating the Self-Consistency of LLMs
Systems often repeat the same prompt to large language models (LLMs) and aggregate responses to improve reliability. This short note analyzes an estimator of the self-consistency of LLMs and the tradeoffs it induces under a fixed compute budget $B=mn$, where $m$ is the number of prompts sampled from the task distribution and $n$ is the number of repeated LLM calls per prompt; the resulting analysis favors a rough split $m,n\propto\sqrt{B}$.

Determining codimension of Bogdanov-Takens and Bautin bifurcations via simplest normal form computation
Pei Yu, Yanni Zeng, Maoan Han
https://arxiv.org/abs/2510.10006 https://…

Determining codimension of Bogdanov-Takens and Bautin bifurcations via simplest normal form computation
In solving real-world problems, determining the codimension of Bogdanov-Takens (BT) and Bautin (generalized Hopf) bifurcations can be very challenging, even for simple two-dimensional dynamical systems. This difficulty becomes particularly evident when the number of system parameters exceeds the codimension of the bifurcations. Such challenges are closely linked to analyzing complex dynamics, such as the bifurcation of multiple limit cycles and homoclinic/heteroclinic bifurcations. In this pape…

Enhancing Urban VANETs Stability: A Single-Hop Clustering Strategy in Metropolitan Environments
Pouya Firouzmakan, Suprakash Datta
https://arxiv.org/abs/2510.00939 https://

Enhancing Urban VANETs Stability: A Single-Hop Clustering Strategy in Metropolitan Environments
Vehicular Ad-hoc Networks (VANETs), a subclass of Mobile Ad-hoc Networks (MANETs), are expected to play a crucial role in the future of intelligent transportation systems (ITSs). A key objective of VANETs is to enable efficient and cost-effective communication among vehicles while supporting a large number of network participants and minimizing infrastructure dependency. However, the highly dynamic nature of vehicular networks poses significant challenges to their deployment. Clustering techniq…

Energy loss of heavy-flavor quarks in color string medium
Daria Prokhorova, Shuzhe Shi, Evgeny Andronov
https://arxiv.org/abs/2509.24316 https://arxiv.org/…

Energy loss of heavy-flavor quarks in color string medium
The paper presents preliminary estimates of heavy-flavor (HF) quark energy loss during its propagation through the non-equilibrated medium formed in minimum bias proton-proton (p+p) collisions at LHC energies. The study is inspired by the ongoing hot debates on whether tiny droplets of Quark-Gluon Plasma can be created in collisions of small systems. In this work, we model a p+p event with a fluctuating number of color strings originated from multi-pomeron exchanges. Considered longitudinal osc…

Mixed-precision ab initio tensor network state methods adapted for NVIDIA Blackwell technology via emulated FP64 arithmetic
Cole Brower, Samuel Rodriguez Bernabeu, Jeff Hammond, John Gunnels, Sotiris S. Xanthea, Martin Ganahl, Andor Menczer, \"Ors Legeza
https://arxiv.org/abs/2510.04795

Mixed-precision ab initio tensor network state methods adapted for NVIDIA Blackwell technology via emulated FP64 arithmetic
We report cutting-edge performance results via mixed-precision spin adapted ab initio Density Matrix Renormalization Group (DMRG) electronic structure calculations utilizing the Ozaki scheme for emulating FP64 arithmetic through the use of fixed-point compute resources. By approximating the underlying matrix and tensor algebra with operations on a modest number of fixed-point representatives (``slices''), we demonstrate on smaller benchmark systems and for the active compounds of the FeMoco and…

Amplification and Detection of Single Itinerant Microwave Photons
Lukas Danner (German Aerospace Center, Institute for Complex Quantum Systems and IQST, University of Ulm, Ulm, Germany), Max Hofheinz (Institut Quantique, Universit\'e de Sherbrooke, Sherbrooke, Qu\'ebec, Canada), Nicolas Bourlet (Institut Quantique, Universit\'e de Sherbrooke, Sherbrooke, Qu\'ebec, Canada), Ciprian Padurariu (Institute for Complex Quantum Systems and IQST, University of Ulm, Ulm, Germany…

Amplification and Detection of Single Itinerant Microwave Photons
Single-photon detectors are an essential part of the toolbox of modern quantum optics for implementing quantum technologies and enabling tests of fundamental physics. The low energy of microwave photons, the natural signal path for superconducting quantum devices, makes their detection much harder than for visible light. Despite impressive progress in recent years and the proposal and realization of a number of different detector architectures, the reliable detection of a single itinerant micro…

Accelerating kinetic plasma simulations with machine learning generated initial conditions
Andrew T. Powis, Domenica Corona Rivera, Alexander Khrabry, Igor D. Kaganovich
https://arxiv.org/abs/2510.01977

Accelerating kinetic plasma simulations with machine learning generated initial conditions
Computer aided engineering of multi-time-scale plasma systems which exhibit a quasi-steady state solution are challenging due to the large number of time steps required to reach convergence. Machine learning techniques combined with traditional first-principles simulations and high-performance computing offer many interesting pathways towards resolving this challenge. We consider acceleration of kinetic plasma simulations via machine learning generated initial conditions. The approach is demons…

Partial Resilient Leader-Follower Consensus in Time-Varying Graphs
Haejoon Lee, Dimitra Panagou
https://arxiv.org/abs/2510.01144 https://arxiv.org/pdf/2510…

Partial Resilient Leader-Follower Consensus in Time-Varying Graphs
This work studies resilient leader-follower consensus with a bounded number of adversaries. Existing approaches typically require robustness conditions of the entire network to guarantee resilient consensus. However, the behavior of such systems when these conditions are not fully met remains unexplored. To address this gap, we introduce the notion of partial leader-follower consensus, in which a subset of non-adversarial followers successfully tracks the leader's reference state despite insuff…

(Anti)Gravitron: A Statistical Physics Perspective on Multidimensional Metrics of Polarizing Inequality
Rolando Gonzales Martinez
https://arxiv.org/abs/2510.09436 https://

(Anti)Gravitron: A Statistical Physics Perspective on Multidimensional Metrics of Polarizing Inequality
This paper introduces a novel framework for measuring multidimensional inequality based on a statistical physics reinterpretation of centrifugal and centripetal forces in rotating systems. Inspired by the mechanics of the Gravitron and extended via the conceptual AntiGravitron, this study proposes a new class of inequality metrics grounded in multivariate mixtures of Beta distributions. These composite metrics capture three key structural dimensions of polarizing inequality: the number and bala…

On the Hydrodynamic Approximation of Quantum Integrable Models -- An Illustration via the repulsive Lieb-Liniger Model
Friedrich H\"ubner
https://arxiv.org/abs/2509.20445 h…

On the Hydrodynamic Approximation of Quantum Integrable Models -- An Illustration via the repulsive Lieb-Liniger Model
Generalized hydrodynamics is a framework to study the large scale dynamics of integrable models, special fine-tuned one-dimensional many-body systems that possess an infinite number of local conserved quantities. Unlike classical models, where the microscopic origins of generalized hydrodynamics are better understood, in quantum models it can only be derived using the hydrodynamic formalism. Using the paradigmatic and experimentally relevant repulsive Lieb-Liniger model as an example, this thes…

Splitting Alternating Algorithms for Sparse Solutions of Linear Systems with Concatenated Orthogonal Matrices
Yun-Bin Zhao, Zhong-Feng Sun
https://arxiv.org/abs/2509.24558 https…

Splitting Alternating Algorithms for Sparse Solutions of Linear Systems with Concatenated Orthogonal Matrices
A class of splitting alternating algorithms is proposed for finding the sparse solution of linear systems with concatenated orthogonal matrices. Depending on the number of matrices concatenated, the proposed algorithms are classified into the two-block splitting alternating algorithm (TSAA) and the multi-block splitting alternating algorithm (MSAA). These algorithms aim to decompose a large-scale linear system into two or more coupled subsystems, each significantly smaller than the original sys…

Quantum Algorithm for Subcellular Multiscale Reaction-Diffusion Systems
Margot Lockwood, Nathan Wiebe, Connah Johnson, Johannes M\"ulmenst\"adt, Jaehun Chun, Gregory Schenter, Margaret S. Cheung, Xiangyu Li
https://arxiv.org/abs/2509.20668

Quantum Algorithm for Subcellular Multiscale Reaction-Diffusion Systems
Computational modeling of cellular systems, where reactants are governed by biochemical equations and physical representations, requires extensive classical computing resources. These limitations significantly constrain the system size and spatiotemporal scales of simulations. A key challenge lies in the "curse of dimensionality", where the number of possible reaction terms grows exponentially with the number of species, and the computation of reaction rates involving many-body interactions bec…

A Fast solver for high condition linear systems using randomized stable solutions of its blocks
Suvendu Kar, Murugesan Venkatapathi
https://arxiv.org/abs/2510.02156 https://

A Fast solver for high condition linear systems using randomized stable solutions of its blocks
We present an enhanced version of the row-based randomized block-Kaczmarz method to solve a linear system of equations. This improvement makes use of a regularization during block updates in the solution, and a dynamic proposal distribution based on the current residue and effective orthogonality between blocks. This improved method provides significant gains in solving high-condition number linear systems that are either sparse, or dense least-squares problems that are significantly over/under…

Data-Driven Optimal Power Flow: A Behavioral Systems Approach
Sebastian Otzen, Hannes M. H. Wolf, Christian A. Hans
https://arxiv.org/abs/2509.25120 https://

Data-Driven Optimal Power Flow: A Behavioral Systems Approach
The increasing decentralization of power systems driven by a large number of renewable energy sources poses challenges in power flow optimization. Partially unknown power line properties can render model-based approaches unsuitable. With increasing deployment of sensors, data-driven methods rise as a promising alternative. They offer the flexibility to adapt to varying grid structures and unknown line properties. In this paper, we propose a novel data-driven representation of nonlinear power fl…

Mutual Information-Driven Visualization and Clustering for Core KPI Selection in O-RAN Testing
Anish Pradhan, Lingjia Liu, Harpreet S. Dhillon
https://arxiv.org/abs/2510.02696 h…

Mutual Information-Driven Visualization and Clustering for Core KPI Selection in O-RAN Testing
O-RAN testing is becoming increasingly difficult with the exponentially growing number of performance measurements as the system grows more complex, with additional units, interfaces, applications, and possible implementations and configurations. To simplify the testing procedure and improve system design for O-RAN systems, it is important to identify the dependencies among various performance measurements, which are inherently time-series and can be modeled as realizations of random processes.…

Curriculum Imitation Learning of Distributed Multi-Robot Policies
Jes\'us Roche, Eduardo Sebasti\'an, Eduardo Montijano
https://arxiv.org/abs/2509.25097 https://

Curriculum Imitation Learning of Distributed Multi-Robot Policies
Learning control policies for multi-robot systems (MRS) remains a major challenge due to long-term coordination and the difficulty of obtaining realistic training data. In this work, we address both limitations within an imitation learning framework. First, we shift the typical role of Curriculum Learning in MRS, from scalability with the number of robots, to focus on improving long-term coordination. We propose a curriculum strategy that gradually increases the length of expert trajectories du…

Dynamics of quantum measurement via electron transport in quantum dot systems: many-particle wavefunction approach
George Stavisskii, Leonid Fedichkin
https://arxiv.org/abs/2510.05348

Dynamics of quantum measurement via electron transport in quantum dot systems: many-particle wavefunction approach
Measurement of a charge qubit via point contacts with complex internal structures is considered. In this context, a fully formalized derivation of the many-body wave function method is presented, together with the corresponding master equations for point contacts possessing an arbitrary number of internal states. The focus is placed on the current noise power spectrum and its dependence on the qubit dynamics and the point contact parameters.

Replaced article(s) found for math.DS. https://arxiv.org/list/math.DS/new
[1/1]:
- Rotation number and dynamics of 3-interval piecewise $\lambda$-affine contractions
P. Guiraud, M. Hern\'andez, A. Meyroneinc, A. Nogueira

Low Complexity Detector for XL-MIMO Uplink: A Cross Splitting Based Information Geometry Approach
Wenjun Zhang, An-An Lu, Xiqi Gao
https://arxiv.org/abs/2510.09039 https://

Low Complexity Detector for XL-MIMO Uplink: A Cross Splitting Based Information Geometry Approach
In this paper, we propose the cross splitting based information geometry approach (CS-IGA), a novel and low complexity iterative detector for uplink signal recovery in extralarge-scale MIMO (XL-MIMO) systems. Conventional iterative detectors, such as the approximate message passing (AMP) algorithm and the traditional information geometry algorithm (IGA), suffer from a per iteration complexity that scales with the number of base station (BS) antennas, creating a computational bottleneck. To over…

Energy, Bosons and Computational Complexity
Ulysse Chabaud, Sevag Gharibian, Saeed Mehraban, Arsalan Motamedi, Hamid Reza Naeij, Dorian Rudolph, Dhruva Sambrani
https://arxiv.org/abs/2510.08545

Energy, Bosons and Computational Complexity
We investigate the role of energy, i.e. average photon number, as a resource in the computational complexity of bosonic systems. We show three sets of results: (1. Energy growth rates) There exist bosonic gate sets which increase energy incredibly rapidly, obtaining e.g. infinite energy in finite/constant time. We prove these high energies can make computing properties of bosonic computations, such as deciding whether a given computation will attain infinite energy, extremely difficult, formall…

TubeDAgger: Reducing the Number of Expert Interventions with Stochastic Reach-Tubes
Julian Lemmel, Manuel Kranzl, Adam Lamine, Philipp Neubauer, Radu Grosu, Sophie A. Neubauer
https://arxiv.org/abs/2510.00906

TubeDAgger: Reducing the Number of Expert Interventions with Stochastic Reach-Tubes
Interactive Imitation Learning deals with training a novice policy from expert demonstrations in an online fashion. The established DAgger algorithm trains a robust novice policy by alternating between interacting with the environment and retraining of the network. Many variants thereof exist, that differ in the method of discerning whether to allow the novice to act or return control to the expert. We propose the use of stochastic reachtubes - common in verification of dynamical systems - as a…

Parallel Algorithms for the One Sided Crossing Minimization Problem
Bogdan-Ioan Popa, Adrian-Marius Dumitran, Livia Magureanu
https://arxiv.org/abs/2509.23706 https://

Parallel Algorithms for the One Sided Crossing Minimization Problem
The One Sided Crossing Minimization (OSCM) problem is an optimization problem in graph drawing that aims to minimize the number of edge crossings in bipartite graph layouts. It has practical applications in areas such as network visualization and VLSI (Very Large Scale Integration) design, where reducing edge crossings improves the arrangement of circuit components and their interconnections. Despite the rise of multi-core systems, the parallelization of exact and fixed-parameter tractable (FPT…

Analysis of persistent and antipersistent time series with the Visibility Graph method
Macarena C\'adiz, Iv\'an Gallo-M\'endez, Pablo S. Moya, Denisse Past\'en
https://arxiv.org/abs/2510.01202

Analysis of persistent and antipersistent time series with the Visibility Graph method
In this work, we investigate a range of time series, including Gaussian noises (white, pink, and blue), stochastic processes (Ornstein-Uhlenbeck, fractional Brownian motion, and Levy flights), and chaotic systems (the logistic map), using the Visibility Graph (VG) method. We focus on the minimum number of data points required to use VG and on two key descriptors: the degree distribution P(k), which often follows a power law P(k) ~ k^-gamma, and the Hurst exponent H, which identifies persistent …

Low-energy dynamics in generic potential fields: Hyperbolic periodic orbits and non-ergodicity
Alberto Enciso, Manuel Garz\'on, Daniel Peralta-Salas
https://arxiv.org/abs/2510.06073

Low-energy dynamics in generic potential fields: Hyperbolic periodic orbits and non-ergodicity
We prove that, on each low energy level, the natural Hamiltonian system defined by a generic smooth potential on $\mathbf{T}^2$ exhibits an arbitrarily high number of hyperbolic periodic orbits and a positive-measure set of invariant tori. Hence, quasi-periodic motion and hyperbolic behavior typically coexist in the low-energy dynamics of natural Hamiltonian systems with two degrees of freedom.

Private Information Retrieval over Graphs
Gennian Ge, Hao Wang, Zixiang Xu, Yijun Zhang
https://arxiv.org/abs/2509.26512 https://arxiv.org/pdf/2509.26512…

Private Information Retrieval over Graphs
The problem of PIR in graph-based replication systems has received significant attention in recent years. A systematic study was conducted by Sadeh, Gu, and Tamo, where each file is replicated across two servers and the storage topology is modeled by a graph. The PIR capacity of a graph $G$, denoted by $\mathcal{C}(G)$, is defined as the supremum of retrieval rates achievable by schemes that preserve user privacy, with the rate measured as the ratio between the file size and the total number of…

Phase Transitions and Noise Robustness of Quantum Graph States
Tatsuya Numajiri, Shion Yamashika, Tomonori Tanizawa, Ryosuke Yoshii, Yuki Takeuchi, Shunji Tsuchiya
https://arxiv.org/abs/2510.00548

Phase Transitions and Noise Robustness of Quantum Graph States
Graph states are entangled states that are essential for quantum information processing, including measurement-based quantum computation. As experimental advances enable the realization of large-scale graph states, efficient fidelity estimation methods are crucial for assessing their robustness against noise. However, calculations of exact fidelity become intractable for large systems due to the exponential growth in the number of stabilizers. In this work, we show that the fidelity between any…

Formation Control via Rotation Symmetry Constraints
Zamir Martinez, Daniel Zelazo
https://arxiv.org/abs/2510.00676 https://arxiv.org/pdf/2510.00676

Formation Control via Rotation Symmetry Constraints
We present a distributed formation control strategy for multi-agent systems based only on rotation symmetry constraints. We propose a potential function that enforces inter-agent \textbf{rotational} symmetries, with its gradient defining the control law driving the agents toward a desired symmetric and planar configuration. We show that only $(n-1)$ edges, the minimal connectivity requirement, are sufficient to implement the control strategy, where $n$ is the number of agents. We further augmen…