Báo cáo toán học: "Optimal Penney Ante Strategy via Correlation Polynomial Identities" pdf

... q/(q − 1). the electronic journal of combinatorics 13 (2006), #R35 14 Optimal Penney Ante Strategy via Correlation Polynomial Identities Daniel Felix Department of Mathematics University of California ... 1980): 1171-1176. [5] W. Penney, Problem 95: penney- ante, Journal of Recreational Mathematics 2 (1969): 241. [6] D. Stark, First occurrence in pairs of long words: a penney-...

Ngày tải lên: 07/08/2014, 13:21

Ngày tải lên: 07/08/2014, 06:23

... case N 0 = 450. We can proceed by analogy for the other cases, except for N 0 = 1050, so we will obviate their analysis. For N 0 = 450, we have lb(450) = 35 that is 35 = 3x −1 for x = 12, then i ... d(L)=D(N)andgcd(l, w)=1 (if gcd(l, w) > 1 and gcd(h, y) = 1, the proof is made by analogy.) Theorem 1 guarantees that L realizes a double-loop digraph G(N; s 1 ,s 2 )withD(N ; s 1 ,s 2 )=D(N)....

Ngày tải lên: 07/08/2014, 07:21

... simplicial complex ∆  via an ele- mentary collapse if ∆  \ ∆={σ, τ} and σ  τ. This means that τ istheonlyfacein ∆  properly containing σ. If ∆ can be obtained from ∆  via a sequence of elementary the ... incomparable in the diagram means that neither of the properties implies the other. We list the nontrivial cases: the electronic journal of combinatorics 12 (2005), #R3 14 1. {σ, τ }...

Ngày tải lên: 07/08/2014, 08:22

... ≡  λ i (c) 7 (mod 2). When the hypothetical code C is viewed as a space over GF(2), the sum on the right is a polynomial function of degree at most 3; so too is the function c → 1+wt(c) (mod 2). As the GF(2) dimension

Ngày tải lên: 07/08/2014, 13:21

... background and introducing our notation. By k we always denote an arbitrary field, and S is the polynomial ring over k in variables V = {x 1 , . . . , x n } with the usual Z-grading. For a squarefree ... ra, 309 (2007), 405 -425. [12] H.T. H`a, A. Van Tuyl, Resolutions of squarefree monomial ideals via facet ideals: a survey, Contemp. Math., 448 (2007), 91-117. [13] S. Jacques, Betti numbe...

Ngày tải lên: 07/08/2014, 21:21

... the following theorem, imply- ing that s(46) = 7, and that the optimal packing of 46 is the trivial one. Its proof is surprisingly simple for such a large case, in particular when compared to ... s(m 2 − 3) = m for m = 4, 7, implying that the most efficient packings of 13 and 46 squares are the trivial ones. The study of packing unit squares into a square goes back to Erd˝os and Graham [2], who...

Ngày tải lên: 08/08/2014, 12:22

... length. Columns: lavg, lmin, Imax average, minimum, and maximum fragment length; and davg average deviation. by the preferred fragment length requirement. Table 1 summarizes the effect of the scaling ... over those 8 sections of Mars that have a length of at least 20 para- graphs. The average deviation davg with respect to the preferred fragment length p is defined as davg = (~-&...

Ngày tải lên: 31/03/2014, 04:20

... sample = mod ( input sample, correlation buffer size ) (7) correlation buffer size = NFFT + correlation window size (8) Figure 15 compares the performance of the two CP correlation algorithms. Thefigureshowsanobvious improvement ... 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Pf Pd FWT alone FWT + P-SCH Correlation FFT + Fine CP correlation FFT alone Figure 18 A graph showing the ef...

Ngày tải lên: 20/06/2014, 20:20

... Figure 2 Figure 4 This Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available ... emissions. In this context, the aim of our work was the development of an easy and inexpensive strategy for the minimization of high COD loads in textile wastewaters occurring in the enzymatic ... methane-conta...

Ngày tải lên: 20/06/2014, 21:20