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)

Friday 24 April

Combinatorics

A construction method for WZ seeds

We propose a systematic method for constructing Wilf-Zeilberger (WZ) seeds and present seven WZ seeds. We also demonstrate how to construct WZ seeds from existing ones. With these WZ seeds, several hypergeometric identities are derived. The construction can be extended to the $q$-cases, leading to the $q$-analogues of the seven WZ seeds.
Read the full abstract

Group Theory

Visibly Pushdown Languages in Groups

In this paper we explore the connections between the class of Visibly Pushdown Languages ($\mathbf{VPL}$) and the natural sets of words one can associate to a finitely generated group. We show that the word problem of a finitely generated group is $\mathbf{VPL}$ exactly when the group is finite. We also show that free reduction does not preserve $\mathbf{VPL}$, and that finding solutions to equations in a free group with $\mathbf{VPL}$ constraints (as reduced words) is undecidable. We explore the structure of sets whose full preimage is $\mathbf{VPL}$, showing these are often recognisable sets. We conjecture that, in any group, this class is precisely the recognisable sets.
Read the full abstract

Group Theory

On simple compact Lie skew braces

We study simplicity of Lie skew braces from both global and infinitesimal perspectives. After reviewing the correspondence between connected Lie skew braces, simply transitive affine actions, and post-Lie algebras, we investigate ideals and rigidity phenomena. Our main result concerns compact connected Lie skew braces. We prove that any compact connected simple Lie skew brace is either the trivial Lie skew brace on \(S^1\), or both of its underlying Lie groups are simple and the brace is trivial or almost trivial. Consequently, apart from the exceptional \(S^1\) case, simplicity of a compact connected Lie skew brace is equivalent to simplicity of either underlying Lie group. We also show that every connected compact solvable Lie skew brace is trivial. Finally, we construct a noncompact example demonstrating that this rigidity phenomenon does not hold in general: there exists a connected simply connected simple Lie skew brace whose additive and multiplicative Lie groups are both solvable.
Read the full abstract

Category Theory

Presheaves and cocompletions in formal category theory

We study the relationship between presheaf constructions and free cocompletions in the context of formal category theory, elucidating the coincidence between the two concepts in familiar settings. We show that, in a virtual equipment satisfying mild assumptions, free cocompletions under classes of weights are exhibited by presheaf constructions. We furthermore extend the theory of weighted colimits from enriched category theory to this setting, developing the concepts of atomicity and rank, and providing recognition theorems for presheaf objects, free cocompletions, and cocomplete objects. As an application of our methods, we construct free cocompletions, under arbitrary classes of colimit-small weights, of (possibly large) categories enriched in (not necessarily symmetric) monoidal categories and bicategories; this resolves a longstanding omission in the literature on enriched category theory.
Read the full abstract

Optimization and Control

Statistical Estimation of Monge Transport Maps via Brenier Potentials

We introduce and analyze a statistical estimator for Monge transport maps: solutions to the quadratic optimal transport problem in the Euclidean space. For absolutely continuous source measures, this map is uniquely defined as the gradient of a convex function, a result known as Brenier's theorem. Without absolute continuity, the problem is relaxed, maps are replaced by coupling measures, and optimal couplings are supported on the subdifferential of a convex function, called a Brenier potential. This potential is the basis for our transport map statistical estimator, for measures known only through finite samples. We construct an explicit optimal Brenier potential for the empirical problem, with a simple closed form expression based on dual solutions. Our transport map estimator is then defined as a suitable subdifferential selection, and can be extended to $\mathbb{R}^d$. We exhibit convergence rates for this estimator based on a new error bound for the quadratic optimal transport problem. In the semi-discrete setting, where the target measure is finitely supported, our estimator enjoys sharper convergence rates. Our methodology does not rely on smoothness or continuity of the target Monge transport map and requires no computation beyond primal-dual solutions of the empirical finite dimensional problem. Finally, using similar proof techniques, we provide novel convergence rates for empirical couplings.
Read the full abstract

Metric Geometry

Convergence of Timed-Metric Spaces and Causality

We introduce the notion of timed-Gromov–Hausdorff distance for timed-metric spaces. We prove that this distance is bi-Lipschitz equivalent to the intrinsic timed-Hausdorff distance of Sakovich–Sormani, and therefore induces the same notion of convergence. We establish a compactness theorem for the timed Gromov–Hausdorff distance, obtained as a straightforward consequence of Gromov's classical compactness theorem. We then investigate the causal structure of timed-metric spaces and the stability of causality under intrinsic timed-Hausdorff convergence. We further analyze causally-null timed-metric spaces and develop several of their basic properties. As a curiosity, we include in an appendix Gromov's original proof of his compactness theorem, as presented in his paper on groups of polynomial growth.
Read the full abstract

Combinatorics

Asymptotically Tight Bound for the Conflict-Free Chromatic Index

The conflict-free chromatic index of a graph $G$ is the minimum number of colours in an edge colouring of $G$ such that the neighbourhood of every edge contains a colour appearing exactly once. Its vertex analogue is the conflict-free chromatic number. These two parameters naturally coincide when the second is applied to the line graph of $G$. It is known that two variants of the latter parameter exhibit substantially different behaviour. For closed vertex neighbourhoods, where each vertex belongs to its own neighbourhood, it is known that $O(\ln^2 \Delta)$ colours suffice, where $\Delta$ denotes the maximum degree of $G$, and this bound is tight in order. In contrast, for open neighbourhoods, the corresponding parameter can be as large as $\Delta+1$, but is bounded above by $O(\ln^{2+\varepsilon} \Delta)$ for claw-free graphs. Since line graphs are claw-free, this yields the best known general upper bound for the edge analogue in the setting of open neighbourhoods. For closed edge neighbourhoods, a stronger general upper bound of $3\log_2 \Delta + 4$ is known. In this paper, we show that for both variants, the conflict-free chromatic index is bounded above by $(1+o(1))\log_2 \Delta$. Since complete graphs require at least $(1 - o(1)) \log_2 \Delta$ colours in the closed as well as the open setting, our result is asymptotically tight in order and in the leading constant. Moreover, we strengthen this conclusion by showing that $(1 - o(1)) \log_2 \Delta$ colours are also typically necessary, as we prove this asymptotically almost surely for random graphs in both dense and relatively sparse regimes. Our proofs combine the probabilistic method with deterministic graph decomposition techniques, as well as new results relating the parameters under consideration with the chromatic number of a graph.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functions

Classical ReLU-based Input Convex Neural Networks (ICNNs) are equivalent to the optimal value functions of Linear Programming (LP). This intrinsic structural equivalence restricts their representational capacity to piecewise-linear polyhedral functions. To overcome this representational bottleneck, we propose the SOC-ICNN, an architecture that generalizes the underlying optimization class from LP to Second-Order Cone Programming (SOCP). By explicitly injecting positive semi-definite curvature and Euclidean norm-based conic primitives, our formulation introduces native smooth curvature into the representation while preserving a rigorous optimization-theoretic interpretation. We formally prove that SOC-ICNNs strictly expand the representational space of ReLU-ICNNs without increasing the asymptotic order of forward-pass complexity. Extensive experiments demonstrate that SOC-ICNN substantially improves function approximation, while delivering competitive downstream decision quality. The code is available at https://anonymous.4open.science/r/SOC-ICNN-4B18/.
Read the full abstract

Number Theory

Matrices with cyclically monotone rows and Cantor numeration systems

We study a class of square matrices with non-negative elements which have cyclically monotone rows in the sense that each row of a matrix from the class consists of a cyclically non-increasing sequence of numbers starting from a maximal element on the diagonal. We prove that if every diagonal element is strictly larger than all other elements in the respective row, then the matrix is regular. This property enables us to solve an open problem that comes from the theory of non-standard numeration systems, also called Cantor numeration systems. The problem concerns a one-to-one relationship between Cantor real bases, which are supposed to be alternate, that is, periodic with a period p, and lists of p sequences of non-negative integers satisfying the so-called Parry condition.
Read the full abstract

Combinatorics

Stacking and clearing in graph pebbling

Suppose that pebbles are distributed on the vertices of a graph G. A pebbling step along an edge uv removes two pebbles from u and places one pebble on v. We introduce two new graph parameters: stack(G): the least integer t such that every configuration with t pebbles can be transformed, by a finite sequence of pebbling steps, into a configuration with all pebbles on a single vertex. clear(G): defined analogously, but requiring that from every configuration with t pebbles, all but one pebble can be removed. We prove that stack(G) is defined exactly for connected graphs, and that clear(G) is defined exactly for connected non-bipartite graphs. We also establish general upper bounds for these parameters; in particular, stack(G), clear(G) <= 2 |V(G)| 2^diam(G), where diam(G) denotes the diameter of G. Among our exact results are the equalities stack(K_n) = clear(K_n) = n + 1, stack(K_{m,n}) = 3 max{m,n} + 1, stack(P_n) = 2^n - 1. We also establish general lower bounds in terms of the independence number and odd closed walks. For cycles, the situation is more delicate. We prove the lower bounds stack(C_{2n}) >= 2^{n+1} - 1, clear(C_{2n+1}) >= 3 * 2^n - 2, and formulate the Almost Stacked Hypothesis, motivated by Sjostrand's cover pebbling theorem. Assuming this hypothesis, we obtain stack(C_{2n}) = 2^{n+1} - 1, clear(C_{2n+1}) = 3 * 2^n - 2. At present, we do not have a conjecture for the exact value of stack(C_{2n+1}). Finally, computational evidence leads us to a conjectural closed formula for the stacking number of a tree in terms of the distances and degrees of the vertices relative to a chosen root.
Read the full abstract

Optimization and Control

Strategically Robust Linear Quadratic Dynamic Games

We study linear quadratic dynamic games where players are uncertain about each other's control policies or goals and consequently seek to be strategically robust. Building on recent work on strategically robust and risk-averse game theory, we first formalize the problem of strategically robust linear quadratic dynamic games. We show that these can be rewritten as simple transformations of linear quadratic games in which each player chooses a controller in a fictitious game in which they are faced with an adversary who is penalized for deviating from the other players' policies. This formulation naturally induces a novel notion of dynamic equilibrium, which we call a strategically robust dynamic equilibrium. We establish existence and uniqueness (in the subgame-perfect sense) of such equilibria and show that the equilibrium policies are Markovian, linear, and can be efficiently computed via coupled backward Riccati equations. Through numerical simulations, including experiments in a network game, we illustrate the benefits of strategic robustness in designing robust and resilient decentralized control schemes. Our experiments also expose a "free-lunch" phenomenon in games in which robustness does not incur a corresponding loss in performance but can yield improvements in players' utilities and social welfare.
Read the full abstract

Optimization and Control

Stackelberg Stochastic Linear-Quadratic Differential Games: A Closed-Loop Equilibrium Approach

This paper addresses a Stackelberg stochastic linear-quadratic (LQ) differential game under closed-loop information, a problem inherently time-inconsistent. Existing approaches rely on solving two coupled Hamilton-Jacobi-Bellman (HJB) equations derived via time discretization and a limiting argument, whose convergence remains an open problem. We propose an alternative framework based on closed-loop equilibrium strategies. We reformulate the leader's problem as a forward-backward optimal control problem involving a coupled system of forward SDEs and backward Riccati equations. Due to the presence of controlled Riccati equations, the leader's problem becomes essentially nonlinear. Using a variational method, we characterize the leader's closed-loop equilibrium strategy and derive the associated equilibrium Riccati equation (ERE). A key conceptual distinction is that the follower adopts a globally optimal strategy against any admissible control of the leader, whereas in previous literature the follower's strategy was only locally optimal along the leader's specific equilibrium path. This makes the follower's strategy more robust and the leader's commitment more credible. In our LQ setting, the resulting ERE coincides exactly with the coupled HJB system from the literature, showing the leader's strategy is equivalent to the feedback Stackelberg solution. Thus, our framework provides not only an alternative derivation but also a rigorous justification of the limiting argument. We establish a priori estimates for the ERE, covering 1D and high-dimensional cases, ensuring global well-posedness for any finite horizon. This significantly extends existing results which require a sufficiently short time horizon or control-independent diffusion. An application to an asset management problem with numerical simulations illustrates the theoretical results.
Read the full abstract

Mathematical Physics

A direct derivation of an effective Hamiltonian in non-relativistic quantum electrodynamics

We present a direct derivation of Arai's effective Hamiltonian in non-relativistic quantum electrodynamics without relying on the scaling limit. Our result applies to a broader class of potentials, including the Rollnik class and confining potentials such as the harmonic potential.
Read the full abstract

Functional Analysis

Hyponormality of the sum of two Toeplitz operators

In this paper, we have studied the hyponormality and invertibility of the operator of type $wT_{\varphi}+T_{\psi}$ where $w$ is any non-zero complex number and $T_{\varphi}, T_{\psi} $ are Toeplitz operators. We have also studied hyponormality when the symbol of Toeplitz operator is a linear functional.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Multiple Mellin-Barnes integrals in Schwinger-DeWitt technique

We consider off-diagonal asymptotic series for integral kernels of functions of Laplace-type operators on curved backgrounds. These expansions are obtained by applying integral transforms to the DeWitt series for the heat kernel of the corresponding operator and thus represent a DeWitt-type series in the heat kernel coefficients with the coefficients of this expansion (which we call basis kernels) being some hypergeometric-type functions of the Synge world function. Basis kernels of a certain class of operator functions were found previously in terms of $N$-fold Mellin-Barnes integrals. In this paper we study series representations of the corresponding Mellin-Barnes integrals in both non-resonant and resonant cases and suggest a physical interpretation for the emerging series, which is related to the UV and IR properties of operator functions.
Read the full abstract

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

A variational formulation of stochastic thermodynamics: Spatially extended systems

Stochastic field theories are often constructed phenomenologically, without a systematic assessment of thermodynamic consistency or local detailed balance. This may hinder a physical description of irreversibility at the field-theoretic level beyond the standard statistical formulation of stochastic thermodynamics. Here, we develop a variational formulation for thermodynamically consistent stochastic field theories by extending Hamilton's principle of classical field theory. Introducing the second law as an axiom yields a consistent local thermodynamic structure in which novel fluctuationdissipation relations emerge naturally, ensuring local detailed balance. Remarkably, the resulting entropy production takes the same form as in standard stochastic thermodynamics, up to a reformulation in an extended phase space incorporating both configurational and thermal variables. This correspondence extends key results, including individual trajectory-level thermodynamics and fluctuation theorems. The construction is formulated within a unified geometric framework based on a generalized Lagrange-d'Alembert principle, providing a top-down connection between phenomenological modeling and thermodynamic consistency. Potential applications include thermodynamically consistent modeling of complex fluids, Lagrangian reduction by symmetry in continuum systems, and structure-preserving numerical schemes for stochastic partial differential equations.
Read the full abstract

All authors Héctor Vaquero del Pino, François Gay-Balmaz, Hiroaki Yoshimura, Lock Yue Chew

Functional Analysis

On numerical invariants for submodules $[(z-w)^2]$ in $H^2(\mathbb{D}^2)$

In this paper, we study numerical invariants associated with a homogeneous submodule of the Hardy module over the bidisk. We focus on the submodule generated by the polynomial $(z-w)^2$ and obtain explicit formulas for the corresponding invariants. As an application, we verify the monotonicity property in this concrete setting. Our results provide a detailed example illustrating the behavior of these invariants beyond the linear case.
Read the full abstract

Group Theory

Closed Form Relations and Higher-Order Approximations of First and Second Derivatives of the Tangent Operator on SE(3)

The Lie group SE(3) of isometric orientation preserving transformation is used for modeling multibody systems, robots, and Cosserat continua. The use of these models in numerical simulation and optimization schemes necessitates the exponential map, its right-trivialized differential (often referred to as tangent operator), as well as higher derivatives in closed form. The $6\times 6$ matrix representation of the differential, $\mathbf{dexp}_{\mathbf{X}}:se\left( 3\right) \rightarrow se\left( 3\right) $ , and its first derivative were reported using a $3\times 3$ block partitioning. In this paper, the differential, its first and second derivative, as well as the Jacobian and Hessian of the evaluation maps, $\mathbf{dexp}_{\mathbf{X}}\mathbf{Z}$ and $\mathbf{dexp}_{\mathbf{X}}^{T}% \mathbf{Z}$, are reported avoiding the block partitioning. For all of them, higher-order approximations are derived. Besides the compactness, the advantage of the presented closed form relations is their numerical robustness when combined with the local approximation. The formulations are demonstrated for computation of the deformation field and the strain rates of an elastic Cosserat-Simo-Reissner rod.
Read the full abstract

Functional Analysis

Compactness of products and commutators of inner projections

In this paper, we study the compactness of the product and the commutator of two inner projections on the Hardy spaces over the unit disk and the polydisc. For the single-variable case, we provide a complete characterization of the compactness of the commutator of two inner projections by means of Douglas algebra. In the multivariable setting, we discover a rigidity phenomenon: on the bidisc, the product of two inner projections is compact if and only if it has finite rank, whereas on the polydisc of dimension strictly greater than two, any such compact product must be trivial.
Read the full abstract

All authors Peiran Zhang, Roumei Tian, Yufeng Lu, Yixin Yang, Chao Zu

Dynamical Systems

Finite-Approximate Solvability of Linear Operator Equations

We introduce and study the finite-approximate solvability of operator equations \(Lu = h\) in a Hilbert space setting, where a bounded operator \(L \colon U \to H\) is paired with a finite-dimensional constraint operator \(\pi \colon H \to H_0\). The objective is to match exactly the prescribed component \(\pi h\) while approximating the remainder. We prove that the problem of finding \(u\) such that \(\|Lu - h\| < \varepsilon\) and \(\pi(Lu) = \pi h\) is solvable for all \(\varepsilon > 0\) if and only if \(\alpha T_\alpha^{-1}h \to 0\) as \(\alpha \to 0^+\). We further show that dropping any of the structural assumptions on \(L\), \(\Gamma\), or \(\pi\) leads to a failure of the equivalence. When \(\pi \colon H \to H_0\) has an infinite-dimensional range that is compactly embedded in \(H\), the operator \(T_\alpha\) may no longer be invertible. However, a Galerkin scheme \(\pi_n \to \pi\) recovers approximate solvability through the resolvents \((\alpha(I - \pi_n) + \Gamma)^{-1}\).
Read the full abstract

Number Theory

Higher moments of the symmetric square $L$-function off the critical line

Let $f$ be the Hecke eigenform for the modular group $SL_2(\mathbb{Z})$, and $L(s, \text{sym}^2 f)$ be the symmetric square $L$-function associated with $f$. For $\frac{1}{2}<\sigma<1$, define $m(\sigma)$ as the supremum of all numbers $m$ such that \[ \int_{1}^T|L(\sigma+it, \text{sym}^2 f)|^m \text{d}t\ll_f T^{1+\varepsilon}, \] where $\epsilon>0$ is an arbitrarily small number. In this paper, we established the bound \begin{align*} m(\sigma)\geq \frac{17}{26-28\sigma}, \text{ for }\frac{5}{8}\leq\sigma\leq\frac{52}{73}, \end{align*} which improved our previous result.
Read the full abstract

Information Theory

Semantic Error Correction and Decoding for Short Block Codes

This paper presents a semantic-enhanced receiver framework for transmitting natural language sentences over noisy wireless channels using multiple short block codes. After ASCII encoding, the sentence is divided into segments, each independently encoded with a short block code and transmitted over an AWGN channel. At the receiver, segments are decoded in parallel, followed by a semantic error correction (SEC) model, which reconstructs corrupted segments using language model context. We further propose the semantic list decoding (SLD), which generates multiple candidate reconstructions and selects the best one via weighted Hamming distance, and a semantic confidence-guided HARQ (SHARQ) mechanism that replaces CRC-based error detection with a confidence score, enabling selective segment retransmission without CRC overhead. All modules are designed and trained using bidirectional and auto-regressive transformers (BART). Simulation results demonstrate that the proposed scheme significantly outperforms conventional capacity-approaching short codes and long codes at the same rate. Specifically, SEC provides approximately 0.4 dB BLER gain over plain short-code transmission, while SLD extends this to 0.8 dB. Compared to transmitting the entire sentence as a single long 5G LDPC codeword, our approach significantly improves semantic fidelity and reduces decoding latency by up to 90%. SHARQ further provides an additional 1.5 dB gain over conventional HARQ.
Read the full abstract

All authors Jiafu Hao, Chentao Yue, Wanchun Liu, Branka Vucetic, Yonghui Li

Number Theory

On a new modular equation of degree five and Eisenstein series identities of associated levels

In this research article, we obtain few theta function identities of level ten employing Ramanujan's $_1 \psi_1$ summation formula. Using these identities, we derive a new modular equation of degree five. Further, we establish Eisenstein series identities of level ten using Bailey's very-well poised $_6 \psi_6$ summation formula.
Read the full abstract

Optimization and Control

Finite Termination of a Generalized Perceptron Algorithm

Motivated by Ridgway's proof of the perceptron algorithm, we study a simple subgradient method for convex inequality systems in Hilbert space. Assuming strict feasibility and bounded subgradients, we establish finite termination for several natural step sizes. We also examine what can go wrong without strict feasibility: finite convergence may fail even for one function, and with several functions the method may converge to a point outside the feasible set. The linear setting recovers the classical perceptron algorithm.
Read the full abstract

Information Theory · Cross-listed from eess.SP

A General EM-Based Channel Model for Reconfigurable Antenna Systems

Reconfigurable antenna systems (RASs), such as fluid antennas and movable antennas, are poised to play a pivotal role in sixth-generation (6G) systems by dynamically adapting the antenna elements for system performance enhancement. However, unlocking their full potential requires channel models that accurately capture the influence of antenna configurations on the radiation, propagation, and reception of signals. Existing channel models suffer from several limitations, such as neglecting polarization effects, being restricted to specific antenna types, or relying on oversimplified assumptions. In this paper, we propose a general electromagnetic (EM)-based channel model grounded in spherical vector wave expansion (SVWE). The proposed EM-based channel model captures the impact of antenna position and orientation on the channel gain, thereby making it particularly well-suited for RASs. The effectiveness and accuracy are validated through comparisons with commercial simulation software, demonstrating excellent agreement in predicted channel gains. Moreover, it is shown that antenna orientation is a critical factor governing communication performance, and that dynamically adjusting the antenna orientation yields up to 70% improvement in achievable communication rate compared to a fixed-antenna configuration.
Read the full abstract

Representation Theory

Stability of Branching Multiplicities for Orthogonal Gelfand Pairs

We propose a structural framework for branching multiplicities in representation theory, emphasizing their behavior under variation of infinitesimal characters. For the orthogonal reductive pairs $(G,G')$ with complexified Lie algebras $(\mathfrak{o}(n+1,\mathbb{C}), \mathfrak{o}(n,\mathbb{C}))$, we show that branching multiplicities are governed by universal systems of linear inequalities on the parameter space of reduced coherent families introduced in this paper. To describe the loci where multiplicities may change, we introduce fences: piecewise-linear hypersurfaces that divide the parameter space into convex regions. We prove that the multiplicity function is locally constant on each such region bounded by these fences. The framework applies uniformly to finite-dimensional representations and to admissible smooth Fréchet representations of real reductive groups. It accounts for classical results such as the Weyl branching law and provides a unified explanation for a range of phenomena, including the Gross–Prasad conjecture, sporadic symmetry breaking operators, and fusion rules for Verma modules. These results establish a general paradigm for branching multiplicities in orthogonal Gelfand pairs.
Read the full abstract

Number Theory

Exceptional poles of archimedean Rankin-Selberg L-functions for irreducible generic representations of GL(n,R)

For irreducible generic representations $\pi_1$ and $\pi_2$ of $\operatorname{GL}_n(\mathbb R)$, we prove that the notions of exceptional pole of type $1$ and type $2$ coincide at every level. When both representations are in general position, we use this identification to express the Rankin–Selberg $L$-function $L(s,\pi_1\times\pi_2)$ in terms of the exceptional $L$-factors attached to the irreducible constituents of their derivatives.
Read the full abstract

Probability

On necessary and sufficient conditions for the local large deviation principle

One says that the local large deviation principle (LLDP) is satisfied for a family of random vectors $\{\zeta_T\}_{T\ge 0}$ in $\mathbb R^d,$ $d\ge 1,$ if there exists a function $D:\mathbb R^d\to [0,\infty],$ $D\not \equiv \infty,$ such that, for any $\alpha\in \mathbb R^d$, \[ \lim_{T\to \infty}T^{-1}\ln \mathbf{P} (|\zeta_T -\alpha|<\varepsilon_T)= - D(\alpha)\] for $\varepsilon_T\to 0$ slowly enough. In this paper, we establish necessary and sufficient conditions for the LLDP that are very close to each other. Namely, if the LLDP is satisfied then, for $M_T\to\infty$ slowly enough as $T\to\infty$, there exists the limit \[ A(\mu):= \lim_{T\to\infty}T^{-1}\ln \mathbf{E} (e^{T\langle \mu, \zeta_T\rangle}; |\zeta_T|\le M_T)\in (-\infty, \infty],\quad \mu\in \mathbb R^d,\] which is equal to the Legendre–Fenchel transform $\mathcal L_D$ of the rate function $D$. Conversely, if the above limit $A(\cdot )$ exists and is an essentially smooth function, then the LLDP is satisfied with the rate function $D$ equal to $\mathcal L_A.$ This "relaxed version" of the Gärtner–Ellis theorem's main condition does not involve the restrictive integrability assumptions from the latter and is most adequate to the nature of the local large deviation problem.
Read the full abstract

Numerical Analysis

A high order accurate and energy stable continuous Galerkin framework on summation-by-parts form for the incompressible Navier-Stokes equations

This paper presents a high-order accurate Continuous Galerkin Finite Element Method (CGFEM) for solving the initial boundary value problems governed by the Incompressible Navier-Stokes (INS) equations. We discretize the INS equations using the CGFEM approach in Summation-By-Parts (SBP) form. Lagrange polynomials of up to 4th order are employed. The boundary conditions are imposed weakly using the Simultaneous Approximation Term (SAT) technique, which accommodates discontinuous boundary data without special treatment. The resulting SBP-SAT formulation guarantees an energy stable discretization. The efficiency of the proposed framework is demonstrated by solving a series of numerical tests. Initially, the Method of Manufactured Solutions (MMS) is employed to demonstrate 4th order convergence. Subsequently, the 4th order accurate scheme is applied to a classical benchmark problem featuring discontinuous boundary conditions: the lid-driven cavity flow over a wide range of Reynolds numbers. Accurate and oscillation-free solutions are achieved even in the vicinity of the discontinuous top corner boundaries. Lastly, a canonical backward-facing step flow problem is solved, where accuracy and efficiency are demonstrated.
Read the full abstract

All authors Mrityunjoy Mandal, Arnaud G Malan, Prince Nchupang, Jan Nordström

Combinatorics

Some New Results on Seidel Equienergetic Graphs

The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Some variants of energy can also be found in the literature which are defined on the concepts of Laplacian matrix, Distance matrix, Common neighbourhood matrix and Seidel matrix. The Seidel matrix of the graph $G$ is the square matrix in which $ij^{th}$ entry is $-1$ or $1$, if the vertices $v_i$ and $v_j$ are adjacent or non-adjacent respectively, and is $0$ , if $v_i=v_j.$ The Seidel energy of $G$ is the sum of the absolute values of the eigenvalues of its Seidel matrix. We present here some graph families which are Seidel equienergetic.
Read the full abstract