arXiv Math @arxiv_math@qoto.org

We study $\mathbb{E}_n$-Koszul duality for pairs of algebras of the form $\mathrm{C}_{\bullet}(Ω^{n}_*X;\Bbbk) \leftrightarrow \mathrm{C}^{\bullet}(X;\Bbbk)$, and the closely related question of $n$-affineness for Betti stacks. It was expected, but not known, that $\mathbb{E}_n$-Koszul duality should induce a kind of Morita equivalence between categories of iterated modules. We establish this rigorously by proving that the $(\infty,n)$-category of iterated modules over $\mathrm{C}_{\bullet}(Ω_*^{n+1}X;\Bbbk)$ is equivalent to the $(\infty,n)$-category of quasi-coherent sheaves of $(\infty,n-1)$-categories on $\mathrm{cSpec}(\mathrm{C}^{\bullet}(X;\Bbbk))$, where $\mathrm{cSpec}(\mathrm{C}^{\bullet}(X;\Bbbk))$ is the cospectrum of $\mathrm{C}^{\bullet}(X;\Bbbk)$. By the monodromy equivalence, these categories are also equivalent to the category of higher local systems on $X$, $n\mathbf{LocSysCat}^{n-1}(X;\Bbbk)$. Our result is new already in the classical case $n=1$, although it can be seen to recover well known formulations of $\mathbb{E}_1$-Koszul duality as a Morita equivalence of module categories (up to appropriate completions of the $t$-structures). We also investigate (higher) affineness properties of Betti stacks. We give a complete characterization of $n$-affine Betti stacks, in terms of the $0$-affineness of their iterated loop space. As a consequence, we prove that $n$-truncated Betti stacks are $n$-affine; and that $π_{n+1}(X)$ is an obstruction to $n$-affineness.

As semantic communication (SemCom) gains increasing attention as a novel communication paradigm, ensuring the security of transmitted semantic information over open wireless channels becomes crucial. Existing secure SemCom solutions often lack explicit control over security. To address this, we propose a coding-enhanced jamming approach for secure SemCom over wiretap channels. This approach integrates deep joint source and channel coding (DeepJSCC) with neural network-based digital modulation, enabling controlled jamming through two-layer superposition coding. The outer constellation sequence encodes the source image, while the inner constellation sequence, derived from a secret image, acts as the jamming signal. By minimizing the mutual information between the outer and inner constellation sequences, the jamming effect is enhanced. The jamming signal is superposed on the outer constellation sequence, preventing the eavesdropper from recovering the source image. The power allocation coefficient (PAC) in the superposition coding can be adjusted to control system security. Experiments show that our approach matches existing methods in security while significantly improving reconstruction performance across varying channel signal-to-noise ratios (SNRs) and compression ratios.

Banyaga and Hurtubise defined the Morse-Bott-Smale chain complex as a quotient of a large chain complex by introducing five degeneracy relations. In this paper, we unify the five conditions into only one degeneracy condition. This allows for a simpler definition of Morse-Bott homology and more computable examples. Moreover, we show that our chain complex for a Morse-Smale function is quasi-isomorphic to the Morse-Smale-Witten chain complex. As a result, we obtain another proof of the Morse Homology Theorem.

Following our previous works on $C^*$-graph algebras and the associated Cuntz-Krieger graph families, in this paper we will try to have a look at the colored version of these structures and to see what a $C^*$-colored graph algebra might mean by employing some constructive examples very close to the toy example used in our previous works, and we also will try to study their graph theoretical properties as possible.

In this paper, by virtue of a determinantal formula for derivatives of the ratio between two differentiable functions, in view of the Faà di Bruno formula, and with the help of several identities and closed-form formulas for the partial Bell polynomials $\operatorname{B}_{n,k}$, the author establishes thirteen Maclaurin series expansions of the functions \begin{align*} &\ln\frac{\operatorname{e}^x+1}{2}, && \ln\frac{\operatorname{e}^x-1}{x}, && \ln\cosh x, \\ &\ln\frac{\sinh x}{x}, && \biggl[\frac{\ln(1+x)}{x}\biggr]^r, && \biggl(\frac{\operatorname{e}^x-1}{x}\biggr)^r \end{align*} for $r=\pm\frac{1}{2}$ and $r\in\mathbb{R}$ in terms of the Dirichlet eta function $η(1-2k)$, the Riemann zeta function $ζ(1-2k)$, and the Stirling numbers of the first and second kinds $s(n,k)$ and $S(n,k)$. presents four determinantal expressions and three recursive relations for the Bernoulli numbers $B_{2n}$. finds out three closed-form formulas for the Bernoulli numbers $B_{2n}$ and the generalized Bernoulli numbers $B_n^{(r)}$ in terms of the Stirling numbers of the second kind $S(n,k)$, and deduce two combinatorial identities for the Stirling numbers of the second kind $S(n,k)$. acquires two combinatorial identities, which can be regarded as diagonal recursive relations, involving the Stirling numbers of the first and second kinds $s(n,k)$ and $S(n,k)$. recovers an integral representation and a closed-form formula, and establish an alternative explicit and closed-form formula, for the Bernoulli numbers of the second kind $b_n$ in terms of the Stirling numbers of the first kind $s(n,k)$. obtains three identities connecting the Stirling numbers of the first and second kinds $s(n,k)$ and $S(n,k)$.

We show a construction for dense 3-uniform linear hypergraphs without $3\times 3$ grids, improving the lower bound on its Turán number.

We investigate random partitions of complete graphs defined by Poissonian emsembles of Markov loops

In this study, we discuss the relationship between two families of density-power-based divergences with functional degrees of freedom -- the Hölder divergence and the functional density power divergence (FDPD) -- based on their intersection and generalization. These divergence families include the density power divergence and the $γ$-divergence as special cases. First, we prove that the intersection of the Hölder divergence and the FDPD is limited to a general divergence family introduced by Jones et al. (Biometrika, 2001). Subsequently, motivated by the fact that Hölder's inequality is used in the proofs of nonnegativity for both the Hölder divergence and the FDPD, we define a generalized divergence family, referred to as the $ξ$-Hölder divergence. The nonnegativity of the $ξ$-Hölder divergence is established through a combination of the inequalities used to prove the nonnegativity of the Hölder divergence and the FDPD. Furthermore, we derive an inequality between the composite scoring rules corresponding to different FDPDs based on the $ξ$-Hölder divergence. Finally, we prove that imposing the mathematical structure of the Hölder score on a composite scoring rule results in the $ξ$-Hölder divergence.

Nonlinear spectral problems arise across a range of fields, including mechanical vibrations, fluid-solid interactions, and photonic crystals. Discretizing infinite-dimensional nonlinear spectral problems often introduces significant computational challenges, particularly spectral pollution and invisibility, which can distort or obscure the true underlying spectrum. We present the first general, convergent computational method for computing the spectra and pseudospectra of nonlinear spectral problems. Our approach uses new results on nonlinear injection moduli and requires only minimal continuity assumptions: specifically, continuity with respect to the gap metric on operator graphs, making it applicable to a broad class of problems. We use the Solvability Complexity Index (SCI) hierarchy, which has recently been used to resolve the classical linear problem, to systematically classify the computational complexity of nonlinear spectral problems. Our results establish the optimality of the method and reveal that Hermiticity does not necessarily simplify the computational complexity of these nonlinear problems. Comprehensive examples -- including nonlinear shifts, Klein--Gordon equations, wave equations with acoustic boundary conditions, time-fractional beam equations, and biologically inspired delay differential equations -- demonstrate the robustness, accuracy, and broad applicability of our methodology.

A convergent power series solution is obtained for the SIR model, using an asymptotically motivated gauge function. For certain choices of model parameter values, the series converges over the full physical domain (i.e., for all positive time). Furthermore, the radius of convergence as a function of nondimensionalized initial susceptible and infected populations is obtained via a numerical root test.

Let $H$ be a graph with vertex set $V(H)=\{v_1, v_2, \cdots, v_k\}$. The generalized blow-up graph $H_{p_1,\ldots,p_k}^{q_1,\ldots,q_k}$ is constructed by replacing each vertex $v_i \in V(H)$ with the graph $G_i = p_iK_t \cup q_iK_1$$(i=1,2,\cdots,k)$, then connecting all vertices between $G_i$ and $G_j$ whenever $v_iv_j \in E(H)$. In this paper, we enumerate the spanning trees in generalized blow-up graphs $H_{p_1, p_2, \cdots, p_k}^{q_1, q_2, \cdots, q_k}$, which extends the results of Ge [Discrete Appl. Math. 305 (2021) 145-153], Cheng, Chen and Yan [Discrete Appl. Math. 320 (2022) 259-269]. Furthermore, we determine the resistance distances and Kirchhoff indices of generalized blow-up graphs $H_{p_1, p_2, \cdots, p_k}^{q_1, q_2, \cdots, q_k}$, which extends the results of Sun, Yang and Xu [Discrete Math. 348 (2025) 114327], Xu and Xu [Discrete Appl. Math. 362 (2025) 18-33], Ni, Pan and Zhou [Discrete Appl. Math. 362 (2025) 100-108].

The two-layer quasi-geostrophic equations (2QGE) serve as a simplified model for simulating wind-driven, stratified ocean flows. However, their numerical simulation remains computationally expensive due to the need for high-resolution meshes to capture a wide range of turbulent scales. This becomes especially problematic when several simulations need to be run because of, e.g., uncertainty in the parameter settings. To address this challenge, we propose a data-driven reduced order model (ROM) for the 2QGE that leverages randomized proper orthogonal decomposition (rPOD) and long short-term memory (LSTM) networks. To efficiently generate the snapshot data required for model construction, we apply a nonlinear filtering stabilization technique that allows for the use of larger mesh sizes compared to a direct numerical simulations (DNS). Thanks to the use of rPOD to extract the dominant modes from the snapshot matrices, we achieve up to 700 times speedup over the use of deterministic POD. LSTM networks are trained with the modal coefficients associated with the snapshots to enable the prediction of the time- and parameter-dependent modal coefficients during the online phase, which is hundreds of thousands of time faster than a DNS. We assess the accuracy and efficiency of our rPOD-LSTM ROM through an extension of a well-known benchmark called double-gyre wind forcing test. The dimension of the parameter space in this test is increased from two to four.

Recent literature reports two sectional techniques, the finite volume method [Das et al., 2020, SIAM J. Sci. Comput., 42(6): B1570-B1598] and the fixed pivot technique [Kushwah et al., 2023, Commun. Nonlinear Sci. Numer. Simul., 121(37): 107244] to solve one-dimensional collision-induced nonlinear particle breakage equation. It is observed that both the methods become inconsistent over random grids. Therefore, we propose a new birth modification strategy, where the newly born particles are proportionately allocated in three adjacent cells, depending upon the average volume in each cell. This modification technique improves the numerical model by making it consistent over random grids. A detailed convergence and error analysis for this new scheme is studied over different possible choices of grids such as uniform, nonuniform, locally-uniform, random and oscillatory grids. In addition, we have also identified the conditions upon kernels for which the convergence rate increases significantly and the scheme achieves second order of convergence over uniform, nonuniform and locally-uniform grids. The enhanced order of accuracy will enable the new model to be easily coupled with CFD-modules. Another significant advancement in the literature is done by extending the discrete model for two-dimensional equation over rectangular grids.

Let $Λ$ be an order in a division algebra over a number field. We prove, under some conditions, that $SL_3(Λ)$ is boundedly generated by elementary matrices.

The past decade has seen notable advances in our understanding of structured error-correcting codes, particularly binary Reed--Muller (RM) codes. While initial breakthroughs were for erasure channels based on symmetry, extending these results to the binary symmetric channel (BSC) and other binary memoryless symmetric (BMS) channels required new tools and conditions. Recent work uses nesting to obtain multiple weakly correlated "looks" that imply capacity-achieving performance under bit-MAP and block-MAP decoding. This paper revisits and extends past approaches, aiming to simplify proofs, unify insights, and remove unnecessary conditions. By leveraging powerful results from the analysis of boolean functions, we derive recursive bounds using two or three looks at each stage. This gives bounds on the bit error probability that decay exponentially in the number of stages. For the BSC, we incorporate level-k inequalities and hypercontractive techniques to achieve the faster decay rate required for vanishing block error probability. The results are presented in a semitutorial style, providing both theoretical insights and practical implications for future research on structured codes.

We continue the development of the theory of capturing schemes over $ω_1$ by analyzing the relation between the capturing construction schemes (whose existence is implied by Jensen's $\Diamond$-principle) and both the Continuum Hypothesis and Ostaszewski's $\clubsuit$-principle. Formally, we show that the property of being capturing can be viewed as the conjunction of two properties, one of which is implied by $\clubsuit$ and the other one by CH. We apply these principles to construct multiple gaps, entangled sets and metric spaces without uncountable monotone subspaces.

We consider the computation of internal solutions for a time domain plasma wave equation with unknown coefficients from the data obtained by sampling its transfer function at the boundary. The computation is performed by transforming known background snapshots using the Cholesky decomposition of the data-driven Gramian. We show that this approximation is asymptotically close to the projection of the true internal solution onto the subspace of background snapshots. This allows us to derive a generally applicable bound for the error in the approximation of internal fields from boundary data for a time domain plasma wave equation with an unknown potential $q$. For general $q\in L^\infty$, we prove convergence of these data generated internal fields in one dimension for two examples. The first is for piecewise constant initial data and sampling $τ$ equal to the pulse width. The second is piecewise linear initial data and sampling at half the pulse width. We show that in both cases the data generated solutions converge in $L^2$ at order $\sqrtτ$. We present numerical experiments validating the result and the sharpness of this convergence rate.

We introduce two notions of barrier certificates that use multiple functions to provide a lower bound on the probabilistic satisfaction of safety for stochastic dynamical systems. A barrier certificate for a stochastic dynamical system acts as a nonnegative supermartingale, and provides a lower bound on the probability that the system is safe. The promise of such certificates is that their search can be effectively automated. Typically, one may use optimization or SMT solvers to find such barrier certificates of a given fixed template. When such approaches fail, a typical approach is to instead change the template. We propose an alternative approach that we dub interpolation-inspired barrier certificates. An interpolation-inspired barrier certificate consists of a set of functions that jointly provide a lower bound on the probability of satisfying safety. We show how one may find such certificates of a fixed template, even when we fail to find standard barrier certificates of the same template. However, we note that such certificates still need to ensure a supermartingale guarantee for one function in the set. To address this challenge, we consider the use of $k$-induction with these interpolation-inspired certificates. The recent use of $k$-induction in barrier certificates allows one to relax the supermartingale requirement at every time step to a combination of a supermartingale requirement every $k$ steps and a $c$-martingale requirement for the intermediate steps. We provide a generic formulation of a barrier certificate that we dub $k$-inductive interpolation-inspired barrier certificate. The formulation allows for several combinations of interpolation and $k$-induction for barrier certificate. We present two examples among the possible combinations. We finally present sum-of-squares programming to synthesize this set of functions and demonstrate their utility in case studies.

We study highest weight vectors for symmetric and alternating spaces of tensors, whose dimensions are given by generalized Kronecker coefficients. We present a unified explicit construction for corresponding spanning sets of highest weight vectors and completely describe the linear relations among them. We prove that these highest weight vectors satisfy a natural yet nontrivial duality. As applications, we also give conceptual interpretations to power expansions of Cayley's first hyperdeterminant and its dual exterior Cayley form.

We bring to light a new connection between dynamics and Heegaard Floer homology. On a closed 3-manifold $Y$ we consider a pseudo-Anosov flow $ϕ$ with no perfect fits with respect to its singularity locus $L \subset Y$, or perhaps a larger collection of closed orbits. Using work of Agol and Guéritaud on veering branched surfaces we produce a chain complex computing the link Floer homology of $L$ in the framing specified by the degeneracy curves of the flow. Using work of Landry, Minsky, and Taylor we show that the generators of the chain complex correspond to certain closed multi-orbits of $ϕ$. We prove that two canonical generators $\mathbf{x}^\mathrm{top}$ and $\mathbf{x}^\mathrm{bot}$ determine non-trivial homology classes located in the $\text{spin}^\text{c}$-grading of the flow, and its opposite. Finally, we observe that our specific model of the chain complex for link Floer homology naturally supports a grading with dynamical significance. This grading, a modification of the regular Maslov grading, is shown to categorify a suitable normalization of the zeta function associated to $ϕ$.