Longtime behaviour and bursting frequency, via a simple formula, of FitzHugh–Rinzel neurons

The longtime behaviour of the FitzHugh–Rinzel (FHR) neurons and the transition to instability of the FHR steady states, are investigated. Criteria guaranteeing solutions boundedness, absorbing sets, in the energy phase space, existence and steady states instability via oscillatory bifurcations, are obtained. Denoting by $$ \lambda ^{3} + \sum\nolimits_{{k = 1}}^{3} {A_{k} } (R)\lambda ^{{3 - k}} = 0 $$ λ 3 + ∑ k = 1 3 A k ( R ) λ 3 - k = 0 , with R bifurcation parameter, the spectrum equation of a steady state $$m_0$$ m 0 , linearly asymptotically stable at certain value of R, the frequency f of an oscillatory destabilizing bifurcation (neuron bursting frequency), is shown to be $$ f=\displaystyle \frac{\sqrt{A_2(R_\mathrm{H})}}{2\pi } $$ f = A 2 ( R H ) 2 π with $$R_\mathrm{H}$$ R H location of R at which the bifurcation occurs. The instability coefficient power (ICP) (Rionero in Rend Fis Acc Lincei 31:985–997, 2020; Fluids 6(2):57, 2021) for the onset of oscillatory bifurcations, is introduced, proved and applied, in a new version.

Construction of LDPC convolutional codes via difference triangle sets

In this paper, a construction of $$(n,k,\delta )$$ ( n , k , δ ) LDPC convolutional codes over arbitrary finite fields, which generalizes the work of Robinson and Bernstein and the later work of Tong is provided. The sets of integers forming a (k, w)-(weak) difference triangle set are used as supports of some columns of the sliding parity-check matrix of an $$(n,k,\delta )$$ ( n , k , δ ) convolutional code, where $$n\in {\mathbb {N}}$$ n ∈ N , $$n>k$$ n > k . The parameters of the convolutional code are related to the parameters of the underlying difference triangle set. In particular, a relation between the free distance of the code and w is established as well as a relation between the degree of the code and the scope of the difference triangle set. Moreover, we show that some conditions on the weak difference triangle set ensure that the Tanner graph associated to the sliding parity-check matrix of the convolutional code is free from $$2\ell $$ 2 ℓ -cycles not satisfying the full rank condition over any finite field. Finally, we relax these conditions and provide a lower bound on the field size, depending on the parity of $$\ell $$ ℓ , that is sufficient to still avoid $$2\ell $$ 2 ℓ -cycles. This is important for improving the performance of a code and avoiding the presence of low-weight codewords and absorbing sets.

Infinite-dimensional manifolds related to C-spaces

Haver's property C turns out to be related to Borst's transfinite extension of the covering dimension. We prove that, for a uncountably many countable ordinals β there exists a strongly universal kω-space for the class of spaces of transfinite covering dimension <β. In some sense, our result is a kω-counterpart of Radul's theorem on existence of absorbing sets of given transfinite covering dimension.

Pullback Attractors for a Nonautonomous Retarded Degenerate Parabolic Equation

This paper is devoted to a nonautonomous retarded degenerate parabolic equation. We first show the existence and uniqueness of a weak solution for the equation by using the standard Galerkin method. Then we establish the existence of pullback attractors for the equation by proving the existence of compact pullback absorbing sets and the pullback asymptotic compactness.