Results 11 to 20 of about 2,300,073 (304)
On Partial Sum of Tribonacci Numbers [PDF]
International Journal of Mathematics and Mathematical Sciences, 2015 We study the sum st(k,r)=∑i=0tTki+r of k step apart Tribonacci numbers for any 1≤r≤k. We prove that st(k,r) satisfies certain Tribonacci rule st(k,r)=akst-1(k,r)+bkst-2(k,r)+st-3(k,r)+λ with integers ak,bk,ck, and λ.
Eunmi Choi, Jiin Jo
doaj +3 more sources
A new extended Mulholland's inequality involving one partial sum
Open MathematicsBy using the weight coefficients and the techniques of real analysis, a new extended Mulholland’s inequality with multi-parameters involving one partial sum is given. The equivalent statements of the best value related to several parameters are provided.
Peng Ling, Yang Bicheng
doaj +2 more sources
Random partial update sum-squared autocorrelation minimization algorithm for channel shortening (RPUSAM). [PDF]
, 2008 Partial updating is an effective method for reducing computational complexity in adaptive filter implementations. In this work, a novel random partial update sum-squared auto-correlation minimization (RPUSAM) algorithm is proposed. This algorithm has low
M. Grira (7207376) +1 more
core +7 more sources
Partially Coherent Direct Sum Channels [PDF]
Quantum, 2021 We introduce Partially Coherent Direct Sum (PCDS) quantum channels, as a generalization of the already known Direct Sum quantum channels. We derive necessary and sufficient conditions to identify the subset of those maps which are degradable, and provide a simplified expression for their quantum capacities.
Stefano Chessa, Vittorio Giovannetti
openaire +6 more sources
Partial Gaussian sums III [PDF]
Glasgow Mathematical Journal, 1989 For integers a, N and H > 0 writewhere ϰ denotes a non-principal Dirichlet character modulo the positive integer k and e(y) denotes e2πiy.
openaire +1 more source
Optimal Prefix Free Codes with Partial Sorting
Algorithms, 2019 We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within O ( n ( 1 + lg α ) ) ⊆ O ( n lg n ) , where the alternation α ∈ [ 1 . .
Jérémy Barbay
doaj +1 more source
Partial sum of eigenvalues of random graphs [PDF]
, 2019 summary:Let $G$ be a graph on $n$ vertices and let $\lambda _{1}\geq \lambda _{2}\geq \ldots \geq \lambda _{n}$ be the eigenvalues of its adjacency matrix.
Rocha, Israel +3 more
core +1 more source
Cluster sets for partial sums and partial sum processes
The Annals of Probability, 2014 Published in at http://dx.doi.org/10.1214/12-AOP827 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Einmahl, Uwe, Kuelbs, Jim
openaire +5 more sources
Partial sum process of orthogonal series as rough process [PDF]
, 2016 In this thesis, we investigate the pathwise regularity of partial sum process of general orthogonal series, and prove that the partial sum process is a geometric 2-rough process under the same condition as in Menshov-Rademacher Theorem.
core +1 more source
Karbala International Journal of Modern Science, 2019 In this paper, we introduce and study a new class A^* (λ,μ,ν,η,p,ζ,τ) of meromorphic multivalent functions defined by fractional calculus operator of the punctured unit disc U^*.
Aqeel Ketab AL-khafaji +2 more
doaj +1 more source