If k < n, can one express the majority of n bits as the majority of at most k majorities, each of at most k bits? We prove that such an expression is possible only if k & n = n. This improves on a bound proved by Kulikov and Podolskii [KP17], who showed that k & n. Our proof is based on ideas originating in discrepancy theory, as well as a strong concentration bound for sums of independent Bern...

Several attempts have been made to give an objective definition of subjective probability. These attempts can be divided into two approaches. The first approach uses an a priori probability distribution over the set of interpretations of the language that we are using to describe information. The idea is to define such an a priori probability distribution using some general principles such as t...

General inequalities for the distribution of the longest success run in Bernoulli trials are found through a direct combinatorial analysis. Their employment allows the derivation of a new lower bound which can be used in the achievement of theoretical results.

Let X1,X2, . . . ,Xn be independent Bernoulli random variables with P(Xj = 1) = 1 − P(Xj = 0)= pj and let Sn := X1 +X2 + ···+Xn. Sn is called a Poisson binomial random variable and it is well known that the distribution of a Poisson binomial random variable can be approximated by the standard normal distribution. In this paper, we use Taylor’s formula to improve the approximation by adding some...

We study a coupled fluid-structure system. The structure corresponds to a part of the boundary of a domain containing an incompressible viscous fluid. The structure displacement is modeled by a damped beam equation. We prove the existence of strong solutions to our system for small data and the existence of local strong solutions for any initial data.

Remark added May 1997 This paper was a preliminary version of the paper \Some harmonic analysis questions suggested by Anderson-Bernoulli models" by the same authors. It is being posted here because setion 5 contains proofs of some minor results which are stated but not proved in the paper submitted for publication. Speci ̄cally, Proposition 4.8 in the version submitted is proved di®erently here...

An ordinary block design has v points, blocks of size k, and each of the ( v 2 ) unordered pairs of points is contained in a common number λ of blocks. In 2007, Sarvate and Beam introduced a variation where rather than covering all pairs a constant number of times, one wishes to cover all pairs a different number of times. It is of greatest interest when these pair frequencies form an interval ...

not only provides an elegant formula for evaluating ζ(2n), but it also tells us of the arithmetical nature of ζ(2n). In contrast, we know very little about ζ(2n + 1). One of the major achievements in number theory in the past half-century is R. Apéry’s proof that ζ(3) is irrational [2], but for n ≥ 2, the arithmetical nature of ζ(2n+ 1) remains open. Ramanujan made many beautiful and elegant di...