Dynamical Systems
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 8 March
We consider the rough differential equations driven by tempered fractional Brownian motion with Hurst index $H\in (\frac{1}{4}, \frac{1}{3})$ and tempered parameter $\lambda>0$. First, by means of piecewise linear approximation, we canonically lift the tempered fractional Brownian motion to a three-step geometric rough path in an almost sure sense. Subsequently, employing the Doss-Sussmann technique in conjunction with a greedy sequence of stopping times, we construct a suitable transformation that establishes a bijection between the solution of the rough differential equation and that of an associated ordinary differential equation. This yields the existence and uniqueness of a solution to the original equation. Based on this result and appealing to Gronwall's lemma, we further derive an upper bound for the solution norm, thereby providing a quantitative control on its growth.
Mathematical Physics · Cross-listed from quant-ph
Comment on "On the emergence of preferred structures in quantum theory" by Soulas, Franzmann, and Di Biagio
This reply is also a friendly introduction to the impossibility of emergence of preferred structures from the Hamiltonian $\mathsf{H}$ and the unit vector $|\psi\rangle$ only. The obstructions to emergence are illustrated on the concrete construction of a tensor product structure (TPS) from Soulas et al., 2025 (arXiv:2512.07468v2). Soulas et al. offer their TPS as a counterexample to the proof from Stoica, 2022a (arXiv:2102.08620) that structures constructed only from $\mathsf{H}$ and $|\psi\rangle$ either contradict physical observations or can't describe them unambiguously. Soulas et al.'s construction of a unique TPS can't be both invariant and compatible with physical observations, so it can't be a counterexample. Its incompatibility becomes visible by examining how the relation between $|\psi(t)\rangle$ and the TPS, encoding the entanglement, changes in time. Therefore their TPS doesn't refute, but confirms (Stoica, 2022a). Besides this, since Soulas et al.'s method to construct preferred structures consists of choosing their invariants, by the same logic one could claim as well that the masses of elementary particles emerge uniquely just by fixing their values by hand. Soulas et al.'s construction is concrete and can illustrate the major obstructions for emergent structures, confirming them despite doing the best possible to avoid them. This makes it an excellent pedagogical tool to illustrate the trilemma, but also the relational and structural aspects of quantum theory and its symmetries.
Read the full abstract
Analysis of PDEs
A global well-posedness result for the three-dimensional inviscid quasi-geostrophic equation over a cylindrical domain
The three-dimensional quasi-geostrophic equation is considered over a cylindrical domain with a multiply connected horizontal cross-section. Homogeneous Neumann boundary conditions, tantamount to homogeneous density fields, are imposed on the top and bottom surfaces, while no-flux boundary conditions combined with constant circulations are imposed on the lateral boundary loops. The global existence and uniqueness of a generalized solution is proven, provided that the initial potential vorticity (PV) field is essentially bounded. If the initial PV field is differentiable, then the solution is shown to satisfy the system in the classical sense.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Group-Sparse Smoothing for Longitudinal Models with Time-Varying Coefficients
Longitudinal associations may vary over time, yet allowing every regression effect to be dynamic can inflate estimation variance and obscure interpretable structure. We develop time-varying-effect selection (TV-Select), a group-sparse smoothing framework that classifies covariate effects as zero, constant, or time varying. Each coefficient is decomposed into a constant mean and a centered temporal deviation represented by a full-rank, L2-normalized effective spline basis. A group penalty identifies varying components, while a roughness penalty controls their curvature. The resulting convex criterion is solved by cyclic block proximal-gradient updates and followed by smooth refitting. Under a full-column-rank unpenalized design and an effective model dimension that is small relative to the total number of observations, we establish prediction and parameter rates, blockwise function-estimation bounds, and exact recovery of the varying set under irrepresentability and beta-min conditions. A stable classification refit further separates zero from constant effects. For fixed-dimensional contrasts, we construct an oracle-equivalent one-step estimator with cluster-robust asymptotic normality and consistent sandwich variance estimation. Simulations demonstrate that TV-Select combines low false-positive rates with accurate function estimation and competitive prediction across a range of longitudinal settings. An application to Sleep-EDF data produces smooth and parsimonious temporal effect estimates with essentially unchanged held-out predictive performance.
Read the full abstract
Analysis of PDEs · Cross-listed from cs.LG
Partial Differential Equations in the Age of Machine Learning: A Critical Synthesis of Classical, Machine Learning, and Hybrid Methods
Partial differential equations (PDEs) govern physical phenomena across the full range of scientific scales, yet their computational solution remains one of the defining challenges of modern science. This critical review examines two mature but epistemologically distinct paradigms for PDE solution, classical numerical methods and machine learning approaches, through a unified evaluative framework organized around six fundamental computational challenges. Classical methods are assessed for their structure-preserving properties, rigorous convergence theory, and scalable solver design; their persistent limitations in high-dimensional and geometrically complex settings are characterized precisely. Machine learning approaches are introduced under a taxonomy organized by the degree to which physical knowledge is incorporated and subjected to the same critical evaluation applied to classical methods. Classical methods are deductive – errors are bounded by quantities derivable from PDE structure and discretization parameters – while machine learning methods are inductive – accuracy depends on statistical proximity to the training distribution. This epistemological distinction is the primary criterion governing responsible method selection. We identify three genuine complementarities between the paradigms and develop principles for hybrid design, including a framework for the structure inheritance problem that addresses when classical guarantees propagate through hybrid couplings, and an error budget decomposition that separates discretization, neural approximation, and coupling contributions. We further assess emerging frontiers, including foundation models, differentiable programming, quantum algorithms, and exascale co-design, evaluating each against the structural constraints that determine whether current barriers are fundamental or contingent on engineering progress.
Read the full abstract
Optimization and Control
Compressed Proximal Federated Learning for Non-Convex Composite Optimization on Heterogeneous Data
Federated Composite Optimization (FCO) has emerged as a promising framework for training models with structural constraints (e.g., sparsity) in distributed edge networks. However, simultaneously achieving communication efficiency and convergence robustness remains a significant challenge, particularly when dealing with non-smooth regularizers, statistical heterogeneity, and the restrictions of biased compression. To address these issues, we propose FedCEF (Federated Composite Error Feedback), a novel algorithm tailored for non-convex FCO. FedCEF introduces a decoupled proximal update scheme that separates the proximal operator from communication, enabling clients to handle non-smooth terms locally while transmitting compressed information. To mitigate the noise from aggressive quantization and the bias from non-IID data, FedCEF integrates a rigorous error feedback mechanism with control variates. Furthermore, we design a communication-efficient pre-proximal downlink strategy that allows clients to exactly reconstruct global control variables without explicit transmission. We theoretically establish that FedCEF achieves sublinear convergence to a bounded residual error under general non-convexity, which is controllable via the step size and batch size. Extensive experiments on real datasets validate FedCEF maintains competitive model accuracy even under extreme compression ratios (e.g., 1%), significantly reducing the total communication volume compared to uncompressed baselines.
Read the full abstract
Dynamical Systems
Why does entropy drive evolution equations?
`Entropy' appears as driving force in many different evolution equations, both deterministic and stochastic, and in these equations this `entropy' also takes different forms. We show how all these examples can be understood as different instances of a common principle: Entropy drives evolutions because it characterizes the invariant measure of an underlying stochastic process. This interpretation explains the appearance of entropy, the different forms that entropy takes in these equations, and how entropy `drives' these evolution equations. We illustrate this common structure with examples from stochastic processes, gradient flows, and GENERIC systems.
Read the full abstract
Dynamical Systems
Extreme value theorem for geodesic flow on the quotient of the theta group
We establish an extreme value theorem for the geodesic flow $g_t$ on the hyperbolic surface $\Theta\backslash\mathbb{H}^2$ associated with the theta group $\Theta$. To capture excursions into both cusps of this surface, we introduce a generalized continued fraction algorithm obtained by splicing the even and odd–odd continued fraction maps into a single dynamical system. We prove that the natural extension of this map is isomorphic to the first return map of the geodesic flow on a suitable cross-section. Using spectral properties of the associated transfer operator, we derive a Galambos-type extreme value law for the digits of the spliced continued fraction. This symbolic result is then translated into a geometric extreme value theorem describing maximal cusp excursions of geodesics on $\Theta\backslash\mathbb{H}^2$.
Read the full abstract
Number Theory
Oscillatory Interference in Dirichlet L-Functions and the Separation of Primes
Dirichlet's theorem guarantees infinitely many primes in each reduced residue class modulo q, but the analytic mechanism underlying this separation is often difficult to visualize directly. In this article we construct simplified oscillatory reconstructions based on the imaginary parts of the nontrivial zeros of Dirichlet L-functions. These reconstructions produce interference patterns that act as analytic filters separating primes according to congruence classes. Examples for moduli 3, 4, and 5 illustrate how the oscillatory frequencies associated with the zeros generate structured peak patterns at prime powers. For complex characters modulo 5, conjugate pairs of L-functions produce cancellation effects that mirror algebraic relations between characters. When all characters modulo 5 are combined, the Dedekind factorization of the cyclotomic field $\mathbf{Q}(\zeta_5)$ appears visually as a striking interference pattern in which only primes congruent to 1 (mod 5) remain. These numerical experiments provide a visual bridge between analytic number theory and algebraic number theory by illustrating how the zero distributions of L-functions generate structured oscillations in prime-related functions.
Read the full abstract
Analysis of PDEs
Sign-changing solutions for a Yamabe type problem
Mathematical Physics · Cross-listed from nlin.SI
On algebro-geometric solutions to the Gelfand–Dickey hierarchy
In [14] Dubrovin introduced an $A_1$-type infinite ODE system and gave a simple way of constructing algebro-geometric solutions to the KdV hierarchy (cf. also [15,4]). In [34] the infinite ODE system is generalized to $\mathfrak{g}$-type infinite ODE system, where $\mathfrak{g}$ is any simple Lie algebra. In this paper, we give a simple constructinon of algebro-geometric solutions to the Gelfand–Dickey hierarchy based on the $A_n$-type infinite ODE system and Dubrovin's method. As an application, we give a formula for the $N$-point function for the related Riemann $\theta$-function.
Read the full abstract
Probability
Regularization of Hyperbolic Stochastic Partial Differential Equations By Two Fractional Brownian Sheets
In this paper, we establish existence and uniqueness of strong solutions for a stochastic differential equation driven by an additive noise given by the sum of two correlated fractional Brownian sheets with different Hurst parameters. Our analysis relies on techniques from two-parameter fractional calculus and a tailored version of Girsanov's theorem. The main challenge arises from the correlation between the two noises and the technical requirements for applying Girsanov's theorem in this setting. We show that, despite these difficulties, the additive noise regularizes the equation, allowing well-posedness under weak assumptions on the drift.
Read the full abstract
Logic
Explicit affine formulas for distances between tuples in classical discrete structures
Answering a question of Ben Yaacov, Ibarlucía, and Tsankov [5], we show an explicit way to construct an affine formula for the distance between two $n$-tuples in a $\{0,1\}$-valued $\varnothing$-structure, using $\lceil \log_2 n \rceil$ quantifier alternations.
Analysis of PDEs
Existence, Sharp Boundary Asymptotics, and Stochastic Optimal Control for Semilinear Elliptic Equations with Gradient-Dependent Terms and Singular Weights: Theory, Economic Applications, and Numerical Simulations
We develop a unified framework for semilinear elliptic equations with gradient-dependent nonlinearities and singular weights in strictly convex domains. Considering large solutions of \[ -\Delta u + b(x)\,h(|\nabla u|) + a(x)\,u = f(x) \quad \text{in }\Omega\subset\mathbb{R}^N, \] where $h$ is strictly convex with $h(s)\sim s^{q}$ for $q\in(1,2]$ and $a(x),b(x)$ display prescribed singular behavior near $\partial\Omega$, we establish existence and uniqueness via Perron's method and derive sharp boundary blow-up asymptotics. In particular, we obtain optimal liminf–limsup estimates for the rate $\gamma=(\beta-q+2)/(q-1)$, extending recent analytic techniques for gradient-growth problems. We further prove strict convexity of solutions through the microscopic convexity principle, highlighting geometric effects arising from the interaction between the nonlinear gradient term and the singular weights. A verification theorem is provided, showing that the solution coincides with the value function of an infinite-horizon stochastic optimal control problem with state constraints. Applications to Operational Research and Management Science are discussed, including case studies in inventory control, portfolio risk management, and supply chain modeling, as well as connections with boundary layer theory and diffusion processes. Numerical experiments in one and two dimensions confirm the predicted boundary behavior and geometric structure. Python implementations are included in the Appendix.
Read the full abstract
Analysis of PDEs
Inverse Robin Spectral Problem for the p-Laplace Operator
We study an inverse Robin spectral problem for the $p$-Laplacian with mixed Dirichlet–Robin boundary conditions. The unknown coefficient lies on an inaccessible Robin portion, and the data are the principal eigenvalue and nonlinear conormal flux on an accessible Dirichlet patch. For a coating of thickness $\varepsilon\rho$ and conductivity $\varepsilon^{p-1}$, we prove convergence of the principal eigenvalue and strong $W^{1,p}$ convergence of the eigenfunctions to an effective Robin problem with coefficient $h=\rho^{-(p-1)}$. The Rayleigh characterization gives a two-sided comparison inequality, ordered uniqueness and weighted $L^1$ stability, and Fréchet differentiability of the eigenvalue map for $1<p<\infty$. For nonordered coefficients and $p\ge2$, the eigenvalue and accessible flux determine the coefficient under the stated critical-set connectivity and local boundary-regularity hypotheses. Differentiability of the principal eigenfunction branch is proved for $p=2$ and imposed as a structural hypothesis for $p>2$; together with a quantitative linearized estimate, it yields conditional local stability. On finite-dimensional classes, branch differentiability and linearized injectivity yield local Lipschitz stability (with branch differentiability automatic when $p=2$), while monotone one-parameter families are identifiable from the principal eigenvalue.
Read the full abstract
Combinatorics
On the 2-Linkage Problem for Split Digraphs
A digraph is {\bf \( k \)-linked} if for arbitary two disjoint vertex sets \(\{s_1, \ldots, s_k\}\) and \(\{t_1, \ldots, t_k\}\), there exist vertex-disjoint directed paths \(P_1, \ldots, P_k\) {such that \(P_i\) is a directed path from \(s_i\) to \(t_i\) for each $i\in [k]$}. A split digraph is a digraph \( D = (V_1, V_2; A) \) whose vertex set is a disjoint union of two nonempty sets \( V_1 \) and \( V_2 \) such that \( V_1 \) is an independent set and the subdigraph induced by \( V_2 \) is semicomplete (no pair of non-adjacent vertices). A semicomplete split digraph is a split digraph \( D = (V_1, V_2; A) \) in which every vertex in the independent set \( V_1 \) is adjacent to every vertex in \( V_2 \). {Semicomplete split digraphs form an important subclass of the class of semicomplete multipartite digraphs.} In this paper, we prove that every 6-strong split digraph is 2-linked. This solves a problem posed by Bang-Jensen and Wang [J. Graph Theory, 2025]. We also show that every 5-strong semicomplete split digraph is 2-linked. This bound is tight already for semicomplete digraphs.
Read the full abstract
Category Theory
Proceedings Eighth International Conference on Applied Category Theory
The Eighth International Conference on Applied Category Theory took place at the University of Florida on June 2-6 2025. The conference consisted of 2 plenary invited talks, 28 contributed talks, an online community meeting, a general community meeting, and 4 talks by junior researchers who attended the Adjoint School to present the results of their research at the school. Information regarding the conference may be found at https://gataslab.org/act2025/act2025.html. Submission to ACT2025 had three tracks: extended abstracts, software demonstrations, and proceedings. Accepted proceedings track submissions are included in this volume. The contributions to ACT2025 ranged from pure to applied and included contributions in a wide range of disciplines. ACT2025 included talks related to computer science, probability theory, chemistry, string diagrams, game semantics, quantum computation, and more.
Read the full abstract
History and Overview of Mathematics
Peacock's Principle as a Conservative Strategy
The view that Peacock's principle of permanence has been invalidated by Hamilton's introduction of non-commutative algebras has always seemed rather odd, in light of Peacock's favorable reception of quaternions and the endorsement of his principle by Hamilton. But the view is not just odd; it is incorrect. In order to show this, I critically analyze Peacock's attempts to reject possible exceptions to his principle, like the factorial function and an infinite series due to Euler. Then I argue that the principle of permanence is best understood as an expression of a conservative strategy, philosophically grounded in Hume's conception of the laws of reasoning, which advocates their preservation to the furthest extent possible, thus allowing exceptions, i.e., violations of these laws. On this reading, non-commutative multiplication does not invalidate Peacock's principle, if the reasons for violating commutativity outweigh the reasons for its preservation. Finally, I show that Hamilton followed a conservative strategy of precisely this sort when he developed his quaternionic calculus.
Read the full abstract
Algebraic Topology
Local Laplacian: theory and models for data analysis
While topological data analysis has emerged as a powerful paradigm for structural inference, its foundational tools, notably persistent homology and the persistent Laplacian, are frequently insensitive to localized structural fluctuations and suffer from prohibitive computational costs on large-scale datasets. To bridge this gap, we introduce the persistent local Laplacian formalism, which is designed to extract fine-grained local topological and geometric signatures while enabling a highly efficient, parallelizable computational workflow. On the theoretical front, we prove a generalized persistent Hodge isomorphism, establishing that the harmonic space of the persistent local Laplacian is isomorphic to the persistent local homology. Furthermore, we derive a unitary equivalence between the persistent local Laplacian and the persistent Laplacian of its corresponding link complex at a shifted dimension. This spectral conjugacy establishes the mathematical foundation for developing efficient computational schemes to resolve persistent local spectral invariants. We further extend this construction to point clouds and graph-structured data, characterizing their persistent local spectral properties through combinatorial filtrations. The resulting architecture is inherently decoupled, facilitating massive parallelization and rendering it uniquely scalable for large-scale network analysis and distributed computational environments.
Read the full abstract
Metric Geometry
Validity of the Strong Version of the Union of Uniform Closed Balls Conjecture in the Plane
We prove the validity of the strong version of the union of uniform closed balls conjecture, formulated in 2011 as [4, Conjecture 2.5], in the plane.
Functional Analysis
Subnormality of the quotients of $\mathbb T^d$-invariant Hilbert modules
In this paper, we investigate $\mathbb T^d$-invariant Hilbert modules $\mathscr H$ over the polynomial ring $\mathbb C[z_1, \ldots, z_d]$ and their quotients, with primary emphasis on the classification of subnormal quotient modules of the form $\mathscr H/[p],$ where $p$ is a homogeneous polynomial in $d$ complex variables. The motivation for this classification arises from the case $p(z_1, z_2)=z_1-z_2,$ in which the subnormality of the quotient module $\widehat{\mathscr H_{\kappa_1} \otimes \mathscr H_{\kappa_2}}/[p]$ is equivalent to that of the module tensor product $\mathscr H_{\kappa_1} \otimes_{\mathbb C[z]} \mathscr H_{\kappa_2}$ of $\mathbb T$-invariant Hilbert modules $\mathscr H_{\kappa_1}$ and $\mathscr H_{\kappa_2}$, a problem first considered by N. Salinas. In addition to general structural results on principal homogeneous submodules $[p]$ of $\mathscr H$, we prove that if $\mathscr H/[p]$ is subnormal, then $p$ must be square-free. Furthermore, when $\mathscr H$ is either $H^2(\mathbb D^d)$ or $H^2(\mathbb B^d),$ $d \ge 1,$ the subnormality of the quotient module $\mathscr H/[p]$ implies that $\mathrm{deg}\,p \le 1.$ We further show that $H^2(\mathbb D^2)/[p]$ (resp. $H^2(\mathbb B^2)/[p]$) is subnormal if and only if $\mathrm{deg} \,p \le 1.$ If $H^2_d$ denotes the Drury-Arveson module in $d$ dimensions, then $H^2_2/[p]$ is subnormal if and only if $p$ is nonzero and $\mathrm{deg} \,p \le 1$. This is surprising, especially since $H^2_d$ is not a subnormal Hilbert module for $d \ge 2.$ Moreover, the phenomenon above does not occur for the Dirichlet module $D_2(\mathbb B^2)$. Finally, we present an example demonstrating that a $\mathcal U_d$-invariant subnormal Hilbert module $\mathscr H$ may have a subnormal quotient module $\mathscr H/[p]$ even when $\mathrm{deg}\, p = 2.$
Read the full abstract
Dynamical Systems
Topological, metric and fractal properties of one family of self-similar sets
Depending on a natural parameter $l$, we study the topological, metric, and fractal properties of the homogeneous self-similar set $$K_{l}=\left\{\sum_{i=1}^{\infty} \frac{\varepsilon_i}{(2l+2)^i} : (\varepsilon_i) \in \{0, 2, 4, \dots, 2l, 2l+1, 2l+3, \dots, 4l+1 \}^{\mathbb{N}} \right\}.$$ In particular, we prove that $K_l$ is a Cantorval, a perfect set on the real line with a non-empty interior and fractal boundary. Additionally, we show that $K_l$ has Lebesgue measure $1$ and that its boundary has Hausdorff dimension $\log(2l+1)/\log(2l+2)$.
Read the full abstract
Analysis of PDEs · Cross-listed from physics.flu-dyn
Weak Singularity of Navier-Stokes Equations Based on Energy Estimation in Sobolev Space
Based on Dou Huashu's energy gradient theory, this paper focuses on the weak singularity of the incompressible Navier-Stokes (NS) equations in steady, fully developed flows. When the gradient of total mechanical energy is perpendicular to the streamline (i.e., $ u_j \frac{\partial E}{\partial x_j} = 0 $), substituting this critical condition into the NS equations with no-slip boundary conditions leads to the viscous term $ \nu \to 0 $. To rigorously analyze the regularity of the solution, Sobolev space $ H_0^1(\Omega) $ is introduced for energy estimation. The results show that the velocity field loses $ H^1 $-regularity, and the NS equations degenerate into Euler equations, which admit discontinuous weak solutions. Thus, the position where the mechanical energy gradient is perpendicular to the streamline becomes a weak singularity of the NS equations.
Read the full abstract
Geometric Topology
Fundamental Groups of Genus-$0$ Quadratic Differential Strata via Exchange Graphs
We investigate how exchange-graph techniques can be used to study the topology of strata of meromorphic quadratic differentials. The exchange graph provides natural generators for the fundamental group. By extending the combinatorics of triangulations to weighted mixed-angulations, we generalise the familiar relations arising in the simple-zero case and introduce an additional relation that appears only around higher-order zeroes. In the genus-zero case with four singularities, we show that these relations suffice to give explicit presentations of the fundamental group.
Read the full abstract
Representation Theory
Representations of shifted super Yangians and finite $W$-superalgebras of type A
In this article, we study the representation theory of shifted super Yangians and finite $W$-superalgebras of type A. A criterion for the finite dimensionality of irreducible modules is obtained in the standard parity case. Furthermore, we provide an explicit Gelfand-Tsetlin character formula for Verma modules of finite $W$-superalgebras. As an application, we show that the centers of the finite $W$-superalgebras associated to any even nilpotent elements belonging to the same general linear Lie superalgebra are all isomorphic to the center of the universal enveloping superalgebra.
Read the full abstract
Differential Geometry · Cross-listed from gr-qc
The Kerr-Newman two-twistor particle
An all-orders worldline effective action for Kerr-Newman black hole is achieved in twistor particle theory. Exact hidden symmetries are identified in self-dual backgrounds.
Information Theory
A Finite-Blocklength Analysis for ORBGRAND
Within the Guessing Random Additive Noise Decoding (GRAND) family, ordered reliability bits GRAND (ORBGRAND) offers hardware-friendly use of soft information. Existing information-theoretic results for ORBGRAND are asymptotic in blocklength and do not quantify its short-to-moderate blocklength performance. This paper develops a finite-blocklength analysis for ORBGRAND over general binary-input memoryless channels, addressing the key challenge that the rank-induced decoding metrics are coupled across symbols. We specialize the random-coding union (RCU) bound for mismatched decoding to ORBGRAND, yielding the ORB-RCU bound. We then characterize the two codeword decoding metrics governing this bound: the transmitted-codeword decoding metric is represented, up to a deterministic $O(n^{-1})$ term, by a nondegenerate second-order $U$-statistic and admits a Gaussian approximation via the Hoeffding projection and a Berry-Esseen theorem for $U$-statistics, whereas the competing-codeword decoding metric is reduced to a weighted sum of independent and identically distributed Bernoulli random variables and characterized by a strong large-deviation expansion that holds uniformly. Combining these ingredients, we establish a Gaussian approximation for the ORB-RCU bound, which yields a third-order achievable rate expansion for ORBGRAND. The first-order term coincides with the previously established ORBGRAND achievable rate, the second-order term defines an ORBGRAND dispersion, and the third-order correction is $\frac{\ln n}{2n}$. Numerical results for the BPSK-modulated additive white Gaussian noise channel show that ORB-RCU remains close to the ML-RCU benchmark and that the resulting approximation accurately predicts finite-blocklength performance in the operating regime of practical interest.
Read the full abstract
Algebraic Geometry
A characterization of Fano type varieties
We prove a characterization of Fano type varieties.
Analysis of PDEs
Pointwise regularity of solutions for fully fractional parabolic equations
This paper investigates the higher pointwise regularity of nonnegative classical solutions for fully fractional parabolic equations $(\partial_t -\Delta)^{s} u = f,$ where $s\in(0,1)$. We establish $C^{k+\alpha+2s}$ or $C^{k+\alpha+2s,\ln} (k\geq 0,\alpha\in[0,1))$ pointwise regularity according to $\alpha+2s\notin \mathbb{Z}$ or $\alpha+2s\in \mathbb{Z}$, which imply the classical local regularity directly. We provide a simplified and unified proof by introducing novel equivalent definitions for pointwise function spaces. Moreover, the equivalent integral representation and directional average for fractional heat kernel play an important role in our discussion.
Read the full abstract
Combinatorics
On a conjecture concerning the property of chromatic polynomials with negative variables
Let $G$ be a graph of order $n$ and $P(G,x)$ be the chromatic polynomial of $G$. Dong, Ge, Gong, Ning, Ouyang, and Tay (J. Graph Theory 96(2021) 343) conjectured that $\frac{d^k}{dx^k} \bigl( \ln[(-1)^n P(G, x)] \bigr) < 0$ holds for all $k \geq 2$ and $x \in (-\infty, 0)$. We prove this conjecture for all $k \geq 2 $ and $ x\leq -6.66\Delta k $, in which $\Delta$ is the maximum degree of $G$.