Rings and Algebras
A new limit variety of additively idempotent semirings
Simin Lyu, Miaomiao Ren and Mengya Yue
We establish a sufficient condition for an additively idempotent semiring to be nonfinitely based. Applying this condition, we prove that the six-element additively idempotent semiring $SR_6$ has no finite basis for its identity. Furthermore, we provide a complete description of the subvariety
lattice of the variety $\mathsf{V}(SR_6)$ generated by $SR_6$, showing that it forms a four-element chain. Our results demonstrate that $\mathsf{V}(SR_6)$ is a limit variety: it is itself nonfinitely based, yet all of its proper subvarieties are finitely based. Moreover, $SR_6$ is the smallest known example of an additively idempotent semiring generating a limit variety.
Read the full abstract ▾
Functional Analysis · Cross-listed from q-fin.MF
Bid–Ask Martingale Optimal Transport
Bryan Liang, Marcel Nutz, Shunan Sheng et al. (+1 more)
Martingale Optimal Transport (MOT) provides a framework for robust pricing and hedging of illiquid derivatives. Classical MOT enforces exact calibration of model marginals to the mid-prices of vanilla options. Motivated by the industry practice of fitting bid and ask marginals to vanilla prices, we introduce a relaxation of MOT in which model-implied
volatilities are only required to lie within observed bid–ask spreads; equivalently, model marginals lie between the bid and ask marginals in convex order. The resulting Bid–Ask MOT (BAMOT) yields realistic price bounds for illiquid derivatives and, via strong duality, can be interpreted as the superhedging price when short and long positions in vanilla options are priced at the bid and ask, respectively. We further establish convergence of BAMOT to classical MOT as bid–ask spreads vanish, and quantify the convergence rate using a novel distance intrinsically linked to bid–ask spreads. Finally, we support our findings with several synthetic and real-data examples.
Read the full abstract ▾
All authors Bryan Liang, Marcel Nutz, Shunan Sheng, Valentin Tissot-Daguette
Information Theory · Cross-listed from eess.SP
Analog Computing with Hybrid Couplers and Phase Shifters
Matteo Nerini, Xuekang Liu and Bruno Clerckx
Analog computing with microwave signals can enable exceptionally fast computations, potentially surpassing the limits of conventional digital computing. For example, by letting some input signals propagate through a linear microwave network and reading the corresponding output signals, we can instantly compute a
matrix-vector product without any digital operations. In this paper, we investigate the computational capabilities of linear microwave networks made exclusively of two low-cost and fundamental components: hybrid couplers and phase shifters, which are both implementable in microstrip. We derive a sufficient and necessary condition characterizing the class of linear transformations that can be computed in the analog domain using these two components. Within this class, we identify three transformations of particular relevance to signal processing, namely the discrete
Fourier transform (DFT), the Hadamard transform, and the Haar transform. For each of these, we provide a systematic design method to construct networks of hybrid couplers and phase shifters capable of computing the transformation for any size power of two. To validate our theoretical results, a hardware prototype was designed and fabricated, integrating hybrid couplers and phase shifters to implement the $4\times4$ DFT. A systematic calibration procedure was subsequently developed to characterize the prototype and compensate for fabrication errors. Measured results from the prototype demonstrate successful DFT computation in the analog domain, showing high correlation with theoretical expectations. By realizing an analog computer through standard microwave components, this work demonstrates a practical pathway toward low-latency, real-time analog signal processing.
Read the full abstract ▾
Algebraic Topology
Interleaving distances from height-difference functions on posets
Toshitaka Aoki
Interleaving distances provide a fundamental tool for comparing persistence modules and have been widely used in topological data analysis. Their definitions are typically based on translation structures (shift operations) on the indexing poset, but on general posets such structures can be scarce, making this framework restrictive. In this paper, we introduce a new interleaving-type distance for functor categories over arbitrary posets, induced by a height-difference function $\rho$. The key idea is to associate to $\rho$ an $\mathbb{R}_{\geq 0}$-indexed family of adjoint endofunctors on $\mathrm{Fun}(P,\mathcal{C})$, which play the role of generalized translations and allow us to formulate interleavings in a purely categorical manner and define the distance $d_{\rho}$, called the height-interleaving distance. In particular, any height function (i.e., a real-valued order-preserving map) canonically induces such a height-difference function, so our framework remains useful on finite posets. Moreover, when $P=\mathbb{R}^d$ and $\rho=\rho_{\mathrm{diag}}$, the resulting distance coincides with the classical interleaving distance for multiparameter persistence modules. However, in general, $d_{\rho}$ need not satisfy the triangle inequality. Under suitable hypotheses (e.g. CIP for $(P,\rho)$; this condition is automatic when $P$ is a tree poset), we prove a triangle inequality up to an additive defect bounded by a constant $c(\rho)$; in particular, when $c(\rho)=0$ this yields an extended pseudo-distance. We also establish a stability property with respect to perturbations of height-difference functions: small changes in $\rho$ induce small changes in the associated height-interleaving distance. Finally, we study an analogue of the erosion-type constructions from classical interleavings within our framework.
Read the full abstract ▾
Algebraic Geometry
McMullen's Curve, the Weil Locus, and the Hodge Conjecture for Abelian Sixfolds
Amir Mostaed
McMullen's compact Kobayashi-geodesic curve $V \subset X_L$, arising from the
hyperbolic triangle group $\Delta(14,21,42)$ via a modular
embedding into the
Hilbert modular sixfold $X_L = \mathbb{H}^6/\mathrm{SL}_2(\mathcal{O}_L)$ attached to the totally real cyclic field $L = \mathbb{Q}(\cos\tfrac{\pi}{21})$, is not contained in any proper Shimura subvariety of $X_L$, and the generic fiber $A_v$ satisfies $\mathrm{MT}(A_v) = \mathrm{Res}_{L/\mathbb{Q}}\,\mathrm{SL}_2$, hence carries no exceptional Hodge tensors. The Weil locus $\mathcal{W}_K \subset X_L$ parametrizing abelian sixfolds of Weil type for $K = \mathbb{Q}(\sqrt{-d})$ has codimension $3$ and $20$ irreducible components; the expected dimension $1 + 3 - 6 = -2$ makes any non-empty $V \cap \mathcal{W}_K$ super-atypical in the sense of Zilber-Pink. We prove that $V \cap \mathcal{W}_K$ is finite, possibly empty: every intersection point is a CM point with $\mathrm{End}^0(A_v) = M = KL$, a degree-$12$ CM field with $\mathrm{Gal}(M/\mathbb{Q}) \cong \mathbb{Z}/2 \times \mathbb{Z}/2 \times \mathbb{Z}/3$, established by two independent methods: the André-Oort
theorem for $\mathcal{A}_6$ and the Ax-Schanuel
theorem for period maps. The Hodge-Weil classes in $H^{3,3}$ at intersection points are absolute Hodge yet inaccessible to all existing algebraicity
theorems, due to three independent obstructions: CM isolation, absence of a $K$-secant structure, and uncontrolled discriminant. For $d \in \{3,7\}$, so that $M = \mathbb{Q}(\zeta_{42})$, we reduce non-emptiness of $V \cap \mathcal{W}_K$ to $44 \times 64 = 2816$ explicit algebraic equations for the
prime $\ell = 43$ via Hecke correspondences on $X_L$, and isolate the remaining open steps toward a new case of the Hodge
conjecture for abelian sixfolds.
Read the full abstract ▾
Algebraic Topology · Cross-listed from cs.LG
Quotient Geometry and Persistence-Stable Metrics for Swarm Configurations
Mark M. Bailey
Can temporal information recover geometry lost by a persistence diagram? For $n\ge3$ points on the unit sphere evolving under known homogeneous complete consensus, we prove generic local recovery modulo rotations and permutations from two ordinary zero-dimensional Vietoris–Rips persistence snapshots. The structural result applies to every labeled tree: its edge inner products and their first temporal derivatives have differential rank $2n-3$, exactly the dimension of the regular formation quotient. An explicit pole–equator witness proves this simultaneously for all tree types after taking a finite intersection of open dense sets. Although one snapshot has generic local fibers of dimension $n-2$, two sufficiently close snapshots are injective on a common neighborhood. The optimal inverse Lipschitz constant grows as $\Theta(1/|h|)$ when the sampling interval tends to zero. A verified left inverse, interval derivative bounds, and explicit persistence-matching margins certify neighborhoods and time intervals at rational reference formations. The results are local and model-specific; reflection ambiguity and centered rank obstructions remain.
Read the full abstract ▾
General Mathematics
A fixed-point iteration method for the number Pi with arbitrary odd order of convergence based on the sine function
Alois Schiessl
In this paper, we present a fixed point method for high-precision computation of number $\pi$ based on the sine function. Let $P\in \mathbb{N}$. We define the function: \[ S\left(x\right) =x+\sum_{k=1}^{P}\left(\prod_{\ell=1}^{k-1}\frac {2\,\ell-1}{2\,\ell}\right)\frac{\sin\left(x\right)^{2\,k-1}}{2\,k-1}\,. \] For every initial value $x_0$ sufficiently close to $\pi$, the sequence \[x_{n+1}=x_n+S\left(x_{n}\right)\;;\,n=0,1,\ldots\] is converging to $\pi$ with order of convergence exactly $\left(2\,P+1\right)$. The computational tests we performed demonstrate the efficiency of the method. \[\] \[\textbf{Zusammenfassung}\] In dieser Abhandlung stellen wir ein Fixpunktverfahren zur Berechnung der Kreiszahl $\pi$ auf Basis der sinus Funktion vor. Es sei $P\in \mathbb{N}$. Wir definieren die Funktion: \[ S\left(x\right) =x+\sum_{k=1}^{P}\left(\prod_{\ell=1}^{k-1}\frac {2\,\ell-1}{2\,\ell}\right)\frac{\sin\left(x\right)^{2\,k-1}}{2\,k-1}\;. \] Für jeden Startwert $x_0$ hinreichend nahe bei $\pi$ konvergiert die Folge \[x_{n+1}=x_n+S\left(x_{n}\right)\;;\,n=0,1,\ldots\] gegen $\pi$ mit Konvergenzordnung genau $\left(2\,P+1\right)$. Anhand von praktischen Berechnungen zeigen wir die Effizienz des Verfahrens. \[\text{Deutsche Version ab Seite 19}\]
Read the full abstract ▾
Numerical Analysis
Semi-explicit time discretization for linear thermo-poroelasticity
R. Altmann, R. Maier and J. Schmeck
Within this paper, we introduce partially and fully decoupled time stepping schemes for linear thermo-poroelasticity. This means that the mechanics, heat, and flow equations can be solved sequentially. We provide sufficient conditions on the material parameters, which can be checked a priori, guaranteeing first-order convergence of the introduced schemes. Hence, the proposed methods have the same order as the implicit Euler scheme but are computationally more efficient due to the decoupling of the system equations. Numerical examples validate the proven convergence results and analyze the sharpness of the mentioned parameter condition. Further, we compare the schemes with other decoupling schemes from the literature.
Read the full abstract ▾
Rings and Algebras
Core EP, Dual Core EP and Composite Generalized Inverses for a Class of Structured Matrices
Faustino Maciala, C. Mendes Araújo and Pedro Patrício
We study generalized inverses for
matrices associated with double
star digraphs. Explicit block formulas and existence criteria are obtained for core, dual core, core EP, and dual core EP inverses, expressed in terms of explicit algebraic criteria derived from the underlying block structure. Other combined outer pseudoinverses, combining Moore–Penrose and core-type inverses, are derived with existence criteria.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Finite path integrals on stochastic branched structures
Roukaya Dekhil, Clifford Ellgen and Bruno Klajn
In this paper, we present a statistical model of spacetime trajectories based on a finite collection of paths organized into a branched
manifold. For each configuration of the branched
manifold, we define a Shannon
entropy. Given the variational nature of both the action in physics and the
entropy in statistical mechanics, we explore the hypothesis that the classical action is proportional to this
entropy. Under this assumption, we derive a Wick-rotated version of the path integral that remains finite and exhibits both
quantum interference at the microscopic level and classical determinism at the macroscopic scale. In effect, this version of the path integral differs from the standard one because it assigns weights of non-uniform magnitude to different paths. The model suggests that wave function collapse can be interpreted as a consequence of
entropy maximization. Although still idealized, this framework provides a possible route toward unifying
quantum and classical descriptions within a common finite-
entropy structure.
Read the full abstract ▾
Metric Geometry
Convexity of Radial Mean Bodies via an Extension of Ball's Bodies
Dylan Langharst
In this work, we extend a classical
theorem of Keith Ball on integrals of log-concave functions along rays against the weight $r^{p-1}$ to the previously inaccessible regime $p\in (-1,0)$: if $g:\mathbb R^n\to\mathbb R_+$ is an integrable, upper semi-continuous, log-concave function which attains its maximum at the origin and has the origin in the interior of its support, then \[ x\mapsto \left(\frac{p}{g(o)}\int_{0}^{\infty}r^{p-1}(g(rx)-g(o))\mathrm{d}\,r\right)^{-\frac{1}{p}} \] is a gauge on $\mathbb{R}^n$. Our approach also provides a new proof of the original regime $p> 0$. The argument is based on a reduction to a two-dimensional inequality derived from Prékopa's
theorem, which may be of independent interest. As a consequence of this extension, we resolve a nearly 30-year-old question of Richard Gardner and Gaoyong Zhang in the affirmative. In 1998, R. Gardner and G. Zhang introduced the radial $p$th mean bodies $R_p K$ of a convex body $K\subset \mathbb{R}^n$ for $p>-1$. Furthermore, they established that $R_p K$ is convex for $p\geq 0$, but the convexity of $R_p K$ for $p\in (-1,0)$ remained open. We prove that $R_p K$ is convex for all $p>-1$.
Read the full abstract ▾
Mathematical Physics
Spectral Analysis of a Quantum Waveguide with Elliptical Window
H. Najar and F. Chogle
We investigate the Dirichlet
Laplacian in two spatial waveguides coupled through an
elliptic window. The
elliptic geometry breaks rotational
symmetry and introduces anisotropy through the semi-axes of the aperture, which modifies the coupling of transverse modes and the low-lying spectrum. We prove that the operator has a finite number of discrete
eigenvalues below the threshold of the essential spectrum and study their dependence on the
geometric parameters of the ellipse. In contrast to the circular case, the
elliptic setting gives rise to spectral effects such as
eigenvalue splitting. Numerical simulations illustrate the variation of the first
eigenvalues and the ground state with the window geometry.
Read the full abstract ▾
Metric Geometry
Minimizers of the Maximum Distance Problem via an Analyst's Traveling Salesperson Algorithm
Enrique Alvarado, Silvia Ghinassi and Lisa Naples
We provide an upper and lower bound for the length of Maximum Distance Problem minimizers in terms of a finite scale
geometric square sum.
Number Theory
On some results of Korobov and Larcher and Zaremba's conjecture
Ilya D. Shkredov
We prove, in particular, the well–known Zaremba
conjecture from the theory of continued fractions for any
prime denominator. More precisely, we show, firstly, that under some mild conditions, for any sufficiently large $q$, there exists $a$ coprime to $q$ such that all partial quotients of $a/q$ are bounded by $O(\sqrt{\log q})$, and, moreover we find asymptotically tight lower bound for the number of such $a$. Secondly, we obtain a good lower bound for the number $a$ such that the sum of all partial quotients of $a/q$ is bounded by $O(\log q \cdot \sqrt{\log \log q})$. This, accordingly, improves on some results of Korobov and Larcher. Finally, we show that for all sufficiently large $\mathcal{M}$ there are $\Omega(q^{1-O(1/\mathcal{M})})$ numbers $a$ coprime to $q$ such that all partial quotients of $a/q$ are bounded by $\mathcal{M}$.
Read the full abstract ▾
Optimization and Control
Chaos-Free Networks are Stable Recurrent Neural Networks
Stefano De Carli, Davide Previtali, Mirko Mazzoleni et al. (+1 more)
Gated Recurrent Neural Networks (RNNs) are widely used for nonlinear system identification due to their high accuracy, although they often exhibit complex, chaotic dynamics that are difficult to analyze. This paper investigates the system-theoretic properties of the Chaos-Free Network (CFN), an architecture originally proposed to eliminate the chaotic behavior found in standard gated RNNs. First, we formally prove that the CFN satisfies Input-to-State Stability (ISS) by design. However, we demonstrate that the CFN architecture does not intrinsically guarantee Incremental ISS (delta-ISS), as ensuring this property relies on specific parametric constraints. To address this, we introduce the Decoupled-Gate Network (DGN), a novel structural variant of the CFN that removes internal state connections in the gating mechanisms. Finally, we prove that the DGN unconditionally satisfies the delta-ISS property, providing an incrementally stable architecture for identifying nonlinear dynamical systems without requiring complex network training modifications. Numerical results confirm that the DGN maintains the modeling capabilities of standard architectures while adhering to these rigorous stability guarantees.
Read the full abstract ▾
All authors Stefano De Carli, Davide Previtali, Mirko Mazzoleni, Fabio Previdi
Mathematical Physics · Cross-listed from cond-mat.mtrl-sci
Vacuum Wannier Functions for First-Principles Scattering and Photoemission
Tyler Wu and Tomás Arias
We establish a first-principles theory of
vacuum Wannier functions unifying tight-binding and nearly-free-electron descriptions across solid-
vacuum interfaces. Analytic solutions for canonical Wannier functions in arbitrary dimension and disentangled functions in 1D motivate a numerically verified 3D Wannier close-packing principle, enabling dense k-space construction of full Born-series scattering states at interfaces and thus predictive photoemission calculations without semiempirical
vacuum potentials. Applications to
graphene and h-BN reveal corrections beyond the first-Born approximation.
Read the full abstract ▾
Statistics Theory · Cross-listed from cs.MS
Scorio.jl: A Julia package for ranking stochastic responses
Mohsen Hariri, Michael Hinczewski and Vipin Chaudhary
Scorio.jl is a Julia package for evaluating and ranking systems from repeated responses to shared tasks. It provides a common tensor-based interface for direct score-based, pairwise, psychometric, voting, graph, and listwise methods, so the same
benchmark can be analyzed under multiple ranking assumptions. We describe the package design, position it relative to existing Julia tools, and report pilot experiments on synthetic rank recovery, stability under limited trials, and runtime scaling.
Read the full abstract ▾
Numerical Analysis
Tensorial Reduced-Order Models for Parametric Coupled Reaction-Diffusion Systems: Application to Brain Tumor Growth Modeling
Asikul Islam, Md Rezwan Bin Mizan, Maxim Olshanskii et al. (+1 more)
We construct efficient surrogate models for parametric forward operators arising in
brain tumor growth simulations, governed by coupled semilinear
parabolic reaction-
diffusion systems on heterogeneous two- and three-dimensional domains. We consider two models of increasing complexity: a scalar single-species formulation and a six-state, nine-parameter multi-species go-or-grow model. The governing equations are discretized using a finite volume method and integrated in time via an operator-splitting strategy. We develop tensorial reduced-order model (TROM) surrogates based on the Higher-Order Singular Value Decomposition in Tucker format and the Tensor Train decomposition, each in intrusive and non-intrusive variants. The models are compared against a classical proper orthogonal decomposition (POD) ROM baseline. Numerical experiments with up to $m=9$ model parameters demonstrate speedups of $85\times$-$120\times$ relative to the full-order solver while maintaining excellent accuracy, establishing tensorial surrogates as a rigorous and efficient computational foundation for many-query workflows.
Read the full abstract ▾
All authors Asikul Islam, Md Rezwan Bin Mizan, Maxim Olshanskii, Andreas Mang
Analysis of PDEs
On the Hausdorff dimension and singularities of the monopolist's free boundary curve
Robert J. McCann, Lucas D. O'Brien and Cale Rankin
The simplest genuinely multidimensional monopolist's problem involves minimizing a linearly perturbed Dirichlet energy among nonnegative convex functions $u$ on an open domain $X \subset [0, \infty)^2$. The geometry of the region of strict convexity $\Omega\subset X$ for the unique minimizer $u$ is of central interest. A relatively closed portion $X_1^0 \subset X$ of the domain is comprised of line segments starting and ending on $\partial X$ along which $u$ is affine. For convex polygons and potentially all domains $X \subset \mathbf{R}^2$, we build on results with Zhang to show that outside $X_1^0 \cup \{u=0\}$, the free boundary of $\Omega$ is a continuous curve of Hausdorff dimension one, and that $\Omega$ has density $1/2$ along it (and is $C^\alpha_{\mathrm{loc}}$ for all $0<\alpha<1$), except perhaps at a discrete set of singular points. We do this by showing that much of the free boundary solves an obstacle problem whose endogenous obstacle is $C^2$. From a slightly stronger conclusion, we deduce the free boundary becomes locally $C^\infty$ outside a closed set whose relative interior is empty. In response to the circulation of the present manuscript, we received a concurrent but independent work of Chen, Figalli and Zhang who verify a strengthening sufficient for this partial regularity result; (they show in particular that $\alpha=1$ and the discrete set mentioned above is empty).
Read the full abstract ▾
Dynamical Systems
Hierarchical Expansion of Finite Discrete Dynamical Systems: A Non-Archimedean Variational Theory over Coordinate Orderings
J. Rogelio Pérez-Buendía and Víctor Nopal-Coello
A finite dynamical system on $\mathbb{F}_p^N$ has a functional graph and combinatorial basins, but nothing on which to run the local analysis a multiplier makes possible. We supply one. Orderings encode configurations as residue classes in $\mathbb{Z}_p$, and an exact rational interpreter over $\mathbb{C}_p$ carries each ball onto its image ball. Rational approximants send, resolution by resolution, every ball onto one of prescribed radius and center. A half-integer pole sphere, with no Archimedean counterpart, settles the expanding case. The prescribed radii are the missing multipliers. They sort balls into contracting, expanding or isometric, giving each configuration a word over three letters, one per scale. Fixed configurations all satisfy $f(a)=a$, yet their words refine them into scale-resolved classes. Contracting balls containing their images trap unique attracting fixed points of the approximant, expanding balls inside their images unique repelling ones. The counts become scores $(\mu_E,\mu_A,\mu_I)$, Haar integrals over $\mathbb{Z}_p$, and minimizing $\mu_E$ over orderings is the finite variational principle. The first score vanishes exactly on Anashin's $p$-adic automata, grading departures by resolution, while the ceiling $(N-1)p^N$ at every ordering isolates the $28$ outer-permutive rules among elementary cellular automata on rings of $N\ge5$
cells. The transition table and ordering determine radii, letters and scores. On a thirteen-gene Boolean network we certify the minimizer over all $13!$ orderings, whose hierarchy separates the ten fixed states by type.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ML
Maximin Robust Bayesian Experimental Design
Hany Abdulsamad, Sahel Iqbal, Christian A. Naesseth et al. (+2 more)
We address the brittleness of
Bayesian experimental design under model misspecification by formulating the problem as a max–min game between the experimenter and an
adversarial nature subject to information-theoretic constraints. We demonstrate that this approach yields a robust objective governed by Sibson's $\alpha$-mutual information~(MI), which identifies the $\alpha$-tilted posterior as the robust belief update and establishes the Rényi divergence as the appropriate measure of conditional information gain. To mitigate the bias and variance of nested Monte Carlo
estimators needed to estimate Sibson's $\alpha$-MI, we adopt a PAC-Bayes framework to search over
stochastic design policies, yielding rigorous high-probability lower bounds on the robust expected information gain that explicitly control finite-sample error.
Read the full abstract ▾
All authors Hany Abdulsamad, Sahel Iqbal, Christian A. Naesseth, Takuo Matsubara, Adrien Corenflos
Analysis of PDEs
Sheets of Spectral Data of Stokes Waves in Weakly Nonlinear Models
Benjamin Akers and Ryan P. Creedon
We study the spectral stability of small-amplitude Stokes waves in a family of weakly nonlinear, unidirectional models of the form $u_t + L u + (u^2)_x = 0$. We introduce a perturbation method to expand the spectral data in wave amplitude near flat-state
eigenvalue collisions, with the ratio of the colliding modes as a free parameter. This yields sheets of spectral data whose slices at fixed amplitude give isolas of instability. The same perturbation framework treats both high-frequency and Benjamin–Feir instabilities, extends to discontinuous dispersion relations (including the Akers–Milewski equation), and, for the first time, provides an analytic approximation of the Benjamin–Feir spectrum for this model and a direct comparison of high-frequency and Benjamin–Feir growth rates across the full family of models. Asymptotic predictions are validated against numerical spectra computed by Floquet–
Fourier–Hill and quasi-Newton methods.
Read the full abstract ▾
Numerical Analysis
A layer stripping method for numerical solution of the GPR problem in a layered medium
Ruben Airapetyan
A numerical method for processing the data of ground penetrating radars for a piece-wise continuous layered medium is proposed. The method combines the layer stripping technique with numerical continuation of data into the complex frequency's domain. The accuracy of the method is analyzed. Error estimates are obtained and numerical testing is performed. They demonstrate numerical efficiency of the method under certain assumptions such as: electrical characteristics inside each layer change slowly, the thicknesses of the layers are at least of the order of the wavelength, conductivity of the medium is not high.
Read the full abstract ▾
Mathematical Physics · Cross-listed from hep-th
Spectral Geometry and the One-Loop QED $\beta$-Function on $S^3 \times S^1$
Lyudmil Antonov
We compute the one-loop QED $\beta$-function coefficient directly from heat kernel data of the twisted
Spin$^c$ Dirac operator on $S^3 \times S^1$. Using $\zeta$-function regularization, the logarithmic scale dependence is encoded in the $a_4$ coefficient of the spectral expansion. The $F_{\mu\nu} F^{\mu\nu}$ term in $a_4$ yields exactly $\beta(e) = e^3/(12\pi^2)$, independent of $r$, $L$, or background, verifying spectral RG flow without flat-space propagators. The result is independent of the radii of $S^3$ and $S^1$ and of the choice of gauge background, providing a parameter-free consistency check that spectral data on compact
manifolds encode renormalization group information. Beyond a mere verification of the coupling flow, this result serves as a non-trivial consistency check of the Spectral Action Principle in a curved background. It demonstrates that universal
quantum corrections can be extracted purely from
geometric spectral invariants, distinguishing this
geometric spectral derivation from momentum-space propagator methods.
Read the full abstract ▾
Commutative Algebra
An analogue of Rogers' theorem on sieving in commutative rings
Petr Kucheriaviy
We prove that an analogue of Rogers'
theorem on sieving holds for an order if and only if the order is a Dedekind domain. We also prove that it holds for a finite commutative ring if and only if the ring is a direct product of local rings with linearly ordered ideals.
Combinatorics
Lights Out! A game of combinatorics and linear algebra
Cassio Vieira Morais and Tiane Marcarini
In this work, we study a triangular variant of the Lights Out game, proposed in the 2025 Capixaba Mathematics Olympiad. We present a combinatorial description of the game, formally characterize its operations, and introduce the notion of a quiet pattern, which determines which configurations admit a solution and how many solutions they possess. We then analyze the geometry of quiet patterns and describe the propagation mechanisms that generate patterns for larger board sizes. Finally, we model the problem using linear systems over the field Z2, obtaining a
matrix associated with the game and a combinatorial criterion for its invertibility. This criterion shows that the game admits a solution for every configuration if and only if the number of coverings of the triangular board by 1 x 1 and 2 x 1 tiles is odd.
Read the full abstract ▾
Combinatorics
Induced paths and cycles in factor graphs of split graphs
Victor N. Schvöllner and Adrián Pastine
Let $S$ be a split graph with bipartition $(K,I)$ and let $\Phi(S)$ be the factor graph associated with $S$, a multigraph on $I$ whose encodes the combinatorial information about 2-switch transformations in $S$. We study induced paths and cycles in $\Phi(S)$ and show that they impose strong structural restrictions on the neighborhoods in $S$ of the corresponding vertices. In particular, induced paths generate chains of neighborhood inclusions which force a monotone behavior of the degrees (in $S$) of their vertices along the path. As a consequence, we prove that induced cycles in $\Phi(S)$ have length $\leq 4$. Finally, we show that in any induced path only the first or the last edge can be simple, which yields an upper bound for the diameter of $\Phi(S)$ in terms of the 2-switch-degree of $S$.
Read the full abstract ▾
Differential Geometry
Renormalized Area of Hypersurfaces in Hyperbolic Spaces
Alvaro Pampano
We employ Chen's conformal invariant quantity [8,
Theorem 1] in combination with the Chern-Gauss-Bonnet formulas to obtain expressions for the renormalized area of asymptotically minimal hypersurfaces in the $(2n+1)$-dimensional
hyperbolic space $\mathbb{H}^{2n+1}$, $n=1,2$. Our results extend Alexakis and Mazzeo's formula for the renormalized area for surfaces in $\mathbb{H}^3$ [1, Proposition 3.1] as well as their relation between the renormalized area of minimal surfaces of $\mathbb{H}^3$ and the Willmore energy of their doubles in $\mathbb{R}^3$ [1, Proposition 8.1] to the non-minimal case and to the higher dimensional case $n=2$. Moreover, we also generalize our results by considering hypersurfaces in $(2n+1)$-dimensional Poincaré-Einstein spaces and even-dimensional submanifolds of arbitrary codimension.
Read the full abstract ▾
Optimization and Control
Schrödinger Bridge Over A Compact Connected Lie Group
Hamza Mahmood, Abhishek Halder and Adeel Akhtar
This work studies the Schrödinger bridge problem for the kinematic equation on a compact connected Lie group. The objective is to steer a controlled
diffusion between given initial and terminal densities supported over the Lie group while minimizing the control effort. We develop a coordinate-free formulation of this
stochastic optimal control problem that respects the underlying
geometric structure of the Lie group, thereby avoiding limitations associated with local parameterizations or
embeddings in Euclidean spaces. We establish the existence and uniqueness of solution to the corresponding Schrödinger system. Our results are constructive in that they derive a
geometric controller that optimally interpolates probability densities supported over the Lie group. To illustrate the results, we provide numerical examples on $\mathsf{SO}(2)$ and $\mathsf{SO}(3)$. The codes and animations are publicly available at https://github.com/gradslab/SbpLieGroups.git .
Read the full abstract ▾