Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Monday 4 May

Optimization and Control

A computational comparison of handling distance constraints in MINLP

Minimum distance constraints (minDCs) appear in many geometric optimization problems. They pose major challenges for mixed-integer nonlinear programming (MINLP) due to their reverse-convexity. We develop new algorithms for tightening variable bounds in general MINLPs with minDCs. Because many such problems exhibit substantial symmetry, we further discuss an approach for handling rotation symmetries. In a computational study, we examine the performance of the various methods and determine the scenarios in which each approach demonstrates superiority.
Read the full abstract

Dynamical Systems

On higher order regionally proximal relations and topological characteristic factors for group actions

We study several aspects of higher-order regionally proximal relations for group actions. First, we develop an algebraic approach to study higher-order regionally proximal relations. To this end, we introduce a new topology on a subgroup of the universal minimal system, which can be seen as a higher-order analogue of the classical $\tau$-topology. Using this topology, we obtain an algebraic characterization of the relation $\mathbf{RP}^{[d]}$ for abelian actions. Then, we study higher-order regionally proximal relations via recurrence sets, extending results of Huang, Shao, and Ye for $\mathbb{Z}$-actions to more general group actions under suitable assumptions. We then study topological characteristic factors and prove, modulo almost one-to-one factors, that the maximal factor of order $d-1$ is the topological characteristic factor of order d for cubic configurations for arbitrary group actions, and for arithmetic progressions for finitely generated abelian group actions. As a consequence, we show that $\mathbf{RP}^{[d]}$ and $\mathbf{AP}^{[d]}$ coincide on minimal points for finitely generated abelian group actions, and we apply this to obtain results on independence along arithmetic progressions.
Read the full abstract

Combinatorics

Graceful labelings of spiders with three-edge legs and pendant leaves at the center

A graph $G$ on $m$ edges is graceful if there is an injection $f : V(G) \to \{0, 1, \ldots, m\}$ whose induced edge labels $\{|f(u) - f(v)| : uv \in E(G)\}$ are exactly $\{1, 2, \ldots, m\}$. Ringel and Kotzig conjectured in 1964 that every tree is graceful. A computer check has confirmed this for all trees on at most 35 vertices (Fang 2010), but no general proof is known. Here we exhibit an infinite family of trees that escapes the named spider results of Bahls–Lake–Wertheim, Panpa–Poomsa-ard, and Panpa–Imnang–Wasuanankul: the family $T(k, m)$ of spiders with $k$ legs of length $3$ together with $m$ pendant leaves at the centre. We prove every such tree is graceful for all $k \ge 1$ and $m \ge 0$. The argument splits into two short lemmas. The first is a pendant-extension lemma that applies whenever the underlying graceful labeling sends the centre to $0$; the second is the base case, namely that $S_{k, 3}$ admits exactly such an apex-zero labeling, a fact already implicit in Bahls–Lake–Wertheim (2010). What is new is the explicit identification of $T(k, m)$ and the observation that the family is closed under both pendant addition and the apex-zero condition, so it includes infinitely many trees not handled by the named theorems above.
Read the full abstract

2605.02303 · 4 May · Withdrawing on novelty grounds. The result is exactly Bahls-Lake-Wertheim (Discrete Math 310, 2010) Theorem 1 (graceful labelings of uniform spiders centred at 0) combined with a routine one-paragraph pendant-extension lemma. The threshold for an independent publication is not met

Combinatorics

On the approximation of permutons

We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for permutons supported by graphs of measure-preserving functions, and demonstrate how the local regularity of this function obstructs approximability. We also consider the biased Brownian separable permuton and prove a lower bound on its approximation error by showing that its supporting measure-preserving function has Lipschitz points almost surely.
Read the full abstract

Information Theory

Semantic Ordered Statistics Decoding

We propose a Semantic Ordered Statistics Decoder (sem-OSD), a soft decoder for short linear block codes carrying byte-streamed sources such as natural-language text. Sem-OSD injects a byte-level language-model (LM) prior into ordered statistics decoding (OSD) through a fused bit-level score that combines channel reliability with the LM prior, and uses it for the most-reliable basis (MRB) selection and the codeword candidate scoring. Sem-OSD enumerates two complementary test-error-pattern (TEP) families: a bit-flip family that flips up to $m$ bits, and an LM-driven family of up to $\omega$ byte substitutions that reaches error patterns the bit-flip family cannot. The LM prior is computed by a byte-level Transformer fine-tuned for byte-level denoising. Simulation results show that, on AWGN, sem-OSD achieves block error rates (BLERs) below the finite-blocklength normal-approximation bound for uniform sources on both binary BCH$(127,64)$ and shortened RS$(16,8)$ over GF(256), exceeding Fossorier OSD by a $1.5$ dB coding gain. On a Gilbert–Elliott burst-error channel, sem-OSD provides $4$ dB and $1$ dB of more coding gain than Berlekamp–Massey and OSD, respectively.
Read the full abstract

Analysis of PDEs

On weak solutions for the stationary Cahn-Hillard-Navier-Stokes equations with singular potential

The stationary Navier–Stokes–Cahn–Hilliard equations are considered, governing the motion of a compressible, two-phase fluid mixture with a diffuse interface. The free energy density in this paper has a singular logarithmic (Flory-uggins) form, ensuring that the mass fraction remains in the physical range and allowing for vacuum states. We prove the existence of weak solutions in a three-dimensional bounded domain under structural assumptions on the adiabatic exponent. The stationary setting poses two main mathematical challenges: the absence of an energy inequality driven by the evolution process to control the singular potential, and the degeneracy of the density near the vacuum. To address these issues, we introduce a specialized regularization of the logarithmic term that eliminates the quadratic growth induced by anti-diffusion, thereby restoring compactness. Uniform estimates are obtained through a special choice of artificial pressure and an interpolation argument that controls the desired norm of the density. A two-level limiting process then yields a weak solution that satisfies the physical bounds almost everywhere on the support of the density.To our knowledge, this is the first existence result for the steady compressible Navier–Stokes–Cahn–Hilliard system that incorporates both a singular free energy and vacuum regions.
Read the full abstract

All authors Zhilei Liang, Sen Liu, Jiangyu Shuai, Dehua Wang

Numerical Analysis · Cross-listed from cs.LG

Variational Matrix-Learning Fourier Networks for Parametric Multiphysics Surrogates

Multiphysics simulation is critical for system-technology co-optimization (STCO) in chiplet-based design, but repeated finite-element solutions of PDE-governed problems are computationally expensive in parametric design exploration. This paper proposes a variational matrix-learning Fourier network (VMLFN) for efficient parametric multiphysics surrogate modeling. VMLFN constructs a log-space sine neural representation with randomly sampled spectral frequencies, frequency-dependent decay regulation, and embedded Dirichlet boundary conditions. With fixed hidden-layer parameters, the output-layer weights are determined by reformulating the governing PDEs into variational weak forms and enforcing the stationarity condition of the resulting energy functional. This converts physics-informed training into a linear matrix-solving problem, requiring only first-order derivatives and avoiding both high-order automatic differentiation and penalty-coefficient tuning. A heuristic frequency-scanning algorithm is further introduced to select a problem-adaptive maximum frequency that covers the dominant spectral range of the target problem. The proposed method is validated on heat conduction, solid mechanics, and Helmholtz wave propagation problems. Results from five benchmark cases demonstrate that VMLFN delivers accurate full-field predictions with substantial speedup over conventional physics-informed neural networks and repeated finite-element simulations.
Read the full abstract

Differential Geometry

Foundations of Riemannian Geometry for Riemannian Optimization: A Monograph with Detailed Derivations

Riemannian geometry provides the fundamental framework for optimization on nonlinear spaces such as matrix manifolds, which arise in machine learning, signal processing, and robotics. While the underlying theory is classical, existing literature often presents results at a high level of abstraction, omitting the detailed coordinate-level derivations required for implementation and algorithm development. This work provides a self-contained and rigorous treatment of the foundations of Riemannian geometry, with a focus on explicit derivations tailored to Riemannian optimization. We systematically develop the key geometric structures – including tangent and cotangent spaces, tensor calculus, metric tensors, Levi-Civita connections, curvature, and geodesics – emphasizing step-by-step derivations in coordinates and matrix form. Building on these foundations, we derive the Riemannian gradient, Hessian, exponential map, and retraction in a form suitable for numerical computation. We further specialize these constructions to important matrix manifolds, including the Stiefel, Grassmann, and SPD (Symmetric Positive Definite) manifolds, providing explicit formulas widely used in optimization and geometric machine learning. This monograph develops a unified and implementation-oriented treatment of Riemannian geometry for optimization on manifolds. Its main contribution is the systematic organization and detailed derivation of classical geometric constructions in forms directly usable for algorithm design and numerical implementation. By connecting coordinate-level differential geometry with matrix-manifold formulas, the monograph bridges the gap between abstract theory and practical computation, and provides a reference for researchers and practitioners working in Riemannian optimization and related fields.
Read the full abstract

Differential Geometry

Non-Kähler Special Lagrangian submanifolds and SYZ mirror symmetry

We determine purely algebraic equations to identify SLags generated by invariant distributions in a class of non-Kähler Calabi-Yau manifolds. We determine SLag distributions, determine which leaves integrate to compact submanifolds and study the deformation theory, which we find to be unobstructed. We apply our results to the Iwasawa manifold, the completely solvable 6-dimensional Nakamura manifold and the complex parallelizable Nakamura manifold. Through these examples we find families of topologically distinct SLags, including the existence of SLag torus fibrations. Following the proposal of Lau-Tseng-Yau, we compute the non-Kähler SYZ mirrors of Nakamura manifolds, together with their refined symplectic Bott-Chern cohomologies. As a consequence, we find the existence of semi-flat non-Kähler mirror pairs which are not diffeomorphic.
Read the full abstract

Combinatorics

Word-Representability of Shift Graphs

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $xy\in E$. For integers $n>k>0 $, the shift graph $G(n,k)$ is the graph whose vertex set consists of all increasing $k$-tuples $(x_1,x_2,\dots,x_k)$ with $1\le x_1<x_2<\cdots<x_k\le n$, where two vertices $(x_1,\dots,x_k)$ and $(y_1,\dots,y_k)$ are adjacent whenever $x_{i+1}=y_i$ for all $1\le i\le k-1$ or $y_{i+1}=x_i$ for all $1\le i\le k-1$. Shift graphs are classical examples of sparse graphs having arbitrarily high chromatic number and odd girth. We further observe that shift graphs arise naturally as induced subgraphs of simplified de Bruijn graphs. Although simplified de Bruijn graphs contain non-word-representable members in general, we prove that the entire class of shift graphs is word-representable. We also introduce a natural generalization of shift graphs in which adjacency is defined by more than one shift condition, and show that these generalized shift graphs are likewise word-representable. As a consequence, we obtain an explicit family of graphs exhibiting a contrast between line graph and line digraph constructions: there exists a family of word-representable graphs whose line graphs are not word-representable when the number of vertices is at least $5$, while their line digraphs are word-representable.
Read the full abstract

Differential Geometry

Superposition of Harmonic Surfaces: Helical Motifs in Lamellar Structures

We study harmonic surfaces in $\mathbb{R}^3$ through the framework of harmonic Enneper immersions and prove a superposition principle for such surfaces. We prove that minimal and maximal surfaces admit a decomposition into harmonic components. Applications include the construction of finite and infinite configurations of helical motifs, an asymptotic analysis via multipole expansions, and the modelling of twist grain boundary phases in lamellar systems.
Read the full abstract

Combinatorics

A complete classification of perfect state transfer in Grover walks on Cayley graphs over dihedral groups

We give a complete classification of Cayley graphs over dihedral groups that exhibit perfect state transfer between distinct vertex states in Grover walks. For $n\ge 3$, let $D_n:=\langle a,b : a^n=b^2=1,\ bab=a^{-1}\rangle$ be the dihedral group of order $2n$, and let $S\subseteq D_n\setminus\{1\}$ satisfying $S=S^{-1}$ and $\langle S\rangle =D_n$. We show that the Cayley graph $\mathrm{Cay}(D_n,S)$ exhibits perfect state transfer if and only if $(D_n,S)$ is equivalent to one of the following pairs: $(D_n,\{b,ba\})$; $(D_n,\{a,a^{-1},ba,ba^{-1}\})$, where $4$ does not divide $n$; or $(D_{2m},\{b,ba^{m},ba,ba^{m+1}\})$, where $m$ is odd. Our proof combines the representation theory of $D_n$ with tools from algebraic number theory.
Read the full abstract

Statistics Theory

Simultaneous Inference for Nonlinear Time Series, a Sieve M-regression Approach

This paper studies simultaneous inference of conditional distributions in nonlinear time series from a sieve M-regression perspective. Existing literature on sieve M-regression has primarily focused on pointwise asymptotics, leaving the development of uncertainty quantification over the entire predictor space unexplored. We address this gap by establishing a uniform Bahadur representation for the sieve M-estimator, accommodating dependent data and a growing number of sieve basis functions. A novel high-dimensional empirical process theory is developed for temporally dependent data, and a specifically designed M-decomposition method is utilized to control high-dimensional complexities. Building on this representation, we develop a convex Gaussian approximation to characterize the asymptotic behavior of the estimator and construct valid simultaneous confidence regions (SCRs). To facilitate practical implementation, we introduce a self-convolved bootstrap algorithm that accurately approximates the distribution of the maximal deviation. Our inferential framework is supported by rigorous error bounds and validated through numerical simulations and real data applications.
Read the full abstract

Combinatorics

On conjectural fermionic formulas for the Macdonald index in Argyres-Douglas theories

We prove a fermionic-bosonic duality relation for the Macdonald index in Argyres-Douglas theories of type $(A_1, D_{2k+1})$, thereby yielding a conjectural fermionic formula due to Andrews et al. Our duality is built upon a new conjugate Bailey pair to be established using techniques from orthogonal polynomials and basic hypergeometric series. In addition, this fermionic formula implies another sum-like expression independently conjectured by Andrews et al. and Kim et al. for the same Macdonald index.
Read the full abstract

Statistics Theory

Statistics of a multi-factor function from its Fourier transform

For a phenomenon $\boldsymbol{f}$ that is a function of $n$ factors, defined on a finite abelian group $G$, we derive its population statistics solely from its Fourier transform $\hat{\boldsymbol{f}}$. Our main result is an $m$-Coefficient/Index Annihilation Theorem: the $m$th moment of $\boldsymbol{f}$ becomes a series of terms, each with precisely $m$ Fourier coefficients — and surprisingly, the coefficient indices in each term sum to zero under group addition. This condition acts like a filter, limiting which terms appear in the Fourier domain, and can reveal deeper relationships between the variables driving $\boldsymbol{f}$. These techniques can also be used as an analytical/design tool, or as a feasibility constraint in search algorithms. For functions defined on $\mathbb{Z}_2^n$, we show how the skew, kurtosis, etc. of a binomial distribution can be derived from the Fourier domain. Several other examples are presented.
Read the full abstract

Classical Analysis and ODEs

Weighted decoupling with lower-dimensional frequency localization

We prove weighted $L^2$ and refined $L^p$ decoupling estimates for functions whose Fourier transforms are supported in a small neighborhood of the unit sphere or the truncated paraboloid with an additional lower-dimensional frequency localization property. As a special case, we recover the fractal $L^2$ restriction estimate of Du and Zhang, with a sharper dependence on the density of the weight. We also derive weighted refined decoupling estimates related to the Falconer distance set problem, improving earlier results under the stronger assumption that the underlying weight is $\alpha$-dimensional at every scale.
Read the full abstract

Group Theory

Characters of surface groups

We initiate the study of characters of surface groups and their corresponding tracial representations. We show that any tracial representation can be approximated arbitrarily well in the Wasserstein topology by factorial tracial representations with spectral gap. In particular, we deduce that the space of traces of a surface group is the Poulsen simplex, thereby resolving positively a question posed by Orovitz, Slutsky, and the third author.
Read the full abstract

Numerical Analysis

A Structure-Preserving Stagewise Rescaling Algorithm for a Two-Dimensional Nonlocal MEMS Equation in an Asymptotically Constant-Feedback Regime

Nonlocal MEMS equations exhibit finite-time quenching, or touchdown, which is difficult to capture numerically. We study a stagewise rescaling algorithm for a two-dimensional nonlocal MEMS equation in an asymptotically constant-feedback touchdown regime. The equation is not exactly invariant under the $A^{3/2}$–$A^3$ scaling used here; the scaling is justified when the reciprocal-integral feedback $K(t)=1+\int_\Omega(1-u)^{-1}dx$ remains bounded and converges to a finite positive limit, as in the single-point touchdown profiles of Duong–Zaag. In this regime the leading-order core dynamics reduce to a local MEMS equation with an asymptotically constant coefficient. Using a fixed-stage scaling of the deficit variable, we obtain a gradient flow for a rescaled energy at frozen amplitude and prove an exact energy dissipation identity within each stage. We introduce a minimizing-movement stage solver and derive a discrete energy inequality. Since strict monotonicity need not hold across stage transitions, we separate the switch and outer-update defects and prove an exact defect balance. Under a uniform switch-defect estimate, this yields quantitative almost monotonicity and a defect-aware criterion for nonexistence of a global admissible continuation. The numerical section is organized around reproducible two-dimensional reference computations: a full-domain stagewise run showing trigger detection, fixed-stage energy decay, and geometric accumulation of physical time, and a direct fixed-domain energy check. These tests are not used as proof of the bounded-window criterion; instead, they report finite-feedback diagnostics and identify the ideal-transfer switch-energy diagnostics required for a posteriori verification.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Distributed Observer-based Fault Detection over Intelligent Networked Multi-Vehicle Systems

Decentralized strategies are of interest for local decision-making over multi-vehicle networks. This paper studies mixed traffic networks of human-driven and autonomous vehicles with partial sensor measurements. The idea is to enable the group of connected autonomous vehicles (CAVs) to track the state of a group of human-driven vehicles (HDVs) via distributed consensus-based observers/estimators. Particularly, we make no assumption that the group of HDVs is locally observable in the direct neighborhood of any CAV. Then, the main contribution is to design local residual-based fault detection and isolation (FDI) at every CAV to detect possible faults/attacks in the sensor measurements. This distributed detection strategy enables every CAV to locally find possible anomalies in its taken sensor measurement with no need for a central processing unit. Two FDI logics are proposed with and without considering the history of the residuals. These FDI techniques are based on probabilistic threshold design on the residuals (in contrast to the existing deterministic threshold FDI techniques) with no assumption that the noise is of bounded support. This is more realistic in real-world multi-vehicle transportation systems.
Read the full abstract

Analysis of PDEs

Gaussian-weighted normal operators on Euclidean space

We consider the normal operator of the X-ray transform, weighted with Gaussian weights, in Euclidean space with dimension at least 3. We show the eigenfunctions of the normal operator are joint eigenfunctions of the harmonic oscillator and the spherical Laplacian, and we relate the spectrum to that of elliptic operators in the 1-cusp pseudodifferential calculus.
Read the full abstract

Optimization and Control

A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms

In this work, we reveal a rich combinatorial structure underlying exact minimax optimal algorithms for classical nonexpansive fixed-point problems. This viewpoint unifies all extremal optimal methods and provides a systematic and practical framework for designing new algorithms via diagrams. Specifically, we study fixed-step algorithms represented by a lower triangular matrix H, and show that the set of optimal (N-1)-step algorithms has exactly (N-1)! vertices (extremal algorithms), each of which naturally corresponds to an arc diagram, a graph that encodes its convergence proof. Using these arc diagrams, we can compose, decompose, and analyze the properties of distinct optimal vertex algorithms. Furthermore, we determine when the H-dual operation, given by taking the anti-diagonal transpose of H, preserves the optimality of a vertex algorithm, and in such cases we characterize the convergence proof of the dual algorithm. Based on this machinery, we develop new optimal algorithms with quasi-anytime guarantees; that is, they admit an increasing integer sequence such that the corresponding iterates have the optimal residual guarantees, and are additionally robust to fixed-point operators that violate nonexpansiveness.
Read the full abstract

Probability

Finitely Dependent Processes on Subshifts

Finitely dependent processes generalize independent processes by requiring that the restrictions of the process to sufficiently separated sets are independent. The existence of stationary finitely dependent processes on combinatorial models like $\mathbb Z^d$ subshifts can be quite mysterious. For instance, Holroyd and Liggett constructed such processes on proper $4$-colorings of $\mathbb Z^d$ for all $d$ while Holroyd, Schramm and Wilson showed that there are no such processes on proper $3$-colorings of $\mathbb Z^d$ for $d>1$. In this paper, we take inspiration from these results and investigate them further. On the positive side, we show that there exists a dense set of stationary finitely dependent processes supported on subshifts with strong mixing properties like the finite extension property. On the negative side, we see that the cohomology of the subshifts can form an obstruction to the existence of such processes. In particular we use Conway-Lagarias-Thurston height functions to characterize when there exists a finitely dependent process on the space of tilings by boxes of $\mathbb Z^2$ answering the tiling problem posed by Gao, Jackson, Krohne and Seward in dimension $2$. The ideas also apply to many other models, such as graph homomorphisms and ribbon tilings. On the way, we also show that continuous cocycles on strongly irreducible subshifts valued in a special class of groups (including torsion free Gromov hyperbolic groups and free product of cyclic groups) are perturbations of group homomorphisms.
Read the full abstract

Algebraic Geometry

Projective connections on super Heisenberg coinvariants. I

We study derived coinvariants of isotropic subbundles on modules over super Heisenberg algebras and construct and study certain natural transitive Lie algebroids acting on them.

Functional Analysis

Hyponormal block Toeplitz operators with finite rank self-commutators

In this paper, we identify a large class of hyponormal block Toeplitz operators whose self-commutators are of finite rank. \ Recall that an operator $T_\varphi$ is hyponormal and $[T_\varphi^{*}, T_\varphi]$ is a finite rank operator if and only if there exists a finite Blaschke product $b$ in $\mathcal{E}(\varphi)$, where $$ \mathcal{E}(\varphi) := \{k \in H^\infty(\mathbb{T}): \left\|k\right\|_\infty \le 1 \textrm{ and } \varphi-k\cdot \bar{\varphi} \in H^\infty(\mathbb{T})\}. $$ An analogous set $\mathcal{E}(\Phi)$ can be defined for a matrix-valued symbol $\Phi$. \ In the block Toeplitz operator case, we first establish that if a symbol $\Phi$ is in $L^\infty(\mathbb{T}, M_n)$ and if $\mathcal{E}(\Phi)$ contains a constant unitary matrix $U$, then $T_\Phi$ is normal. \ We then obtain a suitable converse, under a mild assumption on the symbol. \ Next, we provide a partial answer to a conjecture recently posed by R.E. Curto, I.S. Hwang, and W.Y. Lee. \ Concretely, assume that $\Phi \in H^{\infty}(\mathbb{T}, M_n)$ is such that $\Phi^{\ast}$ is of bounded type and $T_\Phi$ is hyponormal. \ Then $[T_\Phi^{\ast}, T_\Phi]$ is a finite rank operator if and only if there exists a finite Blaschke-Potapov product in $\mathcal{E}(\widetilde{\Phi})$, where $\widetilde\Phi:=\breve{\Phi}^*$ and $\breve{\Phi}(e^{i\theta}):=\Phi(e^{-i\theta})$.
Read the full abstract

Functional Analysis

Semi-hyponormality of commuting pairs of Hilbert space operators

We first find an explicit formula for the square root of positive $2 \times 2$ operator matrices with commuting entries, and then use it to define and study semi-hyponormality for commuting pairs of Hilbert space operators. \ For the well-known $3$–parameter family $W_{(\alpha,\beta)}(a,x,y)$ of $2$–variable weighted shifts, we completely identify the parametric regions in the open unit cube where $W_{(\alpha,\beta)}(a,x,y)$ is subnormal, hyponormal, semi-hyponormal, and weakly hyponormal. As a result, we describe in detail concrete sub-regions where each property holds. For instance, we identify the specific sub-region where weak hyponormality holds but semi-hyponormality does not hold, and vice versa. \ To accomplish this, we employ a new technique emanating from the homogeneous orthogonal decomposition of $\ell^2(\mathbb{Z}_+^2)$. The technique allows us to reduce the study of semi-hyponormality to positivity considerations of a sequence of $2 \times 2$ scalar matrices. It also requires a specific formula for the square root of $2 \times 2$ scalar and operator matrices, and we obtain that along the way. As an application of our main results, we show that the Drury-Arveson shift is not semi-hyponormal. Taken together, the new results offer a sharp contrast between the above-mentioned properties for unilateral weighted shifts and their $2$–variable counterparts.
Read the full abstract

Combinatorics

Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools

We give new examples of graphs and trees with dominating set sequences that are not log-concave. These examples were generated by PatternBoost, a transformer-based reinforcement learning software developed by Charton-Ellenberg-Wagner-Williamson. We also show: for any positive integer $m$, there exists a tree whose dominating set sequence is not log-concave for at least $m$ indices by modifying a similar construction of Bautista-Ramos for the independent set sequence. We show that a large class of caterpillar graphs has log-concave dominating set sequences. A continuous analogue of the sequence is also log-concave for all graphs.
Read the full abstract

Combinatorics

Local Turán inequalities for walks and the spectral radius

Nikiforov's well-known spectral Turán inequality for walks states that, for every graph $G$ with clique number $\omega(G)$, $\lambda^r(G)\le w_r(G)(1-1/\omega(G))$, where $\lambda(G)$ is the largest eigenvalue of the adjacency matrix of $G$, and $w_r(G)$ is the number of walks with $r$ vertices in $G$. For $r=1$, this is Wilf's inequality; for $r=2$, it gives Nikiforov's spectral Turán theorem. Recently, Liu and Ning proved local versions of these two inequalities, strengthening both Wilf's inequality and Nikiforov's spectral Turán theorem. It is natural to ask whether Nikiforov's spectral Turán inequality for walks also admits a local strengthening. Motivated by this question, Kannan, Kumar, and Pragada conjectured the vertex-local bound $\lambda^r(G)\le \sum_{v\in V(G)} w_r(v)(1-1/c_G(v))$, where $w_r(v)$ denotes the number of walks with $r$ vertices starting at $v$, and $c_G(v)$ is the maximum order of a clique containing $v$. This conjecture is important because it gives the most natural local form of Nikiforov's spectral Turán inequality for walks. In this paper, we confirm this conjecture. More precisely, for $r\ge 2$, we prove the stronger edge-local inequality $$\lambda^r(G) \le \sum_{uv\in E(G)} \frac{c_G(uv)-1}{c_G(uv)} \bigl(w_{r-1}(u)+w_{r-1}(v)\bigr),$$ where $c_G(uv)$ is the maximum order of a clique containing the edge $uv$. Our result implies Nikiforov's spectral Turán inequality for walks and unifies several local spectral extremal results of Liu and Ning. We also determine all extremal graphs for both the edge-local and vertex-local inequalities. The main new ingredient is a Markov-chain estimate whose transition matrix is constructed from a Perron vector of $A(G)$; this estimate carries the local edge coefficient through walks of arbitrary length.
Read the full abstract

All authors Feng Liu, Shuang Sun, Yan Wang, Qi Wu

Functional Analysis

Subnormal block Toeplitz operators

In this paper we consider the subnormality of block Toeplitz operators $T_\Phi$, where $\Phi$ is an $n\times n$ matrix-valued function on the unit circle $\mathbb T$ of the form $$ \Phi=Q\Phi^* \quad \hbox{($Q$ is a finite Blaschke--Potapov product).} $$ This is related to a matrix-valued version of Halmos's Problem 5 and Nakazi-Takahashi Theorem. We ask whether $T_\Phi$ is either normal or analytic if $T_\Phi$ is subnormal, where $\Phi$ is of the above form. We give answers to this problem for different cases of the symbol. Moreover, we provide a sufficient condition for the answer to be affirmative when $\Phi^*$ is not of bounded type.
Read the full abstract

All authors Mankunikuzhiyil Abhinand, Raul E. Curto, In Sung Hwang, Woo Young Lee, Thankarajan Prasad

Information Theory · Cross-listed from stat.ML

The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy

Pearl's causal hierarchy shows that observational, interventional, and counterfactual queries are qualitatively distinct. We ask a quantitative version of this question: how many additional bits are needed to specify higher-rung causal answers once lower-rung answers are known? We formalize this via query-class description length, the Kolmogorov complexity of the answers a structural causal model (SCM) gives to a class of queries, with system size given. Our main construction gives acyclic SCMs on $n$ binary variables whose common observational distribution has constant description length, while single-variable intervention answers can require $\Theta(n^2)$ additional bits. For SCMs with independent noises, fixed finite gate-schema and noise libraries, and at most $d$ parents per variable, a degree-sensitive upper bound gives an observational-interventional gap of at most $O(nd\log(en/d)+n\log n)$. This makes the quadratic construction order-optimal in the dense regime and a rooted-tree construction order-optimal for bounded indegree. The quadratic separation persists under $\varepsilon$-accurate total-variation descriptions for every fixed $\varepsilon<1/4$. At the next rung, even knowing every hard-intervention distribution can leave a $\Theta(n)$ counterfactual description gap; a masked-parity construction extends this to $\Theta(n^2)$. These separation rates hold in the worst case and with high probability under uniform hidden parameters. A general ambiguity-to-bits theorem and Shannon analogue, together with explicit encodings, show that the gaps in our constructions equal the logarithm of residual higher-rung ambiguity up to lower-order terms.
Read the full abstract

Analysis of PDEs

Volumetric density estimates for nonlocal minimal surfaces

In this article, we prove that viscosity subsolutions to nonlocal mean curvature-type equations satisfy universal volumetric estimates at all scales provided their boundary has zero Lebesgue measure. Our results hold for a general class of symmetric kernels including kernels that are comparable to the fractional Laplacian. Furthermore, we prove that subsolutions with low density (with respect to a universal constant) necessarily have `fat boundary', that is, have topological boundary with positive Lebesgue measure.
Read the full abstract