Mathematical Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 5 April
We prove an optimal upper bound for the density of electrons of an infinite Bohr atom (no electron-electron interactions) described by the relativistic operators of Chandrasekhar and Dirac. We also consider densities in each angular momentum channel separately.
Algebraic Geometry
Shifted symplectic rigidification
We construct shifted symplectic derived enhancements on rigidified moduli spaces of sheaves on Calabi-Yau varieties of dimension at least two. More generally, we prove that any $B\mathbb{G}_m$-action on a non-positively-shifted symplectic derived Artin stack is Hamiltonian. We provide a symplectic rigidification functor as the left adjoint to the trivial action functor in symplectic categories with Lagrangian correspondences. We also descend the Lagrangian correspondence of short exact sequences of sheaves to rigidified moduli spaces.
Read the full abstract
Group Theory
Tits Alternative in groups with proper product actions on proper Gromov-hyperbolic spaces
In this paper, we study groups with property (PPH), i.e., there exist finitely many proper Gromov-hyperbolic spaces $X_1,\ldots, X_l$ on which $G$ acts cocompactly such that the diagonal action of $G$ on the $\ell^1$-product $\prod_{i=1}^lX_i$ is proper. We show that any finitely generated subgroup of a finitely generated group with property (PPH) either is amenable or contains $F_2$. Furthermore, we study groups with property (PPT), i.e., groups with property (PPH) so that $X_1,\cdots,X_l$ are all proper quasi-trees. We show that any finitely generated subgroup of a finitely generated group with property (PPT) either is virtually (locally-finite)-by-$\mathbb{Z}^n$ or contains $F_2$. Additionally, we establish that for a non-elementary hyperbolic group \(G\), \(G\) admits a proper diagonal action on a finite product of regular trees if and only if \(G\) has property (PPT). This result transforms a question posed by Button \cite{But19} into the problem of whether every non-elementary hyperbolic group has property (PPT).
Read the full abstract
Combinatorics
Proof of Two Supercongruences of Guillera and Zudilin
In $2012$, Guillera and Zudilin established the following two supercongruences involving truncated Ramanujan-type series: for any odd prime $p>2$, \begin{align*} \sum_{n=0}^{p-1}\frac{(\frac{1}{2})_n(\frac{1}{3})_n(\frac{1}{4})_n(\frac{3}{4})_n}{(1)_n^5}(-1)^n\left(172n^2+75n+9\right)\left(\frac{27}{16}\right)^n\equiv 9p^2 \pmod{p^5}, \end{align*} and \begin{align*} \sum_{n=0}^{p-1}\frac{(\frac{1}{2})_n(\frac{1}{3})_n(\frac{2}{3})_n}{(1)_n^3}\left(11n+3\right)\left(\frac{27}{16}\right)^n\equiv 3p \pmod{p^3}, \end{align*} where $(a)_n=\prod_{k=0}^{n-1}(a+k)$ denotes the Pochhammer symbol (rising factorial). In this paper, we mainly apply the Wilf-Zeilberger (WZ) method and symbolic summation techniques to prove these two supercongruences.
Read the full abstract
Optimization and Control
A Periodic Dichotomy in Linear Control Theory
In this paper, we construct a periodic dichotomy transformation using solutions of periodic Riccati and Lyapunov equations. As an application of this transformation, we provide an explicit representation of the optimal extremal for periodic linear quadratic optimal control problems. Specifically, we establish a complete characterization of the optimal extremal under suitable exponential stabilizability and detectability assumptions.
Read the full abstract
Analysis of PDEs
Koch-Tataru theorem for 3D incompressible active nematic liquid crystals
We investigate the incompressible hydrodynamic system of the active nematic liquid crystals in the Beris-Edwards framework. Although we focus on constant activity in this paper, the simplified system derived from it exhibits the potential to perform computations and transmit information in active soft materials \cite{defect-active}. More precisely, by employing Kato's strategy for constructing mild solutions combined with the Banach contraction principle, we show the existence and uniqueness of the Koch-Tataru type solution in $\mathbb{R}^3$ for small initial data $(Q_0,u_0)\in L^\infty\times {\rm BMO}^{-1}$. This is the first well-posedness result for the system with initial data in critical space.
Read the full abstract
Information Theory
Characterization of FR3 Cellular Vehicle-to-Base Station Links in HighRise Urban Scenarios
Driven by the escalating demand for wireless capacity and advancements in 6G research, the new Frequency Range 3 (FR3) referred to upper mid-band (7.125-24.25 GHz) has emerged as a highly compelling spectrum candidate. This range offers a trade-off exploiting the high bandwidth capabilities of millimeter wave frequencies and the superior propagation characteristics of sub-6 GHz bands. As such, the upper mid-band presents an opportunity to enhance both coverage and capacity particularly in the context of 6G and Cellular Vehicle-to-Base Station (C-V2B). Crucially, realizing this potential requires overcoming technical challenges through accurate and realistic channel modeling, especially in dense, high-rise urban environments. To address this, we employ a ray-tracing tool to analyze downlink propagation characteristics, enabling detailed channel modeling for reliable C-V2B communication. Our analysis evaluates the signal-to-noise ratio (SNR) and signal-to-interference-plus-noise ratio (SINR) across sub-6 GHz, FR3, and mmWave bands using antenna array configurations designed for high-rise urban areas. Results show that, under equal aperture sizes across frequencies, FR3 achieves superior SNR compared to mmWave in interference-free conditions. Moreover, under the full-interference case, FR3 yields higher SINR for cell-edge User Equipment (UEs). This indicates that the increased array gain at mmWave cannot fully compensate for the severe path loss experienced by cell-edge UEs.
Read the full abstract
Information Theory
Structure of Polycyclic Codes over $\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle}$ and their Cardinalities
The purpose of this article is to study polycyclic codes over the ring $\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle}, \,t \geq 1$, and their associated torsion codes. It is shown that if $\phi$ is a surjective ring homomorphism from a commutative ring $A$ to a Noetherian ring $B$ with $ ker(\phi)=\langle \pi\rangle$ then for every ideal $I$ of $A$, there exists $a_1,a_2,\dots,a_n$ in $I$ such that $I=\langle a_1,a_2,\dots,a_n\rangle+\pi(I:\pi)$. Using this, we obtain generators of all ideals of the ring $\frac{\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle}[x]}{\langle \omega(x)\rangle},$ where $\omega(x)\in \frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle}[x] $. For the case when $\omega(x)=f(x)^{p^s}$ where $f(x)$ is an irreducible polynomial in $\mathbb{F}_{p^m}[x]$ and $s$ is a non-negative integer, we obtain several other results, including computation of torsion ideals and their torsional degrees when $t=4$. We use the torsional degree to compute the cardinality of polycyclic codes over the ring $\frac{\mathbb{F}_{p^m}[u]}{\langle u^4 \rangle}$ and illustrate the result with some examples that verify the computed cardinality.
Read the full abstract
Optimization and Control
Robust $\mathcal{H}_\infty$ Observer Design via Finsler's Lemma and IQCs
This paper develops a Finsler-based LMI for robust $\mathcal{H}_\infty$ observer design with integral quadratic constraints (IQCs) and block-structured uncertainty. By introducing a slack variable that relaxes the coupling between the Lyapunov matrix, the observer gain, and the IQC multiplier, the formulation addresses two limitations of the standard block-diagonal approach: the LMI requirement $\mathrm{He}(PA) \prec 0$ (which fails for marginally stable dynamics), and a multiplier–Lyapunov trade-off that causes infeasibility for wide uncertainty ranges. For marginally stable dynamics, artificial damping in the design model balances certified versus actual performance. The framework is demonstrated on quaternion attitude estimation with angular velocity uncertainty and mass-spring-damper state estimation with uncertain physical parameters.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.other
Modified Mosseri-Sadoc tiles from $D_6$
A modified set of Mosseri-Sadoc (MS) tiles tessellating 3D Euclidean space with icosahedral symmetry is introduced. The new set of tiles are embedded in dodecahedron with a threefold symmetric order. The modified Mosseri-Sadoc (MMS) tiles can be inflated by a new inflation matrix with positive eigenvalues $\tau^3$ and $\tau$ with the corresponding eigenvectors representing the volumes and the Dehn invariants of the tiles, respectively, where $\tau=\frac{1+\sqrt5}{2}$ is the golden ratio. The MMS tiles are obtained by projection of the 4D and 5D facets of the Delone cells tiling the $D_6$ root lattice in an alternating order. It is also proved that a subset of the lattice $D_6$ projects into the dodecahedron inflated by $\tau^n$ with an arbitrary integer $n$ and tiled by the MMS tiles.
Read the full abstract
Information Theory
Hemispherical Concentration Subset Recovery in Many-Access Gaussian Multiple-Access Channels
We consider subset recovery in the many-access Gaussian multiple-access channel with a shared spherical codebook, where codewords are drawn independently and uniformly from the hypersphere of radius \( \sqrt{nP} \), the number of active users scales linearly with the blocklength $n$ as \( K_a(n)=\beta n \) for a constant \( \beta > 0 \), and the codebook size is \( M_n=n^d \) with \( d>2 \). We identify a geometric property showing that, for \( 0<\beta<2 \), any transmitted \( K_a(n) \)-subset lies in a single hemisphere with high probability for sufficiently large $n$. We further show that reliable decoding is possible only for \( \beta < 1/4 \). The overlap between the reliable decoding range of \( \beta \) and the hemispherical concentration range motivates our approach of two-stage decoding procedure. In the pre-filtering stage, the decoder restricts attention to a sequence of spherical caps \( \{ \hat{\mathcal{H}}_n \} \) that converges in Hausdorff distance to the hemisphere $\hat{\mathcal{H}}$, whose axis is the normalized observation \( \hat{\mathbf{u}}=\mathbf{Y}/\|\mathbf{Y}\| \). In the second stage, maximum-likelihood decoding is performed over the reduced candidate set. We show that the per-user error probability of the pre-filtering stage vanishes as \( n\to\infty \). Moreover, the per-user error probability of the maximum-likelihood stage over the reduced search space decays exponentially with asymptotic exponent \( P/4 \).
Read the full abstract
Dynamical Systems
Finiteness of Bowen-Margulis-Sullivan Measure for Gromov-Patterson-Sullivan Systems
In this paper, we develop a notion of strongly positive reccurent (SPR) property for a convergence group with a continuous Gromov-Patterson-Sullivan (GPS) system defined by Blayac-Canary-Zhang-Zimmer. We prove that these SPR groups admits a finite Bowen-Margulis-Sullivan (BMS) measure on some associated flow spaces, which means that dynamically they admit a cocompact action on the flow spaces. This notion of SPR groups gives rise to many new examples of subgroups in higher rank Lie group that admit finite BMS measure beyond relatively Anosov groups.
Read the full abstract
Probability
Stationary Distributions in Monotone Markov Models: Theory and Applications
Many economic models feature monotone Markov dynamics on state spaces that may be noncompact. Establishing existence, uniqueness, and stability of stationary distributions in such settings has required a patchwork of sufficient conditions, each tailored to specific applications. We provide a single necessary and sufficient condition: a monotone Markov process has a globally stable stationary distribution if and only if it is asymptotically contractive and has a tight trajectory. This characterization covers both compact and noncompact state spaces, discrete and continuous time, and extends to nonlinear Markov operators that depend on aggregate state. We demonstrate the result through applications to wage dynamics, Bayesian learning with belief shocks, and income processes that generate Pareto tails.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Statistics of Matrix Elements of Operators in a Disorder-Free SYK model
Recently, studies have explored the statistics of matrix elements of local operators in the Lieb-Liniger model. It was found that the probability distribution function for off-diagonal matrix elements $\langle \boldsymbol{\mu}|\mathcal{O}|\boldsymbol{\lambda} \rangle$ within the same macro-state is well described by the Fréchet distributions. This represents a significant development for the Eigenstate Thermalization Hypothesis (ETH). In this paper, we investigate a similar phenomenon in another solvable model: the disorder-free Sachdev-Ye-Kitaev (SYK) model. The Hamiltonian of this model consists of 4-body interactions of Majorana fermions. Unlike the conventional SYK model, the coupling strengths in this model are fixed to a constant, earning it the name “disorder-free.” We evaluate the matrix elements of operators constructed from products of $n$ Majorana fermions: $\mathcal{O} = \chi_{a_1}\chi_{a_2}\ldots \chi_{a_n}$. For a general choice of indices and $n \geq 4$, we find that the statistics of the off-diagonal matrix elements are well-fitted by a generalized inverse Gaussian distribution rather than Fréchet distributions.
Read the full abstract
Combinatorics
Independent domination polynomial of comaximal graphs of commutative rings
The comaximal graph $ \Gamma(R) $ of a commutative ring $R$ is a simple graph with vertex set $ R $ and two distinct vertices $ a $ and $b $ of $ \Gamma(R) $ are adjacent if and only if $ aR+bR=R $, where $ aR $ is the ideal generated by $ a $ in $ R $. In this article, the independent domination polynomial $ D_{i}(\Gamma(\mathbb{Z}_{n}),x) $ of $ \Gamma(\mathbb{Z}_{n}) $ is discussed, along with its unimodal and log-concave properties for certain values of $n$. Some auxiliary results related to $D_{i}(\Gamma(\mathbb{Z}_{n}),x)$ are presented in terms of their zeros. In addition, we determine the independence polynomial $ I(\Gamma(\mathbb{Z}_{n}),x ) $ of $ \Gamma(\mathbb{Z}_{n}) $ for special values of $n$ and provide a general result associated with it. The bounds for the zero of the polynomial $ I(\Gamma(\mathbb{Z}_{n}),x ) $ are established, and their log-concave and unimodal properties are examined.
Read the full abstract
Functional Analysis
Dynamical rigidity for weighted composition operators on holomorphic function spaces
We study weighted composition operators on quasi-Banach spaces of holomorphic functions via their induced action on jets along periodic orbits. Under a natural graded nondegeneracy condition, boundedness and compactness, together with a nonvanishing condition on the weight along the periodic orbit, impose strong restrictions on the local holomorphic dynamics of the symbol. We also obtain local periodic-point obstructions from supercyclicity, hypercyclicity, and cyclicity. As consequences, we obtain affine-symbol rigidity for bounded weighted composition operators on spaces of entire functions. In one complex variable, if the ambient function space is any infinite-dimensional quasi-Banach space continuously embedded in the space of entire functions, then boundedness forces the symbol to be affine. In particular, this applies to every infinite-dimensional reproducing kernel Hilbert space of entire functions. We also prove a higher-dimensional affine-rigidity theorem under mild stability assumptions, and a weighted rigidity theorem for polynomial automorphisms of two complex variables. Our approach relies on local holomorphic dynamics at periodic points rather than reproducing-kernel formulas or space-specific norm estimates, and it applies uniformly across broad classes of holomorphic function spaces.
Read the full abstract
Mathematical Physics
Two Approximate Solutions of the Ornstein-Zernike (OZ) Integral Equation
This thesis explores the evolution of liquid-state theories based on the Ornstein-Zernike (OZ) equation, summarizing the foundational methods developed by Baxter, Lebowitz, Wertheim, and others. A unifying feature of these approaches is their shared analytical strategy: by introducing an intermediate function with specific mathematical properties, they effectively decouple the total correlation function and the direct correlation function. This allows the OZ equation to be solved within specific spatial intervals by exploiting regions where either the total or direct correlation function is known. Furthermore, this work presents a comprehensive derivation of analytical solutions to the OZ integral equation under the hard-sphere model. This includes applications of the Percus-Yevick (PY) approximation for both single- and multi-component systems, as well as the Mean Spherical Approximation (MSA) for systems of charged hard spheres. Building upon these analytical solutions, explicit expressions for macroscopic thermodynamic properties, such as the equation of state and activity coefficients, are rigorously derived. These derivations extensively employ advanced mathematical techniques, including Fourier transforms, complex analysis, and integral equation theory. Notably, many of the intermediate analytical steps and thermodynamic derivations presented herein offer a level of clarity and completeness previously absent from the existing literature.
Read the full abstract
Numerical Analysis · Cross-listed from cs.ET
Adaptive Tensor Network Simulation via Entropy-Feedback PID Control and GPU-Accelerated SVD
Tensor network methods, particularly those based on Matrix Product States (MPS), provide a powerful framework for simulating quantum many-body systems. A persistent computational challenge in these methods is the selection of the bond dimension chi, which controls the trade-off between accuracy and computational cost. Fixed bond dimension strategies either waste resources in low-entanglement regions or lose fidelity in high-entanglement regions. This work introduces an adaptive bond dimension management framework that uses von Neumann entropy feedback coupled with a Proportional-Integral-Derivative (PID) controller to dynamically adjust chi at each bond during simulation. An Exponential Moving Average (EMA) filter stabilizes entropy measurements against transient fluctuations, and a predictive scheduling module anticipates future bond dimension requirements from entropy trends. The per-bond granularity of the allocation ensures that computational resources concentrate where entanglement is largest. The framework integrates GPU-accelerated Singular Value Decomposition (SVD) via CuPy and the cuSOLVER backend, achieving individual SVD speedups of 4.1x at chi=256 and 7.1x at chi=2048 relative to CPU-based NumPy for isolated matrix factorisations (measured on an NVIDIA A100-SXM4-40GB GPU with CuPy 13.4.1 and CUDA 12.8). At the system level, benchmarks on the spin-1/2 antiferromagnetic Heisenberg chain demonstrate a 2.7x reduction in total DMRG wall time compared to fixed-chi simulations, with energy accuracy within 0.1% of the Bethe ansatz solution. Integration with the Density Matrix Renormalization Group (DMRG) algorithm yields ground-state energies per site converging to E/N = -0.4432 for the isotropic Heisenberg model at chi = 128. Validation against Amazon Web Services (AWS) Braket SV1 statevector simulator confirms agreement within 2-5% for small systems.
Read the full abstract
Optimization and Control
Distributed Optimal Consensus of Nonlinear Multi-Agent Systems
In this paper, the optimal consensus problem for general nonlinear multi-agent systems is studied, where both leaderless and leader-follower cases are considered in a unified framework. The key idea is to convert consensus problems into optimal control problems where the objective of each agent with nonlinear dynamics is to design the control input minimizing the global consensus cost function. Compared with the existing distributed consensus control for nonlinear multi-agent systems, we propose a distributed optimal consensus algorithm based on the optimal control principle (OCP) method, and two enhanced algorithms are developed under the model predictive control (MPC) framework,these two algorithms demonstrate broader applicability when handling general nonlinear multi-agent systems. Moreover, the convergence and superlinear convergence rate of the proposed algorithms are rigorously analyzed. Numerical simulations demonstrate the effectiveness of the proposed algorithms.
Read the full abstract
Probability · Cross-listed from cs.DS
Uniform Sampling of Proper Graph Colorings via Soft Coloring and Partial Rejection Sampling
We present a new algorithm for the exact uniform sampling of proper \(k\)-colorings of a graph on \(n\) vertices with maximum degree~\(\Delta\). The algorithm is based on partial rejection sampling (PRS) and introduces a soft relaxation of the proper coloring constraint that is progressively tightened until an exact sample is obtained. Unlike coupling from the past (CFTP), the method is inherently parallelizable. We propose a hybrid variant that decomposes the global sampling problem into independent subproblems of size \(O(\log n)\), each solved by any existing exact sampler. This decomposition acts as a complexity reducer: it replaces the input size~\(n\) with \(O(\log n)\) in the component solver's runtime, so that any improvement in direct methods automatically yields a stronger result. Using an existing CFTP method as the component solver, this improves upon the best known exact sampling runtime for \(k>3\Delta\). Recursive application of the hybrid drives the runtime to \(O(L^{\log^* n}\cdot n\Delta)\), where \(L\) is the number of relaxation levels. We conjecture that \(L\) is bounded independently of~\(n\), which would yield a linear-time parallelizable algorithm for general graphs. Our simulations strongly support this conjecture.
Read the full abstract
Combinatorics
2-Geodesic-transitive graphs of order twice a prime power
In this paper, we study 2-geodesic-transitive graphs of order twice an odd prime power. Classifications of corresponding basic graphs and such graphs with almost simple automorphism groups are given, and a reduction theorem for general case is obtained. Certain new 2-geodesic-transitive graphs are found, and a Magma code regarding 2-geodesic-transitive graphs is provided.
Read the full abstract
Geometric Topology
An explicit slice formula for surface invariants via curve invariants
We give an explicit slice formula for a surface invariant of generic immersions in $\mathbb{R}^3$, expressed in terms of curve invariants arising from planar slices. Using a motion-picture viewpoint, we introduce differential measures that record local changes of the curve invariant $St_{(1)}$ and the surface invariant $St_{(2)}$ across singular slice transitions. Our main result shows that, for a quadruple-point event, if $j$ denotes the number of outward coorientations before the event, then the change of the surface invariant satisfies $dSt_{(2)} = 2j - 4$. This yields a computable and combinatorial description of the surface invariant via slice data. In particular, the formula makes explicit the relation between curve-level invariants and finite-order invariants of surface immersions in the sense of Nowik.
Read the full abstract
Combinatorics
Equality in Fill's spectral gap problem
We study the adjacent-transposition chain on the symmetric group $\mathfrak{S}_n$ with a regular parameter vector $\vec{p} = (p_{i,j})_{i\neq j}$. Fill's spectral gap conjecture, recently resolved in the affirmative by Greaves-Zhu, states that among all regular parameter vectors, the spectral gap of the transition matrix is minimized by the uniform vector $p_{i,j}= 1/2$ for all $i\neq j$. We prove the stronger statement that among all regular parameter vectors, the spectral gap is minimized if and only if $\vec{p}$ has a neutral label, i.e., there exists $c \in [n]$ such that $p_{c,i} = 1/2$ for all $i\neq c$. Moreover, in this case, we show that the multiplicity of the second largest eigenvalue is equal to the number of neutral labels, unless the number of neutral labels is $n-2$ or $n$, in which case the multiplicity is $n-1$. This confirms a conjecture of Fill.
Read the full abstract
Numerical Analysis
Bound preserving and mass conservative methods for the nonlocal Cahn-Hilliard equation with the logarithmic Flory-Huggins potential
It is well known that the exponential time differencing (ETD) method has been successfully applied to the classic Cahn-Hilliard equation with double well potential. However, this numerical method can not be extended to the Cahn-Hilliard equation with Flory-Huggins potential directly due to the fact that the the numerical solution may go beyond the physical interval which leads the non-physical solution. In this paper, we develop and analyze first- and second-order numerical schemes for the nonlocal Cahn-Hilliard equation with the classic Flory-Huggins energy potential. In more detail, the ETD method is firstly used to obtain the prediction solution, and then this prediction solution is corrected by the projection method to avoid non-physical solution. The proposed method is shown to preserve bound and mass conservation in discrete settings. In addition, error estimates for the numerical solution are rigorously obtained for both schemes. Extensive numerical tests and comparisons are conducted to demonstrate the performance of the proposed schemes.
Read the full abstract
Combinatorics
A Structural Characterization of Determinantally Equivalent Functions
Let $\Lambda$ be a set and $\mathbb{F}$ a field. Suppose that $K,Q:\Lambda^2\to\mathbb{F}$ are two functions such that for any $n\in\mathbb{N}$ and $x_1,x_2,\ldots,x_n\in\Lambda$, the determinants of matrices $(K(x_i,x_j))_{1\leq i,j\leq n}$ and $(Q(x_i,x_j))_{1\leq i,j\leq n}$ agree. We study to what extent $K$ and $Q$ must be related by two canonical transformations corresponding to diagonal similarity and transposition. In the symmetric case, this relation holds without further assumptions (see [Marco Stevens, Equivalent symmetric kernels of determinantal point processes, RMTA, 10(03):2150027, 2021]), while in general it fails. In [Harry Sapranidis Mantelos, Determinantally equivalent nonzero functions, Discrete Mathematics, 349(6):115021, 2026], it was shown that the relation remains valid under a natural $2\times 2$ determinantal condition (property $\mathcal{D}$), together with the additional assumption that both functions are nowhere vanishing. We prove that the 'nowhere vanishing' assumption can be removed entirely, and that property $\mathcal{D}$ alone provides the correct and complete structural mechanism governing the problem. In particular, this shows that the nowhere-zero assumption is not intrinsic to the problem, but rather an artefact of the specific method. The proof is entirely combinatorial and avoids linear algebra, relying on an analysis of permutations in the definition of a determinant as cycles in a graph; in particular, it requires new arguments to handle the breakdown of the identities used in \cite{mantelos2026determinantally}, which are crucial to the method therein. In the 'finite $\Lambda$' case, this also yields a new approach to the classical matrix problem of [Raphael Loewy, Principal minors and diagonal similarity of matrices, Linear Algebra and its Applications 78 (1986), 23–64], thereby revealing an underlying combinatorial structure.
Read the full abstract
Logic
Cyclic group representations for relation algebras $57_{65}$ and $63_{65}$
We exhibit finite cyclic group representations for relation algebras $57_{65}$ and $63_{65}$. As a consequence, of the ten symmetric integral RAs on four atoms having at least one flexible atom, all are now known to have a representation over a finite cyclic group except for $33_{65}$, which is not even known to be finitely representable.
Read the full abstract
Analysis of PDEs
Local Existence, Uniqueness, Regularity, and Global Behavior of Evolution Equations Involving Mixed Local and Nonlocal Operators
In this work, we address a parabolic problem featuring a potentially doubly nonlinear term, governed by a combination of local and nonlocal operators (see Problem P1 below). We first establish the local existence of weak energy solutions via a semidiscretization in time applied to an auxiliary evolution problem. The uniqueness of these solutions is subsequently obtained through a novel generalization of the classical inequality of Diaz and Saa, suitably adapted to the mixed local nonlocal setting. This generalization provides a new comparison principle and establishes the T-accretivity of a corresponding operator in L2. By employing this comparison principle, we construct suitable barrier functions that allow the global in time extension of solutions. Furthermore, we demonstrate the convergence of weak solutions to a nontrivial stationary state. Our approach relies on methods from the theory of contraction semigroups. It is noteworthy that these results are underpinned by a detailed analysis of the stationary problems associated with Problem P1, which also reveals several qualitative properties of the solutions.
Read the full abstract
Algebraic Geometry
Close connectedness of the moduli stack of reduced curves
We prove that the moduli stack of all reduced $n$-pointed curves is “closely connected” in characteristic zero, in the sense that each irreducible component of the stack intersects the component of smoothable curves. We achieve this by performing a detailed study of Ishii's territories, moduli schemes parametrizing reduced curve singularities together with a normalization map. We give explicit equations for territories, bound their dimensions, describe certain functoriality properties, and study the action of several groups on territories. Along the way, we prove the existence of non-smoothable reduced curve singularities in new ranges, generalizing work of Mumford, Pinkham, Greuel, and Stevens.
Read the full abstract
Numerical Analysis
Error control technique of quadrature-based algorithms for the action of real powers of a Hermitian positive-definite matrix
This study considers quadrature-based algorithms to compute $A^\alpha \boldsymbol{b}$, the action of a real power of a Hermitian positive-definite matrix $A$ on a vector $ \boldsymbol{b}$. In these algorithms, the computation of an integral representation of $A^{\alpha} \boldsymbol{b}$ is reduced to solving several tens or hundreds of shifted linear systems. Current approaches usually analyze the quadrature discretization error, but rarely take into account the additional error introduced by solving these shifted linear systems with iterative solvers. Here, we bound this error with the residual of the approximated solution of these linear systems. This allows the derivation of a stopping criterion for iterative solvers to keep the error of $A^\alpha \boldsymbol{b}$ below a prescribed error tolerance. Numerical results demonstrate that the proposed criterion enables the computation of $A^\alpha \boldsymbol{b}$ within prescribed tolerance limits.
Read the full abstract
Analysis of PDEs
Inhomogeneous Scaling Function and Heat Kernel Estimates on Fractals Satisfying Some Resistance Conditions
In this paper, we focus on strongly local regular Dirichlet forms, especially those satisfying Morrey-type inequalities. We prove the equivalence between resistance estimates and heat kernel estimates in this case. Self-similar forms on fractals serve as a major application, where we construct a spatially inhomogeneous scaling function and characterize all the doubling self-similar measures. Further, on some special examples, the resistance conditions are reduced to some geometric conditions, on which a complete theory on self-similar Dirichlet spaces is established therein. In particular, we construct a concrete example on rotated triangle fractals, where the optimal heat kernel estimate is not related at all to the lower scaling exponent.