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)

Saturday 4 April

Geometric Topology

The Conway polynomials and Self Delta-equivalence of pretzel links

In this paper, we study the self delta-equivalence of pretzel links. If the number of components is 2, then we know the complete invariants in terms of the Conway polynomial for classification. We calculate the values. For pretzel links with more than or equal to 3 components, we give a necessary and sufficient condition to be self delta-equivalent.
Read the full abstract

Functional Analysis

A characterization of Banach spaces with numerical index one

We investigate the extremal properties of the unit ball of $L(X)_w^*$, the dual space of bounded linear operators defined on a Banach space $X$ equipped with the numerical radius norm. As an application of the present study, we obtain a geometric characterization of Banach spaces with numerical index one, which extends the well-known McGregor's characterization of finite-dimensional Banach spaces with numerical index one. We also present refinements of several earlier results in this direction, including an explicit description of the extreme points of $B_{L(X)_w^*}$, the unit ball of $L(X)_w^*$, for any finite-dimensional Banach space $X$. This allows us to obtain an independent and elementary proof of McGregor's characterization of finite-dimensional Banach spaces with numerical index one.
Read the full abstract

Analysis of PDEs

A boundary integral approach to the eigenvalue problem for the anisotropic bidomain operator with perfect contact conditions

In this work, we study the eigenvalue problem associated with the bidomain operator in an anisotropic heterogeneous domain composed of three subregions representing the left ventricle, the septum, and the right ventricle. The anisotropic conductivity, together with the different orientations of the fiber directions in each subdomain, leads to an elliptic boundary value problem with discontinuous coefficients and transmission conditions across the interfaces. Our main contribution consists in reformulating this problem using potential theory. By expressing the solution in terms of single- and double-layer potentials, we reduce the original boundary value problem to a system of Fredholm-type boundary integral equations. We derive explicit expressions for the fundamental solution of the associated anisotropic Helmholtz operator, as well as for the corresponding kernels, which are given in terms of Bessel functions. Finally, we propose a numerical scheme for approximating the eigenvalues of the bidomain operator based on the discretization of the resulting integral system. This approach provides an efficient framework for the analysis of anisotropic boundary value problems with interface conditions.
Read the full abstract

Classical Analysis and ODEs

Separating zeros of polynomials using an added interlacing point

Following a systematic analysis of existing results, we investigate when complete interlacing between the zeros of distinct polynomial sequences, $\{\mathcal{P}_n\}$ and $\{\mathcal{G}_n\}$ can be achieved by using a naturally arising extra point. Specifically, we analyse several general mixed recurrence relations that ensure the $n+1$ zeros of the polynomial $(x-E)\mathcal{P}_n(x)$ interlace with the $k$ zeros of $\mathcal{G}_k$, where $k=n$ or $n+1$. In addition, we show that imposing specific conditions on the extra point $E$ yields full interlacing between the zeros of $\mathcal{P}_n$ and $\mathcal{G}_k$ for a suitable choice of $n$. The approach provides a consolidated framework broadly applicable to both orthogonal and non-orthogonal polynomials and we illustrate this with new interlacing results for zeros of Krawtchouk, Meixner, and Narayana polynomials. We also illustrate that this general approach can be used to recover and refine existing results regarding the complete interlacing of zeros for classical Jacobi and Laguerre polynomials.
Read the full abstract

Functional Analysis

Harnack parts for 5-by-5 truncated shift with numerical radius one

We provide a complete description of the Harnack part for normalized truncated shift of size five with numerical radius one. We prove that any operator in this Harnack component must assume one of two distinct forms: either it belongs to the unitary orbit of the shift, thereby preserving its norm, or it is a structured nilpotent matrix with a different norm. Using polynomial methods derived from the kernel conditions, we establish that any element is necessarily nilpotent with same order of the truncated shift. These results reveal that the Harnack equivalence class exhibits a significantly richer algebraic structure in dimension five than previously observed in lower-dimensional cases.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

Random matrix theory of integrability-to-chaos transition

The statistics of gaps between quantum energy levels is a hallmark criterion in quantum chaos and quantum integrability studies. The relevant distributions corresponding to exactly integrable vs. fully chaotic systems are universal and described by the Poisson vs. Wigner-Dyson curves. In the transitional regime between integrability and chaos, the distributions are much less universal and have not been understood quantitatively until now. We point out that the relevant statistics that controls these distributions is that of the matrix elements of the nonintegrable perturbation Hamiltonian in the energy eigenbasis of the unperturbed integrable system. With this insight, we formulate a simple random matrix ensemble that correctly reproduces the level spacing distributions in a variety of test systems. For the distribution of matrix elements appearing in our construction, we furthermore discover surprising universal features: across a variety of physical systems with diverse degrees of freedom, these distributions are dominated by simple power laws.
Read the full abstract

All authors Ben Craps, Marine De Clerck, Oleg Evnin, Maxim Pavlov

Operator Algebras

Some remarks on Reduced $C^*$-algebras of semigroup dynamical systems and product systems

We study the exactness of the reduced crossed product of a semigroup dynamical system and the reduced $C^{*}$-algebra of a product system. We show that for a semigroup dynamical system $(A, P,\alpha)$, under reasonable hypotheses (e.g., $P$ is abelian and finitely generated), the reduced crossed product $A \rtimes_{red} P$ is exact if and only if $A$ is exact. This strengthens our earlier result (\cite{Amir_Sundar-product-system}), where it was assumed that the action of $P$ on $A$ is by injective endomorphisms. We also compare the groupoid crossed product described in \cite{Amir_Sundar-product-system} and the Fell bundle constructed in \cite{Rennie_Sims} for a product system, and show that they are equivalent as Fell bundles.
Read the full abstract

Algebraic Geometry · Cross-listed from cs.CR

Explainable PQC: A Layered Interpretive Framework for Post-Quantum Cryptographic Security Assumptions

This paper studies how post-quantum cryptographic (PQC) security assumptions can be represented and communicated through a structured, layered framework that is useful for technical interpretation but does not replace formal cryptographic proofs. We propose “Explainable PQC,” an interdisciplinary framework connecting three layers: (1) a complexity-based interpretive model that distinguishes classical security, quantum security, and reduction-backed hardness, drawing on computational complexity classes as supporting language; (2) an exploratory mathematical investigation applying combinatorial Hodge theory and polyhedral geometry to study structural aspects of lattice hardness; and (3)~an empirical experimentation platform, implemented in Julia, for measuring the behavior of lattice basis reduction algorithms (LLL, BKZ) in low-dimensional settings. The motivating case study throughout the paper is lattice-based PQC, including ML-KEM (FIPS 203) and ML-DSA (FIPS 204). The contribution of this paper is conceptual and organizational: it defines a layered interpretive framework, clarifies its scope relative to formal cryptographic proofs and reduction-based security arguments, and identifies mathematical and implementation-level directions through which PQC security claims may be more transparently communicated. This paper does not claim new cryptographic hardness results, new attacks, or concrete security parameter estimates.
Read the full abstract

Statistics Theory · Cross-listed from econ.EM

Robust Priors in Nonlinear Panel Models with Individual and Time Effects

We develop likelihood-based bias reduction for nonlinear panel models with additive individual and time effects. In two-way panels, integrated-likelihood corrections are attractive but challenging because the required integration is high dimensional and standard Laplace approximations may fail when the parameter dimension grows with the sample size. We propose a target-centered full-exponential Laplace–cumulant expansion that exploits the sparse higher-order derivative structure implied by additive effects, delivering a tractable approximation with a negligible remainder under large-$N,T$ asymptotics. The expansion motivates robust priors that yield bias reduction for both common parameters and fixed effects. We provide implementations for binary, ordered, and multinomial response models with two-way effects. For average partial effects, we show that the remaining first-order bias has a simple variance form and can be removed by a closed-form adjustment. Monte Carlo experiments and an empirical illustration show substantial bias reduction with accurate inference.
Read the full abstract

All authors Zizhong Yan, Zhengyu Zhang, Mingli Chen, Jingrong Li, Iván Fernández-Val

Numerical Analysis

Optimal numerical integration for functions in fractional Gaussian Sobolev spaces

This paper investigates the numerical approximation of integrals for functions in fractional Gaussian Sobolev spaces $W^s_{p}(\mathbb{R}^d,\gamma)$ with dominating mixed smoothness defined via kernel related to the fractional Ornstein-Uhlenbeck operator. Building upon quadrature rules for fractional Sobolev spaces on the unit cube $[-\tfrac{1}{2}, \tfrac{1}{2}]^d$, we construct quadrature schemes on $\mathbb{R}^d$ that achieve the same rate of convergence. As a consequence, we establish the optimal asymptotic order of the integration error in the regime $1 < p < \infty$ and $s > \frac{1}{p}$, $s\not \in \mathbb{N}$. Furthermore, we show that the fractional Gaussian Sobolev spaces $W^s_{2}(\mathbb{R}^d,\gamma)$ coincide with Hermite spaces $\mathcal{H}^s(\mathbb{R}^d,\gamma)$ characterized by the weighted $\ell_2$-summability of their Fourier-Hermite coefficients. From this, we derive the optimal asymptotic order of the integration error for functions in these spaces for all $s > \frac{1}{2}$. We also establish the corresponding optimal asymptotic order for functions in fractional Gaussian Sobolev spaces $W^s_{p,G}(\mathbb{R}^d,\gamma)$ defined via the Gagliardo seminorm.
Read the full abstract

Optimization and Control

A Hybrid Algorithm for Monotone Variational Inequalities

Inspired by the adaptive Golden Ratio Algorithm (aGRAAL), we propose two new methods for solving monotone variational inequalities. We show that by selecting the momentum parameter beyond the golden ratio in aGRAAL, the convergence speed can be improved, which motivates us to study the switching between small and large momentum parameters to accelerate convergence. We validate the performance of our proposed algorithms on several classes of variational inequality problems studied in the machine learning and control literature, including Nash equilibrium seeking, composite minimization, Markov decision processes, and zero-sum games, and compare them to that of existing methods.
Read the full abstract

Algebraic Geometry

Rank jumps for Jacobians of Hyperelliptic curves on K3 surfaces

We study Mordell-Weil rank jumps on families of jacobians of a pencil of genus-2 curves on a K3 surface defined over a number field k. We exhibit a finite extension l/k over which the subset of fibers for which the rank jumps is infinite. Moreover, we describe further geometric conditions on the K3 surface under which the rank jumps on a non-thin set of fibers.
Read the full abstract

Classical Analysis and ODEs

Extension theorems for logarithmic Schrödinger and discrete Laplacian operators

In this paper we consider logarithmic operators in two different contexts: the adapted to (continuous) Schrödinger operators and the classical discrete setting. The Schrödinger operator $\mathcal L_V$ on $\mathbb R^d$ is defined as $\mathcal L_V=-\Delta+V$, where the potential $V$ is nonnegative and satisfies a reverse Hölder inequality and, as usual, $\Delta$ denotes the Euclidean Laplacian, while the discrete Laplacian $\Delta_d$ on $\mathbb Z$ is given by $(\Delta_df)(n)=f(n+1)-2f(n)+f(n-1)$, $n\in \mathbb Z$. Both logarithmic operators $\log \mathcal L_V$ and $\log (-\Delta_d)$ are nonlocal operators and we will define them through suitable extension problems. The extension problems for logarithmic operators are inspired by the one introduced by Caffarelli and Silvestre for the fractional Laplacian but, in this case, the logarithmic operators are obtained as the boundary values of the extension in a more involved way.
Read the full abstract

Information Theory · Cross-listed from cs.LG

Algebraic Diversity: Group-Theoretic Spectral Estimation from Single Observations

We establish that temporal averaging over multiple observations is the degenerate case of algebraic group action with the trivial group $G=\{e\}$. A General Replacement Theorem proves that a group-averaged estimator from one snapshot achieves equivalent subspace decomposition to multi-snapshot covariance estimation. The Trivial Group Embedding Theorem proves that the sample covariance is the accumulation of trivial-group estimates, with variance governed by a $(G,L)$ continuum as $1/(|G|\cdot L)$. The processing gain $10\log_{10}(M)$ dB equals the classical beamforming gain, establishing that this gain is a property of group order, not sensor count. The DFT, DCT, and KLT are unified as group-matched special cases. We conjecture a General Algebraic Averaging Theorem extending these results to arbitrary statistics, with variance governed by the effective group order $d_{\mathrm{eff}}$. Monte Carlo experiments on the first four sample moments across five group types confirm the conjecture to four-digit precision. The framework exploits the $structure$ of information (representation-theoretic symmetry of the data object) rather than the content, complementing Shannon's theory. Five applications are demonstrated: single-snapshot MUSIC, massive MIMO, single-pulse waveform classification, graph signal processing, and analysis of transformer LLMs. Techniques for blind group matching are described.
Read the full abstract

2604.03634 · 4 Apr · 41 pages, 14 figures. v3: Retracted six findings in Section 11, transformer application, due to error in spectral concentration metric. Corrected results deferred to separate publication. Remark added after Conjecture 23 on orbit-structure bias in psi criterion. v4: new result blind group matching; v5: updated metrics; v6: New Theorem 7 on MLE, added Nitzberg citation; v7:"group gain" update

Mathematical Physics

Perfect fluid equations with nonrelativistic conformal symmetry: Exact solutions

The group-theoretic approach is used to construct exact solutions to perfect fluid equations invariant under the Schrodinger group, or the l-conformal Galilei group, or the Lifshitz group. In each respective case, the velocity vector field looks similar to the Bjorken flow. It is shown that one can reach an arbitrarily high density (and hence pressure) for a short period of time by adjusting the value of l and other free parameters available.
Read the full abstract

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

On the instability of some upward propagating, exact, nonlinear mountain waves

Using the short-wavelength instability method, we investigate the linear instability of an exact solution describing upward-propagating mountain waves, derived in A.~Constantin, J. Phys. A: Math. Theor. (2023), for a dry and adiabatic compressible flow. Within this approach, the stability problem reduces to the analysis of a system of ordinary differential equations with periodic coefficients along the fluid trajectories, which we study by means of Floquet theory. We show that the Floquet multipliers are of the form $\{1,\mu,\mu^{-1}\}$, the multiplier $1$ being associated with the conservation of potential vorticity, so that stability is decided by a single discriminant, which coincides with that of a Hill equation. For neutral stratification the flow is unstable whenever the wave steepness exceeds the critical value $\frac{1}{3}$, while a weakly stable stratification lowers this threshold to $\frac{1}{3}-\frac{4}{9}\nu^2+O(\nu^4)$, $\nu$ being the ratio between the Brunt–Väisälä frequency and the orbital frequency of the air parcels. The instability is a subharmonic parametric resonance. Since the solution is given in Lagrangian coordinates, these results identify an unstable region in the upper part of the laminar layer, beneath the tropopause, where the wave is steepest.
Read the full abstract

Number Theory

On $u$-Multiple Zeta Values in Positive Characteristic

In this paper, we introduce the concepts of the $u$-bracket, finite multiple harmonic $u$-series, and $u$-multiple zeta values via the Carlitz module. These objects serve as function field counterparts to the classical theory of $q$-analogs. We prove that the "limits" of finite multiple harmonic $u$-series at Carlitz torsion points yield Thakur's multiple zeta values and finite multiple zeta values over $\mathbb{F}_r(\theta)$ from analytic and algebraic perspectives, respectively. This can be regarded as a positive characteristic analog of the results by Bachmann, Takeyama, and Tasaka [BTT18]. Furthermore, we investigate the properties of $u$-multiple zeta values and their expansions, obtaining a family of explicit relations among Thakur's multiple zeta values at both positive and non-positive indices.
Read the full abstract

Combinatorics

On digraphs determined by their singular values

Let $D$ be an digraph of order $n$ with adjacency matrix $A(D)$ and outdegree matrix $\Delta^+=\Delta^+(D)$. Then the Laplacian and signless Laplacian matrices of $D$ are respectively defined as $L(D)=\Delta^+-A(D)$ and $Q(D)=\Delta^++A(D)$. In this paper, we compute singular values and an exact formula for the trace norm of Laplacian matrices of the directed path $\overrightarrow{P_n}$, the directed cycle $\overrightarrow{C_n}$ and all orientations of a star. We show that for a bipartite digraph $D$, the matrices $L(D)$ and $Q(D)$ have same singular values and use this to compute the singular values and trace norm of signless Laplacian matrices. We study the problem of determination of digraphs by their singular values and prove the directed path $\overrightarrow{P_n}$, the directed cycle $\overrightarrow{C_n}$ and oriented star $\overrightarrow{S}_n(n-1,0)$ are determined by their Laplacian and signless Laplacian singular values but are not determined by their adjacency singular values.
Read the full abstract

Combinatorics

Solution of Erdős Problem 633

We classify triangles that can be tiled only into a square number of congruent triangles, settling Erdős Problem 633.

Optimization and Control · Cross-listed from eess.SY

Multi-Robot Multi-Queue Control via Exhaustive Assignment Actor-Critic Learning

We study online task allocation for multi-robot, multi-queue systems with asymmetric stochastic arrivals and switching delays. We formulate the problem in discrete time: each location can host at most one robot per slot, servicing a task consumes one slot, switching between locations incurs a one-slot travel delay, and arrivals at locations are independent Bernoulli processes with heterogeneous rates. Building on our previous structural result that optimal policies are of exhaustive type, we formulate a discounted-cost Markov decision process and develop an exhaustive-assignment actor-critic policy architecture that enforces exhaustive service by construction and learns only the next-queue allocation for idle robots. Unlike the exhaustive-serve-longest (ESL) queue rule, whose optimality is known only under symmetry, the proposed policy adapts to asymmetry in arrival rates. Across different server-location ratios, loads, and asymmetric arrival profiles, the proposed policy consistently achieves lower discounted holding cost and smaller mean queue length than the ESL baseline, while remaining near-optimal on instances where an optimal benchmark is available. These results show that structure-aware actor-critic methods provide an effective approach for real-time multi-robot scheduling.
Read the full abstract

All authors Mohammad Merati, H. M. Sabbir Ahmad, Wenchao Li, David Castañón

Analysis of PDEs

Well-posedness of linear elliptic equations with $L^d$-drifts under divergence-type conditions

We establish the well-posedness of linear elliptic equations with critical-order drifts in $L^d$ and positive zero-order coefficients in $L^1$ or $L^{\frac{2d}{d+2}}$, where classical methods are often too restrictive. Our approach relies on a divergence-free transformation and a structural condition on the drift vector field, which admits a decomposition into a regular component and another whose weak divergence belongs to $L^{\tilde{q}}$ for some $\tilde{q} > \frac{d}{2}$. This condition is essential for constructing a suitable weight function $\rho$ via the weak maximum principle and the Harnack inequality. Within this framework, we prove the existence and uniqueness of weak solutions, significantly relaxing the regularity assumptions on the zero-order coefficients in $L^{\frac{d}{2}}$.
Read the full abstract

Numerical Analysis

A Regularized Auxiliary Variable (RAV) Approach for Gradient Flows

In this paper, we propose a regularized auxiliary variable (RAV) approach and construct accurate and robust time-discrete schemes for a large class of gradient flows. By introducing an auxiliary variable $r=0$ and constructing an auxiliary equation that naturally fits into the energy relation, the numerical solution $r^{n+1}$ of the auxiliary variable is corrected at each time step to preserve consistency with the original system. The developed RAV scheme satisfies unconditional energy stability with respect to the original variables, and in certain cases the original energy law can be directly recovered. Furthermore, we obtain a uniform bound on the norm of the numerical solution, which allows us to establish the optimal error estimate in $L^\infty(0,T;H^2)$ for the second-order scheme without any restriction on the time step. We present ample numerical results, including comparisons with the scalar auxiliary variable (SAV) approach, to demonstrate the accuracy and effectiveness of the proposed RAV approach.
Read the full abstract

Analysis of PDEs

Recent developments on elliptic equations from composites

When inclusions in a composite are separated by a very small gap, high contrast between the inclusion and matrix properties can induce strong amplification of the underlying field inside the narrow region. Quantifying this field concentration phenomenon is important both for the theory of composite materials and for practical applications. This survey reviews substantial progress over the past three decades. In particular, we survey a set of elliptic equations and systems for which optimal estimates or sharp asymptotic characterizations have been obtained, and we highlight several interesting open questions.
Read the full abstract

Information Theory

Impure codes exceeding the pure bounds for quantum local recovery

Existing literature provides several bounds for quantum local recovery, which essentially consider the number of message qudits, the distance, the length, and the locality of the involved codes. We give a family of $J$-affine variety codes that result in impure CSS codes. These quantum codes exceed several of the above mentioned bounds that apply to pure quantum locally recoverable codes. We also discuss a connection between bounds on quantum local recovery and on weight-constrained stabilizer codes.
Read the full abstract

All authors Carlos Galindo, Fernando Hernando, Helena Martín-Cruz, Ryutaroh Matsumoto

Combinatorics

On Realizing Reconfiguration Graphs of Cliques

For a graph $H$ and an integer $k\ge 1$, the Token Sliding reconfiguration graph $\mathsf{TS}_k(H)$ and the Token Jumping reconfiguration graph $\mathsf{TJ}_k(H)$ have as vertices the $k$-cliques of $H$, with two vertices adjacent when one clique is obtained from the other by replacing one vertex with an adjacent non-member, and respectively by an arbitrary non-member. For a target graph $G$, we study the feasibility sets $\mathcal{K}^{\mathsf{TS}}(G)$ and $\mathcal{K}^{\mathsf{TJ}}(G)$, consisting of all integers $k$ for which $G$ is isomorphic to $\mathsf{TS}_k(H)$ and $\mathsf{TJ}_k(H)$, respectively, for some graph $H$. We determine the exact feasibility sets for complete graphs, paths, cycles, complete bipartite graphs, book graphs, friendship graphs, and their complements, and give complete classifications for all Johnson graphs.
Read the full abstract

Optimization and Control

Fréchet Regression on the Bures-Wasserstein Manifold

Fréchet regression, or conditional Barycenters, is a flexible framework for modeling relationships between covariates (usually Euclidean) and response variables on general metric spaces, e.g., probability distributions or positive definite matrices. However, in contrast to classical barycenter problems, computing conditional counterparts in many non-Euclidean spaces remains an open challenge, as they yield non-convex optimization problems with an affine structure. In this work, we study the existence and computation of conditional barycenters, specifically in the space of positive-definite matrices with the Bures-Wasserstein metric. We provide a sufficient condition for the existence of a minimizer of the conditional barycenter problem that characterizes the regression range of extrapolation. Moreover, we further characterize the optimization landscape, proving that under this condition, the objective is free of local maxima. Additionally, we develop a projection-free and provably correct algorithm for the approximate computation of first-order stationary points. Finally, we provide a stochastic reformulation that enables the use of off-the-shelf stochastic Riemannian optimization methods for large-scale setups. Numerical experiments validate the performance of the proposed methods on regression problems of real-world biological networks and on large-scale synthetic Diffusion Tensor Imaging problems.
Read the full abstract

Analysis of PDEs

Eigencone Constellations on Ranked Spheres

We introduce eigencone constellations, a hierarchical framework for embedding bounded-degree spatial graphs into concentric spherical shells and partitioning each shell into spectrally weighted, spherical star-shaped territories. Given a connected sparse spatial graph $G$ with a distinguished root vertex (the queen), we assign each vertex to a sphere whose radial position is determined by its graph distance from the queen, then tessellate each sphere into constellation territories whose solid angles are proportional to the spectral mass of the corresponding subgraph. Within each territory, nodes are packed by constrained repulsion, yielding local simplex structures. The resulting geometric representation provides a structural framework for measuring spectral distance between dynamic subgraph states. By combining this eigencone-derived metric with constraints on the domain-specific edit alphabet, we define a forward-only deterministic trajectory – the isomorphic walk – which converges graph edits efficiently. We define the notion of spherical star-shaped domains with geodesic visibility, establish their properties under spectral projection, and demonstrate the trajectory convergence on molecular contact graphs.
Read the full abstract

Probability

Degree-preserving conservative processes and a unified approach for their hydrodynamics

We investigate a broad class of large-scale one-dimensional interacting systems characterized by a single conservation law and satisfying the "degree-preserving property". Under mild and natural assumptions, we establish a unified framework for the analysis of both invariant measures and hydrodynamic limits. In particular, we prove that when the generator preserves the degree of polynomials of the state variables up to order two, the marginals of any product invariant measure must belong to a family of six specific distributions. This classification is shown to be consistent with a classical result on univariate natural exponential families due to C.N. Morris, which we apply here for the first time in the context of microscopic stochastic systems. As a consequence, we construct a new interacting particle system whose invariant measure is given by the generalized hyperbolic secant distribution. Furthermore, we prove that, despite the generality of the dynamics, the macroscopic behavior of all models in this class is governed by the classical heat equation, with a diffusion coefficient depending explicitly on the underlying microscopic interactions.
Read the full abstract

All authors Chiara Franceschini, Patrícia Gonçalves, Kohei Hayashi, Makiko Sasada

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

Relaxed magnetohydrodynamics with cross-field flow

The phase-space Lagrangian model of Dewar et al. (Phys. Plasmas 27, 062507, 2020) provides a framework for incorporating cross-field flow into relaxed equilibria while retaining ideal magnetohydrodynamics force balance. Here, we characterize the steady-state solution space and identify a solvability condition that couples the prescribed constrained flow to the geometry through the metric tensor. Using this condition, we construct equilibria in slab, cylindrical, and toroidal geometries. In toroidal geometry, the cross-field flow strongly correlates with magnetic-island structure: varying the rotation frequency modifies the dominant Fourier harmonic of the radial component of the magnetic field and can drive a transition from a primary (m = 1) island to secondary (m = 2) islands. In slab and cylindrical geometries, flow parameters weakly affect island width but strongly modify equilibrium profiles.
Read the full abstract

All authors Arash Tavassoli, Stuart R. Hudson, Zhisong Qu, Matthew Hole

Combinatorics

Real Reliability Roots of Simple Graphs are Dense

We prove that the closure of the real roots of all-terminal reliability polynomials is exactly $[-1,0] \cup \{1\}$, resolving a conjecture of Brown and McMullin and refining the corresponding density result for multigraphs due to Brown and Colbourn. The crux of the proof is demonstrating that real reliability roots of edge-substitution graphs $G[H]$, where $G$ ranges over connected multigraphs and $H$ ranges over complete graphs missing an edge, are dense.
Read the full abstract