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 22 April

Algebraic Topology

Equivariant formality and the cohomology of subgroups of right-angled Coxeter groups

We construct models for the classifying spaces of coabelian subgroups of right-angled Coxeter groups as homotopy orbit spaces of real moment-angle complexes, generalizing well-known models for the classifying space of a right-angled Coxeter group and its commutator subgroup. This identifies the cohomology of these groups with the Borel equivariant cohomology of elementary abelian $2$-group actions on cubical subcomplexes of a cube $[-1,1]^m$. We then characterize equivariant formality for these actions, leading to a simple graph-theoretic criterion for when the cohomology of a coabelian subgroup is free as a module over the cohomology of the quotient by the commutator subgroup of the right-angled Coxeter group.
Read the full abstract

Numerical Analysis

Bulk-surface coupled PDE with an open boundary

We study a bulk-surface coupled Laplace system involving an embedded open boundary. The problem is reformulated as an integro-differential equation using boundary integral representations, for which we establish existence and uniqueness of the solution. A Wiener-Hopf technique is employed to study the solution regularity and derive asymptotic expressions for the edge singularity. Building on these results, we develop a finite element method that incorporates the singularity structure and provide a rigorous error analysis. Numerical experiments confirm the theoretical convergence rates.
Read the full abstract

Analysis of PDEs

Magnetic uncertainty in variable geometry

In this paper, we study Hardy-type uncertainty principles and unique continuation properties for linear covariant Schrodinger equations with variable coefficients in the presence of bounded electric and magnetic potentials. Under suitable smallness assumptions on the leading coefficients, we prove that any solution exhibiting super-quadratic exponential decay at two distinct times must vanish identically. Under an additional structural assumption on the coefficient matrix $G$, we further establish a Hardy-type result at the quadratic exponential scale. We also obtain an analogous uniqueness result for the heat equation with variable-coefficient magnetic perturbations. Our results unify and extend previous works in two directions: they recover the constant-coefficient covariant case treated by Barcelo-Fanelli-Gutierrez-Ruiz-Vilela when $G=I$, and the variable-coefficient non-magnetic case considered by Federico-Li-Yu when $A=0$. The proofs combine logarithmic convexity arguments with Carleman estimates adapted to variable-coefficient covariant Schrödinger and parabolic flows. Although our approach follows the general strategy introduced by Escauriaza-Kenig-Ponce-Vega, substantial new difficulties arise from the interaction between the variable metric and the magnetic structure, which requires new weight functions and refined commutator estimates.
Read the full abstract

All authors Luca Fanelli, Yilin Song, Ying Wang, Jiqiang Zheng, Ruihan Zhou

Statistics Theory

The E-measure

We introduce the E-measure: a measure-like generalization of the E-value to a class of hypotheses. Unlike classical measures, E-measures are closed under infimums instead of addition. They arise from a compatibility axiom with logical implications, that there should be at least as much evidence against more specific hypotheses. We show that E-measures are the only non-dominated such objects, if the hypothesis class is closed under intersections. We propose to use the E-measure to present all the relevant evidence for a problem, where the relevance is captured by the choice of hypothesis class. We showcase this by applying the E-measure to decision making, inducing a hypothesis class from the uncertain consequences of decisions. This results in uniform E-consequence bounds on decisions, which nest high-probability loss bounds. Correcting for multiplicity, we consider 'familywise evidence' and 'false evidence rate' control, generalizing from errors and discoveries to continuous evidence. Remarkably, E-measures control these without multiplicity correction if the hypothesis class is intersection-closed. Moreover, we obtain a 'frequentist' notion of updating from E-prior to E-posterior. Abstracting the notion of a 'hypothesis', we advocate for using E-measures for any unknown quantity, leading to predictive E-measures.
Read the full abstract

Combinatorics

Computing the Exchange Number in Graphs with respect to Cycle Convexity

Given a graph $G$, a subset $S \subseteq V(G)$ is cycle convex, if for any vertex $v \in V(G) \setminus S$, the induced subgraph, $G[S \cup \{v\}]$ cannot form a cycle containing the vertex $v$. The exchange number of $G$, denoted by $e_{cc}(G)$ is the maximum cardinality of an $\textit{$E$-independent}$ set of $G$. This paper studies the computational complexity of determining the exchange number of graphs and provides exact values for some graph classes. Given a graph $G$ and a positive integer $k$, we show that deciding whether $e_{cc}(G) \geq k$ is NP-complete even if $G$ is a $K_5$-free graph. In contrast, we characterize all $n$-vertex graphs $G$ with exchange number $n-1$ and obtain closed formulas for chordal graphs $G$ whose blocks lie in a single chain, which leads to polynomial-time algorithms for computing $e_{cc}(G)$. We also establish a lower bound for the exchange number of the Cartesian product of general graphs and by using the results of Anand et al. \cite{bijo2}, we derive an explicit formula for the exchange number of strong and lexicographic graph products.
Read the full abstract

Geometric Topology

Twisted Alexander Polynomials and Fibered Classes in Ribbon Homology Cobordisms

Let $Y_-$ and $Y_+$ be two compact 3-manifolds with empty or toroidal boundary. A 4-dimensional ribbon homology cobordism is a homologically trivial cobordism built with 1-handles and 2-handles. In this note, following the work of Friedl and collaborators, we apply twisted Alexander polynomials to show that the fibered classes of $Y_+$ map to those of $Y_-$.
Read the full abstract

Combinatorics

Modularity, Extensions and Connectivity in Infinite Matroids

We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a complete theory of single-element extensions, a description of the relationship between quotients and projections, a proof that matroids for which every flat is modular must be finitary, and two new perspectives on the infinite matroid connectivity parameter \lambda. In most cases, existing theory for finite matroids either fails completely or does not extend in obvious ways, and as a result we develop multiple new techniques for reasoning about infinite matroids, including establishing well-behaved infinite analogues of nullity, local connectivity and skewness. We also point to an online repository containing formalized proofs of all our results using the lean4 proof assistant
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Path integral formulation of finite-dimensional quantum mechanics in discrete phase space

We develop a path integral representation for the dynamics of quantum systems with a finite-dimensional Hilbert space, formulated entirely within a discrete phase space. Starting from the discrete Wigner function on ${\mathbb{Z}_d} \times {\mathbb{Z}_d}$ ($d$ an odd prime) and the associated Weyl transform built from generalized displacement operators, we derive an exact kernel that propagates the discrete Wigner function in time and, by iterating its composition law through a short-time approximation, obtain a sum-over-paths expression weighted by a discrete phase-space action – the natural finite-dimensional counterpart of Marinov's functional. For Hamiltonians linear in the phase-space coordinates and at times strictly commensurate with the lattice, the fluctuation sum collapses to a deterministic shift, realizing the discrete analog of classical Hamiltonian flow. Applying the formalism to one and to two interacting qutrits ($d=3$), we show that the full entanglement dynamics – captured by a closed-form linear entropy valid for all times – requires the coherent contribution of all fluctuation sectors; the boundary-term (mean-field) sector alone fails to reproduce it. For a non-stabilizer Hamiltonian, where the short-time kernel is only approximate, the time-sliced path integral converges to the exact dynamics, including the dynamical generation of Wigner negativity. We discuss implications for the semiclassical simulation of many-body spin systems and for the characterization of non-classicality through Wigner negativity.
Read the full abstract

Operator Algebras

Finite Riesz products and Ornstein non-inequalities on quantum tori

We demonstrate a construction of products on the quantum torus $\mathbb{T}_\theta^2$ that generalises the usual construction of finite Riesz products on the commutative torus $\mathbb{T}^2$. We explain why the former constitutes a natural analogue of the latter in the non-commutative setting and, based on this construction, as well as on previous results by K. Kazaniecki and the second author, we prove a non-commutative version of an Ornstein non-inequality.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

General Relativity via differential forms – explorations in Plebanski's Formalism for GR

This thesis studies general relativity (GR) using chiral formulations, which take advantage of the decomposition of the four-dimensional Lorentz group into self-dual and anti-self-dual sectors. Within this framework, GR can be expressed using Plebanski's formulation, where the basic variables are triples of 2-forms rather than a metric, or alternatively through pure connection approaches. These viewpoints expose additional structure in Einstein's equations (EEs) and offer new analytical and numerical tools. Part I develops the geometric foundations using fibre bundles, where the 2-forms arise as soldering forms on an SO(3,C) bundle. Part II investigates the linearised form of EEs in the chiral setting, with particular attention to their gauge fixings. Part III extends this analysis to the nonlinear regime, and also examines the complex-geometric structure underlying black hole spacetimes. The final part turns to numerical relativity, exploring evolution schemes built from the chiral formulations and their associated gauge choices.
Read the full abstract

Numerical Analysis

A provably stable numerical method for the anisotropic diffusion equation in confined magnetic fields: Curvilinear coordinates and multi-block domains

We present a robust and accurate numerical method for the anisotropic diffusion equation in curvilinear coordinates. This study extends the recent work [Muir et al., Computer Physics Communications, 2025] for solving the anisotropic diffusion equation in magnetic fields from Cartesian meshes to to curvilinear coordinates and complex geometries. The method uses summation by parts with simultaneous approximation terms for computing the diffusion perpendicular to field lines. The diffusion along field lines is computed using a penalty approach, similar to a simultaneous approximation term, but applied across the volume. To extend the method to complex geometry we use a multi-block approach with piecewise smooth structured meshes. That is, the domain is split into sub-grids, with locally adjacent boundaries coupled weakly using penalties. We prove the semi-discrete stability for the curvilinear implementation by deriving discrete energy estimates. The approach is verified though a number of numerical tests, which demonstrate the convergence properties of the method in multi-domain approach. Finally, we present a qualitative result generated in complex geometry and magnetic field, which is generated by the Stepped Pressure Equilibrium Code.
Read the full abstract

All authors Dean Muir, Kenneth Duru, Stuart Hudson, Matthew Hole

Complex Variables

Stability under product and composition for uniform Carleman asymptotic expansions

We study the stability under point-wise product and under composition in Carleman classes of holomorphic functions, defined on sectors of the Riemann surface of the logarithm, and admitting a uniform asymptotic expansion with remainders controlled by a given sequence of positive real numbers $\mathbf{M}$. On the one hand, the well-known conditions of algebrability and Faà di Bruno, imposed on the sequence $\mathbf{M}$, ensure the desired stability with respect to each operation in both the Roumieu and the Beurling settings. On the other hand, these conditions turn out to be necessary for the corresponding stability in the Roumieu case as long as the existence of suitable characteristic functions, in a precise sense, is guaranteed within the class. The construction of such functions rests on classical results of B. Rodríguez-Salinas, and is given in detail. Our results are inspired by, and thoroughly generalize, several partial statements by G.~Auberson and G.~Mennessier for Gevrey classes of order 1.
Read the full abstract

All authors Javier Jiménez-Garrido, Ignacio Miguel-Cantero, Javier Sanz, Gerhard Schindl

Combinatorics

Majority C-coloring of graphs

Inspired by the majority colorings and C-colorings, we introduce and study the majority C-coloring of graphs. In such a vertex coloring, every vertex shares its color with at least half of its neighbors. The maximum number of colors that can be used in a majority C-coloring of a graph $G$ is called the majority C-chromatic number and denoted by $\mc(G)$. An upper bound on $\mc(G)$ is proved in terms of the order, minimum, and maximum degree. Its sharpness is demonstrated by several results over different graph classes. In particular, $\mc(P_n^k)= \mc(C_n^k)= \lfloor n/(k+1)\rfloor$ is true for the $k$-th power of a path and a cycle if $n \ge k+1$. Further, $\mc(G) = (n-d)/3$ holds if $G$ is a $(\mbox{claw}, K_4)$-free cubic graph and contains $d$ diamonds. %claw-free cubic graph on $n \ge 6$ vertices and contains $d$ diamonds. It is further shown that the majority C-chromatic number is not monotone under edge deletion. In fact, both the lower and upper bounds are sharp in the inequality chain $\mc(G)-2 \leq \mc(G-e) \leq \mc(G) +1$. The minimum and maximum number of edges in an $n$-vertex graph $G$ with $\mc(G)=k$ are determined for every $n$ and $k$. It is also pointed out that the classical chromatic number $\chi(G)$ and $\mc(G)$ are incomparable, and the difference $\mc(G)-\chi(G)$ can take any positive or negative integer. On the other hand, $\mc(G)+\chi(G) \leq n+1$ holds for every graph $G$ of order $n$. The decision problem of whether $\mc(G) \ge k$ holds is NP-complete for every fixed $k\ge 2$. In contrast, some sufficient conditions for $\mc(G) \ge 2$ are proved, and a linear-time algorithm is presented that determines $\mc(T)$ if $T$ is a tree.
Read the full abstract

All authors Csilla Bujtas, Magda Dettlaff, Hanna Furmanczyk, Aleksandra Laskowska

Numerical Analysis

Incremental SVD Compression for Nonlinear Oldroyd Equations with General Memory Kernels

We study mixed finite element/Crank–Nicolson discretizations of a nonlinear Oldroyd problem with general nonsingular and weakly singular memory kernels. Direct evaluation of the history term requires storing all previous velocity snapshots, which leads to $\mathcal{O}(mN)$ memory and $\mathcal{O}(mN^2)$ work over $N$ time steps, where $m$ denotes the number of spatial degrees of freedom. To reduce this burden, we compress the velocity history online by an incremental singular value decomposition and use the compressed representation in the discrete memory term. Under an approximate low-rank assumption of numerical rank $r$, the storage decreases to $\mathcal{O}((m+N)r)$, while the total history-evaluation work becomes $\mathcal{O}(mNr+rN^2)$. For nonsingular kernels, we derive a tolerance-dependent perturbation estimate showing that the baseline finite element accuracy is retained when the compression tolerance is sufficiently small. We also extend the approach to tempered weakly singular kernels via convolution quadrature. Numerical tests show near-indistinguishable solutions from the uncompressed scheme for the reported tolerances, together with substantial memory savings and reduced wall-clock time.
Read the full abstract

Representation Theory

Universal $2$-parameter $\mathcal{N}=2$ supersymmetric $\mathcal{W}_{\infty}$-algebra

The universal $2$-parameter vertex algebra $\mathcal{W}_{\infty}$ of type $\mathcal{W}(2,3,\dots)$ is a classifying object for vertex algebras of type $\mathcal{W}(2,3,\dots,N)$ for some $N$; under mild hypotheses, all such vertex algebras arise as quotients of $\mathcal{W}_{\infty}$. In 2017, Gaiotto and Rapčák introduced a family of such vertex algebras called $Y$-algebras, and conjectured that they fall into groups of three that are mutually isomorphic. This is a common generalization of both Feigin-Frenkel duality and the coset realization of principal $\mathcal{W}$-algebras in type $A$, and was proven in 2021 for the simple $Y$-algebras (i.e., one label is zero) by the first and third authors. In this paper, we extend this entire story to the $\mathcal{N}=2$ superconformal setting. First, we prove the 2013 conjecture of Gaberdiel and Candu that there exists a universal $2$-parameter vertex algebra $\mathcal{W}^{\mathcal{N}=2}_{\infty}$ which is an extension of the $\mathcal{N}=2$ superconformal algebra, and has four additional generators in weights $i, i + \frac{1}{2}, i + \frac{1}{2}, i+1$, for each integer $i > 1$. This admits many $1$-parameter quotients which we call $\mathcal{N}=2$ supersymmetric $Y$-algebras, and we prove the dualities among these algebras which were conjectured in 2018 by Prochazka and Rapčák. A special case is the coset realization of the principal $\mathcal{W}$-algebra $\mathcal{W}^k(\mathfrak{sl}_{n+1|n})$ which was conjectured in 1992 by Ito. As a corollary, we obtain the strong rationality of $\mathcal{W}_k(\mathfrak{sl}_{n+1|n})$ for $k = -1 + \frac{1}{n+a+1}$ for all positive integers $n,a$, and we describe its module category. This generalizes Adamović's 1999 result on $\mathcal{N}=2$ minimal models, which is the case $n=1$.
Read the full abstract

All authors Thomas Creutzig, Volodymyr Kovalchuk, Andrew R. Linshaw, Arim Song, Uhi Rinn Suh

Number Theory

Mellin transforms, transfinite diameter and rational approximations of integrals

We establish a higher-dimensional irrationality criterion for periods which are presented as Mellin integrals depending on many parameters. The criterion is stated as an upper bound on the multi-variate transfinite diameter of the image of the domain of integration under the Mellin arguments. Most of the paper is devoted to studying notions of transfinite diameter relative to very general multivariate Vandermonde matrices. As a proof of principle, we illustrate how this approach works with detailed computations in the case of a 5-parameter family of integrals for $\zeta(2)$ on $\mathcal{M}_{0,5}$, the moduli space of curves of genus 0 with 5 marked points. This yields a `higher-dimensional' proof of the irrationality of $\zeta(2)$, based on an upper bound for a certain kind of transfinite diameter associated to $\mathcal{M}_{0,5}$.
Read the full abstract

Dynamical Systems

Global Hopf bifurcation and symmetric periodic solutions in multi-agent systems with pseudoneutral memory

We study the emergence of symmetric oscillatory behavior in multi-agent systems where each agent incorporates distributed memory of past states and feedback from changes in its response over a finite time window. The latter admits a neutral-form presentation but reduces to a finite difference of delayed states. The closed-loop dynamics are therefore described by a system of nonlinear retarded functional differential equations with a high degree of symmetry, arising from a network of homogeneous agents. By reformulating the problem as a fixed point operator equation, we apply equivariant degree theory to establish rigorous conditions for unbounded global Hopf bifurcation from the consensus equilibrium. Our main results provide sufficient conditions for the local asymptotic stability of consensus and for the existence of unbounded global branches of non-constant periodic solutions with prescribed spatio-temporal symmetries. The question of whether such periodic solutions are stable (and therefore constitute periodic multiconsensus) is not resolved by the degree method; we address it in an illustrative example via numerical simulations. The example, which models eight coupled asset markets with chartist traders and fundamentalists, demonstrates how memory-driven instability can generate periodic boom-bust cycles across clusters of assets. The numerical example illustrates the predicted two-cluster pattern, and Floquet computations provide numerical evidence of local orbital asymptotic stability at sampled parameter values.
Read the full abstract

Numerical Analysis

CO$_2$ sequestration hybrid solver using isogeometric alternating-directions and collocation-based robust variational physics informed neural networks (IGA-ADS-CRVPINN)

This paper presents the hybrid solver for a $CO_2$ sequestration problem. The solver uses the IGA-ADS (IsoGeometric Analysis Alternating Directions solver) to compute the saturation scalar field update using the explicit method, and CRVPINN (Collocation-based Robust Variational Physics Informed Neural Networks solver) to compute the pressure scalar field. The study focuses on simulating the physical behavior of $CO_2$ in porous structures, excluding chemical reactions. The mathematical model is based on Darcy's Law. The CRVPINN is pretrained on the initial pressure configuration, and the time step pressure updates require only 100 iterations of the Adam method per time step. We compare our hybrid IGA-ADS solver, coupled with the CRVPINN method, with a baseline of the IGA-ADS solver coupled with the MUMPS direct solver. Our hybrid solver is over 3 times faster on a single computational node from the ARES cluster of ACK CYFRONET. Future work includes extensive testing, inverse problem solving, and potential application to $H_2$ storage problems.
Read the full abstract

All authors Askold Vilkha, Tomasz Służalec, Marcin Łoś, Maciej Paszyński

Commutative Algebra

On the regularity index of the minimum distance function in projective nested Cartesian codes

Let $X$ be a projective nested product of fields and let $\delta_X(d)$ be the minimum distance in degree $d\geq 1$ of the projective nested Cartesian code $C_X(d)$. The regularity index ${\rm reg}(\delta_X)$ of the minimum distance function $\delta_X$ is the minimum integer $d_0\geq 0$ such that $\delta_X(d)=1$ for $d\geq d_0$. We give a formula for ${\rm reg}(\delta_X)$ by determining an indicator function of least degree for each point of $X$ and using the fact that ${\rm reg}(\delta_X)$ is the ${\rm v}$-number of the vanishing ideal $I_X$ of $X$. Then we give an arithmetical criterion that characterizes when $X$ is Cayley–Bacharach.
Read the full abstract

Optimization and Control

Evaluation of Various Objective Functions for Optimal Reactive Power Flow Including Transformer Tap Changer Optimisation

Modern distribution grids with high penetration of renewable generation provide substantial flexibility through distributed reactive power sources and transformer tap changers. This high degree of freedom can be exploited for optimisation. However, choosing an objective function for optimisation is not trivial, e.~g. minimising grid losses may lead to overvoltages and minimising voltage deviations may lead to higher reactive power flows to neighbouring system operators. Thus, this paper deals with the design of an objective function for the centralised optimisation of distributed reactive power sources and transformer tap changers. Different objectives for characteristic network quantities are investigated for the optimisation and optimised in a combined manner and separately. The consequences of optimising conflicting target values are then analysed. For the optimisation, various grid usage cases of a 110 kV benchmark power grid from SimBench are examined. The investigated power grid is characterised by a high proportion of renewable energy plants. The optimisation is carried out in a data-driven, object-oriented manner using the interior point method with open source software. At the end of the paper, a meaningful optimisation function with combined weighted objectives is derived and the results are analysed.
Read the full abstract

Mathematical Physics · Cross-listed from physics.plasm-ph

An analytic formula for surface currents generating prescribed plasma equilibrium fields

Given a plasma domain $P\subset\mathbb{R}^3$, a plasma equilibrium field $B$ on $P$ and a coil winding surface $\Sigma$ surrounding $P$, we provide an analytic formula whose output is a surface current distribution $j$ on $\Sigma$ such that $\operatorname{BS}(j)+\operatorname{BS}(\operatorname{curl}(B))=B$ in $P$, i.e. the combination of the plasma current magnetic field and the surface current magnetic field exactly produce the full plasma equilibrium field. We use this new formula to provide a theoretical explanation of the empirical phenomenon that currents tend to attain their maximal strength at points which correspond to points of highest normal magnetic curvature on the plasma boundary. Some discussions regarding aspects of numerical approximations are also included.
Read the full abstract

Numerical Analysis

Heat Transfer Modeling in Enhanced Geothermal Energy: A Three-Temperature Approach for Solid, Injected, and Residing Fluids

Enhanced geothermal systems (EGS) involve strongly coupled, advection-dominated flow and heat transfer in fractured porous media. Conventional models typically assume local thermal equilibrium with a single effective fluid temperature or, at best, an averaged pore-fluid temperature, so the thermal evolution of injected cold fluid is only inferred indirectly. In this work, we develop a local thermal non-equilibrium (LTNE) model that explicitly resolves the temperature of injected fluid as it moves through the reservoir and exchanges heat with the hot rock and resident fluid. The key ingredient is a concentration variable that tracks the injected fluid and induces a three-way LTNE coupling among rock, resident-fluid, and injected-fluid temperatures. This framework distinguishes, at the continuum scale, how newly injected fluid parcels are heated by conductive and convective exchange, and predicts production-well temperatures without relying on bulk averages. To discretize the resulting nonlinear, advection-dominated system, we employ an enriched Galerkin (EG) finite element method for Darcy flow, temperature, and concentration, providing local mass conservation with relatively few degrees of freedom. We further design a flux-corrected transport (FCT) strategy for the EG concentration and temperature equations to enforce a discrete maximum principle and suppress nonphysical oscillations while preserving local conservation. Time integration uses an IMPES-type splitting combined with a strong-stability-preserving Runge–Kutta scheme. Numerical experiments for fractured EGS problems show that the proposed LTNE–EG–FCT framework captures injected-fluid heating paths and thermal breakthrough behavior not resolved by standard single-temperature or averaged LTNE models.
Read the full abstract

Combinatorics

Lifting Cubic Realizations of Weak Orders in Types A and B

We study cubic realizations of posets compatible with projection maps, meaning that the projection is represented by deletion of the last coordinate. For cylindrical projections, we introduce the pre-Reeb graph and the augmented pre-Reeb graph, which control compatible cubic lifts and compatible order-embedding cubic lifts, respectively. We apply this construction to the deletion towers in weak order of types A and B. The pre-Reeb graphs are the 1-skeleta of, respectively, cubes and certain zonotopes. In both cases, the augmented pre-Reeb graphs have reachability posets that are total orders, yielding combinatorial uniqueness of the compatible order-embedding cubic coordinates.
Read the full abstract

Information Theory

Wideband Direct Satellite Uplink Enabled by Pilot-less Sparse Superposition Codes

Direct satellite uplink is severely constrained by limited link budgets, which hinder the exploitation of wideband resources, and ultimately limit the throughout. This paper presents a pilot-less coded modulation scheme based on sparse superposition coding (SSC) to enable efficient wideband usage in coverage-limited scenarios. This scheme leverages the structured Zadoff-Chu quasi-orthogonal (ZC-QO) dictionary to support scalable transmission. To address decoding complexity, the SSC transmitted signal embeds root index information via indicator sequences, allowing the receiver to restrict the decoding search space. In addition, a multi-codeword transmission framework with repetition and stop-feedback is developed, enabling reliable communication and better resource utilization. Simulation results show that the proposed scheme achieves throughput gains compared to a more conventional narrow-band multi-dimensional constellation-based approach.
Read the full abstract

Combinatorics

Laplacian state transfer in graphs with involutions

For $q\in\mathbb{R}\backslash\{0\}$, the generalized Laplacian of a graph $X$ is the matrix $\mathscr{L}=\Delta+qA$, where $\Delta$ is the degree matrix and $A$ is the adjacency matrix of $X$. In this paper, we investigate perfect state transfer (PST) on graphs with possible loops equipped with non-trivial involutions, where we take the generalized Laplacian matrix as the Hamiltonian of the underlying spin network. We establish an equivalence between the existence of PST between certain pair (or plus states) in such a graph and PST between vertices in a subgraph induced by the involution. This allows us to prove that for almost all simple unweighted planar graphs (resp., almost all simple unweighted trees), the assignment of loops of weight one to exactly two vertices in the graph produces PST between pair states relative to $\mathscr{L}$. We also show that a path on $n$ vertices admits PST between end vertices relative to $\mathscr{L}$ if and only if $n =2$, or $(n,q)=(3,\frac{k^2-l^2}{8l^2})$ where $k>l$ are integers with $k \not\equiv l \pmod{2}$. For cycles, we show that the addition of an extra edge does not yield PST between vertices relative to Laplacian and signless Laplacian matrices. Furthermore, we show that the addition of a few suitable edges (including loops) in complete bipartite graphs, cycles, and paths yields PST between pair states.
Read the full abstract

Differential Geometry

On $q$-convex hypersurfaces in Riemannian manifolds

We prove that any closed, convex hypersurface in an $(n+1)$-dimensional Riemannian manifold with $\lceil \frac{n}{2} \rceil$-positive curvature operator is a rational homology sphere with finite fundamental group. The same conclusion holds for any $\lceil \frac{n}{2} \rceil$-convex hypersurface, provided that the mean curvature satisfies a sharp pinching condition. Both results follow from more general vanishing and estimation theorems for the Betti numbers of closed $q$-convex immersed hypersurfaces in $(n+1)$-dimensional Riemannian manifolds, under a lower bound on the average of the smallest $(n-p)$ eigenvalues of the curvature operator.
Read the full abstract

Probability

Uniqueness and Mixing in the Low-Temperature Random-Cluster Model on Trees and Random Graphs

We study the random-cluster model on trees and treelike graphs at low temperatures. This is a model of dependent percolation parametrized by an edge probability $p\in (0,1)$ and a clustering weight $q\in [1,\infty)$, generalizing independent Bernoulli percolation ($q=1$) and closely related to the classical ferromagnetic Ising and Potts spin systems at integer $q$. For $q>2$, approximately sampling from this model on graphs of degree at most $\Delta$ is computationally hard. At parameter $p$ below the tree uniqueness threshold $p_{\mathsf{u}}(q,\Delta)$, it is expected that sampling is easy and local Markov chains mix rapidly on all bounded degree graphs. On typical graphs (e.g., random regular graphs), the same is predicted at $p > p_{\mathsf{s}}(q,\Delta)$, where $p_{\mathsf{s}}(q,\Delta)$ is a second uniqueness transition point on the $\Delta$-regular wired tree. Our first result establishes this non-uniqueness/uniqueness phase transition at $p_{\mathsf{s}}(q,\Delta)$ for all $q$ on the infinite $\Delta$-regular wired tree, resolving a conjecture of Häggström (1996). For this, we establish weak spatial mixing at $p>p_{\mathsf{s}}(q,\Delta)$ under sufficiently wired boundary conditions. We use this understanding of decay of correlations to show that on the wired tree on $n$ vertices, whenever $q>1$ and $p>p_{\mathsf{s}}(q,\Delta)$, the mixing time of random-cluster Glauber dynamics is a near-optimal $n^{1+o(1)}$. We then extend these results on spatial and temporal mixing from the tree to treelike geometries with mostly wired boundaries and use them to show that the random-cluster Glauber dynamics mix rapidly on the random $\Delta$-regular graph for all $p>p_{\mathsf{s}}(q,\Delta)$ as long as $q \ge C \log \Delta$, providing an efficient sampling algorithm for both the random-cluster and Potts models in this context.
Read the full abstract

All authors Antonio Blanca, Reza Gheissari, Heehyun Park, Xusheng Zhang

Information Theory · Cross-listed from eess.IV

CKM Beyond Channel Gain: Spatial Correlation Map Construction with Deep Learning

Channel knowledge map (CKM) is a promising technique to achieve environment-aware wireless communication and sensing. Constructing the complete CKM based on channel knowledge observations at sparse locations is a fundamental problem for CKM-enabled wireless networks. However, most existing works on CKM construction only consider the special type of CKM, i.e., the channel gain map (CGM), which only records the channel gain value for each location. In this paper, we consider the channel spatial correlation map (SCM) construction, which signifies the location-specific spatial correlation matrix for multi-antenna systems. Unlike CGM construction, constructing SCM poses significant challenges due to its extremely high-dimensional structure. To address this issue, we first decompose the high-dimensional SCM into lower-dimensional path gain map (PGM) and path angle map (PAM). Then we propose a deep learning model termed E-SRResNet for constructing high-quality SCM from sparse samples, which incorporates multi-head attention (MHA) mechanisms and multi-scale feature fusion (MSFF) to accurately model both local and global spatial relationships of channel parameters and complex nonlinear mappings. Furthermore, we preprocess the dataset to provide priors including line-of-sight (LoS) map, binary building map and base station (BS) map for the model to reconstruct SCM more accurately. Simulations conducted on the CKMImageNet dataset demonstrate that the proposed E-SRResNet achieves significant performance improvements over baseline methods. Moreover, the cosine similarity between the constructed SCM and the ground truth exceeds 0.8 in most regions, validating the effectiveness of the proposed construction method.
Read the full abstract

All authors Z. Chen, S. Fu, Y. Zeng, X. Xu, Z. Wei

Dynamical Systems

CRITERIA: A network decomposition and elementary flux mode translation-based tool for computing equilibria of biochemical systems

Understanding how biochemical systems settle into stable states, such as how protein concentrations reach equilibrium, is central to explaining cellular behavior and designing synthetic biological circuits. However, existing analytical tools for computing these equilibria, such as COMPILES, are limited by computational bottlenecks and can only be applied to a restricted class of reaction networks. In this work, we introduce CRITERIA (Computing paRametrized posITive EquilibRIA), a new computational framework that makes equilibrium analysis more efficient and broadly applicable. CRITERIA uses a graph-based approach built on elementary flux modes to streamline key steps in the computation. It also changes how the problem is solved by combining subnetworks into a single system before computing equilibria, which avoids complicated symbolic calculations required in previous methods. We demonstrate the usefulness of CRITERIA by studying biologically important systems, including the EnvZ-OmpR signaling pathway and a synthetic CRISPRi circuit. Our approach enables faster and more scalable analysis, allowing researchers to better understand how complex biochemical networks behave over time.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Wall-crossing of Instantons on the Blow-up

We study the instanton counting in four dimensional $\mathcal{N}=2$ supersymmetric gauge theories on the blow-up of $\mathbb{C}^2$: we start by formulating the instanton moduli space as a quiver variety, which we regularise by introducing two stability parameters, thus endowing it with a structure of infinitely many chambers separated by walls. Within a given chamber, we formulate the instanton partition function as a contour integral, which can be evaluated using the Jeffrey-Kirwan residue prescription. We characterise the physically relevant contributions in terms of bipartite oriented graphs and show that they can more efficiently be classified in terms of combinatorial objects called super-partitions. Within a given chamber, only certain types of super-partitions contribute and we show that the corresponding selection criteria are equivalent to stability conditions that have previously been proposed in the literature. We use this formalism to compare how the instanton counting changes when moving across walls between neighbouring chambers and provide explicit expressions for the corresponding partition functions. In a limiting chamber and using our approach, we show how to reproduce the Nakajima-Yoshioka blow-up formula.
Read the full abstract