Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 23, 2026 — 22:15:29 EST

0

Posted in math.MG · 2026-08-26 · Jonas W. Peteranderl

Linear isoperimetric filling inequalities in Hadamard spaces at and above the asymptotic rank

Reformulated in terms of the asymptotic rank, a conjecture by Gromov predicts a linear isoperimetric filling inequality in all dimensions greater than or equal to the asymptotic rank of a Hadamard space, in contrast to the Euclidean-type nonlinear behavior below this threshold. We prove the predicted linear inequality for Hadamard...

💬 0 commentsarXiv:2608.26059v1PDF
0

Posted in math.OC · 2026-08-26 · Bradley Sturt

The Value of Human Expertise

We consider optimization applications with unknown parameters where the decision maker believes that the optimal value of the nominal problem-the optimization problem they would have solved if the true parameters were known-is unlikely to be large. This belief derives from information that humans have that is not captured in datasets,...

💬 0 commentsarXiv:2608.26051v1PDF
0

Posted in math.NA · 2026-08-26 · Daozhi Han, Nan Jiang, Jonah H. Nissan, Sayantan Sarkar

A family of second order, linear, unconditionally stable methods for the Cahn-Hilliard-Navier-Stokes equations

We present a family of second-order, linear, unconditionally stable implicit-explicit (IMEX) methods for the Cahn-Hilliard-Navier-Stokes (CHNS) equations modeling matched-density two-phase flows. The proposed semi-discrete scheme combines extrapolation of the nonlinear terms with an auxiliary-variable formulation of the nonlinear...

💬 0 commentsarXiv:2608.26046v1PDF
0

Posted in math.AC · 2026-08-26 · Viet-Hoang Tran, Phan Thanh Toan, Thieu N. Vo, Tan M. Nguyen

Polynomial extensions do not preserve the strong finite type property

Arnold introduced the strong finite type (SFT) property in 1973 while studying the dimension of power series rings. For several classes of rings, polynomial extension is known to preserve the SFT property, but the general question remained open. We answer it negatively by constructing an SFT ring $R$ such that $R[X]$ is not SFT.

💬 0 commentsarXiv:2608.26044v1PDF
0

Posted in math.FA · 2026-08-26 · Xiang Fang, Feng Guo, Aman Mishra, P. Muthukumar

Critical Norm Profiles for Finite-Prime Composition Operators on the Hardy Space of Dirichlet Series

We identify the critical boundary operator-norm profile of finite-prime composition operators on the Hardy--Hilbert space \(\mathcal H^2\) of Dirichlet series. For \[ \varphi_{δ,\boldsymbolρ}(s) = \frac12+δ+ δ\sum_{j=1}^dρ_jp_j^{-s}, \qquad \boldsymbolρ\in B_d, \] the renormalized positive coefficient operators converge uniformly in...

💬 0 commentsarXiv:2608.26041v1PDF
0

Posted in math.PR · 2026-08-26 · Renjie Feng, Dong Yao

Rotated semicircle laws for permanental roots of Gaussian random matrices

For matrices drawn from the standard Gaussian orthogonal ensemble (GOE) and Gaussian unitary ensemble (GUE), we prove that the normalized zero counting measure of the permanental characteristic polynomial $Per(zI_N-H_N)$ converges almost surely to the standard Wigner semicircle law on $[-2,2]$, rotated by $π/2$ onto the imaginary...

💬 0 commentsarXiv:2608.26038v1PDF
0

Posted in math.AP · 2026-08-26 · Oliver Petersen, András Vasy

Dual modes in Kerr spacetimes and the Whiting transform: Mode stability revisited

The purpose of the paper is to place Whiting's classical growing mode stability argument, extended to real frequencies by Shlapentokh-Rothman for the scalar wave equation and by Andersson, Ma, Paganini and Whiting in general, in the framework of classical PDE theory. The key steps are: a description of the dual or adjoint modes, a...

💬 0 commentsarXiv:2608.26034v1PDF
0

Posted in math.FA · 2026-08-26 · Manasa N. Vempati

Sparse Operators and their boundedness on Morrey-type Spaces: An Expository Note

Sparse domination is a central tool in modern harmonic analysis, offering a unified approach to weighted inequalities for Calderón--Zygmund operators and related operators such as commutator operators, rough singular integrals, square functions etc. In this expository note, we briefly survey the main ideas behind sparse bounds on...

💬 0 commentsarXiv:2608.26032v1PDF
0

Posted in math.MG · 2026-08-26 · Jonas Knoerr

Isometry invariant valuations on spherical polytopes

We show that every continuous and isometry invariant valuation on spherical polytopes is a linear combination of the spherical intrinsic volumes. The proof relies on a weak differentiability property satisfied by valuations on polytopes in $\mathbb{R}^n$ with a natural smoothness property with respect to the action of the affine...

💬 0 commentsarXiv:2608.26015v1PDF
0

Posted in math.OC · 2026-08-26 · Xin He, Ya-Ping Fang

A unified continuous-discrete framework for Nesterov acceleration: transitions between convex and strongly convex regimes

Classical Nesterov acceleration employs different choices of damping and inertial parameters in the convex and strongly convex settings, both for continuous-time dynamics and for discrete algorithms. When the strong convexity parameter is small, directly using the strongly convex damping or inertial coefficient may lead to slower...

💬 0 commentsarXiv:2608.26014v1PDF
0

Posted in math.NT · 2026-08-26 · Biplab Paul, Ameya Pitale, Abhishek Saha, Ralf Schmidt

An explicit refined Gan--Gross--Prasad identity for Fourier--Jacobi periods of degree 2 Siegel cusp forms

We compute the local integrals appearing in the refined Gan--Gross--Prasad conjecture for Fourier--Jacobi periods of $\mathrm{Sp}_4$ in new ramified cases and use this to formulate an explicit conjectural identity relating Petersson norms of degree 2 Siegel cusp forms and associated half-integral weight forms. We note consequences of...

💬 0 commentsarXiv:2608.26007v1PDF
0

Posted in math.CO · 2026-08-26 · Daniel Debrohim, Diana Sasaki, Patrícia Nunes

Cyclically Colored Triangulations: Enumeration and Connectedness of Reconfiguration Graphs

We study the connectedness and enumeration of reconfiguration graphs of valid triangulations of convex polygons whose vertices are cyclically colored with $j \ge 3$ colors, where every triangle has vertices of three pairwise distinct colors. For $j = 3$, we settle a conjectural expectation of Acharya, Mütze, and Verciani: we prove...

💬 0 commentsarXiv:2608.26006v1PDF
0

Posted in math.AC · 2026-08-26 · Richard Bartels, Sarah Dajani, Gabriel Koomson

Reduction numbers for witnesses to the generalized Loewy length

Let $(R,\mathfrak{m})$ be a one-dimensional Cohen-Macaulay local ring. In this paper, we find the reduction number $r_{z}(\mathfrak{m}^d)$ of $\mathfrak{m}^d$ with respect to a witness $z\in \mathfrak{m}^d \setminus \mathfrak{m}^{d+1}$ to the generalized Loewy length $\text{g}\ell\ell(R)$ for several infinite families of hypersurfaces...

💬 0 commentsarXiv:2608.26003v1PDF
0

Posted in math.GT · 2026-08-26 · Tara E. Brendle, Dan Margalit, Andrew Putman

The kernel of the Birman-Craggs-Johnson homomorphism

For surfaces of genus $g \geq 3$ with at most one boundary component, we give explicit generating sets for the kernel of the Birman-Craggs-Johnson homomorphism and the commutator subgroup of the Torelli group. As an application, we give a new proof of Johnson's calculation of the abelianization of the Torelli group.

💬 0 commentsarXiv:2608.26001v1PDF
0

Posted in math.AG · 2026-08-26 · Gwyn Bellamy, Tom Gannon

Crepant partial resolutions of the nilpotent cone via Hamiltonian reduction

We show that the nilpotent cone associated to a simply connected semisimple algebraic group, together with all its crepant projective partial resolutions, can be constructed as Hamiltonian reductions of the affine closure of the cotangent bundle of base affine space for suitable choices of stability parameter of a maximal torus. We...

💬 0 commentsarXiv:2608.25994v1PDF
0

Posted in math-ph · 2026-08-26 · Huilong Ren

Plasticity as Directional Stationarity: Yielding, Flow, and Hardening from One Functional

Traditional plasticity theory is commonly organized through an elastic law, a yield condition, a flow rule, hardening relations, and loading--unloading conditions. This paper formulates these relations through directional stationarity of one scalar functional evaluated over one-sided admissible plastic paths. The first variation...

💬 0 commentsarXiv:2608.25991v1PDF
0

Posted in math.ST · 2026-08-26 · Yifei Xiong, Nianqiao Phyllis Ju, Vinayak Rao

Statistical Properties of Nonparametric MLE under Laplace Noise

Local differential privacy (LDP) protects individuals in a dataset by perturbing each measurement before release. For real-valued data, a widely used mechanism is additive Laplace noise. We study the problem of estimating the distribution of the latent confidential data from the privatized observations via the nonparametric maximum...

💬 0 commentsarXiv:2608.25997v1PDF
0

Posted in stat.ME · 2026-08-26 · Robin Denz, Filippo Saatkamp, Katharina Meiszl, Nina Timmesfeld

The Symmetric Pair Matching Design: A Self-Controlled Method with Automatic Adjustment for Time Effects

Self-controlled study designs eliminate confounding by individual-level characteristics that remain constant during the observation time and are thus widely used in pharmacoepidemiology and vaccine safety research. However, existing methods remain vulnerable to time effects, including temporal trends and seasonality in the exposure or...

💬 0 commentsarXiv:2608.25979v1PDF
0

Posted in cs.RO · 2026-08-26 · S. Talha Bukhari, Yi Wei, Ruiqi Ni, Zachary Kingston, Aniket Bera

Fast Generative Grasping via Lie Group-Constrained MeanFlow

Grasp synthesis is a core task in robotic manipulation, for which the solution typically forms a multimodal distribution rather than a point estimate. Generative robotic grasping aims to learn this distribution with deep generative models such as diffusion and flow-based approaches. The iterative nature of such generative models makes...

💬 0 commentsarXiv:2608.26076v1PDF
0

Posted in cs.SI · 2026-08-26 · Mihnea C. Moldoveanu, Joel A. C. Baum

Epistemic Networks, Collective Misperception, and the Manipulation of Social Knowledge

We investigate the structure of interactive beliefs in networks: the epistemic state in which agents hold, revise, and act on their models of the epistemic states of other agents. What a group believes depends on what each member agent takes the others to believe, and on what each takes the others to believe about still others. We...

💬 0 commentsarXiv:2608.26075v1PDF
0

Posted in cs.RO · 2026-08-26 · Cong Xu, Ravi Sankar

Gating Before Commitment: Anticipating Intent Divergence to Prevent Post-Interaction Decision Failures in Autonomous Driving

Intent misinterpretation during vehicle interactions causes recurring planning failures. We study a decision layer in which a language-guided intent module reads structured descriptors, computes a smoothed intent-geometry divergence score, and gates the planned maneuver before commitment, upstream of a corridor envelope. On a replayed...

💬 0 commentsarXiv:2608.26074v1PDF
0

Posted in cs.CR · 2026-08-26 · Hritvik Taneja, Moinuddin Qureshi

From Fleet to Lab: Revisiting the Security and Complexity of Industrial Rowhammer Mitigation

This paper studies efficient and secure Rowhammer mitigation at the Memory-Controller (MC). Rowhammer mitigation faces a fundamental tradeoff between tracking storage and mitigation rate: precise trackers (such as Misra-Gries) avoid unnecessary mitigations but require large CAM structures, whereas sampling-based schemes (such as PARA)...

💬 0 commentsarXiv:2608.26072v1PDF
0

Posted in cs.CL · 2026-08-26 · Niklas Muennighoff, Zhengyang Wang, Zeyi Chen, Weijia Shi, Binyuan Hui, John Yang, Dapeng Jiang, Mika Senghaas, Fares Obeid, Johannes Hagemann, Sami Jaghouar, Ludwig Schmidt, Percy Liang, Jason Wei, Andrew Y. Ng, Luke Zettlemoyer, Yejin Choi, Mike Lewis

Prefix Sliding for efficient test-time scaling

Test-time scaling uses extra test-time compute to improve performance, such as letting language models reason longer when solving a problem. As models keep the entire reasoning trace in memory via full attention, hard tasks that need long thinking can be prohibitively expensive. However, we find most intermediate reasoning tokens lose...

💬 0 commentsarXiv:2608.26070v1PDF
0

Posted in cs.LG · 2026-08-26 · Hao Luo, Yiting Yang, Wenyi Zhao, Man Jiang, Zhijun Lin, Ghulam Mohiuddin, Ting Jiang, Kunming Luo, Zihao Zhang, Qingsen Yan, Guoqing Wang, Wei Dong, Peng Wang

Group-Shared Low-Rank Approximation for Mobile-Efficient Pointwise Convolutions in Large-Kernel CNNs

Large-kernel Convolutional Neural Networks (CNNs) deliver remarkable performance in vision tasks by significantly expanding receptive fields, yet their quadratic parameter growth critically impedes storage-efficient edge deployment. While existing efficient architectures adopt parameter-efficient depthwise separable convolution...

💬 0 commentsarXiv:2608.26069v1PDF