Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 5 April

Analysis of PDEs

Existence and Concentration of Multiple Positive Solutions for a Logarithmic Fractional Schrödinger–Poisson System

We study a logarithmic fractional Schrödinger–Poisson system in \(\R^{3}\): \begin{equation*} \begin{cases} \varepsilon^{2\alpha}(-\Delta)^{\alpha}u+V(x)u+\phi u=u\log u^{2}+|u|^{p-2}u, & \text{in }\R^{3},\\ \varepsilon^{2\alpha}(-\Delta)^{\alpha}\phi=u^{2}, & \text{in }\R^{3}. \end{cases} \end{equation*} Here \(\alpha\in\bigl(\frac34,1\bigr)\), \(4<p<2_{\alpha}^{*}=\frac{6}{3-2\alpha}\), and \(V\) satisfies a global potential condition. Using a suitable Orlicz-type Banach space, we establish a \(C^{1}\) variational framework for the problem and combine the Nehari manifold method with Lusternik–Schnirelmann category theory. We then prove that, for every fixed \(\delta>0\) and all sufficiently small \(\varepsilon>0\), the system admits at least \(\operatorname{cat}_{M_{\delta}}(M)\) distinct positive solutions. Moreover, the maximum points of these solutions concentrate near the global minimum set of \(V\) as \(\varepsilon\to0\).
Read the full abstract

Combinatorics

Domino Tilings of Cruciform Regions

P. Di Francesco first introduced the "Aztec triangle" in his study of the relationship between the twenty-vertex model and domino tilings. He conjectured an exact formula for the number of tilings of the Aztec triangle, and it has since been proved by several authors. In an attempt to prove the conjecture, M. Ciucu showed that the tiling number of the Aztec triangle divides the tiling number of a new region called the "cruciform region," a superposition of two Aztec rectangles. Ciucu proved that the number of domino tilings of a cruciform region is given by a simple product formula. In this paper, we generalize Ciucu's tiling formula by providing a generating-function formula for the cruciform region.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

On Data Thinning for Model Validation in Small Area Estimation

Small area estimation produces estimates of population parameters for geographic and demographic subgroups with limited sample sizes. Such estimates are critical for policy decisions, yet principled validation of these models remains a challenge. Unlike conventional predictive settings, validation data are rarely available. Data thinning splits a single observation into independent training and test components. It enables out-of-sample validation using only the area-level summary statistics routinely available, requiring only their Gaussianity and known sampling variances. However, the properties of thinning-based model comparison have not been formally studied. In this paper, we develop these properties. We construct an unbiased estimator of thinned-data mean squared error and show that it differs systematically from its full-data counterpart; for the standard Fay-Herriot model, the gap admits a closed-form expression that depends on the candidate model's shrinkage behavior. We further show that the estimator variance increases sharply as the training fraction approaches one, producing a bias-variance tradeoff with no universally optimal thinning parameter. Practical recommendations balancing these forces are informed by theory and verified empirically. Design-based simulations using American Community Survey microdata show that the recommended data thinning approach is competitive with information-criterion and simulation-based methods, and substantially more stable across heterogeneous sampling designs.
Read the full abstract

Differential Geometry

On the Classification of Vaisman Manifolds with Vanishing First Basic Chern Class and Large First Betti Number

We show that every Vaisman manifold with large first Betti number and vanishing first basic Chern class is diffeomorphic to a Kodaira-Thurston manifold. Furthermore, its complex structure is left-invariant, the characteristic foliation is regular, and the associated fibration is given by the Albanese map. Under the additional assumption that the LCK rank is $1$, the Vaisman structure is also left-invariant. We further prove that if all basic harmonic $1$-forms have constant length, then the Vaisman manifold with large first Betti number is diffeomorphic to a Kodaira-Thurston manifold and its complex structure is the standard complex structure. Finally, we discuss the relationship of this condition with transverse geometric formality in this setting.
Read the full abstract

Optimization and Control

Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints

Recent advancements in data science have significantly elevated the importance of orthogonally constrained optimization problems. The Riemannian approach has become a popular technique for addressing these problems due to the advantageous computational and analytical properties of the Stiefel manifold. Nonetheless, the interplay of nonsmoothness alongside orthogonality constraints introduces substantial challenges to current Riemannian methods, including scalability, parallelizability, complicated subproblems, and cumulative numerical errors that threaten feasibility. In this paper, we take a retraction-free primal-dual approach and propose a linearized smoothing augmented Lagrangian method specifically designed for nonsmooth and nonconvex optimization with orthogonality constraints. Our proposed method is single-loop and free of subproblem solving. We establish its iteration complexity of $O(\epsilon^{-3})$ for finding $\epsilon$-KKT points, matching the best-known results in the Riemannian optimization literature. Additionally, by invoking the standard Kurdyka-Lojasiewicz (KL) property, we demonstrate asymptotic sequential convergence of the proposed algorithm. Numerical experiments on both smooth and nonsmooth orthogonal constrained problems demonstrate the superior computational efficiency and scalability of the proposed method compared with state-of-the-art algorithms.
Read the full abstract

All authors Linglingzhi Zhu, Wentao Ding, Shangyuan Liu, Anthony Man-Cho So

Dynamical Systems

Quantization of Lagrangian Descriptors

We formulate Lagrangian descriptors (LDs) in the path integral framework. Averaging the classical LD over fluctuations about extremal trajectories defines a quantum LD that incorporates quantum effects. Invariant manifolds, which sharply organize classical transport, become finite-width phase space structures under quantum fluctuations, and their overlap provides a geometric mechanism consistent with tunneling as fluctuation-induced delocalization of transport barriers. We demonstrate this approach for the Hamiltonian saddle, where path integral sampling reveals manifold broadening and barrier penetration. This establishes a geometric framework for studying phase space transport and tunneling beyond the classical regime, while also providing a natural route toward the application of LDs to field theory.
Read the full abstract

Number Theory

Extensions of the Carlitz-McConnel and Blokhuis-Sziklai theorems for unions of cyclotomic classes

Let $p$ be a prime, let $q=p^n$, and let $D\subseteq \mathbb{F}_q^\ast$. A celebrated result of Carlitz and McConnel states that if $D$ is a proper subgroup of $\mathbb{F}_q^\ast$, and $f:\mathbb{F}_q\to\mathbb{F}_q$ is a function such that $(f(x)-f(y))/(x-y)\in D$ for all $x\neq y$, then $f$ must be of the form $f(x)=ax^{p^j}+b$. In this paper, we extend their result to the setting where $D$ is a union of cosets of a fixed subgroup of $\mathbb{F}_q^\ast$, under a mild assumption. In a similar spirit, we also investigate maximum cliques in related Cayley graphs over finite fields, strengthening several results of Blokhuis, Sziklai, and Asgarli and Yip.
Read the full abstract

Information Theory

Mechanism and Communication Co-Design for Differentially Private Energy Sharing

Integrating distributed energy resources (DERs) is a critical step toward addressing the global climate crisis. This transformation has driven the transition from traditional consumers to prosumers and given rise to new energy sharing business models. Existing works have extensively studied prosumer energy sharing mechanisms, yet little attention has been paid to privacy protection, particularly when communication constraints are taken into account. In this paper, we study an energy sharing mechanism where information is exchanged over wireless channels via over-the-air (OTA) multiple-input multiple-output (MIMO) aggregation to exploit spectral efficiency for scalable prosumer coordination. To characterize the privacy leakage risk during data transmission process, we introduce an adversarial attack model and demonstrate that, under certain conditions, the platform can extract and recover prosumers' private parameters from the base station observations. To safeguard the energy sharing mechanism against such attacks, we propose a differentially private equilibrium-seeking algorithm, analyze the achievable privacy level, and establish convergence guarantees that quantify the impact of privacy on the convergence accuracy. Numerical experiments demonstrate that our approach effectively protects prosumers' privacy while converging to near-optimal solutions.
Read the full abstract

Number Theory

Relation between Anderson Generating Functions and Weil Pairing

The existence of the Weil pairing for Drinfeld modules was proved by van~der~Heiden using the Anderson $t$-motive. Papikian's note provided the explicit formula for the rank-two Weil pairing that avoids Anderson motives. Following this approach, Katen extended the formula to higher ranks. As Papikian observed, this method is more elementary than the approach using Anderson motives, but it is less conceptual. This paper is devoted to a new insight into Katen's formula motivated by the Moore determinant coming from Hamahata's tensor product of Drinfeld modules and the basis of torsion modules found by Maurischat and Perkins. We investigate the Weil operator, establish its connection with the remainder polynomial of Anderson generating functions modulo a fixed polynomial $\mathfrak{f}$, and finally derive an extremely simple interpretation: the value of the rank-$r$ Weil pairing is essentially the specific coefficient in the Moore determinant of certain Anderson generating functions.
Read the full abstract

Differential Geometry

Minimal networks on S^2

The minimal network problem is a classical topic in geometric measure theory and the calculus of variations, which aims to find networks of minimal length connecting given points. Most classical results are established in the Euclidean plane, while a complete theory for constant-curvature Riemannian manifolds remains to be developed. In this paper, we locally extend the theory of minimal networks and the calibration method from the Euclidean plane to the standard unit sphere \(S^2\). We redefine \(\mathbb{R}^2\)-valued co-vectors, differential forms, currents, and calibrations adapted to spherical geometry. Using exponential maps and local metric perturbation estimates, we prove that spherical minimal networks composed of great-circle arcs with \(120^\circ\) triple junctions are locally length-minimizing only within sufficiently small geodesic balls on \(S^2\), without obtaining global minimality results. Our work partially enriches the theory of minimal networks on constant-curvature spaces, and provides a theoretical reference and technical basis for future research on extending such results to higher-dimensional Riemannian manifolds and more general surfaces.
Read the full abstract

Statistics Theory

Heavy Tailed Homogeneous Structural Causal Models

We consider causal discovery in structural causal models driven by heavy-tailed noise, where extremes carry important information about causal direction. We introduce the Heavy-Tailed Homogeneous Structural Causal Model (HT-HSCM), a unified framework that generalizes heavy-tailed linear and max-linear models. We demonstrate that causal tail coefficients identify the complete ancestral partial order of the underlying directed acyclic graph. We also formulate a recursive algorithm for recovering quantities associated with the model called ancestral impulse-responses from the causal tail coefficients. Our results provide a general and theoretically justified framework for causal discovery in heavy-tailed systems.
Read the full abstract

Combinatorics

Gallai 3-colourings of random graphs

A Gallai $k$-colouring of a graph $G$ is a colouring of $E(G)$ with $k$ colours that induces no rainbow triangles, that is, a triangle with edges of 3 different colours. We give a first step towards estimating the number of Gallai colourings of the Erdős-Rényi random graph, by proving that for every $\delta > 0$ there are $c$ and $C$ such that with high probability the number of Gallai 3-colourings of $G(n,p)$ is at least $3^{(1-\delta)\binom{n}{2}p}$ for $p \leq cn^{-1/2}$, and at most $2^{(1+\delta)\binom{n}{2}p}$ for $p \geq Cn^{-1/2}$.
Read the full abstract

Combinatorics

A General Lower Bound for the Limited Augmented Zarankiewicz Number based upon Complete Graphs

The limited augmented Zarankiewicz number $z_L(m,n)$ satisfies $\operatorname{BSR}(m,n)\ge z_L(m,n)\ge z(m,n)$, where $\operatorname{BSR}(m,n)$ is the maximum SOS rank of $m\times n$ biquadratic forms and $z(m,n)$ is the classical Zarankiewicz number. Our main result is a general lower bound for $z_L(m,n)$ based on the incidence graph of the complete graph $K_{4t}$. For every integer $t\ge 1$, let $m = \binom{4t}{2}$ and $n = 4t$. Then $$ \operatorname{BSR}(m,n) \;\ge\; z_L(m,n) \;\ge\; 2\binom{4t}{2} + 4t^2 - 2t. $$ Since $z = 2\binom{4t}{2} = \Theta(t^2)$, the gap satisfies $z_L - z \ge 4t^2 - 2t = \Theta(t^2) = \Theta(m)$, i.e., it grows linearly in $m$. Moreover, $$ \frac{z_L - z}{z} \;\ge\; \frac{4t^2}{16t^2 - 4t} \;\longrightarrow\; \frac{1}{4} \quad \text{as } t\to\infty, $$ so the gap is asymptotically at least $25\%$ of $z$ – a non-negligible constant fraction. For $t=1$ we obtain $z_L(6,4)\ge 14$, and we prove that this bound is tight, i.e., $z_L(6,4)=14$. For $t=2$ and $t=3$ we obtain $z_L(28,8)\ge 68$ and $z_L(66,12)\ge 162$, respectively, improving previously known bounds. We also determine the exact values of $z_L(m,n)$ for $5\times3$ and $5\times4$: $z_L(5,3)=9$ and $z_L(5,4)=12$. These results serve as base cases for a lifting method that constructs admissible limited augmented graphs on $(m+1)\times(n+1)$ from optimal ones on $m\times n$. Applying this method, we obtain new lower bounds: $z_L(6,3)\ge 10$ and $z_L(6,5)\ge 17$. For $5\times 5$ we establish a new lower bound $z_L(5,5)\ge 15$, improving the previously known bound. By a direct construction, we have $z_L(6,6)\ge 20$.
Read the full abstract

Probability

Learning Equilibrium Fluctuation Expansions from Overdamped Langevin Dynamics

We study higher-order small-noise fluctuation expansions for the overdamped Langevin dynamics in a quartic double-well potential. Assuming that the initial data admits a suitable expansion structure, we obtain a strong dynamical expansion of the trajectories, as well as an expansion of the laws with respect to smooth observables. We then investigate the long-time behavior of the expansion coefficients. In the scalar case $d=1$, each coefficient converges exponentially fast to a finite limit as $t\to\infty$. In contrast, for $d\ge 2$, the fluctuation expansion coefficients reflect the degeneracy of the manifold of minima, which in general prevents the existence of a finite long-time limit. Furthermore, by combining a multi-level induction with combinatorial arguments, we derive a recursive formula for the fluctuation expansion coefficients. This recursion shows that the long-time limits of these dynamical expansion coefficients coincide with those arising from the corresponding equilibrium expansions.
Read the full abstract

Combinatorics · Cross-listed from cs.CG

Signotopes Induce Unique Sink Orientations on Grids

A unique sink orientation (USO) is an orientation of the edges of a polytope in which every face contains a unique sink. For a product of simplices $\Delta_{m-1} \times \Delta_{n-1}$, Felsner, Gärtner and Tschirschnitz (2005) characterize USOs which are induced by linear functions as the USOs on a $(m \times n)$-grid that correspond to a two-colored arrangement of lines. We generalize some of their results to products $\Delta^1 \times\cdots\times \Delta^r$ of $r$ simplices, USOs on $r$-dimensional grids and $(r+1)$-signotopes.
Read the full abstract

Information Theory

On the Rate Region of I.I.D. Discrete Signaling and Treating Interference as Noise for the Gaussian Broadcast Channel

We revisit the Gaussian broadcast channel (GBC) and explore the rate region achieved by purely discrete inputs with treating interference as noise (TIN) decoding. Specifically, we introduce a simple scheme based on superposition coding with identically and independently distributed (i.i.d.) inputs drawn from discrete constellations, e.g., pulse amplitude modulations (PAM). Most importantly, we prove that the resulting achievable rate region under TIN decoding is within a constant gap to the capacity region of the GBC, where the gap is independent of all channel parameters. In addition, we show via simulation that the weak user can achieve a higher rate with PAM than with Gaussian signaling in some cases.
Read the full abstract

Information Theory

Quasi-BP for BCH Codes and its Optimization

This paper proposes a quasi-belief propagation decoder for BCH codes that systematically integrates domain knowledge–specifically, channel noise variance, the cyclic property of the codes, and the deliberate redundancy in their parity-check matrices–to enable efficient iterative decoding. We rigorously formalize this parallelizable decoder within an information-theoretic framework by tracking mutual information evolution through the constituent variable and check decoders, thereby validating the use of scattered EXIT charts as a tool for optimizing the decoder's parameters. At each iteration, an input dilation operation expands the set of messages, while a subsequent merging operation accelerates mutual information growth, ensuring rapid convergence. The proposed decoder achieves decoding performance approaching that of LDPC codes with comparable rate and blocklength, effectively pioneering the feasible deployment of BP-like decoding for high-density parity-check codes. The generality and robustness of the scheme are demonstrated through extensive simulations across codes of varying rates and blocklengths.
Read the full abstract

Numerical Analysis

A Geometry-Aware Operator Learning Framework for Interface Problems on Varying Domains

Solving Partial Differential Equation (PDE) interface problems on varying domains is a critical task in design and optimization, yet it remains computationally prohibitive for traditional solvers. Although operator learning has shown promise on fixed geometries, its potential for geometry-dependent interface problems has been largely unexplored. To bridge this gap, we propose an extension-based neural operator framework applicable to general linear interface problems. A key innovation of our method is the integration of the Tailored Finite Point Method (TFPM) with our base network, which reduces memory consumption and effectively alleviates the curse of dimensionality. On the theoretical front, we establish the continuity of the Helmholtz operator with respect to domain perturbations and provide rigorous error estimates for the proposed encodings. Comprehensive numerical experiments demonstrate that our framework achieves state-of-the-art accuracy and robustness. Consequently, this work provides a powerful, data-efficient tool for varying-domain simulations, offering new possibilities for real-time shape optimization.
Read the full abstract

All authors Shanshan Xiao, Ye Li, Zhongyi Huang, Hao Wu

Representation Theory

On the generalized graded cellular bases for cyclotomic quiver Hecke-Clifford superalgebras

In this paper, we construct semisimple deformations for cyclotomic quiver Hecke-Clifford superalgebras of types $A^{(1)}_{s-1}$, $C^{(1)}_{s}$, $A^{(2)}_{2s}$, $D^{(2)}_{s}$. We derive a unified dimension formula for the bi-weight spaces for cyclotomic quiver Hecke-Clifford superalgebras of types $A^{(1)}_{s-1}$, $C^{(1)}_{s}$, $A^{(2)}_{2s}$, $D^{(2)}_{s}$. We introduce the notion of generalized graded cellular superalgebra. We prove a large class of cyclotomic quiver Hecke-Clifford superalgebras of types $A^{(1)}_{s-1}$, $C^{(1)}_{s}$, $A^{(2)}_{2s}$, $D^{(2)}_{s}$ is generalized graded cellular. By taking idempotent truncation, this recovers the known graded cellualr results for cyclotomic quiver Hecke algebras of types $A^{(1)}_{s-1}$, $C^{(1)}_{s}$.
Read the full abstract

Information Theory

CTD-Diff: Cooperative Time-Division Diffusion for Multi-User Semantic Communication Systems

Semantic communication (SemCom) has emerged as a transformative paradigm for efficient information transmission by emphasizing the exchange of task-relevant meaning rather than raw data. While diffusion-based SemCom models have demonstrated remarkable generative capabilities, existing studies predominantly focus on point-to-point links, overlooking the potential of multi-user (MU) cooperation in MU wireless environments. To address this limitation, we propose a Cooperative Time-Division Diffusion (CTD-Diff) framework. Unlike traditional approaches that view channel noise solely as a detriment, our framework innovatively integrates the noisy wireless transmission process directly into the forward diffusion chain. Specifically, we design a multi-user cooperation mechanism based on Time-Division Multiple Access (TDMA), where idle users overhearing the active transmitter act as semantic collaborators. To maximize the signal fidelity, the receiver employs direct signal aggregation to fuse the direct signal with cooperative copies. This aggregated noisy semantic representation serves as the condition for the reverse diffusion process, allowing the receiver to reconstruct high-fidelity data by mitigating the cumulative channel distortions. By effectively converting physical channel noise into diffusion noise, the proposed method significantly enhances the transmission reliability. Extensive experiments demonstrate that CTD-Diff outperforms various baselines regarding the reconstruction accuracy and the perceptual quality, particularly under challenging low signal-to-noise ratio (SNR) conditions.
Read the full abstract

Complex Variables

Composition operators between model and Hardy spaces

Let $n\ge 1$ and $\varphi: \mathbb{D}^n\to\mathbb{D}$ be a holomorphic function, where $\mathbb{D}$ denotes the open unit disk of $\mathbb{C}$. Let $\Theta: \mathbb{D} \to \mathbb{D}$ be an inner function and $K^p_\Theta$, $p>0$, denote the corresponding model space. We obtain characterizations of the compact composition operators $C_\varphi: K^p_\Theta \to H^p(\mathbb{D}^n)$, $1<p<\infty$, where $H^p(\mathbb{D}^n)$ denotes the Hardy space.
Read the full abstract

Functional Analysis

Explicit Formulas for the One-Parameter Group Generated by the Dunkl Operator on $\mathbb{R}$

Let $T_{b}$ be the Dunkl operator for the reflection group $G=\mathbb{Z}/2\mathbb{Z}$, and $D_{b}:=|x|^{b}\,T_{b}\,|x|^{-b}$. We compute explicitly the unitary one-parameter group $e^{tD_{b}}$ generated by $D_{b}$. We obtain two representations: a boundary value representation from the upper and lower half-planes, and a real-variable formula consisting of a translation term and a principal value integral term with an explicit kernel expressed in terms of Legendre functions.
Read the full abstract

Differential Geometry

Some rigidity theorems for spectral curvature bounds

We investigate the geometric implications of spectral curvature bounds, extending classical rigidity results in scalar curvature geometry to the spectral setting. By systematically employing the warped $\mu$-bubble method, we show classification theorems for stable weighted minimal hypersurfaces in 3-manifolds with nonnegative spectral scalar curvature, and we establish band width estimates for both spectral Ricci and spectral scalar curvatures. Furthermore, we prove some splitting theorems under spectral curvature conditions, including a spectral version of the Geroch conjecture for manifolds with arbitrary ends and a result related to the Milnor conjecture.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Extended Hybrid Timed Petri Nets with Semi-Supervised Anomaly Detection for Switched Systems, Modelling and Fault Detection

Hybrid physical systems combine continuous and discrete dynamics, which can be simultaneously affected by faults. Conventional fault detection methods often treat these dynamics separately, limiting their ability to capture interacting fault patterns. This paper proposes a unified fault detection framework for hybrid dynamical systems by integrating an Extended Timed Continuous Petri Net (ETCPN) model with semi-supervised anomaly detection. The proposed ETCPN extends existing Petri net formalisms by introducing marking-dependent flow functions, enabling intrinsic coupling between discrete and continuous dynamics. Based on this structure, a mode-dependent hybrid observer is designed, whose stability under arbitrary switching is ensured via Linear Matrix Inequalities (LMIs), solved offline to determine observer gains. The observer generates residuals that reflect discrepancies between the estimated and measured outputs. These residuals are processed using semi-supervised methods, including One-Class SVM (OC-SVM), Support Vector Data Description (SVDD), and Elliptic Envelope (EE), trained exclusively on normal data to avoid reliance on labeled faults. The framework is validated through simulations involving discrete faults, continuous faults, and hybrid faults. Results demonstrate high detection accuracy, fast convergence, and robust performance, with OC-SVM and SVDD providing the best trade-off between detection rate and false alarms. The framework is computationally efficient for real-time deployment, as the main complexity is confined to the offline LMI design phase.
Read the full abstract

Information Theory

Environment-Aware Near-Field Channel Estimation Leveraging CKM and ISAC

This paper proposes an environment-aware near-field channel estimation framework for integrated sensing and communication (ISAC) systems equipped with extremely large-scale antenna arrays (ELAAs). The proposed framework jointly exploits channel knowledge maps (CKMs) and ISAC to obtain a priori information on static and dynamic environmental features for facilitating channel estimation. In particular, we propose a novel CKM representation, termed the virtual object map (VOM), which stores the locations of virtual environment objects (EOs) to characterize the dominant multipath components (MPCs) induced by static physical EOs. In addition, we design a sensing-assisted channel training protocol, in which the ISAC-enabled base station (BS) transmits downlink pilots while simultaneously collecting monostatic echoes for sensing dynamic targets in the environment, and the user equipment (UE) feeds back a quantized version of its received pilot observation. Based on the VOM prior and the sensed dynamic information, the BS jointly estimates the coefficients of the static and dynamic MPCs to recover the near-field channel. Numerical results demonstrate that the proposed joint VOM- and sensing-aided channel estimation scheme significantly outperforms conventional schemes without VOM-based priors and/or dynamic sensing in terms of both channel estimation accuracy and achievable rate.
Read the full abstract

All authors Yuan Guo, Yilong Chen, Zixiang Ren, Jie Xu

Optimization and Control · Cross-listed from eess.SY

Element-based Formation Control: a Unified Perspective from Continuum Mechanics

This paper establishes a unified element-based framework for formation control by introducing the concept of the deformation gradient from continuum mechanics. Unlike traditional methods that rely on geometric constraints defined on graph edges, we model the formation as a discrete elastic body composed of simplicial elements. By defining a generalized distortion energy based on the local deformation gradient tensor, we derive a family of distributed control laws that can enforce various geometric invariances, including translation, rotation, scaling, and affine transformations. The convergence properties and the features of the proposed controllers are analyzed in detail. Theoretically, we show that the proposed framework serves as a bridge between existing rigidity-based and Laplacian-based approaches. Specifically, we show that rigidity-based controllers are mathematically equivalent to minimizing specific projections of the deformation energy tensor. Furthermore, we establish a rigorous link between the proposed energy minimization and Laplacian-based formation control. Numerical simulations in 2D and 3D validate the effectiveness and the unified nature of the proposed framework.
Read the full abstract

Optimization and Control

Optimal triangulations for piecewise linear approximations of non-convex variable products

We show optimal triangulations for piecewise linear (PWL) approximations of indefinite quadratic functions over the plane. Optimal triangulations have minimum triangle density while allowing a PWL approximation that fulfills a prescribed error bound measured in the L-infinity norm. In 2000, Pottmann et al. proved optimal triangulations for PWL interpolations and conjectured that these are also optimal for general PWL approximations. This conjecture was refuted in 2018 by Atariah et al., who allowed a constant deviation at the vertices of the triangles and decreased the triangle density by roughly 3%, though they left open whether their construction was optimal. In this paper, we resolve this open question: allowing varying deviations at vertices reduces the optimal triangle density by 25% compared to Atariah et al., and we prove this is globally optimal. We thus show that the potential of general PWL approximations is significantly lower for indefinite than for definite quadratic functions, where the triangle density can be halved when allowing general approximations compared to interpolations. Furthermore, we prove that among parallelogram tilings – triangulations built from translated copies of a triangle and its point-reflection – the constant-deviation construction of Atariah et al. is optimal when continuity of the PWL approximation is required. We conjecture that this optimality extends to all continuous triangulations, not just those based on parallelograms.
Read the full abstract

Combinatorics

A note on piercing discrete rectangles

In 2008, Halman proved a discrete Helly-type theorem for axis-parallel boxes in $\mathbb R^d$. Very recently, this result was extended to the $(p,q)$ setting with $p \geq q \geq d+1$ by Edwards and Soberón, and subsequently to the case $p \geq q \geq 2$ by Gangopadhyay, Polyanskii, and the author of this paper. In this paper, we obtain improved bounds for the $(p,q)$ problem in the case $q=2$ and $d=2$. More precisely, our main result asserts that for any integer $p \geq 2$, any set $P \subseteq \mathbb R^2$, and any finite family $\mathcal B$ of axis-parallel rectangles in $\mathbb R^2$ such that every rectangle contains a point of $P$, if among every $p$ rectangles there exist two whose intersection contains a point of $P$, then there exists a subset $S \subseteq P$ of size at most $O\!\bigl( (p \log \log p)^2 \bigr)$ such that every rectangle contains a point of $S$. Moreover, when $p=2$, the size of $S$ can be bounded by $4$.
Read the full abstract

Numerical Analysis

A Reciprocity-Law-Compliant Photoacoustic Forward-Adjoint Operator

We extend the forward-adjoint operator framework derived in our previous study to photoacoustic tomography (PAT). In that earlier work, the acoustic forward operator included a reception operator that maps, at each time step, the pressure wavefield in free space onto the boundary (receiver surface). It was shown that this reception operator serves as a left-inverse of an emission operator that maps the pressure restricted to the boundary (emitter surface) onto free space, perfectly complying with the reciprocity law of physics. In this study, we define the full PAT forward operator as a composite mapping composed of an acoustic forward operator equipped with a scaled variant of the previously proposed reception operator, and an operator describing the photoacoustic source. Singularities arising both in the reception step (due to the boundary restriction) and in the photoacoustic source (due to its instantaneous nature) are regularized using regularized Dirac delta distributions. The resulting PAT forward-adjoint operator pair satisfies an inner-product relation, which we verify through numerical experiments on a discretized domain. The effectiveness of the proposed operator pair is further demonstrated using an iterative minimization framework that yields both qualitatively and quantitatively accurate reconstructions of an initial pressure distribution from the corresponding Dirichlet-type boundary data.
Read the full abstract

Spectral Theory

Threshold Virtual States of a Jacobi operator

We prove that the set of parameters for which a virtual level appears at the edge of the continuous spectrum of a Jacobi matrix with a finite-rank diagonal perturbation constitutes an algebraic variety of codimension one. This variety partitions the parameter space into connected components, with their number determined by the size of the perturbation support. We also reveal a hierarchical structure underlying these critical varieties as the rank of the perturbation increases.
Read the full abstract