Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 19, 2026 — 07:20:49 EST

0

Posted in math.AG · 2026-09-16 · Yuto Masamura

Relative cone of curves and extremal contractions of a successive blowup

Let $X$ be a normal variety, and let $π\colon\tilde X\to X$ be the successive blowup along subvarieties $Z_1,\dotsc,Z_n\subseteq X$ of codimension at least two that have simple normal crossings and satisfy $Z_h\not\supseteq Z_i$ whenever $h<I$. We prove that the relative cone of curves $\overline{\operatorname{NE}}(\tilde X/X)$ is...

💬 0 commentsarXiv:2609.18936v1PDF
0

Posted in math.NT · 2026-09-16 · Guy Fowler

A uniform effective André--Oort result

We prove the André--Oort conjecture for hypersurfaces $V \subset Y(1)^n \cong \mathbb{A}^n_\mathbb{C}$ defined by an equation $a_1 x_1^m + \ldots + a_n x_n^m = b$, where $a_1, \ldots, a_n, b \in \overline{\mathbb{Q}}$ and $m \in \mathbb{Z}_{>0}$. Unlike previous proofs, our result is both effective and uniform in the height of the...

💬 0 commentsarXiv:2609.18934v1PDF
0

Posted in math.HO · 2026-09-16 · Victor Tapia

The suppression thesis in Riemann's Habilitationsvortrag

In 1854 Riemann presented his Habilitationsvortrag {\it Über die Hypothesen welche der Geometrie zu Grunde liegen} to the Faculty of Philosophy of the University of Göttingen. The lecture does not contain analytical developments and Riemann never explained the reason for this choice. According to Dedekind this choice was done in order...

💬 0 commentsarXiv:2609.18923v1PDF
0

Posted in math.AG · 2026-09-16 · Thomas Polstra, Austyn Simpson

Bertini's theorem for $F$-rationality is false

Let $k=\overline{\mathbb{F}_2}$. We construct a nine-dimensional $F$-rational affine variety $X$ admitting a locally closed embedding $X\hookrightarrow \mathbb{P}_k^{19}$ together with a dense open set $U\subseteq (\mathbb{P}^{19})^\vee$ such that $X\cap H$ is not $F$-rational (or even $F$-injective) for all $H\in U$. We also...

💬 0 commentsarXiv:2609.18921v1PDF
0

Posted in math-ph · 2026-09-16 · Haonan Zhang

Wehrl-type entropy problem for compact connected semisimple Lie groups

This paper solves the Wehrl-type entropy problem for arbitrary compact connected semisimple Lie groups. Let $G$ be a compact connected semisimple Lie group, and let $π:G\to U(V_λ)$ be a finite-dimensional irreducible unitary representation associated with the highest weight $λ$. We prove that coherent projectors are the unique...

💬 0 commentsarXiv:2609.18919v1PDF
0

Posted in math.NA · 2026-09-16 · Andreas Alexander Buchheit, Andreas Rupp

Graph lattice sums and graph zeta functions for long-range interacting quantum lattice models

Taming the exponential increase of the Hilbert space dimension with system size in the simulation of gapped quantum lattice models is of the highest relevance for understanding and designing exotic quantum materials, where nonlocal interactions are of particular interest. High-order linked-cluster expansions provide access the...

💬 0 commentsarXiv:2609.18918v1PDF
0

Posted in cs.CV · 2026-09-16 · Jiaming Zhang, Homanga Bharadhwaj

Track, Articulate, Act: Generating Articulation from Casual Human Videos

Human videos contain rich causal evidence for robot manipulation: they reveal how hand motion induces object motion and produces task-relevant changes in object state. In this work, we study articulated objects such as doors, drawers, cabinets, laptops, ovens, and hinged containers that are ubiquitous in daily life and present unique...

💬 0 commentsarXiv:2609.19119v1PDF
0

Posted in cs.DS · 2026-09-16 · Hamed Abdi, Kiarash Banihashem, MohammadTaghi Hajiaghayi, Danny Mittal

On the Strong Matroid Secretary Conjecture and Beyond

The strong matroid secretary conjecture asserts that every matroid admits a $1/e$-competitive secretary algorithm, matching the classical single-choice guarantee. We formulate a finite linear program whose value is the optimal ordinal competitive ratio of any fixed matroid; for all matroids of positive rank on seven elements and...

💬 0 commentsarXiv:2609.19118v1PDF
0

Posted in cs.CL · 2026-09-16 · Peter Potash

Playing log(N)-Questions over Wikipedia Abstracts: Communication Efficiency Between Paired Frontier Models

We evaluate six frontier language models on the two-agent $\log(N)$-Questions game. A questioner sees $N$ Wikipedia lead paragraphs and must identify a secretly chosen target using exactly $\log_2 N$ yes/no questions. An answerer sees only the target and the question, and replies with one word. Both roles run on the same provider, so...

💬 0 commentsarXiv:2609.19113v1PDF
0

Posted in cs.CR · 2026-09-16 · Ramana Ranganatham, Chirag Adiga, Michael Zuzak, Tejasvi Das

Analog Pin Directionality as an Exfiltration Attack Surface in Mixed-Signal ICs

Mixed-signal SoCs rely on nominally input-only analog pins to acquire off-chip signals, but the directionality of these interfaces is generally treated as a functional property rather than explicitly verified as a security property. This work identifies and experimentally demonstrates a directionality-based class of analog and...

💬 0 commentsarXiv:2609.19111v1PDF
0

Posted in cs.LG · 2026-09-16 · Zixi Chen, Akshay Vegesna, Samip Dahal, Andrew Gordon Wilson

How Model Growth, Recursion, and Boundary Operators Influence Scaling Exponents

Scaling laws predict how loss decreases with increases in computation. We show, contrary to conventional wisdom, that architectural interventions can modify scaling exponents in pre-training, leading to exponential improvements in performance with increases in computation. As an anchoring point, we consider the architectural...

💬 0 commentsarXiv:2609.19107v1PDF
0

Posted in cs.RO · 2026-09-16 · Kaijun Zhou, Zhiyang Li, Le Chen, Jinyu Gu

rMuscle: Robotic Muscle Memory for Efficient Vision-Language-Action Model Inference

Factory work is a promising early scenario for embodied AI: assigning repetitive manual jobs to robots has clear economic payoff, and a structured station keeps the jobs tractable for current policies. Vision-Language-Action (VLA) models now dominate as the policy paradigm for these robots. The inference latency of VLA models directly...

💬 0 commentsarXiv:2609.19104v1PDF
0

Posted in cs.CL · 2026-09-16 · Leon Bergen, Usha Bhalla, Andrew Lee, Barak Widawsky, Linas Nasvytis, Connor Watts, Siddharth Boppana, Sidharth Baskaran, Dron Hazra, Michael Byun, Atticus Geiger, Owen Lewis, Matthew Kowal, Vasudev Shyam, Thomas Fel, Thomas McGrath, Ekdeep Singh Lubana, Jack Merullo

Monitoring and Discovering Reward Hacking with Internal Representations during LLM Evaluations

As models scale, reward hacking becomes more frequent, more sophisticated, and more consequential. Does it leave a telltale signature in model representations? This work analyzes how reward hacking is represented internally in frontier open source LLMs, and how those representations can be used to understand and discover the range of...

💬 0 commentsarXiv:2609.19101v1PDF
0

Posted in cs.CR · 2026-09-16 · Muhammad Abdullah Sohail

Characterizing Network Centralization and Observability in the Remote MCP Ecosystem

The Model Context Protocol (MCP) has emerged as the dominant interface for connecting autonomous agents to external data sources and execution environments. The ecosystem's transition from local process execution to remote Streamable HTTP deployments introduces unmeasured architectural and security constraints at scale. This paper...

💬 0 commentsarXiv:2609.19100v1PDF
0

Posted in cs.LG · 2026-09-16 · Michael M. Craig, Riley J. Hickman, Yingshan Ma, Rémi Piché-Taillefer, Christine Allen, Pauric Bannigan

Evidence-Grounded Agentic Formulation Development in an Autonomous Laboratory

Self-emulsifying drug delivery systems (SEDDS) can improve the oral bioavailability of poorly soluble drugs, but identifying high-performing formulations remains experimentally intensive. We present Andromeda 2, an agentic system that reasons over structured in-house experimental evidence and invokes computational and experimental...

💬 0 commentsarXiv:2609.19099v1PDF
0

Posted in eess.SY · 2026-09-16 · Tarek Bouazza, Zhiqi Tang, Soulaimane Berkane, Tarek Hamel

Leader-Follower Formation Control with Prescribed Convergence Rates under Bearing Persistence of Excitation

This paper addresses leader-follower formation control using only relative bearing and velocity measurements. Bearing-based leader-follower control strategies commonly use fixed control gains, for which the guaranteed convergence rates explicitly depend on the persistence of excitation (PE) properties of the desired formations. We...

💬 0 commentsarXiv:2609.19106v1PDF
0

Posted in quant-ph · 2026-09-16 · A. Barış Özgüler

Securing quantum error correction against misleading advice from AI agents

Can an attacker turn influence over an artificial intelligence (AI) adviser into a harmful quantum error-correction update? We identify an ambiguity in passive syndrome records that obstructs recovery selection, then show how additional calibration measurements support certified recovery updates under uncertainty and drift. In an...

💬 0 commentsarXiv:2609.19090v1PDF
0

Posted in eess.SY · 2026-09-16 · James B. Rawlings, Titus Quah, Matthias A. Müller

On asymptotic stability of the time-varying Kalman filter for unstabilizable linear systems: an optimization perspective

This paper establishes the necessary and sufficient conditions for asymptotic stability of the time-varying Kalman filter applied to a linear time invariant system with semidefinite initial state covariance and positive definite process and measurement noise. Rather than analyze the discrete Riccati equation as in the classic...

💬 0 commentsarXiv:2609.18925v1PDF
0

Posted in eess.SY · 2026-09-16 · Ashutossh Gupta, Vassilis Kekatos

Designing Grid-Aware Dynamic Specifications for Large Data Center Loads

As data center (DC) loads increasingly penetrate the power grid, there is an urgent need for grid operators to provide clear dynamic specifications to DC owners to ensure safe grid operation. To this end, we study two salient behaviors of large language model (LLM) training loads: abrupt ramps at job initiation and termination, which...

💬 0 commentsarXiv:2609.18888v1PDF
0

Posted in cs.LG · 2026-09-16 · Matteo Marchi, João Pedro Silvestre, Bahman Gharesifard, Paulo Tabuada

Preventing Model Collapse: A Fisher-Rao Perspective on the Dynamics of Training with Synthetic Data

Large Language Models (LLMs) are now routinely trained using synthetic data, since high-quality human data has been exhausted by the ever increasing needs of larger and larger models. However, recursive training on synthetic data frequently induces model collapse, a degenerative feedback loop where models progressively forget the true...

💬 0 commentsarXiv:2609.18878v1PDF
0

Posted in eess.SY · 2026-09-16 · Eric Mountain, Tarunraj Singh

Time-Optimal Operation of a Load-Hoisting Gantry Crane

This paper addresses the problem of designing time-optimal control profiles for point-to-point control of a gantry crane moving in a two dimensional plane. It is assumed that the hoisting motor completes the hoisting maneuver at a constant rate and completes its transition in the same time that it takes for the cart to reach its...

💬 0 commentsarXiv:2609.18872v1PDF
0

Posted in math.OC · 2026-09-16 · Yubo Cai, Gioele Zardini

Optimizing Lyapunov Certificates via Stability-Preserving Quadratization for Polynomial Systems

Region-of-attraction (ROA) certificates for polynomial systems become expensive as state dimension and degree grow: direct sum-of-squares (SOS) formulations require combinatorially growing monomial bases. Quadratization represents a polynomial vector field exactly on an invariant manifold of a quadratic system, allowing a quadratic...

💬 0 commentsarXiv:2609.18871v1PDF
0

Posted in eess.SY · 2026-09-16 · Andrea Fusco, Andrea Lodi, Lavanya Marla

Learning to Solve Two-Stage Stochastic Unit Commitment Problems with Quality Guarantees

Two-stage stochastic Mixed-Integer Linear Programs are a canonical modeling tool to optimize power system operations under uncertainty, yet their extensive-form counterparts scale linearly with the number of scenarios and quickly become computationally prohibitive under day-ahead time constraints. We propose an Input Convex Neural...

💬 0 commentsarXiv:2609.18859v1PDF
0

Posted in cs.NI · 2026-09-16 · Seyed Bagher Hashemi Natanzi, Bo Tang

Taming the Agentic RAN: Stability-Guaranteed Arbitration of Autonomous AI Agents in O-RAN

The O-RAN control plane is becoming agentic: autonomous AI agents, deployed as rApps by different vendors, independently close control loops over shared radio resources. We demonstrate on a live O-RAN system that this independence is unsafe. Two agents with individually correct objectives, one protecting a latency SLA and one...

💬 0 commentsarXiv:2609.18857v1PDF