Results 11 to 20 of about 356 (201)
Deciphering the RRM-RNA recognition code: A computational analysis.
PLoS Computational Biology, 2023 RNA recognition motifs (RRM) are the most prevalent class of RNA binding domains in eucaryotes. Their RNA binding preferences have been investigated for almost two decades, and even though some RRM domains are now very well described, their RNA ...
Joel Roca-Martínez +3 more
doaj +1 more source
The probabilistic number theory and continuum
Lietuvos Matematikos Rinkinys, 1999 Let bn be a sequence of real numbers increasing unboundedly, α > 0 and B(n, α) = [bn α]. The conditions on bn are considered, which imply the regularity of distribution of B(n, α) in arithmetic progressions for almost all α > 0.
Vilius Stakėnas
doaj +3 more sources
A new factor theorem for generalized absolute Riesz summability
Karpatsʹkì Matematičnì Publìkacìï, 2019 The aim of this paper is to consider an absolute summability method and generalize a theorem concerning $\left|\bar{N},p_{n}\right|_{k}$ summability of infinite series to ${\varphi-\mid{\bar{N},p_n;\delta}\mid}_k$ summability of infinite series by using ...
A. Karakaş
doaj +1 more source
A Theorem on Absolute Summability of Infinite Series
Cumhuriyet Science Journal, 2019 Inthis paper, a theorem on absolute summability of infinite series is obtained bytaking almost increasing sequence instead of positive non-decreasing sequence.Also, some results of absolute summability are given.
Bağdagül Kartal
doaj +1 more source
A New Application of Almost Increasing Sequences
Annals of the Alexandru Ioan Cuza University - Mathematics, 2015 Abstract Bor has proved a main theorem dealing with | N̄ , pn|k summability factors of infinite series. In this paper, we have generalized this theorem to the φ − |A, pn|k summability factors, under weaker conditions by using an almost increasing sequence instead of a positive monotonic non-decreasing sequence.
Keten, Ayşegül, Özarslan, Hikmet
openaire +2 more sources
An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A graph $G$ is a $2$-tree if $G=K_3$, or $G$ has a vertex $v$ of degree 2, whose neighbors are adjacent, and $G-v$ is a 2-tree. Clearly, if $G$ is a 2-tree on $n$ vertices, then $|E(G)|=2n-3$.
De-Yan Zeng, Jian-Hua Yin
doaj +1 more source
Sequential Action of Different Fiber-Degrading Enzymes Enhances the Degradation of Corn Stover
Agriculture, 2022 Corn stover is one of the most agricultural residue abundances over the world; however, it is extremely prevented from microbial and enzymatic degradation into monomers because of the complex chemical and physical structure.
Shengguo Zhao +3 more
doaj +1 more source
On the quasi-monotone and almost increasing sequences [PDF]
Journal of Mathematical Inequalities, 2007 In this paper, a theorem of Bor and ¨ Ozarslan (3) dealing with | C,α;β |k summability factors has been generalized for | C,α,γ;β | k summability methods.
ÖZARSLAN, Hikmet, Bor, Hüseyin
openaire +2 more sources
Maximal increasing sequences in fillings of almost-moon polyominoes [PDF]
Advances in Applied Mathematics, 2015 It was proved by Rubey that the number of fillings with zeros and ones of a given moon polyomino thatdo not contain a northeast chain of a fixed size depends only on the set of column lengths of the polyomino. Rubey’sproof uses an adaption of jeu de taquin and promotion for arbitrary fillings of moon polyominoes and deduces theresult for 01-fillings ...
Svetlana Poznanovic, Catherine H. Yan
openaire +5 more sources
Quasi β-power increasing sequences
International Journal of Mathematics and Mathematical Sciences, 2004 We prove a theorem of Mazhar (1999) on |N¯,pn|k summability factors under weaker conditions by using a quasi β-power increasing sequence instead of an almost increasing sequence.
H. Bor, L. Debnath
doaj +1 more source