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)

Wednesday 8 April

Differential Geometry

Complete minimal submanifolds of the non-compact Riemannian symmetric spaces SL_n(R)/SO(n), Sp(n,R)/U(n), SO*(2n)/U(n), SU*(2n)/Sp(n) via complex-valued eigenfunctions

In this work we construct new multidimensional families of complete minimal submanifolds, of the classical non-compact Riemannian symmetric spaces SL_n(R)/SO(n), Sp(n,R)/U(n), SO*(2n)/U(n) and SU*(2n)/Sp(n), of codimension two.

Statistics Theory

Non-asymptotic two-sample kernel testing with the spectrally truncated normalized MMD

Kernel methods provide a flexible and powerful framework for nonparametric statistical testing by embedding probability distributions into a reproducing kernel Hilbert space (RKHS). In this work, we study the kernel two-sample testing problem and focus on a normalized version of the Maximum Mean Discrepancy (MMD) as a test statistic, which scales the discrepancy by the within-group covariance operator to account for data variability. This normalization has been shown to improve test power in both theoretical and empirical settings. Because this normalization requires regularization, we study the non-asymptotic properties of the spectrally truncated normalized MMD (st-nMMD) and derive an exponential upper bound under the null hypothesis. Thanks to this result we propose a sharp and explicit upper bound for the corresponding non-asymptotic quantile, along with a data-adaptive estimator. We further propose an algorithm to tune the hyperparameters involved in the quantile estimation, including the truncation level, without requiring data splitting. We demonstrate the performance of the st-nMMD through numerical experiments under both the null and alternative hypotheses.
Read the full abstract

All authors Perrine Lacroix, Bertrand Michel, Franck Picard, Vincent Rivoirard

Category Theory

Embedding Boolean ample monoids as full submonoids of Boolean inverse monoids

We show that, in certain circumstances, a Boolean ample monoid may be fully embedded into a Boolean inverse monoid in a way that generalizes how right reversible cancellative monoids may be embedded into groups. We use groupoids of fractions and non-commutative Stone duality to prove the result.
Read the full abstract

Functional Analysis

Bergman-space regularity for the heat equation with white-noise boundary forcing

We introduce a Bergman-space framework for the study of boundary-forced heat equations and show that, in the one-dimensional case, boundary white noise gives rise to a sharp holomorphic regularity phenomenon. More precisely, we consider the heat equation on a bounded interval with Dirichlet or Neumann boundary conditions driven by independent white noises at the endpoints, and we prove that for every positive time the corresponding state extends holomorphically to a rhombus in the complex plane having the original interval as one of its diagonals. Moreover, the resulting process admits a continuous version with values in a scale of weighted Bergman spaces on that rhombus, depending on two parameters $\delta\in(0,1)$ and $\Theta\in\left(0,\frac{\pi}{4}\right)$. To our knowledge, this is the first systematic use of Bergman spaces as state spaces for parabolic equations with stochastic boundary forcing. We also prove that the result is optimal, in the sense that the conclusion fails at the critical values $\delta=0$ and $\Theta=\frac{\pi}{4}$.
Read the full abstract

Number Theory

Explicit inequalities for the nth lucky number

Gardiner, Lazarus, Metropolis, and Ulam introduced a variation of the sieve of Eratosthenes that (instead of producing the sequence of prime numbers) produces the sequence of "lucky numbers". The distribution of lucky numbers has a striking similarity to that of prime numbers. In particular, Hawkins and Briggs proved that if $\ell_n$ denotes the $n$th lucky number then $\ell_n \sim n \log n$, which is analogous to the prime number theorem. This work provides explicit upper and lower bounds on $\ell_n$.
Read the full abstract

Numerical Analysis

Low-rank solutions to a class of parametrized systems using Riemannian optimization

We propose a computational framework for computing low-rank approximations to the ensemble of solutions of a parametrized system of the form $A(\xi)x(\xi)+g(x(\xi))=b(\xi)$ for multiple parameter values. The central idea is to reinterpret the parametrized system as the first-order optimality condition of an optimization problem set over the space of real matrices, which is then minimized over the manifold of fixed-rank matrices. This formulation enables the use of Riemannian optimization techniques, including conjugate gradient and trust-region methods, and covers both linear and nonlinear instances under mild assumptions on the structure of the parametrized system. We further provide a theoretical analysis establishing conditions under which the solution matrix admits accurate low-rank approximations, extending existing results from linear to nonlinear problems. To enhance computational efficiency and robustness, we discuss tailored preconditioning strategies and a rank-compression mechanism to control the rank growth induced by nonlinearities. Numerical experiments demonstrate that the proposed approach achieves significant computational savings compared to solving each system independently, as well as highlight the potential of Riemannian optimization methods for low-rank approximations in large-scale parametrized nonlinear problems.
Read the full abstract

Information Theory

Energy Saving for Cell-Free Massive MIMO Networks: A Multi-Agent Deep Reinforcement Learning Approach

This paper focuses on energy savings in downlink operation of cell-free massive MIMO (CF mMIMO) networks under dynamic traffic conditions. We propose a multi-agent deep reinforcement learning (MADRL) algorithm that enables each access point (AP) to autonomously control antenna re-configuration and advanced sleep mode (ASM) selection. After the training process, the proposed framework operates in a fully distributed manner, eliminating the need for centralized control and allowing each AP to dynamically adjust to real-time traffic fluctuations. Simulation results show that the proposed algorithm reduces power consumption (PC) by 56.23% compared to systems without any energy-saving scheme and by 30.12% relative to a non-learning mechanism that only utilizes the lightest sleep mode, with only a slight increase in drop ratio. Moreover, compared to the widely used deep Q-network (DQN) algorithm, it achieves a similar PC level but with a significantly lower drop ratio.
Read the full abstract

All authors Qichen Wang, Keyu Li, Ozan Alp Topal, Özlem Tugfe Demir, Mustafa Ozger, Cicek Cavdar

Mathematical Physics

Existence of a Phase Transition in the One-Dimensional Ising Spin Glass Model with Long-Range Interactions on the Nishimori Line

Dyson [Commun. Math. Phys. 12, 91 (1969)] rigorously proved the existence of a phase transition in the one-dimensional Ising model with long-range interactions of the form $r^{-\alpha}$ for $1 < \alpha < 2$. In the present study, we extend this result to the Ising spin glass model with Gaussian disorder on the Nishimori line. Following Dyson's method, we first prove the existence of long-range order at finite low temperatures in the Dyson hierarchical Ising spin glass model on the Nishimori line, with power-law-like interactions $J(r) \sim r^{-\alpha}$ for $1 < \alpha < 3/2$. The key ingredients of the proof are the interpolation method developed in the rigorous analysis of mean-field spin glass models, the Gibbs–Bogoliubov inequality on the Nishimori line, and the Tsirelson–Ibragimov–Sudakov inequality (Gaussian concentration inequality). We then use the Griffiths inequality on the Nishimori line to rigorously establish the existence of a phase transition in the one-dimensional Ising spin glass model with long-range interactions on the Nishimori line for $1 < \alpha < 3/2$. For $3/2 \le \alpha \le 2 $, the existence of a phase transition remains an open problem.
Read the full abstract

Numerical Analysis · Cross-listed from physics.flu-dyn

A solver-in-the-loop framework for end-to-end differentiable coastal hydrodynamics

Numerical simulation of wave propagation and run-up is a cornerstone of coastal engineering and tsunami hazard assessment. However, applying these forward models to inverse problems, such as bathymetry estimation, source inversion, and structural optimization, remains notoriously difficult due to the rigidity and high computational cost of deriving discrete adjoints. In this paper, we introduce AegirJAX, a fully differentiable hydrodynamic solver based on the depth-integrated, non-hydrostatic shallow-water equations. By implementing the solver entirely within a reverse-mode automatic differentiation framework, AegirJAX treats the time-marching physics loop as a continuous computational graph. We demonstrate the framework's versatility across a suite of scientific machine learning tasks: (1) discovering regime-specific neural corrections for model misspecifications in highly dispersive wave propagation; (2) performing continuous topology optimization for breakwater design; (3) training recurrent neural networks in-the-loop for active wave cancellation; and (4) inverting hidden bathymetry and submarine landslide kinematics directly from downstream sensor data. The proposed differentiable paradigm fundamentally blurs the line between forward simulation and inverse optimization, offering a unified, end-to-end framework for coastal hydrodynamics.
Read the full abstract

Rings and Algebras

A note on even Clifford algebras of skew quadric hypersurfaces

Let $S_\alpha = k\langle x_1,\dots,x_n\rangle /(x_i x_j - \alpha_{ij} x_j x_i)$ be a standard graded skew polynomial algebra over an algebraically closed field $k$ of characteristic not equal to $2$. We show the following results. When $n$ is odd and $f = x_1x_2 + \cdots + x_{n-2}x_{n-1} + x_n^2$ is a normal element of $S_\alpha$, the even Clifford algebra of the skew quadric hypersurface $S_\alpha/(f)$ is isomorphic to a full matrix algebra $M_{2^{(n-1)/2}}(k)$, and the stable category $\underline{\mathsf{CM}}^{\mathbb Z}(S_\alpha/(f))$ of graded maximal Cohen-Macaulay modules over $S_\alpha/(f)$ is triangle equivalent to the derived category $\mathsf{D}^b(\mathsf{mod}\,k)$. When $n$ is even and $f = x_1x_2 + \cdots + x_{n-1}x_n$ is a normal element of $S_\alpha$, the even Clifford algebra of $S_\alpha/(f)$ is isomorphic to $M_{2^{(n-2)/2}}(k)^2$, and the stable category $\underline{\mathsf{CM}}^{\mathbb Z}(S_\alpha/(f))$ of graded maximal Cohen-Macaulay modules over $S_\alpha/(f)$ is triangle equivalent to the derived category $\mathsf{D}^b(\mathsf{mod}\,k^2)$. As a consequence, $S_\alpha/(f)$ is of finite Cohen-Macaulay representation type in both cases. These results demonstrate that $S_\alpha/(f)$ is a natural noncommutative generalization of the homogeneous coordinate ring of a smooth quadric hypersurface.
Read the full abstract

Dynamical Systems · Cross-listed from q-bio.MN

A modular approach to achieve multistationarity using AND-gates

Systems of differential equations have been used to model biological systems such as gene and neural networks. A problem of particular interest is to understand the number of stable steady states. Here we propose conjunctive networks (systems of differential equations equations created using AND gates) to achieve any desired number of stable steady states. Our approach uses combinatorial tools to predict the number of stable steady states from the structure of the wiring diagram. Furthermore, AND gates have been successfully engineered by experimentalists for gene networks, so our results provide a modular approach to design gene networks that achieve arbitrary number of phenotypes.
Read the full abstract

Combinatorics

Smooth Graphs

The notion of smoothness was introduced originally in the context of step systems on connected graphs. Smoothness turns out to be a very general property of metrics defined by a five-point condition. Restricted to graphs, it is closely related to the convexity of point-shadows. We show that smoothness is preserved by isometric subgraphs, both Cartesian and strong graph products, and gated amalgams. As a consequence, median graphs and many of their generalizations are smooth. We also show that l1-graphs are smooth. On the other hand, an induced K2,3 or K1,1,3 is incompatible with smoothness. Finally, we characterize smooth graphs among the Ptolemaic graphs as precisely the K1,1,3-free Ptolemaic graphs.
Read the full abstract

All authors Boštjan Brešar, Manoj Changat, Prasanth G. Narasimha-Shenoi, Bruno J. Schmidt, Peter F. Stadler

Combinatorics

Weak saturation of tensor product of cliques

Given two hypergraphs $G$ and $H$, the weak saturation number $\operatorname{\mathrm{wsat}}(G,H)$ is the minimum number of edges in a spanning subhypergraph $F$ of $G$ such that the missing edges of $F$ can be added one at a time so that each added edge creates a copy of $H$. In this work, we determine weak saturation numbers for the case when $G$ and $H$ are tensor product of cliques, generalizing a result of Moshkovitz and Shapira (Journal of Combinatorial Theory, Series B, 2015), who found the exact values of $\operatorname{\mathrm{wsat}}(K^d_{n_1,\ldots,n_d},\ K^d_{r_1,\ldots,r_d})$. The proof also yields results for colored weak saturation numbers $\operatorname{\mathrm{c-wsat}}(G,H)$ of colored hypergraphs $G$ and $H$, where the colorings of the copies of $H$ must be compatible with the coloring of $G$. We determine these numbers when $G$ and $H$ are unions of tensor product of cliques, generalizing a result of Bulavka, Tancer, and Tyomkyn (Combinatorica, 2023), who determined $\operatorname{\mathrm{c-wsat}}(K^q_{n_1,\ldots,n_d}, K^q_{r_1,\ldots,r_d})$. Moreover, our proof allows us to generalize a result of Balogh, Bollobás, Morris, and Riordan (Journal of Combinatorial Theory, Series A, 2012) by determining colored weak saturation numbers $\operatorname{\mathrm{c-wsat}}(K^d_{n_1,\ldots,n_d},\{K^d_{r_1,\ldots,r_d}\}_{\mathbf{r}\in \mathcal{R}})$ for an arbitrary family $\mathcal{R}$. The quantity $\operatorname{\mathrm{c-wsat}}(G,\mathcal{H})$ extends colored weak saturation by allowing, at each step, the creation of a colored copy of any hypergraph in the fixed family of hypergraphs $\mathcal{H}$.
Read the full abstract

Combinatorics

Asymptotically optimal lower bounds on weak saturation numbers for hypergraphs

Given an $r$-uniform hypergraph $H$ and a positive integer $n$, the weak saturation number $\mathrm{wsat}(n,H)$ is the minimum number of edges in an $r$-uniform hypergraph $F$ on $n$ vertices such that the missing edges in $F$ can be added, one at a time, so that each added edge creates a copy of $H$. For the case of graphs ($r = 2$), asymptotically optimal general lower bounds for these numbers in terms of the minimum vertex degree of $H$ are known. In this work, we generalize these bounds to the case of hypergraphs and establish their asymptotic optimality. To prove this, we introduce a lower bound method based on polymatroids. This method generalizes a linear algebraic method but, unlike the original version, makes it possible to derive lower bounds with non-integer asymptotic coefficients.
Read the full abstract

Numerical Analysis

A new high-order finite-volume advection scheme on spherical Voronoi grids and a comparative study in a mimetic finite-volume moist shallow-water model

Spherical centroidal Voronoi tessellations (SCVTs), currently used in numerical weather forecasting models such as the Model for Prediction Across Scales (MPAS), are a type of spherical grid that is highly flexible, allowing the construction of locally refined regions with higher resolution without requiring modifications to the numerical discretization or its implementation. However, the irregularity of SCVT grids makes the construction of robust high-order schemes challenging. In particular, in atmospheric modeling, high-order advection schemes are desirable since they reduce numerical diffusion and improve the representation of fine-scale tracer structures. Therefore, in this work, we propose a new class of high-order advection schemes on the sphere based on the $k$-exact reconstruction approach, extending their successful use on planar domains to the spherical surface. We assess the performance of the proposed method and compare it with existing advection schemes for SCVT grids used in MPAS. The evaluation includes classical advection test cases on the sphere as well as simulations with a mimetic finite-volume moist shallow-water model, in which the advection scheme is applied to the transport of moisture tracers. Grid-related robustness was investigated using locally refined spherical grids with a local focus on the Andes topography. Our results show that the proposed schemes achieve high-order accuracy in the advection tests, exhibit little sensitivity to grid distortion, and produce comparable results to existing schemes in the moist shallow-water model. Overall, grid robustness is therefore limited to the sensitivity of the discretization of the shallow-water model, irrespective of the advection scheme.
Read the full abstract

Logic

Cardinality in a paraconsistent and paracomplete set theory

This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that “$x\in A$” is both true and false for some $x$) or incomplete ($A$ such that “$x\in A$” is neither true nor false for some $x$). We carefully analyze what it means for two potentially incomplete or inconsistent sets to have “the same size”, construct the corresponding cardinal numbers, and develop the basic theory of cardinal arithmetic. A surprising result is that the cardinality of any set can be expressed as a linear combination of three fundamental cardinal numbers with classical cardinals as coefficients. In that sense, our cardinal numbers form a three-dimensional space over the usual cardinals, much like how the complex numbers form a two-dimensional space over the reals.
Read the full abstract

Dynamical Systems

Dynamics on fences

Homeomorphisms of the Cantor set play a central role in topology, dynamical systems and descriptive set theory. In parallel, several classes of fence-like spaces - such as the hairy Cantor set, hairy arcs, Cantor bouquets in complex dynamics, the Lelek fan in topology and Fraïssé fence in descriptive set theory - have recently been studied for their rich structural and dynamical properties. In this paper, we introduce a general construction that associates to each homeomorphism of the Cantor set a canonically defined homeomorphism of a corresponding fence space. This construction lifts dynamical properties from the Cantor set to these fence-like spaces, allowing one to systematically transfer features such as minimality, recurrence, and orbit structure. As a consequence, we obtain a unified framework for studying dynamics on a broad class of fence-like spaces and establish new connections between their topological structure and induced dynamical behavior.
Read the full abstract

Numerical Analysis · Cross-listed from physics.comp-ph

Granular mixing and flow dynamics in horizontal stirred bed reactors

Horizontal stirred bed reactors (HSBRs) are used in gas–phase polyolefin production, where efficient solids mixing and controlled residence time distributions are essential for product quality and stability. Despite their industrial relevance, the influence of operating conditions on granular flow and mixing in HSBRs is not well understood. Discrete Element Method (DEM) simulations are used to study the effects of rotation speed and fill level on particle motion, mixing, and axial transport in a lab–scale HSBR. An industrial–grade polypropylene powder is modelled using calibrated contact parameters. Mixing is quantified using the Lacey index in axial (z) and cross–sectional (xy) directions. Particle circulation is characterised via cycle–time analysis and a coarse–grained angular velocity field. Axial dispersion coefficients are obtained from particle trajectories using both Einstein–type and cycle–based approaches, and validated with a diffusion model predicting the axial Lacey index. Results show that axial mixing depends strongly on rotation speed and fill level: higher rotation speeds accelerate homogenization, while higher fill levels slow mixing. Cross–sectional mixing is mainly sensitive to rotation speed, with fill–level effects diminishing at higher speeds. Cycle time decreases with increasing rotation speed and fill level, indicating enhanced circulation. Axial dispersion increases with rotation speed but decreases with fill level, with consistent results across methods. These findings reveal trade–offs between axial mixing, circulation, and dispersion, highlighting the need to balance operating conditions and demonstrating the capability of DEM to support HSBR optimisation.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Controller Design for Structured State-space Models via Contraction Theory

This paper presents an indirect data-driven output feedback controller synthesis for nonlinear systems, leveraging Structured State-space Models (SSMs) as surrogate models. SSMs have emerged as a compelling alternative in modelling time-series data and dynamical systems. They can capture long-term dependencies while maintaining linear computational complexity with respect to the sequence length, in comparison to the quadratic complexity of Transformer-based architectures. The contributions of this work are threefold. We provide the first analysis of controllability and observability of SSMs, which leads to scalable control design via Linear Matrix Inequalities (LMIs) that leverage contraction theory. Moreover, a separation principle for SSMs is established, enabling the independent design of observers and state-feedback controllers while preserving the exponential stability of the closed-loop system. The effectiveness of the proposed framework is demonstrated through a numerical example, showcasing nonlinear system identification and the synthesis of an output feedback controller.
Read the full abstract

All authors Muhammad Zakwan, Vaibhav Gupta, Alireza Karimi, Efe C. Balta, Giancarlo Ferrari-Trecate

Spectral Theory

Eigenvalue collision and exotic preservers on semisimple operators

We classify $n\times n$-matrix-valued continuous commutativity and spectrum preservers defined on spaces of (a) normal, (b) semisimple and (c) arbitrary $n\times n$ matrices with spectra contained in sufficiently connected subsets $\mathcal{X}\subseteq \mathbb{C}$, generalizing a number of results due to Šemrl, Gogić, Tomašević and the author among others. In case (a) these are always conjugations or transpose conjugations, while in cases (b) and (c) qualitatively distinct possibilities arise depending on the local regularity of the complex-conjugation map close to coincident-eigenvalue loci of $\mathcal{X}^n$.
Read the full abstract

Algebraic Geometry

On computing the spherical roots for a class of spherical subgroups

Given a connected reductive algebraic group $G$, we consider the class of spherical subgroups $H \subset G$ such that $H$ is regularly embedded in a parabolic subgroup $P \subset G$ and $H,P$ have a common Levi subgroup $L$. In a previous paper, the author developed a fast algorithm that reduces the computation of the set of spherical roots for such subgroups $H$ to the case where the quotient of Lie algebras $\operatorname{Lie} P / \operatorname{Lie} H$ is a strictly indecomposable spherical $L$-module. In this paper, we complete the classification of all such cases and compute the spherical roots for each of them, which enables one to use the above fast algorithm directly for computing the spherical roots for arbitrary spherical subgroups in the class under consideration.
Read the full abstract

Dynamical Systems

On local solutions to time-varying linear systems

This paper develops an intrinsic framework for local solutions to time-varying linear systems with real meromorphic coefficients. Local solutions on compact intervals naturally form a sheaf of vector spaces. We introduce regularity triples to distinguish regularity across singularities, one-sided regularity at singularities, and regularity away from singularities. The local formulation isolates a continuation property implicit in established global frameworks and yields a simple definition of behavioural controllability. We establish an algebraically verifiable sufficient condition for continuation, prove its necessity for controllability, and derive an algebraic characterization of controllability based on the Teichmüller-Nakayama form, recovering and slightly generalizing established results.
Read the full abstract

Numerical Analysis

A Locking-free and Loosely Coupled Robin-Robin Scheme for Fluid-Poroelasticity Interaction

We study a fluid-poroelasticity interaction (FPSI) problem coupling the unsteady Stokes equations with the fully dynamic Biot system. A major challenge in such problems is to design partitioned schemes that remain robust in locking-related parameter regimes while preserving the physical interface coupling structure.To address this issue, we introduce two auxiliary variables and reformulate the Biot system as a four-field problem consisting of a dynamic Stokes-like system coupled with a diffusion equation. Crucially, this reformulation preserves the original interface conditions. Based on Robin-Robin transmission conditions with explicitly lagged interface data, we construct a fully decoupled scheme in which the fluid and poroelastic subproblems can be solved independently and in parallel at each time step, without sub-iterations.We prove that the resulting method is unconditionally stable and derive optimal-order error estimates in the $H^1$-norm. The analysis further shows that the scheme is robust with respect to extreme poroelastic parameters and avoids the locking effects inherent in standard formulations. Numerical experiments confirm the theoretical convergence results and demonstrate the locking-robust performance of the proposed method.
Read the full abstract

All authors Wenlong He, Thomas Wick, Xiaohe Yue, Jiwei Zhang, Haibiao Zheng

Mathematical Physics · Cross-listed from nucl-th

How acausal equations emerge from causal dynamics

We construct a causal and covariantly stable kinetic model whose spectrum at real wavenumbers $k$ reproduces any rest-frame stable dissipative dispersion relation $\omega(k)$ via suitable initialization of the microscopic degrees of freedom. Macroscopic observables can therefore obey arbitrary linear evolution equations (including forms that would be acausal if taken as fundamental), while the underlying dynamics remains causal, and all apparent propagation is encoded in the initial data. This provides an explicit counterexample to the idea that microscopic causality alone constrains the analytic form of dispersion relations at real $k$. In particular, bounds on transport coefficients based solely on the analytic structure of $\omega(k)$, such as the hydrohedron bounds, require additional assumptions about the region in the complex $k$-plane where $\omega(k)$ corresponds to physical modes.
Read the full abstract

Dynamical Systems

Physics-Informed Functional Link Constrained Framework with Domain Mapping for Solving Bending Analysis of an Exponentially Loaded Perforated Beam

This article presents a novel and comprehensive approach for analyzing bending behavior of the tapered perforated beam under an exponential load. The governing differential equation includes important factors like filling ratio ($\alpha$), number of rows of holes ($N$), tapering parameters ($\phi$ and $\psi$), and exponential loading parameter ($\gamma$), providing a realistic and flexible representation of perforated beam configuration. Main goal of this work is to see how well the Domain mapped physics-informed Functional link Theory of Functional Connection (DFL-TFC) method analyses bending response of perforated beam with square holes under exponential loading. For comparison purposes, a corresponding PINN-based formulation is developed. Outcomes clearly show that the proposed DFL-TFC framework gives better results, including faster convergence, reduced computational cost, and improved solution accuracy when compared to the PINN approach. These findings highlight effectiveness and potential of DFL-TFC method for solving complex engineering problems governed by differential equations. Within this framework, hidden layer is replaced by a functional expansion block that enriches input representation via orthogonal polynomial basis functions, and the domain of DE mapped to corresponding domain of orthogonal polynomials. A Constrained Expression (CE), constructed through the Theory of Functional Connections (TFC) using boundary conditions, ensures that constraints are exactly satisfied. In CE, free function is represented using a Functional Link Neural Network (FLNN), which learns to solve resulting unconstrained optimization problem. The obtained results are further validated through the Galerkin and PINN solutions.
Read the full abstract

Algebraic Topology

An Algebraic Introduction to Persistence

We introduce persistence with an emphasis on its algebraic foundations, using the representation theory of posets. Linear representations of posets arise in several areas of mathematics, including the representation theory of quivers and finite dimensional algebras, Morse theory and other areas of geometry, as well as topological inference and topological data analysis – often via persistent homology. In some of these contexts, the category of poset representations of interest admits a metric structure given by the so-called interleaving distance. Persistence studies the algebraic properties of these poset representations and their behavior under perturbations in the interleaving distance. We survey fundamental results in the area, applications to pure and applied mathematics, advanced topics such as multiparameter persistence, as well as theoretical challenges and open questions.
Read the full abstract

Information Theory

Top-P Sensor Selection for Target Localization

We study set-valued decision rules in which performance is defined by the inclusion of the top-$p$ hypotheses, rather than only the single best or true hypothesis. This criterion is motivated by sensor selection for target tracking, where inexpensive measurements are used to identify a list of sensor nodes that are likely to be closest to a target. We analyze the performance of top-$p$ versus top-$1$ selection under sequential hypothesis testing, propose a geometry-aware sensor selection algorithm, and validate the approach using real testbed data.
Read the full abstract

All authors Kaan Buyukkalayci, Kyle Pak, Merve Karakas, Xinlin Li, Christina Fragouli

Mathematical Physics · Cross-listed from gr-qc

From freely falling frames to the Lorentz gauge-symmetry group and a Hamiltonian composite theory of gravitation

The concept of freely falling frames suggests that gravity exhibits a local Lorentz gauge symmetry and requires a background Minkowski reference frame. The gauge vector fields of a Yang-Mills-type theory can be constructed from the transformations to these local freely falling frames, thereby leading to a composite theory of gravity. We propose coordinate conditions under which an exact black-hole solution can be obtained. Our analysis of planar gravitational waves reveals that, despite the large symmetry group, composite gravity possesses only four physical degrees of freedom. We elaborate a Hamiltonian formulation of composite gravity, derive the full set of constraints for the nonlinear theory, and outline the pathway toward its quantization.
Read the full abstract

Analysis of PDEs

Spherical rigidity for an exterior overdetermined problem with Neumann data prescribed by mean curvature

We study an overdetermined elliptic free boundary problem for exterior domains in $\mathbb{R}^N$, $N \ge 2$, introduced by F. Morabito [Comm. PDE 46 (2021), 1137-1161]. The overdetermining condition prescribes the Neumann data as a multiple of the boundary mean curvature, with parameter $\Gamma$, together with a spherical compatibility condition. For $N \ge 3$, we prove rigidity of the spherical solution among star-shaped domains when $\Gamma \ge N-2$; in the borderline case $\Gamma = N-2$, the star-shapedness assumption can be removed, and rigidity holds among all bounded domains. The proof combines the Pohozaev identity, geometric identities, and the sharp boundary inequality of Agostiniani and Mazzieri for capacitary potentials. We also obtain rigidity among bounded domains for $\Gamma \le 0$ via Serrin's moving plane method. In dimension two, the unit disc is the only admissible domain for every $\Gamma$.
Read the full abstract