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)

Saturday 2 May

Combinatorics

Multiplicative error set system sparsification: A simpler proof via chain length contraction

The chain length of a set family $\mathcal{S} \subseteq 2^{[m]}$ is the largest ascending sequence of sets in containment order in the union-closure of $\mathcal S$. In this work, we provide a significantly simpler and more optimal characterization of the sparsifiability of set systems in terms of their chain length, improving on the work of Brakensiek and Guruswami [STOC 2025]. Our proof relies on a generalization of Karger's [SODA 1993] famous contraction algorithm and its recent linear algebraic extensions [Khanna-Putterman-Sudan SODA 2024], and our resulting bounds show that, just as VC dimension characterizes the additive sparsifiability of a set system, chain length governs the multiplicative sparsifiability. As a corollary, we obtain improved bounds for weighted CSP sparsification.
Read the full abstract

Algebraic Geometry

Equivariant sheaves on toric prevarieties

Toric prevarieties are non-separated analogues of toric varieties. Perling \cite{Perling_equivariant_sheaves_tor_var} provided a combinatorial description of equivariant quasicoherent sheaves on toric varieties, extending earlier ideas of Klyachko, who outlined a general framework for equivariant torsion free sheaves in an unpublished work \cite{kly_sheaf}. In this article, we present a combinatorial description of equivariant quasicoherent sheaves on toric prevarieties.
Read the full abstract

Numerical Analysis

Completely Positive and Trace Preserving Schemes with Tensor Train Compression for the Lindblad Equation

We propose a family of low-rank, completely positive and trace preserving schemes for the Lindblad equation, a common model for open quantum systems. Low-rank representation is employed at two levels: the density matrix is factorized into the product of tall-skinny matrices, and the columns of these matrices are further represented using the tensor train (TT) format, also know as matrix product states (MPS). This two-level low-rank format fits naturally into our existing Kraus is King scheme (arXiv:2409.08898v2 [math.NA]) for the Lindblad equation, whose underlying operations are arithmetic on the columns of the tall-skinny matrices. We show how these operations can be performed efficiently in the TT/MPS format, with particular emphasis on density matrix rank-truncation. We conclude with extensive numerical experiments demonstrating the convergence of this scheme and its efficiency in simulating systems with up to $10^{19}$ degrees of freedom using only modest compute resources.
Read the full abstract

Optimization and Control

On the convex hull of the graph of a simple monomial

Motivated by previous efforts toward mathematically analyzing the treatment of monomials in spatial branch-and-bound, we study the convex hull of the graph of a simple monomial on a nonnegative box domain in arbitrary dimension, where at most one of the variable lower bounds is positive. We give: (i) a description via linear inequalities, and (ii) a formula for the volume.
Read the full abstract

Information Theory · Cross-listed from stat.ML

Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation

We study high-dimensional LASSO under differential privacy via objective perturbation with heterogeneous covariate scales. In practical scenarios, covariates often exhibit diverse scales; however, standard preprocessing is problematic under privacy constraints, as it consumes additional privacy budget. This heterogeneity induces effective anisotropy in the objective perturbation via the inverse Gram matrix of covariates, which can degrade the stability and accuracy of algorithms. To address this, we propose a Gram-based anisotropic objective perturbation, a “pre-distortion" strategy that counteracts the distortion from the covariate structure to restore isotropy in the estimation process. Using an Approximate Message Passing (AMP) framework and state evolution analysis, we demonstrate that our proposed perturbation significantly stabilizes convergence and improves both statistical efficiency and privacy performance compared to standard uniform noise injection. Our results provide theoretical insights into designing stable and efficient private estimators without relying on data-dependent preprocessing.
Read the full abstract

Analysis of PDEs

On the stability of Lamb-Chaplygin dipole for the 2D Euler equation

The Lamb-Chaplygin dipole is a traveling wave solution to the 2D incompressible Euler equation, whose orbital stability was established in [Abe-Choi, 2022] and [Abe-Choi-Jeong, 2025] assuming the odd symmetry in $x_2$ (O) and non-negativity in upper half-plane (N). This paper is devoted to further study of its stability in the following two aspects. Firstly, we prove the spectral stability of the linearized operator around the Lamb-Chaplygin dipole without conditions (O) or (N), based on the index theory established in [Lin-Zeng, 2022]. This excludes an instability mechanism by unstable eigenmodes, and provides rigorous evidence towards nonlinear stability in this general setting. Secondly, assuming (O) and (N), we refine the orbital stability results in [Abe-Choi, 2022] and [Abe-Choi-Jeong, 2025] quantitatively by proving a linear bound of the fluctuation and a uniform control of the moving velocity. Instead of using a variational approach, our proof relies on the construction of a new coercive Lyapunov functional with a delicate mixed structure: it is quadratic in the interior region, but linear in the exterior region.
Read the full abstract

Optimization and Control

On the redundancy of transitivity constraints in the clique partitioning problem

In this study, we identify a class of redundant transitivity constraints in a 0-1 integer linear programming formulation of the clique partitioning problem. The transitivity constraints in this class can be removed from the formulation without changing the optimal solution set, although each transitivity constraint defines a facet of the associated polytope. This leads to a smaller formulation that is particularly effective for instances arising from correlation clustering, where edge weights are drawn from $\{-1,1\}$. Our computational experiments show that the resulting formulation outperforms existing formulations on such instances.
Read the full abstract

Metric Geometry

How Thick Is the Sierpiński Triangle?

Although the Sierpiński triangle has planar area $0$, it is uniformly non-flat: at every point and every scale, its nearby points span a two-dimensional region of comparable size. We prove a sharp version of this statement, showing that the Feng–Wu thickness of $E$ is exactly $\sqrt{3}/6$, the inradius of a unit equilateral triangle. More precisely, if $E$ is the standard Sierpiński triangle of side length $1$ and $B(x,r)$ denotes the closed disk of radius $r$ centered at $x$, then for every $x\in E$ and every $0<r\le 1$, the convex hull of $E\cap B(x,r)$ contains an equilateral triangle of side length $r$. Consequently, $\operatorname{conv}(E\cap B(x,r))$ contains a closed disk of radius $(\sqrt{3}/6)r$; this constant is best possible. The proof is elementary – boundary edges of all construction triangles survive in the limit set, and self-similarity reduces the problem to the normalized range $1/2\le r\le 1$.
Read the full abstract

Optimization and Control

Quaternion Nonlinear Transform-Induced Nuclear Norm for Low-Rank Tensor Completion

Tensor completion has emerged as a powerful framework for recovering missing data in multidimensional signals by exploiting low-rank tensor structures. Among existing approaches, linear transform-based tensor nuclear norm (TNN) methods have achieved considerable success by enforcing low-rankness on transformed frontal slices. However, the low-rank structure revealed by linear transforms remains inherently limited. To better capture intrinsic correlations, nonlinear transform-based TNN (NTTNN) models have been proposed, significantly enhancing low-rank representation through composite transforms. Despite their effectiveness, existing NTTNN methods are restricted to real-valued tensors and fail to model quaternion-valued data, which are essential for preserving inter-channel dependencies in color images and videos. Extending nonlinear TNN models to the quaternion domain is challenging due to the non-commutativity of quaternion multiplication and the complexity of quaternion singular value decomposition. To address the limitations encountered in prior works, we propose a quaternion nonlinear transform-induced tensor nuclear norm (QNTTNN) via a real embedding of quaternions, enabling tractable nuclear norm definitions and efficient optimization. Building upon QNTTNN, we formulate a quaternion tensor completion model and develop a proximal alternating minimization algorithm with rigorous convergence guarantees. Extensive experiments on benchmark color video inpainting datasets validate the superior performance of the proposed method over existing approaches.
Read the full abstract

Numerical Analysis

A Family of Iterative Methods for Computing Generalized Inverses of Quaternion Matrices and its Applications

The computation of generalized inverses of quaternion matrices is a fundamental problem in quaternion linear algebra, with wide-ranging applications in signal processing, image restoration, and multidimensional data analysis. This paper presents three efficient quaternion iterative algorithms for computing the Moore-Penrose pseudoinverse: (i) the quaternion rapid iterative method (QRAPID), (ii) the quaternion strong approximate inverse (QSAI), and (iii) the quaternion hyperpower iterative method of order nineteen (QHPI19). Convergence theorems and perturbation bounds are established to ensure numerical stability and robustness. The QSAI method is further employed as a preconditioner for quaternion Krylov subspace solvers, resulting in substantial reductions in the iteration count and runtime for large-scale linear systems. Comprehensive numerical experiments demonstrate that the proposed algorithms achieve an accuracy comparable to or better than existing approaches, including quaternion SVD, quaternion Newton-Schulz, and classical hyperpower schemes, while offering significant computational savings. The practical utility of the framework is illustrated through two representative applications: image completion via CUR decomposition and signal filtering, which confirm its scalability and effectiveness in real-world multidimensional data applications.
Read the full abstract

Numerical Analysis

A Neural Latent Dynamics Approach for Solving Inverse Problems in Cardiac Electrophysiology

Solving inverse problems in cardiac electrophysiology consists in the recovery of physiological parameters from surface electrocardiogram (ECG) measurements, a task which is often computationally unfeasible due to the severe ill-posedness and the prohibitive computational complexity of PDE-constrained optimization. In this work, we introduce a data-driven framework leveraging Latent Dynamics Networks (LDNets) to construct efficient surrogate models of the forward operator. By mapping low-dimensional parameters, representing ectopic activation sites or ischemic region descriptors, to the ECG signals via latent dynamics governed by neural ordinary differential equations, our approach circumvents the computational burden of evaluating high-fidelity cardiac models during iterative parameter estimation. The surrogate is trained offline on high-fidelity data, enabling rapid and robust inversion. We validate the proposed framework through rigorous numerical experiments with synthetic data across both 2d and 3d geometries. Results show that the LDNet-based surrogate achieves precise reconstruction of cardiac parameters while drastically reducing computational overhead, thereby enabling near real-time clinical applications.
Read the full abstract

All authors Edoardo Centofanti, Giovanni Ziarelli, Simone Scacchi, Luca Franco Pavarino

Algebraic Geometry

Defect Triangles and Intersection-Space Hodge Atom Shadows for Calabi–Yau Conifolds

We prove a projection-triangle statement for projective Calabi–Yau threefold conifold degenerations and use it to organize an intersection-space Hodge atom shadow package. For a nodal central fiber $X_0$, assume the relevant Banagl–Budur–Maxim, multi-node gluing, mixed-Hodge-module, and specialization-splitting hypotheses, so that $\psi_\pi(F)\simeq \mathcal{IS}^{H}_{X_0}\oplus\mathcal C^H_\Sigma$. Projection of the variation morphism to the intersection-space summand defines $\operatorname{var}_I:\phi_\pi(F)\to\mathcal{IS}^{H}_{X_0}$, and the octahedral axiom gives $P^H\to P^H_I\to\mathcal C^H_\Sigma\xrightarrow{+1}$, where $P^H=\operatorname{Cone}(\operatorname{var})[-1]$ and $P^H_I=\operatorname{Cone}(\operatorname{var}_I)[-1]$. This realizes the intersection-space atom shadow package $\mathsf{HA}^{I}(X_0)$ and compares it with the intersection-homology package $\mathsf{HA}^{IH}(X_0)$. Under the self-dual specialization-splitting hypothesis, the projected variation object satisfies $\mathbb D P^H_I\simeq Q^H_I(3)$, where $Q^H_I=\operatorname{Cone}(\operatorname{can}_I)[-1]$. Under the mixed-Hodge realization of Banagl's middle exact sequence, we isolate a rigid–vanishing filtration and identify the IIB vanishing atom with the realized kernel. For the classical $125$-node quintic, the middle-degree IC–intersection-space defect has rank $202$. The construction remains at Hodge-realization level and identifies $\mathcal C^H_\Sigma$ and $\Delta_{I/IC}(X_0)$ as geometry-side handoff objects for future DT/BPS comparisons.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Hidden gauge invariance

The role of gauge invariance is reconsidered by "deriving it without assuming it" within an autonomous approach to interactions of Standard Model particles. In this approach, the renormalizable interactions are purely constrained by quantum principles, notably the representation on a Hilbert space, which forces interactions to be "string-localized". To some surprise, most interactions fulfilling the constraints enjoy an emergent but possibly "hidden" gauge invariance (uncovered via redefinitions of quantum fields). It is exact and unbroken even in the presence of massive vector bosons. It plays a major role in proving that S-matrices are insensitive to the string-localization, and in fact coincide with S-matrices of local interactions from the gauge theory approach on indefinite state spaces. Thus, particle physics with massless and massive vector bosons can be implemented without indefinite state spaces and ghosts.
Read the full abstract

Numerical Analysis

Sequential Minimal Optimization for $\varepsilon$-SVR with MAPE Loss and Sample-Dependent Box Constraints

Support vector regression with Mean Absolute Percentage Error (MAPE) loss is theoretically well-motivated for forecasting applications where accuracy is evaluated in relative terms, but the sample-dependent dual box constraints it induces have not been addressed in the published SMO literature. We derive a Sequential Minimal Optimization algorithm for this setting and prove a structural-invariance result: the MAPE modification affects exactly two components of the SMO iteration – working-set selection and analytic-update clipping – leaving gradient bookkeeping and curvature computation identical to classical epsilon-SVR. Building on this invariance, we establish four efficiency improvements (asymmetric freeze-counters, warm-starting, block working-set updates of size four, and per-pair tolerance scaling) and resolve a previously-open convergence problem for the odd-symmetry kernel variant via adaptive spectral regularization. Numerical validation against three reference solvers across eleven synthetic configurations certifies solution agreement within standard tolerance. Wall-time benchmarks show the present algorithm achieves the lowest median runtime on every tested configuration against OSQP, MOSEK, and Clarabel. At production scale, the algorithm converges on the California Housing benchmark while the patched LIBSVM reference implementation reaches its iteration ceiling without satisfying optimality – demonstrating the practical necessity of the theoretical efficiency mechanisms. An open-source R package and an explicit solver-adaptation recipe are provided.
Read the full abstract

Probability

From second moments to pairwise negative correlation: applications to minimal and uniform spanning trees

We uncover a close connection between the second moment of the degree of a typical vertex in a random subgraph and the pairwise negative correlation (p-NC) property. On one hand, we exploit this connection to prove the p-NC property for non-adjacent edges in minimal spanning trees on complete graphs. On the other hand, we apply the classical p-NC property of uniform spanning trees to derive a universal upper bound on the second moment of the degree of a uniformly chosen vertex in uniform spanning trees on finite, connected, regular graphs, thereby resolving an open question posed by Nachmias and Peres. Furthermore, we determine that the optimal upper bound is exactly 6, and the method for achieving this optimal bound is interesting in itself – the proof uses Edmonds' matroid polytope theorem.
Read the full abstract

Mathematical Physics

A position dependent mass Hamiltonian and abstract ladder operators

We consider the Hamiltonian $H$ of a particle in one dimension with a position dependent mass for which we apply the recent strategy of the so-called abstract ladder operators, in the attempt to find its eigenvalues and eigenvectors. We don't assume that $H$ is self-adjoint, while we focus on the case of a factorizable operator. We show then that pseudo-bosonic operators play a relevant role in this analysis, and we construct bi-coherent states attached to these operators. Explicit examples are discussed.
Read the full abstract

Logic · Cross-listed from cs.AI

Rethinking Explanations: Formalizing Contrast in Description Logics

There has been a growing interest in explaining entailments over description logic (DL) knowledge bases. The existing explanation formalisms focus on justifications to explain true axioms, and abductive reasoning to explain missing axioms in a knowledge base. However, these formalisms only point out the reasoning steps behind a (missing) entailment and lack a user-centered approach as they do not consider an inquirer's needs, level of understanding, or prior knowledge. We propose contrastive explanations, aiming at answering "why an axiom P (fact) is true instead of another axiom Q (foil)" over description logic knowledge bases. The motivation arises from the observation that when a user discovers that P has occurred, they are often surprised because they anticipated the occurrence of another similar event Q. Furthermore, individual explanations for "why P" and "why not Q" are unsatisfactory since a user expects to see the difference between P and Q. In this work, we first present formal foundations of contrasting questions and then define contrastive explanations within description logics. To this end, facts include ABox assertions of the form C(x) for a concept C and individual x. Possible foils for such facts are assertions C(y) (contrasting against an individual y), or D(x) (contrasting against a concept D). Additionally, we explore the properties of contrastive explanations in the DL EL and ALC. We also provide an implementation of our definition and an experimental evaluation on KBs of varying sizes.
Read the full abstract

All authors Yasir Mahmood, Arnab Sharma, Axel-Cyrille Ngonga Ngomo, Balram Tiwari

Combinatorics

Variants of Wythoff's Games with Different Terminal Sets

We study a variant of the classical Wythoff's game. The classical form is played with two piles of stones, from which two players take turns to remove stones from one or both piles. When removing stones from both piles, an equal number must be removed from each. The player who removes the last stone or stones is the winner. Equivalently, we consider a single chess queen placed somewhere on a large grid of squares. Each player can move the queen toward the upper-left corner of the grid, either vertically, horizontally, or diagonally in any number of steps. The winner is the player who moves the queen to the terminal position in the upper-left corner, the position (0,0) in our coordinate system. Let k be a positive integer, and we consider the variant of Wythoff's game with the terminal set {(x,y):x,y are non-negative integers and x+y <=k}. The set of P-positions of this variant is described by the Fibonacci sequence without using recursion.
Read the full abstract

Number Theory

A logarithmic structure theorem for multiplicative functions with small partial sums

Let $D\in\mathbb{N}$, let $A>D+1$, and let $Q\geqslant3$. Consider the class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ such that $|\sum_{n\leqslant x}f(n)|\le x(\log Q)^{A-D-1}/(\log x)^A$ for all $x\geqslant Q$, and such that $|\Lambda_f|\leqslant D\Lambda$, where $\Lambda_f$ is defined via the Dirichlet convolution identity $f\log=\Lambda_f*f$ and $\Lambda$ denotes von Mangoldt's function. We prove there exist parameters $m\in\{0,1,\dots,D\}$ and $Q=Q_D\leqslant Q_{D-1}\le \cdots\leqslant Q_m<Q_{m+1}=\infty$ such that $\sum_{p\in I} \mathrm{Re}(f(p)+j)/p=O_{A,D}(1)$ for all $j=m,m+1,\dots,D$ and all compact intervals $I\subset[Q_{j+1},Q_j)$. Moreover, when $|\sum_{n\leqslant x}f(n)|\le x^{1-1/\log Q}/(\log x)^{D+1}$ for all $x\geqslant Q$, we relate the parameters $m$ and $Q_j$ to the location of zeroes of the Dirichlet series $\sum_{n\geqslant1} f(n)/n^s$ in the ball $B(1,1/\log Q)$. These results generalize work of the author when $D=1$. Their proof builds on earlier work of the author with Soundararajan, and of Sachpazis.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum jump trajectories, hybrid systems, non-Hermitian evolutions, quantum/classical walks

Quantum stochastic master equations of jump type are formulated in a general way and connections with quantum/classical hybrid systems and quantum filtering theory are discussed. By introducing the notion of “typical trajectory", we show how to recursively construct the solution of the non-linear stochastic master equation (the conditional state). Moreover, by the notion of “exclusive probability densities" we can describe all the probabilities related to the jumps, in particular, the waiting times of the jumps and their probability distributions. This general formulation and the idea of hybrid system allow to unify and generalize different fields: evolutions under non-Hermitian Hamiltonians, unitary dynamics interspersed by quantum channels at random times, quantum renewal processes, continuous time open quantum walks, Lindblad rate equation, ...
Read the full abstract

Combinatorics

Facial diagrams and cycle double cover

We approach the cycle double cover conjecture by looking for a circular 2-cell embedding of cubic graphs on an arbitrary surface. It is easy to see that if such an embedding exists, we can get to it from an arbitrary starting 2-cell embedding by repeating “twists of an edge”. We study this twisting operation in detail and deduce bounds on the number of singular edges (edges where a face meets itself).
Read the full abstract

Algebraic Geometry

Combinatorial Nonresonance Theorems for Hyperplane Arrangement Complements

We study the nonresonance phenomenon for complex rank-one local systems on complements of hyperplane arrangements. We refine the method of Cohen, Dimca, and Orlik and obtain a combinatorial sufficient condition for nonresonance. As an application, we strengthen a theorem of Bailet, Dimca, and Yoshinaga by removing one of its conditions. We also develop restriction and lifting techniques to prove a nonresonance theorem for line arrangements.
Read the full abstract

Classical Analysis and ODEs

Special Solutions of $q$-Heun Equation by $q$-Integral Transformations

We obtain special solutions of the $q$-Heun equation which are expressed as finite summations of $q$-hypergeometric functions. These solutions are obtained by considering the $q$-integral transformations of the polynomial-type solutions.

Number Theory

Bowen–Franks groups and minus class groups of cyclotomic number fields with prime conductor

Let $p$ be an odd rational prime and consider the cyclotomic number field $K = \mathbb{Q}(\zeta_{p})$ of conductor $p$. We construct a directed graph $Y$ on $p-1$ vertices for which the torsion part of the corresponding Bowen–Franks group is closely related to the minus part of the class group of $K$. In particular, both groups have the same cardinality up to an explicit power of $p$. Furthermore, they are both $\mathrm{Gal}(K/\mathbb{Q})$-modules, and we prove the equality of the cardinalities of their isotypic components after tensoring them with the valuation ring of an appropriate $\ell$-adic field for $\ell \nmid p-1$.
Read the full abstract

Functional Analysis

Weak Minimizing Property and the Compact Perturbation Property for the Minimum Modulus

For an operator $T:X\to Y$, denote $m(T)=\inf\{\|Tx\|:x\in S_X\}$. A sequence $(x_n)$ in $S_X$ is said to be minimizing for $T$ if $\|Tx_n\|\to m(T)$. The weak minimizing property (WmP), introduced by Chakraborty, requires that every operator admitting a non-weakly null minimizing sequence attains its minimum modulus. More recently, Han~\cite{Han2026} introduced the Compact Perturbation Property for the minimum modulus (CPPm), which requires that for every operator $T:X\to Y$ that does not attain its minimum modulus, \[ \sup_{K\in\mathcal{K}(X,Y)} m(T+K)=m(T). \] In~\cite{Han2026}, it is shown that $(\ell_1,\ell_1)$ fails both properties, while $(c_0,c_0)$ fails the WmP. However, whether $(c_0,c_0)$ has the CPPm was left open (Problem~3.6). In this paper, we give a negative answer to this question by proving that $(c_0,c_0)$ does not have the CPPm. The proof is constructive, exhibiting a non-min-attaining operator whose minimum modulus is strictly increased by a rank-one compact perturbation. Moreover, we show that this phenomenon is not specific to $c_0$: if $X=\mathbb{K}\oplus_\infty Y$ with $Y$ non-reflexive, then the pair $(X,X)$ fails the CPPm.
Read the full abstract

Algebraic Topology

Moment-angle manifolds associated to neighbourly triangulations of spheres

We show that a moment-angle manifold associated to a neighbourly triangulation of an odd dimensional sphere is homotopy equivalent to a connected sum of products of two spheres, resolving a problem of Buchstaber and Panov. The methods are entirely homotopy theoretic, allowing for an extension to a corresponding result in the case of generalized moment-angle manifolds.
Read the full abstract

Information Theory

RIS Optimization and Scaling Laws in Multi-Operator Systems: Is Quadratic Scaling Achievable?

This paper studies multi-operator wireless communication systems aided by general reconfigurable intelligent surface (RIS), including both conventional single-connected RIS and beyond-diagonal RIS (BD-RIS). Specifically, we consider a system where multiple operators coexist in the same area over different frequency bands, each with a single-antenna base station, while one operator serves its single-antenna user with the aid of an RIS. In such a system, the RIS may unintentionally reflect signals from the non-serving operators, leading to inter-operator interference and rapid fluctuations of their effective channels. To address this issue, we propose a practical RIS design framework that maximizes the received signal power of the serving operator while enforcing fixed RIS-reflected channels of the non-serving operators. We derive closed-form solutions to the resulting optimization problem, based on a novel technique to deal with the coupled unitary and linear equality constraints. We further give scaling law analysis of the received signal power. For a two-operator system, the received signal power scales quadratically with the number of RIS elements for group-connected BD-RIS with group size Gs>=2, whereas for conventional single-connected RIS it scales only linearly. More generally, for an L-operator system with L-1 non-serving operators, the scaling-law transition occurs at Gs=L, where quadratic scaling is achieved when Gs>=L, and linear scaling otherwise. These results demonstrate that, in a multi-operator system, quadratic scaling is achievable only with BD-RIS architectures having enough interconnections. Simulation results validate the analysis and show the significant gain of BD-RIS over conventional RIS in multi-operator systems. In particular, group-connected BD-RIS with Gs=2 achieves a 13dB gain over conventional RIS in a two-operator system with a 128-element RIS.
Read the full abstract

Rings and Algebras

Stack Constructions and Equality Cases for Laffey's Bound for Maximal Commutative Matrix Algebras

We study equality cases in Laffey's lower bound for local maximal commutative subalgebras of matrix algebras with cube-zero radical. We introduce a stacking operation that combines algebras with common outer Loewy layers while preserving maximal commutativity. This yields standard equality bricks $B_{a,c}=(a,ac+1,c;a+c)$ for all $a,c\ge2$ and reduces further constructions to smaller building blocks. We establish the existence of all minimal equality bricks on the balanced branch and obtain sharp realizations throughout the $(4,5)$-sector. We also construct the first nontrivial nearly balanced root over arbitrary fields. We determine the balanced–nearly-balanced envelope of the numerical Laffey profile and give an arithmetic criterion for preservation of sharpness under stacking. As a consequence, the profile is attained in every matrix dimension $14\le n\le52$ and $93\le n\le114$, as well as along five infinite families over arbitrary fields. The main existence and interval results are proved in characteristic zero; the field-independent constructions are stated explicitly.
Read the full abstract

Mathematical Physics

The Haar measure of the $p$-adic rotation group $\textrm{SO}(3)_p$ via nautical angles

We study the explicit construction of the Haar measure on the compact $p$-adic rotation group $\textrm{SO}(3)_p$ by nautical (Cardano) parametrization. Exploiting its topological group isomorphism with $\mathbb{H}_p^\times/\mathbb{Q}_p^\times$ of $p$-adic quaternions modulo scalars, we derive the corresponding change of variables formulas and compute the associated Jacobian in the $p$-adic setting, which we combine with the known Haar measure on the multiplicative group of $p$-adic quaternions $\mathbb{H}_p^\times$. This yields an explicit formula for the normalized Haar measure on $\textrm{SO}(3)_p$ in nautical coordinates, with a factorized density in the three angles. Our construction provides a concrete tool suited for applications of non-Archimedean models where an explicit angular description of invariant integration is required.
Read the full abstract

All authors Lorenzo Guglielmi, Stefano Mancini, Vincenzo Parisi, Ilaria Svampa

Optimization and Control

Optimal control problem for a nonlinear nonlocal evolution system describing an interacting ternary mixture with an evaporating component: 2D case with bulk evaporation

We present an optimal control problem to guide the selection of morphology classes arising in organic solar cells. The study focuses on phase separation processes in polymer solvent mixtures, with particular attention to solvent evaporation as a mechanism to arrest morphology formation. We establish the existence of optimal controls and analyze the Frechet derivative of the control to state mapping. Finally, we derive the first order necessary optimality condition via the corresponding adjoint system.
Read the full abstract