نتایج جستجو برای: euler bernoulli theory
تعداد نتایج: 799962 فیلتر نتایج به سال:
Abstract: For each n ≥ 1, let {Xn,j , j ≥ 1} be i.i.d. Bernoulli random variables with P{Xn,1 = 1} = pn = 1 − qn = 1 − P{Xn,1 = 0}, 0 < pn < 1. Define Wn,mn = ∑mn j=1 (Rn,j −an), where Rn,j = inf{k ≥ 0 : Xn,j+k = 0} is the number of success runs starting at j, mn is a sequences of positive integers, and an = pn/qn. We show that, under the condition mnpn → ∞, the central limit theorem Wn,mn σmn ...
The Euler-Bernoulli uniform elastically supported beam model with incorporated dissipation mechanisms is dealt with. Conditions are given to ensure oscillatory character of solutions.
Abstract. If {an}n=1 and {bn}n=1 are two sequences such that a1 = b1 and bn + a1bn−1 + · · ·+ an−1b1 = nan (n > 1), then we say that (an, bn) is a Newton-Euler pair. In the paper we establish many formulas for Newton-Euler pairs, and then make use of them to obtain new results concerning some special sequences such as p(n), σ(n) and Bn, where p(n) is the number of partitions of n, σ(n) is the s...
— The so-called first fundamental transformation provides a natural combinatorial link between statistics involving cycle lengths of random permutations and statistics dealing with runs on Bernoulli sequences.
Let (b n) n≥0 be the binomial transform of (a n) n≥0. We show how a binomial transformation identity of Chen proves a symmetrical Bernoulli number identity attributed to Carlitz. We then modify Chen's identity to prove a new binomial transformation identity.
ALMOST BLOCK INDEPENDENCE AND BERNOULLICITY OF Zd-ACTIONS BY AUTOMORPHISMS OF COMPACT ABELIAN GROUPS
We prove that a Z d-action by automorphisms of a compact, abelian group is Bernoulli if and only if it has completely positive entropy. The key ingredients of the proof are the extension of certain notions of asymptotic block independence from Z-actionsto Z d-action and their equivalence with Bernoullicity, and a surprisingly close link between one of these asymptotic block independence propert...
The standard textbook method for estimating the probability of a biased coin from finite tosses implicitly assumes the sample sizes are large and gives incorrect results for small samples. We describe the exact solution, which is correct for any sample size.
We study a q-logarithm which was introduced by Euler and give some of its properties. This q-logarithm did not get much attention in the recent literature. We derive basic properties, some of which were already given by Euler in a 1751-paper and 1734-letter to Daniel Bernoulli. The corresponding q-analogue of the dilogarithm is introduced. The relation to the values at 1 and 2 of a q-analogue o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید