Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 21, 2026 — 18:30:28 EST

0

Posted in cs.LG · 2026-09-09 · Weifeng Yang

Nonmaximal sums of maximally monotone operators under Rockafellar's constraint qualification

We construct counterexamples to Rockafellar's sum conjecture in which two maximally monotone operators satisfy the interior-domain condition but their sum is not maximally monotone. We give one counterexample on $c_0$ and another on $\ell^1$ with its usual norm. We establish a general construction theorem that computes the entire...

💬 0 commentsarXiv:2609.10487v1PDF
0

Posted in math.MG · 2026-09-09 · Peizhi Liu

Box dimension prints

We study lower and upper box dimension prints for bounded subsets of \(\mathbb R^n\), defined by weighted covering numbers for independently oriented rectangular boxes with prescribed ordered side-length bounds. The limits range over all eccentricities, including unbounded aspect ratios. For every non-empty bounded set, we identify...

💬 0 commentsarXiv:2609.10485v1PDF
0

Posted in math.RT · 2026-09-09 · Alan Xuelun Hou, Tudor Popescu

Distinguished standard modules for $\mathrm{GL}_{2m}(\mathbb{C})/\mathrm{GL}_m(\mathbb{H})$

We characterize the standard modules of $\GL_{2m}(\C)$ that are distinguished by $\GL_m(\HH)$. Let $δ_1,\dots, δ_{2m}$ be characters of $\mathbb{C}^\times$. Assume that $S = δ_1 \times \cdots \times δ_{2m}$ is a standard module of $\GL_{2m}(\mathbb{C})$. For each $i$, define ${δ_i^*} (z) = δ_i(\overline{z})^{-1}$ for $ z \in...

💬 0 commentsarXiv:2609.10483v1PDF
0

Posted in math.AP · 2026-09-09 · Han Zhou

Open Inextensible Filaments in Planar Stokes Flow: Well-Posedness, Endpoint Asymptotics, and Straightening

We study an inextensible open filament with free ends in a planar Stokes fluid. The system reduces to a third-order nonlocal curvature equation coupled to an elliptic equation for the tension. We prove local well-posedness for nearly critical initial data in supported Sobolev spaces $\widetilde H^s$, $-1/2<s\le0$, satisfying the...

💬 0 commentsarXiv:2609.10480v1PDF
0

Posted in math.NA · 2026-09-09 · Shengrong Ding, Shumo Cui, Remi Abgrall, Kailiang Wu

Invariant domain preservation for hybrid point-value and cell-average discretizations of hyperbolic equations on general meshes

This paper presents a unified invariant-domain-preserving (IDP) framework for hybrid discretizations of hyperbolic conservation laws, including active flux and PAMPA methods, in which cell averages are updated conservatively while cell-boundary point values evolve under a possibly non-conservative operator. The main challenge is to...

💬 0 commentsarXiv:2609.10476v1PDF
0

Posted in math.PR · 2026-09-09 · Gleb Smirnov

MaxCut for $\mathrm{MTP}_2$ Covariances

Let $X=(X_1,\dots,X_n)\in\{0,1\}^n$ have a multivariate totally positive ($\mathrm{MTP}_2$) law. We prove that $$ \sum_{i<j}\mathbb{E}\left[\left|\mathrm{Cov}(X_i,X_j \mid X_{[n]\setminus\{i,j\}})\right|\right] \le n/2, $$ and more generally a weighted MaxCut inequality for the fully conditioned covariances. As an application, we...

💬 0 commentsarXiv:2609.10474v1PDF
0

Posted in math.PR · 2026-09-09 · Stefan Schrott

Couplings Farthest from the Independent Gaussian

Motivated by Wasserstein measures of dependence, we study the largest possible 2-Wasserstein distance between a joint distribution and the product of its prescribed marginals. For two uniform marginals, Catalano and Lavenant conjectured that the monotone and antimonotone couplings maximize the distance from the independent coupling....

💬 0 commentsarXiv:2609.10467v1PDF
0

Posted in math.OC · 2026-09-09 · Edward Huynh, Björn Engquist

Convergence of a Randomized Newton Method in Nonconvex Optimization

We analyze a stochastic Newton optimization scheme for locating the unique global minimizer of a general nonconvex objective function. The method couples a Newton algorithm to additive Gaussian noise with state-dependent variance. In the bounded domain setting, we prove global almost sure convergence. The proof is based on two...

💬 0 commentsarXiv:2609.10465v1PDF
0

Posted in cond-mat.stat-mech · 2026-09-09 · Abhishek Chowdhury

Protected domains and the cost of cooperation on weighted networks

A costly inherited trait can spread when its descendants create a favorable local environment. We ask which finite contact structures sustain such a collective competitor and what their advantage costs. Individuals play a donation game, conferring benefit $b$ at cost $c$. Reciprocal weighted contacts determine averaged payoffs and...

💬 0 commentsarXiv:2609.10463v1PDF
0

Posted in math.GR · 2026-09-09 · Marc Kegel, Shana Yunsheng Li, Qiuyu Ren

Small undecidable groups and unrecognizable 4-manifolds

We construct a $3$-generator $9$-relator group with unsolvable word problem. We use the group to construct two fixed-size Adian--Rabin families of group presentations, one with $4$ generators and $11$ relators, and another with $2$ generators and $10$ relators. As a consequence, $\#_7(S^2\times S^2)$ is topologically unrecognizable...

💬 0 commentsarXiv:2609.10461v1PDF
0

Posted in eess.SY · 2026-09-09 · Mayank S. K. Gupta, Deepanjhan Das, Arun K. Tangirala, Shankar Narasimhan

Multivariate linear regression without prior assumptions

Recovering the linear relationships that govern a system from noisy measurements is a basic task across the physical and engineering sciences. Because every measured variable may carry an unknown amount of noise, classical regression must commit in advance to a set of structural assumptions: ordinary least squares requires a declared...

💬 0 commentsarXiv:2609.10477v1PDF
0

Posted in stat.ME · 2026-09-09 · Lorenzo Carvisiglia, Saverio Ranciati, Mirko Signorelli

Dynamic prediction intervals for survival times

Most work on survival prediction focuses on estimating survival probabilities rather than predicting individual event times. Recent conformal methods have made it possible to construct prediction intervals for survival times with right-censored outcomes, but existing approaches are restricted to settings with covariates only measured...

💬 0 commentsarXiv:2609.10409v1PDF
0

Posted in cs.DS · 2026-09-09 · Sergei Kudria, Jason Luo, Mahbod Majid

Subexponential Approximation of the Permanent in Deterministic Polynomial Time

We give the first deterministic polynomial time algorithm that approximates the permanent of arbitrary nonnegative rational matrices within a subexponential factor. For a matrix of order $n$, the approximation factor is \[ \exp\!\left(O\!\left(\frac{n(\log\log n)^2}{\log n}\right)\right)=\exp(o(n)). \] All previously known...

💬 0 commentsarXiv:2609.10516v1PDF
0

Posted in cs.PF · 2026-09-09 · Zhongchun Zhou, Chengtao Lai, Songtao Mao

PASCAL: A Phase-Aware Shared-Cache Model for Parallel Scans

In modern AI Accelerators and GPGPUs, many concurrent cores repeatedly access the same shared data. This pattern occurs in attention, where different query tiles share the same K/V block, GEMM, where every tile in a row reads the same panel, and many other operators. We name this pattern parallel scan. Due to a significant amount of...

💬 0 commentsarXiv:2609.10515v1PDF
0

Posted in quant-ph · 2026-09-09 · Ashwin Nayak, Xingyu Zhou

Optimal Low-Rank Quantum State Tomography with Bounded-Sample Joint Measurements

We determine the optimal sample complexity of low-rank quantum state tomography when each measurement may act jointly on at most $t$ samples. For sufficiently small $\varepsilon$, estimating an unknown state on $\mathbb{C}^d$ of rank at most $r$ to trace norm error $\varepsilon$ with constant success probability requires, and is...

💬 0 commentsarXiv:2609.10514v1PDF
0

Posted in cs.DC · 2026-09-09 · Suman Raj, Hai Duc Nguyen, Haochen Pan, Ryan Chard, Kyle Chard, Ian Foster

Avatar: Toward Autonomous End-to-End Orchestration of Scientific Workflows using LLMs

Scientific workflow management (WMSs) systems automate execution, yet orchestrate using fixed, hand-tuned rules. LLM agents promise more autonomous orchestration, but it remains unclear where to introduce agentic reasoning, how to bound its risk, and when it actually helps. We present Avatar, an actor-based architecture comprising an...

💬 0 commentsarXiv:2609.10509v1PDF
0

Posted in cs.RO · 2026-09-09 · Nisarga Nilavadi, Ralf Römer, Moritz Reuss, Michael Krawez, Tobias Jülg, Angela P. Schoellig, Rudolf Lioutikov, Wolfram Burgard

DUET-DINO: Simultaneous Cross-View World Modeling for Latent Planning in Robot Manipulation

Action-conditioned latent world models predict future visual representations, enabling zero-shot goal-conditioned robot planning and control. However, their predictions for fine-grained spatial and rotational actions are unreliable for full 7-DoF end-effector control. To address this gap, we introduce DUET-DINO, a simultaneous...

💬 0 commentsarXiv:2609.10506v1PDF
0

Posted in cs.LG · 2026-09-09 · Menachem Finkelstein, Diana Legziel Levy, Zohar Yakhini, Sarel Cohen

Quantum Feature Engineering for Credit Default Prediction: When and Why IQP Circuits Help Linear Classifiers

Credit default prediction is a tabular classification problem in which modest gains in F1 translate directly into reduced financial exposure. We ask whether Instantaneous Quantum Polynomial-time (IQP) circuits can produce features that improve a classifier over both its raw classical baseline and Kernel PCA - the strongest...

💬 0 commentsarXiv:2609.10505v1PDF
0

Posted in cs.CG · 2026-09-09 · Tomás Banduc, Simone Pezzuto, Francisco Sahli Costabal

iLogMap: Geodesic Polar Coordinates Parameterization with the Magnetic Laplacian

Geodesic polar coordinates (GPCs) provide an intrinsic parameterization over curved surfaces, but their accurate estimation remains challenging, particularly in the presence of anisotropic metrics, high curvature and complex topology. We introduce iLogMap, a method for computing GPCs in curved domains that recasts the angular...

💬 0 commentsarXiv:2609.10503v1PDF
0

Posted in cs.CR · 2026-09-09 · Emma Sheppard, Zachary Wadhams, Dalton Arford, Clemente Izurieta, Ann Marie Reinhold

Wicked Problem, Parsimonious Solution: Securing Electric Vehicle Charging Station Software

Electric vehicle charging infrastructure presents a suite of novel cyber-physical threats. Among this infrastructure, charging stations are the most vulnerable elements. The software in the charging station supply equipment is particularly vulnerable. Currently, the software is an attack surface that is largely unprotected and poorly...

💬 0 commentsarXiv:2609.10502v1PDF
0

Posted in cs.CV · 2026-09-09 · Simon Khan, Laurent Gajny, Jennyfer Lecompte, Sébastien Laporte

Field Converter: Geometry-Initialized Temporal Residual Refinement for World-Grounded Player Pose Estimation from Soccer Broadcasts

Recovering 3D human pose from monocular sports broadcasts remains challenging when players must be localized in a shared metric world coordinate system rather than only reconstructed relative to their own body. We introduce Field Converter, a geometry-initialized temporal residual framework for world-grounded 3D player pose estimation...

💬 0 commentsarXiv:2609.10498v1PDF
0

Posted in cs.DS · 2026-09-09 · Michal Parnas

Testing the Binary Rank with Polynomial Query Complexity

We provide an adaptive two-sided error testing algorithm for the binary rank of a $0,1$ matrix $M$ with query complexity $O(d^3\log(d+1)/ε^2)$, where $d$ is the tested binary rank bound and $ε$ is the distance parameter. This answers an open question posed by Parnas, Ron and Shraibman~\cite{parnas2021property}, who asked whether the...

💬 0 commentsarXiv:2609.10496v1PDF