اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSome binomial sums involving absolute values
103
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider several families of binomial sum identities whose definition involves the absolute value function. In particular, we consider centered double sums of the form [S_{alpha,beta}(n) := sum_{k,;ell}binom{2n}{n+k}binom{2n}{n+ell} |k^alpha-ell^alpha|^beta,] obtaining new results in the cases $alpha = 1, 2$. We show that there is a close connection between these double sums in the case $alpha=1$ and the single centered binomial sums considered by Tuenter.
قيم البحث
اقرأ أيضاً
Recently, Ni and Pan proved a $q$-congruence on certain sums involving central $q$-binomial coefficients, which was conjectured by Guo. In this paper, we give a generalization of this $q$-congruence and confirm another $q$-congruence, also conjecture
d by Guo. Our proof uses Ni and Pans technique and a simple $q$-congruence observed by Guo and Schlosser.
Let svec = (s_1,...,s_m) and tvec = (t_1,...,t_n) be vectors of nonnegative integer-valued functions of m,n with equal sum S = sum_{i=1}^m s_i = sum_{j=1}^n t_j. Let M(svec,tvec) be the number of m*n matrices with nonnegative integer entries such tha
t the i-th row has row sum s_i and the j-th column has column sum t_j for all i,j. Such matrices occur in many different settings, an important example being the contingency tables (also called frequency tables) important in statistics. Define s=max_i s_i and t=max_j t_j. Previous work has established the asymptotic value of M(svec,tvec) as m,ntoinfty with s and t bounded (various authors independently, 1971-1974), and when svec,tvec are constant vectors with m/n,n/m,s/n >= c/log n for sufficiently large (Canfield and McKay, 2007). In this paper we extend the sparse range to the case st=o(S^(2/3)). The proof in part follows a previous asymptotic enumeration of 0-1 matrices under the same conditions (Greenhill, McKay and Wang, 2006). We also generalise the enumeration to matrices over any subset of the nonnegative integers that includes 0 and 1.
Denote by $tau$ k (n), $omega$(n) and $mu$ 2 (n) the number of representations of n as product of k natural numbers, the number of distinct prime factors of n and the characteristic function of the square-free integers, respectively. Let [t] be the i
ntegral part of real number t. For f = $omega$, 2 $omega$ , $mu$ 2 , $tau$ k , we prove that n x f x n = x d 1 f (d) d(d + 1) + O $epsilon$ (x $theta$ f +$epsilon$) for x $rightarrow$ $infty$, where $theta$ $omega$ = 53 110 , $theta$ 2 $omega$ = 9 19 , $theta$ $mu$2 = 2 5 , $theta$ $tau$ k = 5k--1 10k--1 and $epsilon$ > 0 is an arbitrarily small positive number. These improve the corresponding results of Bordell{`e}s.
In this note, we extend the definition of multiple harmonic sums and apply their stuffle relations to obtain explicit evaluations of the sums $R_n(p,t)=sum olimits_{m=0}^n m^p H_m^t$, where $H_m$ are harmonic numbers. When $tle 4$ these sums were fir
st studied by Spiess around 1990 and, more recently, by Jin and Sun. Our key step first is to find an explicit formula of a special type of the extended multiple harmonic sums. This also enables us to provide a general structural result of the sums $R_n(p,t)$ for all $tge 0$.
The Clopper-Pearson confidence interval has ever been documented as an exact approach in some statistics literature. More recently, such approach of interval estimation has been introduced to probabilistic control theory and has been referred as non-
conservative in control community. In this note, we clarify the fact that the so-called exact approach is actually conservative. In particular, we derive analytic results demonstrating the extent of conservatism in the context of probabilistic robustness analysis. This investigation encourages seeking better methods of confidence interval construction for robust control purpose.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
