Qwen Councils

Mathematics

arXiv preprints from January 1, 2026 through September 19, 2026 — 06:25:34 EST

0

Posted in math.CO · 2026-09-04 · Bruce Reed, Maya Stein

The Erd\H os-Sós conjecture in dense graphs

The Erd\H os--Sós conjecture states that every $n$-vertex graph with more than $(k-2)n/2$ edges contains every $k$-vertex tree. We prove that for every $γ$ there is an $n_0$ such that for all $n\ge n_0$ and $k \ge γn$ the conjecture holds. As a corollary of our result, we obtain a solution of a 51-year-old problem of Erd\H os and...

💬 0 commentsarXiv:2609.05417v1PDF
0

Posted in math.CO · 2026-09-04 · Songling Shan

Non-Hamiltonian $\frac{3}{2}$-Tough Plane Triangulations

By Tutte's classic theorem of 1956 that every 4-connected planar graph is Hamiltonian, every planar graph of order at least three with toughness greater than $\frac{3}{2}$ is Hamiltonian. In 1999, Owens constructed a sequence of maximal planar graphs whose toughness approaches $\frac{3}{2}$ from below and which do not contain even a...

💬 0 commentsarXiv:2609.05414v1PDF
0

Posted in math.CO · 2026-09-04 · Bruce Reed, Maya Stein

The extremal cases of the Erd\H os--Sós conjecture

The Erd\H os--Sós conjecture states that every $n$-vertex graph $G$ with more than $(k-2)n/2$ edges contains every $k$-vertex tree. We solve the extremal cases of this conjecture, showing that for some fixed $μ>0$, the conjecture holds for each $G$ that minimally satisfies the assumptions of the conjecture and has a subgraph~$H$...

💬 0 commentsarXiv:2609.05411v1PDF
0

Posted in math.AC · 2026-09-04 · Ton That Quoc Tan

An Improved Upper Bound for the Perturbation Index

Let $(R,\mathfrak m)$ be a Noetherian local ring and $J$ be an arbitrary ideal of $R$. Suppose that $f_1,\ldots,f_r$ is a $J$-filter regular sequence in $R$ and $I=(f_1,\ldots,f_r)$. In this paper, we establish an improved upper bound for the perturbation index of the associated graded ring $\mathrm{gr}_J(R/I)$, refining the bound...

💬 0 commentsarXiv:2609.05299v1PDF
0

Posted in math.PR · 2026-09-04 · Yukun He, Jiaoyang Huang

The oriented Kesten--McKay law for random regular digraphs

We consider the adjacency matrix of a random directed $d$-regular graph on $N$ vertices. For fixed $d\geq 2$, we prove that the empirical eigenvalue density converges in probability to the oriented Kesten--McKay law as $N\to \infty$. The key technical input is the small-ball probability estimate for the smallest singular value. The...

💬 0 commentsarXiv:2609.05297v1PDF
0

Posted in math.AP · 2026-09-04 · Daniel Matthes, Vera Pazukhina

Solutions to fourth order degenerate parabolic equations obtained via weighted energy dissipation

We apply the variational method of Weighted Energy Dissipation (WED) to obtain a global-in-time approximation of solutions to fourth order degenerate parabolic equations of Cahn-Hilliard type. Differently from the standard approach to the existence theory, WED induces an elliptic regularization in time, not in space. The confinement...

💬 0 commentsarXiv:2609.05293v1PDF
0

Posted in math.PR · 2026-09-04 · Jiansheng Xie, Yechi Zhou

Universal Exponent-Two Degree Laws in Range-Renewal Networks

Let an infinite sequence of independent and identically distributed random variables over a countable alphabet generate a graph by joining consecutive symbols and suppressing repeated edges. We determine the exact tail and local asymptotics of the limiting degree distributions of this range-renewal graph. If the ordered sampling...

💬 0 commentsarXiv:2609.05290v1PDF
0

Posted in math.ST · 2026-09-04 · Rianne de Heide

Statistical reduction before the target is known: two boundary results

Suppose that the eventual use of data is not known when the data are reduced or collected. This note considers two simple boundary cases. In a finite statistical experiment, a statistic preserves the Bayes risk for every finite later decision problem if and only if it is sufficient. Hence, when the minimal sufficient statistic is...

💬 0 commentsarXiv:2609.05286v1PDF
0

Posted in math.AP · 2026-09-04 · Eric Bonnetier, Charles Dapogny, Roman Moskalenko

Asymptotic expansion of the voltage potential under small Robin perturbations of its boundary conditions

Inspired by questions related to inverse problems and shape optimization, we derive an asymptotic expansion of the voltage potential, solution to a model elliptic second-order partial differential equation, under small perturbations of its boundary conditions. More precisely, the homogeneous Dirichlet or homogeneous Neumann boundary...

💬 0 commentsarXiv:2609.05283v1PDF
0

Posted in math.DG · 2026-09-04 · Gianni Manno, Vladimir S. Matveev, Filippo Salis

Sophus Lie's problem on two-dimensional metrics with projective symmetries: completing the local classification

We complete the local classification, up to isometry, of $2$-dimensional pseudo-Riemannian metrics (i.e. both Riemannian and Lorentzian), admitting a projective symmetry algebra of dimension at least two. The new contribution is the treatment of the non-regular case: we obtain a complete list of mutually non-isometric normal forms in...

💬 0 commentsarXiv:2609.05280v1PDF
0

Posted in math.AP · 2026-09-04 · Nicholas McCleerey, Abhinav Pande, Thidas Wanasinghe

Asymptotics for the $k$-Hessian Eigenvalue on the Unit Ball

We compute the limit of the eigenvalue of the $k$-Hessian operator on the unit ball in $\mathbb{R}^n$ when $k\rightarrow \infty$, assuming that the ratio $\frac{n}{k}$ remains fixed. When $n< 2ke$, we moreover identify the limit of the corresponding eigenfunctions. We also derive monotonicity results and consider when the ratio varies in $n$.

💬 0 commentsarXiv:2609.05277v1PDF
0

Posted in math.DS · 2026-09-04 · Rhiannon Dougall

Relative ($τ$), Expanders, and Decay of Correlations for certain Expanding Maps

Relative ($τ$) is equivalent to a statement that the sequence of Cayley graphs associated to group quotients $Γ_q=Γ/N_q$, $q\in\mathbb{N}$, form an expander family. There is a philosophy that expander graphs give rise to good mixing; for instance, one has exponential mixing for the geodesic flow uniformly the along a family of...

💬 0 commentsarXiv:2609.05271v1PDF
0

Posted in math.CO · 2026-09-04 · Adriana Baldacchino, Yair Caro, Xandru Mifsud

Ramsey properties of maximal (outer)planar graphs

We study a natural extension of Ramsey theory relative to the classes of maximally planar and maximally outerplanar graphs. This can be seen as a continuation of the study of `Planar Ramsey theory', introduced by Axenovich et al. The question we ask is the following: For a fixed family $\mathcal{K}$ of graphs and a pair of graphs...

💬 0 commentsarXiv:2609.05268v1PDF
0

Posted in math.NA · 2026-09-04 · Yuwen Li, Guozhi Zhang

Shallow neural network approximation in mixed Sobolev spaces

We investigate the best $L_2$ approximation of mixed Sobolev spaces by shallow neural networks with $n$ neurons and general activation functions. We first establish an activation-independent Fourier-block principle: if an activation has univariate approximation order $ρ$ in the sense of the Fourier-block property, then the global...

💬 0 commentsarXiv:2609.05263v1PDF
0

Posted in math.CO · 2026-09-04 · Matheus Adauto, Celina de Figueiredo, Diana Sasaki, Rafael Schneider

Order 14 is the largest order for which every 4-total coloring of every cubic graph is equitable

A total coloring of a graph is an assignment of colors to its vertices and edges so that adjacent or incident elements receive distinct colors, and it is equitable when the cardinalities of any two color classes differ by at most one. Stemock conjectured that every $4$-total coloring of a cubic graph of order less than $20$ is...

💬 0 commentsarXiv:2609.05259v1PDF
0

Posted in math.OC · 2026-09-04 · Sihan Ge, Yichen Lin, Chenyu Zhou, Jianghao Lin, Tao Yao, Dongdong Ge

Ask Before You Optimize: Dynamic Pre-Formulation Clarification for Interactive Optimization

Large language models (LLMs) are increasingly used to formulate optimization models from natural-language problem descriptions, yet realistic operations research (OR) requests are often incomplete: missing objectives, constraints, or business rules can change the resulting mathematical program. Existing evaluations largely assume a...

💬 0 commentsarXiv:2609.05258v1PDF
0

Posted in math.AG · 2026-09-04 · Kush Singhal

Coleman Isomorphisms in Syntomic Cohomology and $\mathrm{THH}$

This paper proves a generalisation of Coleman's isomorphism (between norm compatible cyclotomic units and a group of invertible power series) to various cohomology theories evaluated on proper regular $p$-adic formal schemes, for future applications to Iwasawa theory. This generalisation is an immediate consequence of a description,...

💬 0 commentsarXiv:2609.05252v1PDF
0

Posted in math.NA · 2026-09-04 · Aashutosh Sharma, Andreas Bartel, Manuel Schaller

A Generalized Scalar Auxiliary Variable Method for Structure-Preserving and Efficient Integration of Nonlinear port-Hamiltonian DAEs

We develop an energy-optimal generalized scalar auxiliary variable (EOP-GSAV) framework for nonlinear index-one port-Hamiltonian differential-algebraic equations (pH-DAEs). Exploiting the port-Hamiltonian structure, we separate the nonlinear effort, interconnection, and dissipation terms from a constant implicit core. The resulting...

💬 0 commentsarXiv:2609.05246v1PDF
0

Posted in math.PR · 2026-09-04 · Guilherme Vianna

An Exact Tail Condition for the Largest Error in Estimating a Rank-One Direction

We consider a rectangular random matrix formed by adding a rank-one term to a matrix with independent entries. The direction on the left side of that term is estimated by the leading left singular vector, and the error is multiplied by the square of the size of the added term. For entries with mean zero and variance one, we identify...

💬 0 commentsarXiv:2609.05244v1PDF
0

Posted in math-ph · 2026-09-04 · Yasumichi Matsuzawa, Itaru Sasaki, Akito Suzuki

Representation Theory of Canonical Commutation Relations Arising from the Quantization of the Klein-Gordon Equation with an External Potential

We investigate the Weyl representation of the canonical commutation relations for a model describing a quantized massive scalar field under the influence of an external potential. The main problem is to determine whether the Weyl representation remains equivalent to or becomes inequivalent to the original one when the mass and/or...

💬 0 commentsarXiv:2609.05237v1PDF
0

Posted in math.ST · 2026-09-04 · Mikael Møller Høgsgaard, Patrick Rebeschini, Tobias Wegel

Reconciling Universal and Uniform Learning with $Q$-Aggregation

We study regression under bounded responses in terms of excess mean squared error. When the comparator class is finite, this setting is known as model selection aggregation, and achieving minimax excess risk requires improper learning algorithms. Contrary to this, in the universal learning framework no improperness is needed, as...

💬 0 commentsarXiv:2609.05041v1PDF
0

Posted in math.ST · 2026-09-04 · Cristina Butucea, Huiyun Tang, Marie-Luce Taupin

Faster Learning under Relaxed Local Differential Privacy

We consider density estimation under the relaxed local differential privacy condition that the privatized distributions are $α$-close in total variation distance. We show that adding independent noise with a convenient symmetrized Gamma distribution to each sensitive observation attains the $α$-TV-LDP. We prove that the deconvolution...

💬 0 commentsarXiv:2609.05034v1PDF
0

Posted in math.OC · 2026-09-04 · Shrestha Ghosh, Puduru Viswanadha Reddy

Open-Loop Stackelberg LQ Difference Games with Coupled-Affine Inequality Constraints: An Exact OCP--LCS/LCQP Reformulation

In this letter, we study finite-horizon linear-quadratic Stackelberg difference games with coupled-affine state-control inequality constraints. Under the stated assumptions, we show that generalized open-loop Stackelberg equilibria admit an exact reformulation as an optimal control problem subject to a discrete-time linear...

💬 0 commentsarXiv:2609.04928v1PDF
0

Posted in math.OC · 2026-09-04 · Abbas Pasdar, Farnaz Adib Yaghmaie

Policy Iteration for Domain Randomized Linear Quadratic Systems

In this work, we study policy optimization under domain randomization for linear quadratic control, focusing on learning a single state-feedback controller that minimizes the average cost across systems with uncertain dynamics. We propose a policy iteration algorithm with a step-size rule that preserves stability across all sampled...

💬 0 commentsarXiv:2609.04794v1PDF