Results 21 to 30 of about 216,465 (259)
Pellans sequence and its diophantine triples
Publications de l'Institut Mathematique, 2016 We introduce a novel fourth order linear recurrence sequence {Sn} using the two periodic binary recurrence. We call it ?pellans sequence? and then we solve the system ab+1=Sx, ac+1=Sy bc+1=Sz where a < b < c are positive integers. Therefore, we extend the order of recurrence sequence for this variant diophantine equations by means of ...
Irmak, Nurettin, Alp, Murat
openaire +2 more sources
Spreading Code Estimation of Multi-rate LC-DS-CDMA Signal Using Triple Feature Information [PDF]
Jisuanji gongcheng, 2019 Aiming at the problem of spreading code estimation of multi-rate Long Code Direct Sequence Code Division Multiple Access (LC-DS-CDMA) signal,a matching estimation method based on triple correlation feature information is proposed.Considering the ...
QIANG Fangfang,ZHAO Zhijin
doaj +1 more source
On Intuitionistic Fuzzy Metric Space and Ideal Convergence of Triple Sequence Space [PDF]
Sahand Communications in Mathematical Analysis, 2023 The purpose of this article is to introduce the triple sequences and its convergence over instuitionistic fuzzy metric space (\textbf{IFMS}). The article also discusses ideal convergence of triple sequences, the uniqueness of ideal limits, the ...
Shailendra Pandit, Ayaz Ahmad, Ayhan Esi
doaj +1 more source
Seven-Cluster Structure of Larch Chloroplast Genome [PDF]
Журнал Сибирского федерального университета: Серия Биология, 2015 The paper presents a novel approach to study a nucleotide sequence structure with respect to the chloroplast genome DNA sequence analysis. A specific frequencies distribution pattern of the consecutive triple nucleotide fragments was identified in the ...
Michael G. Sadovsky +5 more
doaj +1 more source
Inversion Sequences Avoiding a Triple of Patterns of 3 Letters
The Electronic Journal of Combinatorics, 2023 An inversion sequence of length $n$ is a sequence of integers $e=e_1\cdots e_n$ which satisfies for each $i\in[n]=\{1,2,\ldots,n\}$ the inequality $0\le e_i < i$. For a set of patterns $P$, we let $\mathbf{I}_n(P)$ denote the set of inversion sequences of length $n$ that avoid all the patterns from~$P$.
David Callan +2 more
openaire +3 more sources
A Note on Triple Repetition Sequence of Domination Number in Graphs
InPrime, 2022 A set D subset of V(G) is a dominating set of a graph G if for all x ϵ V(G)\D, for some y ϵ D such that xy ϵ E(G). A dominating set D subset of V(G) is called a connected dominating set of a graph G if the subgraph induced by D is connected.
Leomarich F. Casinillo +2 more
doaj +1 more source
Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 A proof tableau of Hoare logic is an annotated program with pre- and post-conditions, which corresponds to an inference tree of Hoare logic. In this paper, we show that a proof tableau for partial correctness can be transformed into an inference sequence
Shinnosuke Mizutani, Naoki Nishida
doaj +1 more source
Rough statistical convergence on triple sequences [PDF]
Proyecciones (Antofagasta), 2017 In this paper, using the concept of natural density, we introduce the notion of rough statistical convergence of triple sequences. We define the set of rough statistical limit points of a triple sequence and obtain rough statistical convergence criteria associated with this set.
Debnath, Shyamal, Subramanian, N.
openaire +2 more sources
Generalized Beatty sequences and complementary triples [PDF]
Moscow Journal of Combinatorics and Number Theory, 2019 A generalized Beatty sequence is a sequence $V$ defined by $V(n)=p\lfloor{nα}\rfloor+qn +r$, for $n=1,2,\dots$, where $α$ is a real number, and $p,q,r$ are integers. These occur in several problems, as for instance in homomorphic embeddings of Sturmian languages in the integers.
Allouche, Jean-Paul, Dekking, F. Michel
openaire +3 more sources
Mismatch and G-stack modulated probe signals on SNP microarrays. [PDF]
PLoS ONE, 2009 BACKGROUND: Single nucleotide polymorphism (SNP) arrays are important tools widely used for genotyping and copy number estimation. This technology utilizes the specific affinity of fragmented DNA for binding to surface-attached oligonucleotide DNA probes.
Hans Binder, Mario Fasold, Torsten Glomb
doaj +1 more source