Counting Markov Types
|
|
- Shavonne Terry
- 6 years ago
- Views:
Transcription
1 Counting Markov Types Philippe Jacquet, Charles Knessl, Wojciech Szpankowski To cite this version: Philippe Jacquet, Charles Knessl, Wojciech Szpankowski. Counting Markov Types. Drmota, Michael and Gittenberger, Bernhard. 2st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA 0), 200, Vienna, Austria. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AM, 2st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA 0), pp , 200, DMTCS Proceedings. <0.09/TIT >. <hal > HAL Id: hal Submitted on 20 Aug 205 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
2 AofA 0 DMTCS proc. AM, 200, Counting Markov Types Philippe Jacquet Charles Knessl 2 Wojciech Szpankowski 3 INRIA, Rocquencourt, 7853 Le Chesnay Cedex, France. Philippe.Jacquet@inria.fr 2 Dept. Math. Stat. & Compt. Sci., Univ. of Illinois at Chicago, Chicago, IL , U.S.A. knessl@uic.edu 3 Department of Computer Science, Purdue University, West Lafayette, IN, USA. spa@cs.purdue.edu The method of types is one of the most popular techniques in information theory and combinatorics. Two sequences of equal length have the same type if they have identical empirical distributions. In this paper, we focus on Markov types, that is, sequences generated by a Markov source (of order one). We note that sequences having the same Markov type share the same so called balanced frequency matrix that counts the number of distinct pairs of symbols. We enumerate the number of Markov types for sequences of length n over an alphabet of size m. This turns out to coincide with the number of the balanced frequency matrices as well as with the number of special linear diophantine equations, and also balanced directed multigraphs. For fixed m we prove that the number of Markov types is asymptotically equal to n m2 m d(m) (m 2 m)!, where d(m) is a constant for which we give an integral representation. For m we conclude that asymptotically the number of types is equivalent to 2m 3m/2 e m2 m 2m2 2 m nm πm/2 provided that m = o(n /4 ) (however, our techniques work for m = o( n)). These findings are derived by analytical techniques ranging from multidimensional generating functions to the saddle point method. Keywords: Markov types, integer matrices, linear diophantine equations, multidimensional generating functions, saddle point method 2 m Introduction The method of types is one of the most popular and useful techniques in information theory (e.g., source and channel coding) and combinatorics. Two sequences of equal length are of the same type if they have identical empirical distributions. The essence of the method of types was known for some time in probability and statistical physics. But only in the 970 s Csiszár and his group developed a general This author was supported by NSF Grant DMS and NSA Grant H The work of this author was supported by NSF STC Grant CCF , NSF Grants DMS , and CCF , and NSA Grant H c 200 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France
3 388 Philippe Jacquet, Charles Knessl, Wojciech Szpankowski method and made it a basic tool of information theory of discrete memoryless systems [5]; see also [4, 6, 9,, 2, 4, 20, 2]. In this paper, we discuss Markov types. For concreteness, we first focus on Markov sources of order one. Let A = {, 2,..., m} be an m-ary alphabet, and consider a class of Markov distributions P n (m) on A n, n. We often simply write P n := P n (m). Throughout, we study sequences x n = x... x n of length n. For a distribution P P n the type class of x n is defined as T n (x n ) = {y n : P (x n ) = P (y n )}, that is, all sequences having the same distribution as P (x n ). Clearly, x T n(x n ) = A n. The number n of type classes, or equivalently, the number of distinct distributions, is therefore equal to the cardinality of P n (m) that we also often simplify to P n := P n (m). We aim at deriving an asymptotic expression for P n for fixed or large m when n. For example, for binary memoryless sources, there are P n (2) = n + type classes, and a class consisting of all sequences containing k s has cardinality T n (x n ) = ( n k). Markov sources X t and corresponding Markov types are completely characterized by their transition probabilities that we denote by P, that is P = {p ij } i,j A is the transition matrix of p ij = P (X t+ = j X t = i). The empirical distribution of a sequence x n (with some fixed initial state) is P (x n ) = i,j A where k ij is the number of pairs (ij) A 2 in the sequence x n. For example, P (00) = p 2 0p 0 p. In passing we should point out that in the above p ij can be viewed either as a formal indeterminate or, better, as the ratio of the number of pairs (ij) A 2 to the length of the string (empirical distribution). For a fixed transition matrix P, the frequency matrix k = {k ij } i,j A defines a type class. This matrix is an integer matrix satisfying two properties: k ij = n, and additionally for any i A [, 2] j= i,j A p kij ij, m m k ij = k ji ± δ(x = x n ), i A, j= where δ(a) = when A is true and zero otherwise. The last property is called the flow conservation property and is a consequence of the fact that the number of pairs starting with symbols i A must equal to the number of pairs ending with symbol i A with the possible exception of the last pair. To avoid this exception, throughout we only consider cyclic strings in which the first element x follows the last x n. Thus, we consider integer matrices k = [k ij ] satisfying the following two properties k ij = n, () i,j A m k ij = j= m k ji, i A. (2) j=
4 Counting Markov Types 389 Such integer matrices k will be called balanced frequency matrices. We shall call (2) the conservation law equation. In this paper, we enumerate the number of Markov types P n which coincides with the number of distinct balanced frequency matrices satisfying () and (2). Example. Let s first consider a binary Markov source. The balanced frequency matrix is of the following form [ ] k k k = 2 k 2 k 22 where the nonnegative integers k ij satisfy k + k 2 + k 2 + k 22 = n, The above system of linear equations can be reduced to k 2 = k 2. k + 2k 2 + k 22 = n, (3) and the enumeration of Markov types over a binary alphabet reduces to finding the number of nonnegative solutions of (3). The answer is obviously P n = = n 2 k 2=0 (n 2k 2 + ) ( n 2 + ) n (n + ) = n O(n). Let s now look at the m = 3 case. The balanced frequency matrix has nine elements {k ij } i,j {,2,3}, and they satisfy k + k 2 + k 3 + k 2 + k 22 + k 23 + k 3 + k 32 + k 33 = n k 2 + k 3 = k 2 + k 3 k 2 + k 32 = k 2 + k 23 k 3 + k 23 = k 3 + k 32. How many nonnegative integer solutions does the above system of linear equations have? We shall show that it is asymptotically n6 2 6!. Our goal is to enumerate the number of Markov classes, that is, to find (asymptotically) the cardinality of P n. Our previous example demonstrated that this number coincides with the number of nonnegative integer solutions to the system of linear equations ()-(2). Such an enumeration, for a general class of system of homogeneous diophantine equations, was investigated in Chap. 4.6 of Stanley s book [6] (cf. also [0]). Stanley developed a general theory to construct the associated generating function. However, ultimately only the denominator of this generating function is given in a semi-explicit form in [6], thus allowing the author to derive the growth rate of the number of integer solutions. In this paper, we propose an approach based on previous work of Jacquet and Szpankowski [] where analytic techniques such as multidimensional generating functions and the saddle point method were used.
5 390 Philippe Jacquet, Charles Knessl, Wojciech Szpankowski This allows us to derive precise asymptotic results. In particular, for fixed m we prove that the number of Markov types is asymptotically equal to n m2 m P n d(m) (m 2 m)!, n, where d(m) is a constant for which we only found an integral representation. (i) For large m with m 4 = o(n) we find that asymptotically the number of types is P n 2m 3m/2 e m2 m 2m2 2 m nm πm/2 However, our techniques also allow us to derive asymptotics for m 2 = o(n). In passing we observe that the number of Markov types are often needed for minimax redundancy evaluation [, 2,, 3, 5, 9]. Markov types were studied in a series of papers; see [, 2, 20, 2]. However, existing literature mostly concentrates on finding the cardinality of a Markov type class, that is, T (x n ) with an exception of Martin et al. [2]. In particular, Whittle [2] already in 955 computed T (x n ) for Markov chains of order one Regarding the number of types, it was known for a long while [4, 5, 6] that they grow polynomially, but only in [20] Weinberger et al. mentioned (without proof) that P n = Θ(n m2 m ). This was recently rigorously proved by Martin et al. in [2] for tree sources (that include Markov sources) for fixed m. However, the constant was never identified. We accomplish it here, as well as present asymptotic results for large m. The paper is organized as follows. In Section 2 we formulate precisely our problem and present our main results for fixed and large m. The proofs are given in Section 3. 2 Main Results In this section we present our main results and some of their consequences. We start with some notation. Throughout the paper, we let F be the set of all integer matrices k satisfying the conservation law equation (2), that is, m m k ij = k ji, i A. j= j= For a given n, we let F n be a subset of F consisting of matrices k such that the balance equations () and (2) hold. We first make some general observations about generating functions over matrices, and summarize some results obtained in []. In general, let g k be a sequence of scalars indexed by matrices k and define the generating function G(z) = g k z k k where the summation is over all integer matrices and z = {z ij } i,j A is an m m matrix that we often denote simply as z = [z ij ] (assuming the indices i and j run from to m). Here z k = i,j zkij where 2 m. (i) It is a simple exercise to extend these results to r order Markov chains. Indeed, one needs to replace m by m r.
6 Counting Markov Types 39 k ij is the entry in row i column j in the matrix k. We denote by G (z) = g k z k = g k z k k F n 0 k F n the F-generating function of g k, that is, the generating function of g k over matrices k F satisfying the balance equations () and (2). The following useful lemma is proved in [] but for completeness we x repeat it here. Let [z i ij x j ] be the matrix (x)z (x) where (x) = diag(x,..., x m ) is a diagonal matrix with elements x,..., x m, that is, the element z ij in z is replaced by z ij x i /x j. Lemma Let G(z) = k g kz k be the generating function of a complex matrix z. Then G (z) := ( ) m g k z k dx dxm x j = G([z ij ]) (4) 2iπ x x m x i n 0 k F n x with the convention that the ij-th coefficient of [z j x ij x i ] is z j ij x i, and i = x. In other words, [z j ij x i ] = (x)z (x) where (x) = diag(x,..., x m ). By the change of variables x i = exp(iθ i ) we also have G (z) = (2π) m dθ where [z ij exp(θ j θ i )] = exp( (θ))z exp( (θ)). Proof. Observe that G( (x)z (x)) = G([z ij x j x i ]) = k dθ m G([z ij exp((θ j θ i )i)] g k z k m i= j x kji j kij i. (5) Therefore, G x (z) is the coefficient of G([z j ij x i ]) at x 0 x 0 2 x 0 m since j k ji j k ij = 0 for matrices k F. We write it in shortly as G (z) = [ ] x 0 x 0 x j m g([zij x i ]). The result follows from the Cauchy coefficient formula (cf. [8]). We consider the number of Markov types P n (m) over the alphabet A, whose generating function is F m(z) = n 0 P n (m) z n. Then applying the above lemma with z ij = zx i /x j we conclude that Fm(z) = ( z) m [x0 x 0 2 x 0 m] [ z x ] i (6) x j i j and thus, by the Cauchy formula, P n (m) = [z n ]F m(z) = 2πi F m (z) dz. zn+ In the next section we evaluate asymptotically this expression to yield the following main result of this paper
7 392 Philippe Jacquet, Charles Knessl, Wojciech Szpankowski Theorem (i) For fixed m and n the number of Markov types is n m2 m P n (m) = d(m) (m 2 m)! + 2 O(nm m ) (7) where d(m) is a constant that also can be expressed by the following integral d(m) = (2π) m (ii) When m we find that } {{ } (m ) fold m j= + φ 2 j k l + (φ k φ l ) 2 dφ dφ 2 dφ m. (8) P n (m) 2m 3m/2 e m2 m 2m2 2 m nm πm/2 2 m (9) provided that m 4 = o(n). Remark. It is easy to count the number of matrices k satisfying only equation (), that is, ij k ij = n. Indeed, in this case, it coincides with the number of integer solution of (), which turns out to be the number of combinations with repetitions (the number of ways of selecting m 2 objects from n), that is, ( n + m 2 ) ( n + m 2 ) = n m 2 n m2. Thus the conservation law equation (2) decreases the above by the factor Θ(n m ). Remark 2. The evaluation of the integral (8) is quite cumbersome, but for small values of m we computed it to find that P n (2) n 2 2 2! P n (3) n 6 2 6! P n (4) P n (5) n ! n 20 20! (0) () (2) (3) for large n. It appears that the coefficients of n m2 m are rational numbers, though we have no proof of this. Remark 3. We now compare the coefficient at n m2 m for fixed m in (7) with its asymptotic counterpart in (9). They are shown in Table. Observe extremely small values of these constants even for relatively small m.
8 Counting Markov Types 393 Tab. : Constants at n m2 m for fixed m and large m. m constant in (7) constant in (9) Analysis and Proofs In this section we prove Theorem. Our starting formula is (6) that we repeat below Fm(z) = ( z) m [x0 x 0 2 x 0 m] [ z x ] i. (4) x j i j We first compute this explicitly for m = 2, 3, 4, 5. When m = 2, we have [ F2 (z) = ( z) 2 [x0 x 0 2] z x /x 2 z x 2 /x ]. (5) Let us set A = x /x 2 so we need the coefficient of A 0 in ( Az) ( z/a). Using a partial fractions expression in A, we have Az z/a = [ z 2 Az + z ]. A z For definiteness, we can assume that z < A < /z so that the coefficient of A 0 in ( Az) is one and that in z(a z) is zero. Hence, F 2 (z) = ( z) 2 ( z 2 ) = ( + z) ( z) 3 and P n (2) = 2πi z n+ + z ( z) 3 dz = n2 4 + n [ + ( )n ] 2 n 2, n. (6) 2! For m 3 we use recursive partial fractions expansions. When m = 3 we set x /x 2 = A, x /x 3 = B so that we wish to compute ( ) [A 0 B 0 ]. (7) za z/a Bz z/b Az/B Bz/A
9 394 Philippe Jacquet, Charles Knessl, Wojciech Szpankowski First we do a partial fractions expansion in the A variable, for fixed B and z. Thus the factor inside the parentheses in (7) becomes To coefficient of A 0 in the first term in (8) is and that in the third term is za z 2 Bz z/b /B Bz 2 z/a z 2 Bz z/b z 2 /B B Az/B B z 2 /B B/z z/b z 2 Bz/A Bz 2 /B Bz z/b z 2. (8) z 2 Bz B z 2 /B z/b Bz /B z/b Bz 2, (9) z 2, (20) while the coefficients of A 0 are zero in the second and fourth terms. Combining (9) and (20) we must now compute ( ) + z [B 0 2 ] z 2 Bz z/b Bz 2 z 2. (2) /B Now expanding (2) by a partial fractions expansion in B leads to + z 2 ( z 2 [B0 ] Bz z 2 z z 2 + z/b z 2 z 3 z + /z z 3 Bz 2 z 4 + ) z 3 /z z 4 z 2 /B Hence, = + z2 z 2 [ z 2 z z 3 + z ( z) F 3 (z) = For z, F 3 (z) 2 ( z) 7 so that z 3 z 4 ] = z + z 2 ( z) 7 ( + z) 2 ( + z + z 2 ). P n (3) 2 z + z 2 ( z) 4 ( + z) 2 ( + z + z 2 ). n 6, n. (22) 6! Using similar recursive partial fractions expansions, with the help of the symbolic computation program MAPLE, we find that for m = 4 and m = 5 F 4 (z) = z8 2z 7 + 3z 6 + 2z 5 2z 4 + 2z 3 + 3z 2 2z + ( z) 3 ( + z) 5 ( + z 2 )( + z + z 2 ) 2 (23)
10 Counting Markov Types 395 Tab. 2: Poles and their orders for various m. m\ root e ±2πi/3 ±i e ±2πi/5 e ±4πi/ and where F 5 (z) = Q(z) ( z) 2 ( + z) 8 ( + z 2 ) 2 ( + z + z 2 ) 4 ( + z + z 2 + z 3 + z 4 ), (24) Q(z) = z 20 3z 9 + 7z 8 + 3z 7 + 2z 6 + 7z z z z z + 72z z z z z 6 + 7z 5 + 2z 4 + 3z 3 + 7z 2 3z +. These results show that it is unlikely that a simple formula can be found for F m(z) for general m. By expanding (23) and (24) near z = we conclude that as n P n (4) 96 n 2 2!, P n(5) n 20 20!. (25) It is easy to inductively show that at z =, Fm(z) has a pole of order m 2 m + and the other singularities are poles at the roots of unity that are of order < m 2 m +. These poles and their orders are given in Table 2. Thus, for n, we have where n m2 m P n (m) d(m) (m 2 m)!, (26) d(m) = lim[( z) m2 m+ F m(z)] as z. However, there seems to be no simple formula for the sequence of constants d(m). We proceed to characterize d(m) as an (m ) fold integral. First consider the simple case m = 2. Setting A = e iφ and using a Cauchy integral, we have [A 0 ] z/a Az = 2π dφ 2z cos Φ + z 2.
11 396 Philippe Jacquet, Charles Knessl, Wojciech Szpankowski Now set z = δ and expand the integral for z. The major contribution will come from where δ 0 and scaling Φ = δφ and using the Taylor expansion 2( δ) cos(δφ)+( δ) 2 = δ 2 [+φ 2 ]+O(δ 3 ), we find that F 2 (z) δ 2 2π δ δ 2 [ + φ 2 ] dφ = 2 δ 3, δ 0. When m = 3, we use (3.4) and the Cauchy integral formula with A = e iφ and B = e iψ to get (2π) 2 2z cos Φ + z 2 2z cos Ψ + z 2 2z cos(φ Ψ) + z 2 dφdψ. Again expanding the above for z = δ and Φ = δφ = O(δ), Ψ = δψ = O(δ), we obtain the leading order approximation δ 4 (2π) 2 + φ 2 + ψ 2 + (φ ψ) 2 dφdψ = δ 4 2. Thus as z, F 3 (z) 2 δ 7 = 2 ( z) 7 which follows also from the exact generating function. For general m a completely analogous calculation shows that F m(z) δ m m2 d(m), as δ = z 0, where d(m) = (2π) m } {{ } (m ) fold m j= + φ 2 j k l + (φ k φ l ) 2 dφ dφ 2 dφ m. (27) We have verified that for m = 4 and m = 5, the integral agrees with our previous results. The second product in the above is over all distinct pairs (k, l), so that this may also be written as m 2 m l= k=l+ + (φ k φ l ) 2. (28) This completes the proof of part (i) of Theorem. We now use the saddle point method to prove part (ii) of Theorem. Since and setting z i = e iθi we find that F m(z) = (2iπ) m k ij ( z z ) kij i = ( z z i ) z j z j = (2π) m ij ( z z i z j ) dz z dz m z m (29) ( z exp(i(θ i θ j )) dθ dθ m. (30) ij
12 Counting Markov Types 397 By noticing that the expression ij ( z exp(i(θ i θ j )) does not change when the θ i are all incremented of the same value, one can integrate over θ to obtain Let now Fm(z) = (2π) m+ z i>,j> ( z exp(iθ i )) ( z exp( iθ i )) i ( z exp(i(θ i θ j )) dθ 2 dθ m. (3) L(z, θ 2,..., θ m ) = log( z) + log( z exp(iθ i ))( z exp( iθ i )) i + log( z exp(i(θ i θ j )). An alternative form of the above is i>,j> L(z, θ 2,..., θ m ) = log( z) m i=2 j=2 m log( 2z cos θ i + z 2 ) i=2 m log( 2z cos(θ i θ j ) + z 2 ). Notice that L(z, 0,..., 0) = m 2 log( z). Hence π P n (m) = i(2π) m exp( L(z, θ 2,..., θ m )) dz z n+ dθ 2 dθ m. (32) In order to find the asymptotics of this integral we use the multidimensional saddle point method [8]. The quantity L(z, θ 2,..., θ m ) + n log z attains its minimum value at (θ 2,..., θ m ) = (0,..., 0) and z = z n =. The minimum value is therefore or Then n m 2 +n m 2 log( z n ) + n log z n = m 2 log(m 2 /(m 2 + n)) + n log(n/(m 2 + n)) m 2 log(m 2 ) + n log(n) (m 2 + n) log(m 2 + n). m 2 log( z n ) + n log z n = m 2 log m 2 m 2 log n m 2 + O(m 4 /n) provided that m 4 = o(n). After computations it turns out that at this point (z, θ 2,..., θ m ) = (z n, 0,..., 0): i : 2 z 2 L(z, θ 2,..., θ m ) = m2 ( z n ) 2 2 z θ i L(z, θ 2,..., θ m ) = 0
13 398 Philippe Jacquet, Charles Knessl, Wojciech Szpankowski i j : i : 2 θ 2 i L(z, θ 2,..., θ m ) = 2(m )z n ( z n ) 2 2 θ i θ j L(z, θ 2,..., θ m ) = 2z n ( z n ) 2, m 3. In other words, the second derivative matrix Q 2 of L(z, θ 2,..., θ m ) + n log z at (z, θ 2,..., θ m ) = (z n, 0,..., 0) is Q 2 = ( m2 ( z n ) 2 n ) (z n ) 2 u z u z + 2mz n ( z n ) 2 I 2z n θ ( z n ) 2 u θ u θ where u z = (, 0,..., 0), u θ = m (0,,..., ), and I θ = I u z u z, i.e., the identity restricted on θ components. In the above is the tensor product (in our case, it is a product of two vectors resulting in a matrix). For example, u θ u θ = An application of the saddle point method yields P n (m) where det( ) denotes the determinant of a matrix. Since det(q 2 ) = we find that for m 4 = o(n) (2π) m/2 z n det(q2 ) exp( m2 log( z n ) n log z n ) ( m 2 ( z n ) 2 + n ) ( ) m z n (z n ) 2 ( z n ) 2 2 m m m 2 n 2m m 3m 2 m, P n (m) ( m 2m2 +3m/2 e m2 2 m π m/2 ) 2 n m2 m, and this completes the proof. The condition m 4 = o(n) is needed since we used the approximation for m 2 log( z n ) below (32). References [] K. Atteson, The Asymptotic Redundancy of Bayes Rules for Markov Chains, IEEE Trans. on Information Theory, 45, , 999.
14 Counting Markov Types 399 [2] A. Barron, J. Rissanen, and B. Yu, The Minimum Description Length Principle in Coding and Modeling, IEEE Trans. Information Theory, 44, , 998. [3] P. Billingsley, Statistical Methods in Markov Chains, Ann. Math. Statistics, 32, 2-40, 96. [4] T. Cover and J.A. Thomas, Elements of Information Theory, John Wiley & Sons, New York, 99. [5] I. Cszizar and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic Press, New York, 98. [6] I. Cszizar, The Method of Types, IEEE Trans. Information Theory, 44, , 998. [7] L. D. Davisson, Universal Noiseless Coding, IEEE Trans. Information Theory, 9, , 973. [8] L. D. Davisson, Minimax Noiseless Universal coding for Markov Sources, IEEE Trans. Information Theory, 29, 2-25, 983. [9] M. Drmota and W. Szpankowski, Precise Minimax Redundancy and Regret, IEEE Trans. Information Theory, 50, , [0] P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge University Press, Cambridge, [] P. Jacquet and W. Szpankowski, Markov Types and Minimax Redundancy for Markov Sources, IEEE Trans. Information Theory, 50, , [2] A. Martín, G. Seroussi, and M. J. Weinberger, Type classes of tree models, Proc. ISIT 2007, Nice, France, [3] J. Rissanen, Fisher Information and Stochastic Complexity, IEEE Trans. Information Theory, 42, 40-47, 996. [4] G. Seroussi, On Universal Types, IEEE Trans. Information Theory, 52, 7-89, [5] P. Shields, Universal Redundancy Rates Do Not Exist, IEEE Trans. Information Theory, 39, , 993. [6] R. Stanley, Enumerative Combinatorics, Vol. II, Cambridge University Press, Cambridge, 999. [7] W. Szpankowski, On Asymptotics of Certain Recurrences Arising in Universal Coding, Problems of Information Transmission, 34, 55-6, 998. [8] W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Wiley, New York, 200. [9] Q. Xie, A. Barron, Asymptotic Minimax Regret for Data Compression, Gambling, and Prediction, IEEE Trans. Information Theory, 46, , [20] M. J. Weinberger, N. Merhav, and M. Feder, Optimal sequential probability assignment for individual sequences, IEEE Trans. Inf. Theory, 40, , 994. [2] P. Whittle, Some Distribution and Moment Formulæ for Markov Chain, J. Roy. Stat. Soc., Ser. B., 7, , 955.
15 400 Philippe Jacquet, Charles Knessl, Wojciech Szpankowski
Hook lengths and shifted parts of partitions
Hook lengths and shifted parts of partitions Guo-Niu Han To cite this version: Guo-Niu Han Hook lengths and shifted parts of partitions The Ramanujan Journal, 009, 9 p HAL Id: hal-00395690
More informationOn size, radius and minimum degree
On size, radius and minimum degree Simon Mukwembi To cite this version: Simon Mukwembi. On size, radius and minimum degree. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no.
More informationAnalysis of Boyer and Moore s MJRTY algorithm
Analysis of Boyer and Moore s MJRTY algorithm Laurent Alonso, Edward M. Reingold To cite this version: Laurent Alonso, Edward M. Reingold. Analysis of Boyer and Moore s MJRTY algorithm. Information Processing
More informationA Context free language associated with interval maps
A Context free language associated with interval maps M Archana, V Kannan To cite this version: M Archana, V Kannan. A Context free language associated with interval maps. Discrete Mathematics and Theoretical
More informationOn infinite permutations
On infinite permutations Dmitri G. Fon-Der-Flaass, Anna E. Frid To cite this version: Dmitri G. Fon-Der-Flaass, Anna E. Frid. On infinite permutations. Stefan Felsner. 2005 European Conference on Combinatorics,
More informationA new simple recursive algorithm for finding prime numbers using Rosser s theorem
A new simple recursive algorithm for finding prime numbers using Rosser s theorem Rédoane Daoudi To cite this version: Rédoane Daoudi. A new simple recursive algorithm for finding prime numbers using Rosser
More informationOn Symmetric Norm Inequalities And Hermitian Block-Matrices
On Symmetric Norm Inequalities And Hermitian lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna On Symmetric Norm Inequalities And Hermitian lock-matrices 015 HAL Id: hal-0131860
More informationMethylation-associated PHOX2B gene silencing is a rare event in human neuroblastoma.
Methylation-associated PHOX2B gene silencing is a rare event in human neuroblastoma. Loïc De Pontual, Delphine Trochet, Franck Bourdeaut, Sophie Thomas, Heather Etchevers, Agnes Chompret, Véronique Minard,
More informationComputable priors sharpened into Occam s razors
Computable priors sharpened into Occam s razors David R. Bickel To cite this version: David R. Bickel. Computable priors sharpened into Occam s razors. 2016. HAL Id: hal-01423673 https://hal.archives-ouvertes.fr/hal-01423673v2
More informationThe Windy Postman Problem on Series-Parallel Graphs
The Windy Postman Problem on Series-Parallel Graphs Francisco Javier Zaragoza Martínez To cite this version: Francisco Javier Zaragoza Martínez. The Windy Postman Problem on Series-Parallel Graphs. Stefan
More informationA Simple Proof of P versus NP
A Simple Proof of P versus NP Frank Vega To cite this version: Frank Vega. A Simple Proof of P versus NP. 2016. HAL Id: hal-01281254 https://hal.archives-ouvertes.fr/hal-01281254 Submitted
More informationThe Accelerated Euclidean Algorithm
The Accelerated Euclidean Algorithm Sidi Mohamed Sedjelmaci To cite this version: Sidi Mohamed Sedjelmaci The Accelerated Euclidean Algorithm Laureano Gonzales-Vega and Thomas Recio Eds 2004, University
More informationFull-order observers for linear systems with unknown inputs
Full-order observers for linear systems with unknown inputs Mohamed Darouach, Michel Zasadzinski, Shi Jie Xu To cite this version: Mohamed Darouach, Michel Zasadzinski, Shi Jie Xu. Full-order observers
More informationEaster bracelets for years
Easter bracelets for 5700000 years Denis Roegel To cite this version: Denis Roegel. Easter bracelets for 5700000 years. [Research Report] 2014. HAL Id: hal-01009457 https://hal.inria.fr/hal-01009457
More informationA Slice Based 3-D Schur-Cohn Stability Criterion
A Slice Based 3-D Schur-Cohn Stability Criterion Ioana Serban, Mohamed Najim To cite this version: Ioana Serban, Mohamed Najim. A Slice Based 3-D Schur-Cohn Stability Criterion. ICASSP 007, Apr 007, Honolulu,
More informationNorm Inequalities of Positive Semi-Definite Matrices
Norm Inequalities of Positive Semi-Definite Matrices Antoine Mhanna To cite this version: Antoine Mhanna Norm Inequalities of Positive Semi-Definite Matrices 15 HAL Id: hal-11844 https://halinriafr/hal-11844v1
More informationOn Symmetric Norm Inequalities And Hermitian Block-Matrices
On Symmetric Norm Inequalities And Hermitian lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna On Symmetric Norm Inequalities And Hermitian lock-matrices 016 HAL Id: hal-0131860
More informationMinimax Redundancy for Large Alphabets by Analytic Methods
Minimax Redundancy for Large Alphabets by Analytic Methods Wojciech Szpankowski Purdue University W. Lafayette, IN 47907 March 15, 2012 NSF STC Center for Science of Information CISS, Princeton 2012 Joint
More informationSoundness of the System of Semantic Trees for Classical Logic based on Fitting and Smullyan
Soundness of the System of Semantic Trees for Classical Logic based on Fitting and Smullyan Shahid Rahman To cite this version: Shahid Rahman. Soundness of the System of Semantic Trees for Classical Logic
More informationOn one class of permutation polynomials over finite fields of characteristic two *
On one class of permutation polynomials over finite fields of characteristic two * Leonid Bassalygo, Victor A. Zinoviev To cite this version: Leonid Bassalygo, Victor A. Zinoviev. On one class of permutation
More informationCompleteness of the Tree System for Propositional Classical Logic
Completeness of the Tree System for Propositional Classical Logic Shahid Rahman To cite this version: Shahid Rahman. Completeness of the Tree System for Propositional Classical Logic. Licence. France.
More informationOn Newton-Raphson iteration for multiplicative inverses modulo prime powers
On Newton-Raphson iteration for multiplicative inverses modulo prime powers Jean-Guillaume Dumas To cite this version: Jean-Guillaume Dumas. On Newton-Raphson iteration for multiplicative inverses modulo
More informationQuestion order experimental constraints on quantum-like models of judgement
Question order experimental constraints on quantum-like models of judgement Patrick Cassam-Chenaï To cite this version: Patrick Cassam-Chenaï. Question order experimental constraints on quantum-like models
More informationSmart Bolometer: Toward Monolithic Bolometer with Smart Functions
Smart Bolometer: Toward Monolithic Bolometer with Smart Functions Matthieu Denoual, Gilles Allègre, Patrick Attia, Olivier De Sagazan To cite this version: Matthieu Denoual, Gilles Allègre, Patrick Attia,
More informationExact Comparison of Quadratic Irrationals
Exact Comparison of Quadratic Irrationals Phuc Ngo To cite this version: Phuc Ngo. Exact Comparison of Quadratic Irrationals. [Research Report] LIGM. 20. HAL Id: hal-0069762 https://hal.archives-ouvertes.fr/hal-0069762
More informationChebyshev polynomials, quadratic surds and a variation of Pascal s triangle
Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle Roland Bacher To cite this version: Roland Bacher. Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle.
More informationThe Mahler measure of trinomials of height 1
The Mahler measure of trinomials of height 1 Valérie Flammang To cite this version: Valérie Flammang. The Mahler measure of trinomials of height 1. Journal of the Australian Mathematical Society 14 9 pp.1-4.
More informationSolution to Sylvester equation associated to linear descriptor systems
Solution to Sylvester equation associated to linear descriptor systems Mohamed Darouach To cite this version: Mohamed Darouach. Solution to Sylvester equation associated to linear descriptor systems. Systems
More informationDYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS
DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS Issam Naghmouchi To cite this version: Issam Naghmouchi. DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS. 2010. HAL Id: hal-00593321 https://hal.archives-ouvertes.fr/hal-00593321v2
More informationSome tight polynomial-exponential lower bounds for an exponential function
Some tight polynomial-exponential lower bounds for an exponential function Christophe Chesneau To cite this version: Christophe Chesneau. Some tight polynomial-exponential lower bounds for an exponential
More informationOn the longest path in a recursively partitionable graph
On the longest path in a recursively partitionable graph Julien Bensmail To cite this version: Julien Bensmail. On the longest path in a recursively partitionable graph. 2012. HAL Id:
More informationb-chromatic number of cacti
b-chromatic number of cacti Victor Campos, Claudia Linhares Sales, Frédéric Maffray, Ana Silva To cite this version: Victor Campos, Claudia Linhares Sales, Frédéric Maffray, Ana Silva. b-chromatic number
More informationLinear Quadratic Zero-Sum Two-Person Differential Games
Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard To cite this version: Pierre Bernhard. Linear Quadratic Zero-Sum Two-Person Differential Games. Encyclopaedia of Systems and Control,
More informationA simple kinetic equation of swarm formation: blow up and global existence
A simple kinetic equation of swarm formation: blow up and global existence Miroslaw Lachowicz, Henryk Leszczyński, Martin Parisot To cite this version: Miroslaw Lachowicz, Henryk Leszczyński, Martin Parisot.
More informationFrom Unstructured 3D Point Clouds to Structured Knowledge - A Semantics Approach
From Unstructured 3D Point Clouds to Structured Knowledge - A Semantics Approach Christophe Cruz, Helmi Ben Hmida, Frank Boochs, Christophe Nicolle To cite this version: Christophe Cruz, Helmi Ben Hmida,
More informationThomas Lugand. To cite this version: HAL Id: tel
Contribution à la Modélisation et à l Optimisation de la Machine Asynchrone Double Alimentation pour des Applications Hydrauliques de Pompage Turbinage Thomas Lugand To cite this version: Thomas Lugand.
More informationAnalysis of tree algorithm for collision resolution
Analysis of tree algorithm for collision resolution Laszlo Gyorfi, Sándor Gyori To cite this version: Laszlo Gyorfi, Sándor Gyori. Analysis of tree algorithm for collision resolution. Conrado Martìnez.
More informationA Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence
A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence Dedicated to Philippe Flajolet 1948-2011 July 4, 2013 Philippe Jacquet Charles Knessl 1 Wojciech Szpankowski 2 Bell Labs Dept. Math.
More informationLow frequency resolvent estimates for long range perturbations of the Euclidean Laplacian
Low frequency resolvent estimates for long range perturbations of the Euclidean Laplacian Jean-Francois Bony, Dietrich Häfner To cite this version: Jean-Francois Bony, Dietrich Häfner. Low frequency resolvent
More informationThe FLRW cosmological model revisited: relation of the local time with th e local curvature and consequences on the Heisenberg uncertainty principle
The FLRW cosmological model revisited: relation of the local time with th e local curvature and consequences on the Heisenberg uncertainty principle Nathalie Olivi-Tran, Paul M Gauthier To cite this version:
More informationWidely Linear Estimation with Complex Data
Widely Linear Estimation with Complex Data Bernard Picinbono, Pascal Chevalier To cite this version: Bernard Picinbono, Pascal Chevalier. Widely Linear Estimation with Complex Data. IEEE Transactions on
More informationA non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications
A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications Alexandre Sedoglavic To cite this version: Alexandre Sedoglavic. A non-commutative algorithm for multiplying (7 7) matrices
More informationFORMAL TREATMENT OF RADIATION FIELD FLUCTUATIONS IN VACUUM
FORMAL TREATMENT OF RADIATION FIELD FLUCTUATIONS IN VACUUM Frederic Schuller, Renaud Savalle, Michael Neumann-Spallart To cite this version: Frederic Schuller, Renaud Savalle, Michael Neumann-Spallart.
More informationNegative results on acyclic improper colorings
Negative results on acyclic improper colorings Pascal Ochem To cite this version: Pascal Ochem. Negative results on acyclic improper colorings. Stefan Felsner. 005 European Conference on Combinatorics,
More informationHardware Operator for Simultaneous Sine and Cosine Evaluation
Hardware Operator for Simultaneous Sine and Cosine Evaluation Arnaud Tisserand To cite this version: Arnaud Tisserand. Hardware Operator for Simultaneous Sine and Cosine Evaluation. ICASSP 6: International
More informationDispersion relation results for VCS at JLab
Dispersion relation results for VCS at JLab G. Laveissiere To cite this version: G. Laveissiere. Dispersion relation results for VCS at JLab. Compton Scattering from Low to High Momentum Transfer, Mar
More informationOn the link between finite differences and derivatives of polynomials
On the lin between finite differences and derivatives of polynomials Kolosov Petro To cite this version: Kolosov Petro. On the lin between finite differences and derivatives of polynomials. 13 pages, 1
More informationFiniteness properties for Pisot S-adic tilings
Finiteness properties for Pisot S-adic tilings Pierre Arnoux, Valerie Berthe, Anne Siegel To cite this version: Pierre Arnoux, Valerie Berthe, Anne Siegel. Finiteness properties for Pisot S-adic tilings.
More informationCase report on the article Water nanoelectrolysis: A simple model, Journal of Applied Physics (2017) 122,
Case report on the article Water nanoelectrolysis: A simple model, Journal of Applied Physics (2017) 122, 244902 Juan Olives, Zoubida Hammadi, Roger Morin, Laurent Lapena To cite this version: Juan Olives,
More informationSome explanations about the IWLS algorithm to fit generalized linear models
Some explanations about the IWLS algorithm to fit generalized linear models Christophe Dutang To cite this version: Christophe Dutang. Some explanations about the IWLS algorithm to fit generalized linear
More informationPosterior Covariance vs. Analysis Error Covariance in Data Assimilation
Posterior Covariance vs. Analysis Error Covariance in Data Assimilation François-Xavier Le Dimet, Victor Shutyaev, Igor Gejadze To cite this version: François-Xavier Le Dimet, Victor Shutyaev, Igor Gejadze.
More informationHypertree-Width and Related Hypergraph Invariants
Hypertree-Width and Related Hypergraph Invariants Isolde Adler, Georg Gottlob, Martin Grohe To cite this version: Isolde Adler, Georg Gottlob, Martin Grohe. Hypertree-Width and Related Hypergraph Invariants.
More informationAdditive tree functionals with small toll functions and subtrees of random trees
Additive tree functionals with small toll functions and subtrees of random trees Stephan Wagner To cite this version: Stephan Wagner. Additive tree functionals with small toll functions and subtrees of
More informationA new approach of the concept of prime number
A new approach of the concept of prime number Jamel Ghannouchi To cite this version: Jamel Ghannouchi. A new approach of the concept of prime number. 4 pages. 24. HAL Id: hal-3943 https://hal.archives-ouvertes.fr/hal-3943
More informationThe core of voting games: a partition approach
The core of voting games: a partition approach Aymeric Lardon To cite this version: Aymeric Lardon. The core of voting games: a partition approach. International Game Theory Review, World Scientific Publishing,
More informationNumerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models
Numerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models Florian Lemarié To cite this version: Florian Lemarié. Numerical
More informationCutwidth and degeneracy of graphs
Cutwidth and degeneracy of graphs Benoit Kloeckner To cite this version: Benoit Kloeckner. Cutwidth and degeneracy of graphs. IF_PREPUB. 2009. HAL Id: hal-00408210 https://hal.archives-ouvertes.fr/hal-00408210v1
More informationDissipative Systems Analysis and Control, Theory and Applications: Addendum/Erratum
Dissipative Systems Analysis and Control, Theory and Applications: Addendum/Erratum Bernard Brogliato To cite this version: Bernard Brogliato. Dissipative Systems Analysis and Control, Theory and Applications:
More informationL institution sportive : rêve et illusion
L institution sportive : rêve et illusion Hafsi Bedhioufi, Sida Ayachi, Imen Ben Amar To cite this version: Hafsi Bedhioufi, Sida Ayachi, Imen Ben Amar. L institution sportive : rêve et illusion. Revue
More informationParallel Repetition of entangled games on the uniform distribution
Parallel Repetition of entangled games on the uniform distribution André Chailloux, Scarpa Giannicola To cite this version: André Chailloux, Scarpa Giannicola. Parallel Repetition of entangled games on
More informationOn a series of Ramanujan
On a series of Ramanujan Olivier Oloa To cite this version: Olivier Oloa. On a series of Ramanujan. Gems in Experimental Mathematics, pp.35-3,, . HAL Id: hal-55866 https://hal.archives-ouvertes.fr/hal-55866
More informationUnfolding the Skorohod reflection of a semimartingale
Unfolding the Skorohod reflection of a semimartingale Vilmos Prokaj To cite this version: Vilmos Prokaj. Unfolding the Skorohod reflection of a semimartingale. Statistics and Probability Letters, Elsevier,
More informationTHE BAYESIAN ABEL BOUND ON THE MEAN SQUARE ERROR
THE BAYESIAN ABEL BOUND ON THE MEAN SQUARE ERROR Alexandre Renaux, Philippe Forster, Pascal Larzabal, Christ Richmond To cite this version: Alexandre Renaux, Philippe Forster, Pascal Larzabal, Christ Richmond
More informationThere are infinitely many twin primes 30n+11 and 30n+13, 30n+17 and 30n+19, 30n+29 and 30n+31
There are infinitely many twin primes 30n+11 and 30n+13, 30n+17 and 30n+19, 30n+29 and 30n+31 Sibiri Christian Bandre To cite this version: Sibiri Christian Bandre. There are infinitely many twin primes
More informationOn path partitions of the divisor graph
On path partitions of the divisor graph Paul Melotti, Eric Saias To cite this version: Paul Melotti, Eric Saias On path partitions of the divisor graph 018 HAL Id: hal-0184801 https://halarchives-ouvertesfr/hal-0184801
More informationOn The Exact Solution of Newell-Whitehead-Segel Equation Using the Homotopy Perturbation Method
On The Exact Solution of Newell-Whitehead-Segel Equation Using the Homotopy Perturbation Method S. Salman Nourazar, Mohsen Soori, Akbar Nazari-Golshan To cite this version: S. Salman Nourazar, Mohsen Soori,
More informationPasserelle entre les arts : la sculpture sonore
Passerelle entre les arts : la sculpture sonore Anaïs Rolez To cite this version: Anaïs Rolez. Passerelle entre les arts : la sculpture sonore. Article destiné à l origine à la Revue de l Institut National
More informationAlmost Cover-Free Codes and Designs
Almost Cover-Free Codes and Designs A.G. D Yachkov, I.V. Vorobyev, N.A. Polyanskii, V.Yu. Shchukin To cite this version: A.G. D Yachkov, I.V. Vorobyev, N.A. Polyanskii, V.Yu. Shchukin. Almost Cover-Free
More informationEfficient Subquadratic Space Complexity Binary Polynomial Multipliers Based On Block Recombination
Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based On Block Recombination Murat Cenk, Anwar Hasan, Christophe Negre To cite this version: Murat Cenk, Anwar Hasan, Christophe Negre.
More informationSolving an integrated Job-Shop problem with human resource constraints
Solving an integrated Job-Shop problem with human resource constraints Olivier Guyon, Pierre Lemaire, Eric Pinson, David Rivreau To cite this version: Olivier Guyon, Pierre Lemaire, Eric Pinson, David
More informationEvolution of the cooperation and consequences of a decrease in plant diversity on the root symbiont diversity
Evolution of the cooperation and consequences of a decrease in plant diversity on the root symbiont diversity Marie Duhamel To cite this version: Marie Duhamel. Evolution of the cooperation and consequences
More informationVibro-acoustic simulation of a car window
Vibro-acoustic simulation of a car window Christophe Barras To cite this version: Christophe Barras. Vibro-acoustic simulation of a car window. Société Française d Acoustique. Acoustics 12, Apr 12, Nantes,
More informationLower bound of the covering radius of binary irreducible Goppa codes
Lower bound of the covering radius of binary irreducible Goppa codes Sergey Bezzateev, Natalia Shekhunova To cite this version: Sergey Bezzateev, Natalia Shekhunova. Lower bound of the covering radius
More informationNotes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices Fanny Dufossé, Bora Uçar To cite this version: Fanny Dufossé, Bora Uçar. Notes on Birkhoff-von Neumann decomposition of doubly
More informationThe height of watermelons with wall - Extended Abstract
The height of watermelons with wall - Extended Abstract Thomas Feierl To cite this version: Thomas Feierl. The height of watermelons with wall - Extended Abstract. Jacquet, Philippe. 2007 Conference on
More informationCan we reduce health inequalities? An analysis of the English strategy ( )
Can we reduce health inequalities? An analysis of the English strategy (1997-2010) Johan P Mackenbach To cite this version: Johan P Mackenbach. Can we reduce health inequalities? An analysis of the English
More informationSymmetric Norm Inequalities And Positive Semi-Definite Block-Matrices
Symmetric Norm Inequalities And Positive Semi-Definite lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna Symmetric Norm Inequalities And Positive Semi-Definite lock-matrices 15
More informationLearning an Adaptive Dictionary Structure for Efficient Image Sparse Coding
Learning an Adaptive Dictionary Structure for Efficient Image Sparse Coding Jérémy Aghaei Mazaheri, Christine Guillemot, Claude Labit To cite this version: Jérémy Aghaei Mazaheri, Christine Guillemot,
More informationOn the Griesmer bound for nonlinear codes
On the Griesmer bound for nonlinear codes Emanuele Bellini, Alessio Meneghetti To cite this version: Emanuele Bellini, Alessio Meneghetti. On the Griesmer bound for nonlinear codes. Pascale Charpin, Nicolas
More informationA note on the computation of the fraction of smallest denominator in between two irreducible fractions
A note on the computation of the fraction of smallest denominator in between two irreducible fractions Isabelle Sivignon To cite this version: Isabelle Sivignon. A note on the computation of the fraction
More informationTowards an active anechoic room
Towards an active anechoic room Dominique Habault, Philippe Herzog, Emmanuel Friot, Cédric Pinhède To cite this version: Dominique Habault, Philippe Herzog, Emmanuel Friot, Cédric Pinhède. Towards an active
More informationapproximation results for the Traveling Salesman and related Problems
approximation results for the Traveling Salesman and related Problems Jérôme Monnot To cite this version: Jérôme Monnot. approximation results for the Traveling Salesman and related Problems. Information
More informationSolving the neutron slowing down equation
Solving the neutron slowing down equation Bertrand Mercier, Jinghan Peng To cite this version: Bertrand Mercier, Jinghan Peng. Solving the neutron slowing down equation. 2014. HAL Id: hal-01081772
More informationThe sound power output of a monopole source in a cylindrical pipe containing area discontinuities
The sound power output of a monopole source in a cylindrical pipe containing area discontinuities Wenbo Duan, Ray Kirby To cite this version: Wenbo Duan, Ray Kirby. The sound power output of a monopole
More informationAll Associated Stirling Numbers are Arithmetical Triangles
All Associated Stirling Numbers are Arithmetical Triangles Khaled Ben Letaïef To cite this version: Khaled Ben Letaïef. All Associated Stirling Numbers are Arithmetical Triangles. 2017.
More informationA NUMERICAL NOTE ON UPPER BOUNDS FOR B 2 [g] SETS
A UMERICAL OTE O UPPER BOUDS FOR B [g] SETS Laurent Habsieger, Alain Plagne To cite this version: Laurent Habsieger, Alain Plagne. A UMERICAL OTE O UPPER BOUDS FOR B [g] SETS. 016. HAL
More informationNumerical Exploration of the Compacted Associated Stirling Numbers
Numerical Exploration of the Compacted Associated Stirling Numbers Khaled Ben Letaïef To cite this version: Khaled Ben Letaïef. Numerical Exploration of the Compacted Associated Stirling Numbers. 2017.
More informationA non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications
A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications Alexandre Sedoglavic To cite this version: Alexandre Sedoglavic. A non-commutative algorithm for multiplying (7 7) matrices
More informationA proximal approach to the inversion of ill-conditioned matrices
A proximal approach to the inversion of ill-conditioned matrices Pierre Maréchal, Aude Rondepierre To cite this version: Pierre Maréchal, Aude Rondepierre. A proximal approach to the inversion of ill-conditioned
More informationUnbiased minimum variance estimation for systems with unknown exogenous inputs
Unbiased minimum variance estimation for systems with unknown exogenous inputs Mohamed Darouach, Michel Zasadzinski To cite this version: Mohamed Darouach, Michel Zasadzinski. Unbiased minimum variance
More informationSome diophantine problems concerning equal sums of integers and their cubes
Some diophantine problems concerning equal sums of integers and their cubes Ajai Choudhry To cite this version: Ajai Choudhry. Some diophantine problems concerning equal sums of integers and their cubes.
More informationSound intensity as a function of sound insulation partition
Sound intensity as a function of sound insulation partition S. Cvetkovic, R. Prascevic To cite this version: S. Cvetkovic, R. Prascevic. Sound intensity as a function of sound insulation partition. Journal
More informationSome approaches to modeling of the effective properties for thermoelastic composites
Some approaches to modeling of the ective properties for thermoelastic composites Anna Nasedkina Andrey Nasedkin Vladimir Remizov To cite this version: Anna Nasedkina Andrey Nasedkin Vladimir Remizov.
More informationComments on the method of harmonic balance
Comments on the method of harmonic balance Ronald Mickens To cite this version: Ronald Mickens. Comments on the method of harmonic balance. Journal of Sound and Vibration, Elsevier, 1984, 94 (3), pp.456-460.
More informationNew estimates for the div-curl-grad operators and elliptic problems with L1-data in the half-space
New estimates for the div-curl-grad operators and elliptic problems with L1-data in the half-space Chérif Amrouche, Huy Hoang Nguyen To cite this version: Chérif Amrouche, Huy Hoang Nguyen. New estimates
More informationTwo-step centered spatio-temporal auto-logistic regression model
Two-step centered spatio-temporal auto-logistic regression model Anne Gégout-Petit, Shuxian Li To cite this version: Anne Gégout-Petit, Shuxian Li. Two-step centered spatio-temporal auto-logistic regression
More informationEvaluation of the Magnetic Fields and Mutual Inductance between Circular Coils Arbitrarily Positioned in Space
valuation of the Magnetic Fields and Mutual Inductance between Circular Coils Arbitrarily Positioned in Space Ao Anele, Y Hamam, L Chassagne, J Linares, Y Alayli, Karim Djouani To cite this version: Ao
More informationA generalization of Cramér large deviations for martingales
A generalization of Cramér large deviations for martingales Xiequan Fan, Ion Grama, Quansheng Liu To cite this version: Xiequan Fan, Ion Grama, Quansheng Liu. A generalization of Cramér large deviations
More informationA note on the acyclic 3-choosability of some planar graphs
A note on the acyclic 3-choosability of some planar graphs Hervé Hocquard, Mickael Montassier, André Raspaud To cite this version: Hervé Hocquard, Mickael Montassier, André Raspaud. A note on the acyclic
More informationUnderstanding SVM (and associated kernel machines) through the development of a Matlab toolbox
Understanding SVM (and associated kernel machines) through the development of a Matlab toolbox Stephane Canu To cite this version: Stephane Canu. Understanding SVM (and associated kernel machines) through
More information