Another bridge between Nim and Wythoff
|
|
- Ruby McBride
- 6 years ago
- Views:
Transcription
1 Another bridge between Nim and Wythoff Eric Duchene, Aviezri Fraenkel, Sylvain Gravier, Richard J. Nowakowski To cite this version: Eric Duchene, Aviezri Fraenkel, Sylvain Gravier, Richard J. Nowakowski. Another bridge between Nim and Wythoff. The Australasian Journal of Combinatorics, Combinatorial Mathematics Society of Australasia (Inc.), 9,, pp.-6. <hal-8> HAL Id: hal-8 Submitted on 8 Jul 9 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 Another bridge between Nim and Wythoff E. Duchêne, ERTé Maths à modeler, University of Liège, Belgium A. S. Fraenkel, Dept. of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76, Israel S. Gravier, ERTé Maths à modeler, Institut Fourier, Grenoble, France R. J. Nowakowski Dept of Mathematics, Dalhousie University, Halifax, Canada Abstract The P positions of both two-heap Nim and Wythoff s game are easy to describe, more so in the former than in the latter. Calculating the actual G values is easy for Nim but seemingly hard for Wythoff s game. We consider what happens when the rules for removing from both heaps are modfied in various ways. Key words: Nim, Wythoff s game, Sprague-Grundy function, impartial combinatorial game. AMS subject classification: 9A6 Abbreviated Title: Another Bridge between Nim and Wythoff. Introduction In the game of Nim, played on two heaps of tokens, the two players alternate in choosing a heap and removing any positive number of tokens from that heap. Wythoff s game is also played with two heaps, as in Nim, a player may remove any positive number from a single heap or the same positive number from both heaps, subject to the proviso that every heap remains of nonnegative size at all times. For both games, and in all other games considered in the sequel, the player first unable to move loses.
3 Definition For a position v of an impartial game, let Op(v) be the set of the options of v. That is Op(v) is the set of all the positions that can be reached from v in one move. Definition A P position is one in which the next player has no winning move and in an N position, the next player does have a winning move. In Wythoff and in nim, the position in which both heaps are empty is a P position and any position that has a move to a P position is an N position. Every move from a P position leads to an N position. Let U Z, U Z. The Minimum EXcluded value of U, denotd by Mex(U), is the smallest nonnegative integer not in U. In particular, Mex( ) =. The P and N classsification of positons can be refined. To each game position v of an impartial game we associate a nonnegative integer value G(v), called the G-value of v. This function G is called the Sprague-Grundy function. It can be defined recursively as follows: G(v) = Mex({G(u) : u Op(v)}). It is well-known that the s of the Grundy function constitute the P positions of a game. (See e.g. [,, ] for more information on the G- function.) Note that this function exists uniquely for any finite impartial acyclic game. In an acyclic game, each game position is reached at most once. Definition Given two positive integers a and b, a mod b denotes the smallest non-negative remainder of the division of a by b. Definition We denote the nim-sum of a and b by a b, that is, addition in binary without carries. (Also known as XOR or addition over GF() of a and b.) In two heap Nim, the G-value of (a, b) is a b and is a P position precisely when a = b. In Wythoff s game, the P positions are ( nτ, nτ ), where τ = ( + )/ is the golden ratio. The non-zero G-values appear to be difficult to calculate (cf. [, 6]), however they exhibit additive periodicity. See [6]. A much simplified proof is given in []. In the literature, several variations of Wythoff s game were investigated, some concerning its P positions, others its Sprague-Grundy function. The variations can be subdivided mainly into two categories: (i) extensions,
4 i.e., adjoining new rules to those of Wythoff, and (ii), restrictions, where only certain subsets of Wythoff s moves are permitted. Most investigations concern (i). Examples are [7], where the diagonal move (taking from both piles) is relaxed to taking k > from one pile, l > from the other, subject to k l < a, where a is a fixed positive integer parameter. In [8], this rule is further extended to permit diagonal moves of the form k l < (s )k + t, k Z, where s, t Z are fixed parameters. See also [, 9, ]. Still other extensions are generalizations to more than piles [], [8], [7]. Examples of (ii) are [], where m piles are considered to be components of a vector, and removals can be made only from the first and the last end piles of the vector. In [], the diagonal moves of Wythoff are restricted in certain ways. In [] the moves from a single pile are restricted, and the diagonal moves are both restricted and extended! In this paper, we define a new variation of Wythoff s game called W yt K. The rules are more restrictive than in classical Wythoff s game but are in the same spirit as [], which appears to constitute the first bridge between Nim and Wythoff s game. In [], the authors deal with games where the diagonal move (i.e., taking k > from one pile and l > from the other) is subject to a relation R(k, l). Such games are called Nimhoff games. Wythoff s game is Nimhoff s game where R(k, k) for all k >, whereas Nim is the game where no pair (k, l) satisfies R. The main objective there is to a find a closed formula for the G-values of Nimhoff games, for some particular relations R. The family of cyclic Nimhoff games is widely studied in []. This family contains games of the type R(k, l) if < k+l < h, where h is a fixed positive integer. In addition to these results, the cases R(, ) and R(k, k) for all k being a power of are investigated. A generalized Nim sum is provided to ensure the polynomiality of the G- function of such games. In the present paper, the games W yt K that we investigate are exactly the subset of Nimhoff games corresponding to restrictions of Wythoff s game. Unlike the previous paper, we here focus on the regularity of G- functions (defined in Sect. ). The set W yt K is an illustration of games having a certain regular G-function that we call p-nim regular. For that purpose, the games R(, ) and R( q, q ) of [] are also considered here as instances of W yt K having such a regular G-function. Besides, we deal with the conditions for which a game does or does not have a p-nim regular G-function. Definition Let K be a subset of the positive integers. The game Wyt K is
5 played with two heaps of tokens and Op(a, b) = {(a i, b) : < i a} {(a, b j) : < j b} {(a k, b k) : < k min{a, b}, k K}. That is, for a given K, Wyt K is Wythoff s Nim but with a restricted set K of moves along the diagonal. Specifically, we focus on the following questions:. What are the P positions for Wyt K?. For any non-negative integer j, is there an a j such that (a j, a j + j) is a P position?. What are the G-values and do they exhibit any regularity? The interest in the first question is clear. The second is an indication of how close the game is to Wythoff s game. The third is clear but needs a little explanation. Subtraction games have periodic Sprague-Grundy functions; many infinite octal games (including one-heap nim) have arithmetic periodic Sprague-Grundy functions. As noted, the rows of the Sprague- Grundy function of Wythoff s game are ultimately additive periodic [6], []. For many other games, when a player is analyzing a new game, hand calculations are usually tried first, varying the value of just one or two heaps, say of size k, and calculating the corresponding Sprague-Grundy function, call it G(k), Even though, initially, this sequence can hold the promise of regularity, the appearance of values k where G(k ) k is a typical indicator of impending chaos. This is the motivation behind our definition of nim-regularity in section, where we give an automatic test (one suitable for computers) for checking for this regularity. This test forms the basis for our positive results, but it also leads, later on, to conditions where games do not have any of the aforementioned periodicities, though it may have other regularities. This negative result does not appear (explicitly) in [,, ]. In section we show that when K = {k}, the P positions of Wyt K are nim-regular. For k even, this is (essentially) Lemma of []. We complete the picture for k odd in this section. In section we consider the case where K contains only powers of. In. we handle the case K = {}, followed by stating, in the present language, the case K = { k } for fixed k >, already given in []. We then state and prove the negative result alluded to earlier. In section.
6 we deal with the case where K is an infinite set of powers of. The case K = {, i, i I Z }, turns out to be equivalent to the game where K = {}. In that case, we show a surprising regularity of the G-values modulo. We wrap up with a brief final section. Closed p-nim Regularity Check Our basic definitions are the following. Definition 6 Let A be a doubly, semi-infinite matrix and A p be the finite matrix consisting of the first p rows and first p columns of A. The matrix A is called p-nim-regular if A(a, b) = p ( a p b p ) + A p (a mod p, b mod p) for a, b Z ; if, in addition, each row and each column of A p contains all the integers through p then A is called closed p-nim-regular. A game whose G-values constitute a (closed) p-nim-regular matrix, is said to be a (closed) p-nim-regular game. Figure illustrates this definition with p =. Roughly speaking, one can say that a p-nim-regular matrix is obtained by tiling the quarter-plane with copies of A p scaled according to the Nim matrix. a [b/p] b [a/p] A (p) K Figure : The first G-values of Wyt K when K = {}: an example of a closed -nim-regular matrix
7 Notation For a given Wyt K and p Z, denote by A K (p) a p p matrix where A K (p)(i, j) = G(i, j), i.e. the (i, j) entry of A K (p) is the G-value of the position with heaps of size i and j, for all i, j < p. Note that if A is a closed p-nim-regular matrix, then in the matrix A k p, every row and column contains all the values through k p ; i.e., this matrix is a latin square. Theorem of [] shows that the following game is p-nim-regular: given heaps and allowing the subtraction of a i from heap i, i where a +a < p. Here, Theorem notes that not all Wyt K with K = are closed p-nimregular. We present an automatic check for closed p-nim-regularity for any finite set K. Lemma Let K Z be a finite set and A be the matrix with entries G(a, b). If there is a positive integer p > max K such that (i) each row and each column of A K (p) contains all the integers through p ; and (ii) G(a + p k, b + p k) G(a, b) for a + p k, b + p k < p, a, b < p and k K, then A is closed p-nim regular. Figure above shows the first few G-values of Wyt K for K = {}. In that case, the value p = makes A K (p) satisfy both conditions of Lemma. Proof: Assume there exists some p > max K satisfying both conditions (i) and (ii). Now, let (M n ) be the following sequence of matrices: [ M M n = n M n + n ] p M n + n p for all n. Set M = A K (p). M n We will now prove four properties about the sequence (M n ):. M n = A K ( n p).. M n (a, b) = p( a p b p )+A K(p)(a mod p, b mod p) for a, b < n p. 6
8 . Each row and each column of M n contains all the integers through n p.. M n (a + n p k, b + n p k) M n (a, b) for a + n p k, b + n p k < n p, a, b < n p and k K. One can check that these properties are true for M = A K (p). Now suppose that they are true for some matrix M n with n, and consider the matrix M n.. We will prove that M n = A K ( n p). Let a, b < n p. By the induction hypothesis, we have G(a, b) = M n (a, b) = M n (a, b). Now consider the position (a, b + n p). According to the rules of the game, we have G(a, b + n p) = mex({g(a i, b + n p) : < i a} {G(a, b + n p j) : < j b + n p} {G(a k, b + n p k) : < k a, k K}). One may assume inductively that G(s, t) = M n (s, t) for all the pairs (s, t) (a, b + n p) satisfying s a and t b + n p. With this hypothesis and by construction of M n, we have {G(a i, b + n p) : < i a} = {G(a i, b) + n p : < i a}. Similarly and {G(a, b + n p j) : < j b + n p} = {G(a, b + n p j) : < j b} {G(a, b + n p j) : b < j b + n p} = {G(a, b j) + n p : < j b} {,,,..., n p } {G(a k, b + n p k) : < k a, k K} = {G(a k, b + n p k) : < k a, b, k K} {G(a k, b + n p k) : b < k a, k K} = {G(a k, b k) + n p : < k a, b, k K} {G(a k, b + n p k) : b < k a, k K}. 7
9 Since {G(a k, b + n p k) : b < k a, k K} {,,,..., n p }, we have that G(a, b + n p) = mex({g(op(a, b)) + n p} {,,,..., n p }) = G(a, b) + n p. Now consider the position (a + n p, b + n p). Then G(a + n p, b + n p) = mex({g(a + n p i, b + n p) : < i a + n p} {G(a + n p, b + n p j) : < j b + n p} {G(a + n p k, b + n p k) : < k min(a + n p, b + n p), k K}). As previously, suppose that G(s, t) = M n (s, t) for all the pairs (s, t) (a+ n p, b+ n p) satisfying s a+ n p and t b+ n p. Then we have: {G(a + n p i, b + n p) : < i a + n p} = {G(a i, b) : < i a} { n p,..., n p } {G(a + n p, b + n p j) : < j b + n p} = {G(a, b j) : < j b} { n p,..., n p } {G(a + n p k, b + n p k) : < k min(a + n p, b + n p), k K} Hence = {G(a k, b k) : < k min(a, b), k K} {G(a + n p k, b + n p k) : k > min(a, b), k K}. G(a + n p, b + n p) = mex({g(op(a, b)} { n p,..., n p } {G(a + n p k, b + n p k) : k > min(a, b), k K}). We already know that G(a, b) / { n p,..., n p }, since G(a, b) M n. Moreover, G(a, b) / {G(a+ n p k, b+ n p k) : k > min(a, b), k K}. Indeed, if a + n p k n p or b + n p k n p, then 8
10 G(a + n p k, b + n p k) n p > G(a, b). Otherwise, if a+ n p k < n p and b+ n p k < n p, it is true since M n satisfies Property (). Therefore, we conclude that G(a + n p, b + n p) = G(a, b).. Let a, b < n p. We will prove that the formula M n (a, b) = p( a/p b/p ) + A K (p)(a mod p, b mod p) is satisfied. If a, b < n p, then it is true by induction. If n p a, b < n p, then by construction of M n, we have M n (a, b) = M n (a n p, b n p). (A) By the induction hypothesis, we expand (A): M n (a, b) = M n (a n p, b n p) = p( a/p n b/p n ) + A K (a mod p, b mod p) = p( a/p b/p ) + A K (a mod p, b mod p). If a n p and b < n p, then by construction: M n (a, b) = M n (a n p, b) + n p. (B) By the induction hypothesis, we know that M n (a n p, b) = p( a/p n b/p ) + A K (a mod p, b mod p). Finally, since a n p and b < n p, and according to the properties of the nim-sum, we get from (B) M n (a, b) = n p + p( a/p n b/p ) + A K (a mod p, b mod p) = p( a/p b/p ) + A K (a mod p, b mod p). If b n p and a < n p, then we reduce to the previous case by symmetry.. By construction of M n from M n, and since M n satisfies property () by the induction hypothesis, one can easily check that each row and each column of M n contains all the integers through n p. 9
11 . We will show that M n (a + n p k, b + n p k) M n (a, b) for a + n p k, b + n p k < n p, a, b < n p and k K. The condition a + n p k, b + n p k < n p implies a, b < k. And since k < p, we now consider that a, b < p. We now define two integers A and B such that: A = a + ( n )p B = b + ( n )p. By the formula proved in (), we have M n (a, b) = M n (A, B). Let (X, Y ) be a position defined as follows: X = a + n p k Y = b + n p k. Thus M n (X, Y ) = M n (A + p k, B + p k) = M n (a + p k, b + p k) according to the formula. It now suffices to prove that M n (a + p k, b + p k) M n (a, b). Since a + n p k, b + n p k < n p, we have a k + p, b k + p < p, which means that the positions (a, b) and (a + p k, b + p k) both belong to the square [,..., p ] [,..., p ]. As A K (p) satisifes condition (ii), we deduce that M n (a + p k, b + p k) M n (a, b). P positions Theorem Let K = {k}. Then in Wyt K,. For k = j, the P positions are (i + kp, i + kp), i =,,..., k, p Z and (k +i+kp, k +i+kp+), i =,,..., j, p Z.. For k = j +, the P positions are (i + (k + )p, i + (k + )p), i =,,..., k, p Z and (k+i+(k+)p, k+i+(k+)p+), i =,,..., j, p Z. Proof: Denote by S Z the set of positions described by the theorem. Denote by A the set Z \ S. We must prove that any move from S lands in a
12 position of A, and that from any position of A, there exists a move leading to a position of S. For any subset T of Z, denote by T x the set {(i, j) T : i, j < x}. Denote by B the value k (resp. k + ) if k is even (resp. odd). Figure depicts the set S, which is the diagonal concatenation, modulo B, of the pattern S B. k k or k+ B B k or k+ k B B Figure : A view of the structure S. We first remark that there is exactly one position of S in each row and in each column. It is then straightforward to see that it is not possible to move from a position of S B to another one. Besides, from each position of A B, one can move to a position of S B. Therefore, from any position of the sets {(i, j) : i B, j < B} and {(i, j) : j B, i < B}, one can reach a position of S B. Now consider a position of S {(i, j) : B i, j < B}. Moves in a single heap clearly land in A. A move of length k in both heaps may
13 land in Z B, but not in S B (see figure ). Also, from any position of A {(i, j) : B i, B j < B B j, B i < B}, one can move to a position of S {(i, j) : B i, j < B}. It now suffices to iterate the result for the sets S {(i, j) : pb i, j < (p + )B} and A {(i, j) : (pb i, pb j < (p + )B) or (pb j, pb i < (p + )B)}, with p >. Remark When K = {k}, this result ensures that the only integers j for which there exists an a j such that (a j, a j + j) is a P position are and. This remark leads us to the following conjecture: Conjecture Let K be a finite set, then there exists an integer J K > such that if (a, b) is a P position for Wyt K then a b < J K. G-Values. K is finite Theorem Let K = {}. Then in Wyt K G(m + i, n + j) = (m n) + A K ()(i, j), i, j <, m, n Z where, A K () =. Figure illustrates this result by depicting the table of the first G-values. Proof: One can check that A K () contains the first G-values of the game Wyt K with K = {}. With p = > max K, it is now straightforward to see that the conditions of Lemma are satisfied. For completeness, we report the cases where K = { j } since the language used in [] does not immediately lend itself to this interpretation. Theorem Let K = { k } for fixed k >. Then in Wyt K G( k+ m + i, k+ n + j) = k+ (m n) + A K ( k+ )(i, j), and, as a array of matrices, i, j < k+, m, n Z
14 m n j i Figure : The first G-values of Wyt K for K = {}. A K ( k+ ) = [ A K ( k ) A K ( k ) k ] A K ( k ) k A K ( k, ) where A K ( k ) is the k k matrix of the G-values of Nim with two heaps of sizes lower than k. As an illustration of that case with k =, one can refer to Figure. Theorem Let K = {k : k q k + q Z } (for any integer q > ). Then there is no p such that A K (p) satisfies Lemma, condition (i), i.e. Wyt K is not closed p-nim-regular for any p. Proof: We suppose that such a p exists. First, let K = {j}, j q. From Theorem, the P-positions repeat with period j, consequently, then p would be also be a multiple of j. There exists an i such that i < j and with the property that i j = i + j. Moreover, since j is not a power of then i+ < j also holds and there is no diagonal move available from ( i+, j ). Hence the G-value of the position is i+ j this is -heap nim. Then we have i+ j = i+ + j j. Therefore, since A K (j) contains a number greater than j not every row and column can contain all the numbers through j. For K = {j + }, the argument is similar. From Theorem, p would be a multiple of j +. Since j + is not a power of then there exists i j +, < i < j + so that i j + = i + j +. Therefore,
15 i+ j + = i+ + j + > j +. The position ( i+, j + ) has a G-value equal to i+ j +. Therefore, since A K (j + ) contains a number greater than j + not every row and column can contain all the numbers through j +.. K is an infinite set of powers of When K is a subset of the powers of two including, we show that the G-values of Wyt K are those described by Theorem (see Figure ). Theorem 6 Let K = {, i : i I Z }. Then in Wyt K, G(m+i, n+j) = (m n)+a K ()(i, j), i, j <, m, n Z, where A K () is as defined in Theorem. Proof: Denote by G (a, b) the G-value of the position (a, b) for Wyt K with K = {}. The function G is described in Theorem. We aim at proving that G and G for Wyt K where K = {, i : i I Z } are identical. Since the moves of Wyt K with K = {} are included in those of Wyt K with K = {, i : i I Z }, it suffices to check that G (a, b) G (a k, b k) for all k in { i : i I Z }. Suppose that there exists a position (a, b) and an integer k = i, i such that G (a, b) = G (a k, b k). Then we also have G (a, b) mod = G (a k, b k) mod. According to Theorem, we can assert that G (x, y) mod = A K ()(x mod, y mod ) for any position (x, y). This implies that A K ()(a mod, b mod ) = A K ()((a k) mod, (b k) mod ). When looking at the matrix A K (), we notice that each value,, appears exactly once in each diagonal (fig. ). Therefore, A K ()(a mod, b mod ) = A K ()((a k) mod, (b k) mod ) if and only if a mod = (a k) mod and b mod = (b k) mod. These equalities now imply k mod =, which is impossible since k is a power of. Remark From Theorem 6, one can see that in Wyt K with K = { i : i }, we have G(m+i, n+j) = (m n)+a K ()(i, j), i, j <, m, n Z. Conjecture Let K = { i : i > }. Then for all non-negative integers j, there is an a j such that (a j, a j + j) is a P position.
16 Figure : The three diagonals of A K () modulo Concluding remarks As we pointed out in the Introduction, this work is about restrictions of Wythoff s game. Most previous papers about Wythoff concerned extensions thereof. The Wythoff variation defined in [] contains both a restriction and an extension. It depends on two given positive integer parameters a, b: (i) Remove a positive multiple of b tokens from a single pile (restriction), or (ii) remove k >, l > tokens from the piles, subject to the constraints k l (mod b) (restriction), k l < ab (extension). Other games that are both an extension and a restriction of Wythoff are suggested by the present paper. For example, let a Z, K Z. The diagonal move is extended as follows: take k > from one pile and l > from the other subject to k l < a (extension see [7]) and k K (restriction). The extension [8] can be restricted similarly. (Although in [] there are m piles, this is not a genuine extension, since all moves are restricted to taking from at most piles.) References [] E.R. Berlekamp, J.H. Conway and R.K. Guy, Winning Ways for Your Mathematical Plays (in volumes), nd edition, A K Peters, Wellesley, MA(-). [] U. Blass and A.S. Fraenkel, The Sprague-Grundy function for Wythoff s game, Theor. Comput. Sci. 7 (99), -. [] Blass, U.; Fraenkel, A. S. & Guelman, R., How far can Nim in diguise be stretched? J. Combin. Theory (Ser. A) 8 (998), -6
17 [] I.G. Connell, A generalization of Wythoff s game, Canad. Math. Bull. (99), 8-9. [] J.H. Conway, On Numbers and Games, nd edition, A K Peters, Wellesley, MA,. [6] A. Dress, A. Flammenkamp and N. Pink, Additive periodicity of the Sprague-Grundy function of certain Nim games, Adv. in Appl. Math. (999), 9 7. [7] A.S. Fraenkel, How to beat your Wythoff games opponent on three fronts, Amer. Math. Monthly 89 (98), -6. [8] A.S. Fraenkel, Heap games, numeration systems and sequences, Annals of Combinatorics (998), 97-. [9] A.S. Fraenkel, Euclid and Wythoff games, Discrete Math. (), [] A.S. Fraenkel and I. Borosh, A generalization of Wythoff s game, J. Combin. Theory (Ser. A) (97), 7 9. [] A.S. Fraenkel and D. Krieger, The structure of complementary sets of integers: a -shift theorem, Internat. J. Pure and Appl. Math. (), -9. [] A.S. Fraenkel and M. Lorberbom, Nimhoff games, J. Combin. Theory (Ser. A) 8 (99), -. [] A.S. Fraenkel and E. Reisner, The game of End-Wythoff, to appear in Games of No Chance III. [] A.S. Fraenkel and Y. Yesha, The generalized Sprague-Grundy function and its invariance under certain mappings, J. Combin. Theory (Ser. A) (986), [] H. Landman, A simple FSM-based proof of the additive periodicity of the Sprague-Grundy function of Wythoff s game, in: More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July,, Berkeley, CA, MSRI Publ. (R.J. Nowakowski, ed.), Vol., Cambridge University Press, Cambridge,, pp [6] Gabriel Nivasch, More on the Sprague Grundy function for Wythoff s game, to appear in Games of No Chance III. 6
18 [7] X. Sun, Wythoff s sequence and N-heap Wythoff s conjectures, Discrete Math. (), 8 9. [8] X. Sun and D. Zeilberger, On Fraenkel s N-heap Wythoff s conjectures, Ann. Comb. 8 (), 8. [9] W. Wythoff, A modification of the game of Nim, Nieuw Arch. Wisk. 7 (97),
Geometrical extensions of Wythoff s game
Discrete Mathematics 309 (2009) 3595 3608 www.elsevier.com/locate/disc Geometrical extensions of Wythoff s game Eric Duchêne, Sylvain Gravier Institut Fourier, ERTé Maths à modeler Grenoble, France Received
More informationarxiv: v2 [math.co] 23 Mar 2012
VARIANTS OF WYTHOFF S GAME TRANSLATING ITS P-POSITIONS arxiv:1203.2090v2 [math.co] 23 Mar 2012 NHAN BAO HO Abstract. We introduce a restriction of Wythoff s game, which we call F-Wythoff, in which the
More informationGames Played by Boole and Galois
Games Played by Boole and Galois Aviezri S. Fraenkel August 6, 2007 Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100, Israel Abstract We define an infinite
More informationTHE RALEIGH GAME. Received: 1/6/06, Accepted: 6/25/06. Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7(2) (2007), #A13 THE RALEIGH GAME Aviezri S. Fraenkel 1 Department of Computer Science and Applied Mathematics, Weizmann Institute of Science,
More informationNEW GAMES RELATED TO OLD AND NEW SEQUENCES
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 4 (2004), #G06 NEW GAMES RELATED TO OLD AND NEW SEQUENCES Aviezri S. Fraenkel 1 Department of Computer Science and Applied Mathematics, Weizmann
More informationTheorem 1. Every P -position of the game can be written in the form (T n ; m 1 ; : : : ; m k?1 ), where the (k? 1)-tuples (m 1 ; : : : ; m k?1 ) range
A New Heap Game Aviezri S. Fraenkel and Dmitri Zusman Department of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, Israel fraenkel@wisdom.weizmann.ac.il http://www.wisdom.weizmann.ac.il/~fraenkel
More informationarxiv: v2 [math.co] 9 Aug 2011
Winning strategies for aperiodic subtraction games arxiv:1108.1239v2 [math.co] 9 Aug 2011 Alan Guo MIT Computer Science and Artificial Intelligence Laboratory Cambridge, MA 02139, USA aguo@mit.edu Abstract
More informationAperiodic Subtraction Games
Aperiodic Subtraction Games Aviezri S. Fraenkel Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100, Israel Submitted: 2011; Accepted: 2011; Published: XX
More informationAlgebraic Structure in a Family of Nim-like Arrays
Algebraic Structure in a Family of Nim-like Arrays Lowell Abrams Department of Mathematics The George Washington University Washington, DC 20052 U.S.A. labrams@gwu.edu Dena S. Cowen-Morton Department of
More informationarxiv: v1 [math.co] 27 Aug 2015
P-positions in Modular Extensions to Nim arxiv:1508.07054v1 [math.co] 7 Aug 015 Tanya Khovanova August 31, 015 Abstract Karan Sarkar In this paper, we consider a modular extension to the game of Nim, which
More informationGames derived from a generalized Thue-Morse word
Games derived from a generalized Thue-Morse word Aviezri S. Fraenkel, Dept. of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel; fraenkel@wisdom.weizmann.ac.il
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 informationINVARIANT AND DUAL SUBTRACTION GAMES RESOLVING THE DUCHÊNE-RIGO CONJECTURE.
INVARIANT AND DUAL SUBTRACTION GAMES RESOLVING THE DUCHÊNE-RIGO CONJECTURE. URBAN LARSSON, PETER HEGARTY, AVIEZRI S. FRAENKEL ABSTRACT. We prove a recent conjecture of Duchêne and Rigo, stating that every
More informationMartin Gardner and Wythoff s Game
Martin Gardner and Wythoff s Game February 1, 2011 What s a question to your answer? We will not settle this puzzle here, yet we ll taste it. But let s begin at the beginning, namely in 1907, when Willem
More informationHook 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 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 informationA misère-play -operator
A misère-play -operator Matthieu Dufour Silvia Heubach Urban Larsson arxiv:1608.06996v1 [math.co] 25 Aug 2016 July 31, 2018 Abstract We study the -operator (Larsson et al, 2011) of impartial vector subtraction
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 informationSprague-Grundy Values of the R-Wythoff Game
Sprague-Grundy Values of the R-Wythoff Game Albert Gu Department of Mathematics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A agu@andrew.cmu.edu Submitted: Aug 6, 2014; Accepted: Apr 10, 2015;
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 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 informationD. G. Horrocks 1 Department of Mathematics and Computer Science, University of Prince Edward Island, Charlottetown, PE C1A 4P3, Canada
REGULARITY IN THE G SEQUENCES OF OCTAL GAMES WITH A PASS D. G. Horrocks 1 Department of Mathematics and Computer Science, University of Prince Edward Island, Charlottetown, PE C1A 4P3, Canada dhorrocks@upei.ca
More information#G2 INTEGERS 12 (2012) A GENERALIZED DIAGONAL WYTHOFF NIM
#G2 INTEGERS 12 (2012) A GENERALIZED DIAGONAL WYTHOFF NIM Urban Larsson Mathematical Sciences, Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden urban.larsson@chalmers.se
More informationAlgebraic Structure in a Family of Nim-like Arrays
Algebraic Structure in a Family of Nim-like Arrays Lowell Abrams Department of Mathematics The George Washington University Washington, DC 20052 U.S.A. labrams@gwu.edu Dena S. Cowen-Morton Department of
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 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 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 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 informationPoset-Game Periodicity
Poset-Game Periodicity Steven Byrnes Final Siemens-Westinghouse Version September 29, 2002 Abstract In this paper, we explore poset games, a large class of combinatorial games which includes Nim, Chomp,
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 informationarxiv: v2 [math.co] 15 Feb 2017
GENERALIZED ALGORITHM FOR WYTHOFF S GAME WITH BASIS VECTOR (2 b, 2 b ) SHUBHAM AGGARWAL, JARED GELLER, SHUVOM SADHUKA, MAX YU arxiv:1612.03068v2 [math.co] 15 Feb 2017 Abstract. Wythoff s Game is a variation
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 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 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 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 informationAxiom of infinity and construction of N
Axiom of infinity and construction of N F Portal To cite this version: F Portal. Axiom of infinity and construction of N. 2015. HAL Id: hal-01162075 https://hal.archives-ouvertes.fr/hal-01162075 Submitted
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 informationSelf-dual skew codes and factorization of skew polynomials
Self-dual skew codes and factorization of skew polynomials Delphine Boucher, Félix Ulmer To cite this version: Delphine Boucher, Félix Ulmer. Self-dual skew codes and factorization of skew polynomials.
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 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 informationTheoretical Computer Science
Theoretical Computer Science 411 (2010) 3224 3234 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs N-player partizan games Alessandro
More informationStickelberger s congruences for absolute norms of relative discriminants
Stickelberger s congruences for absolute norms of relative discriminants Georges Gras To cite this version: Georges Gras. Stickelberger s congruences for absolute norms of relative discriminants. Journal
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 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 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 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 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 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 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 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 informationA four parametric generalization of the Wythoff NIM and its recursive solution
R u t c o r Research R e p o r t A four parametric generalization of the Wythoff NIM and its recursive solution Vladimir Gurvich a RRR 8-00, November 00 RUTCOR Rutgers Center for Operations Research Rutgers
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 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 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 informationOPTION-CLOSED GAMES RICHARD J. NOWAKOWSKI AND PAUL OTTAWAY
Volume 6, Number 1, Pages 142 153 ISSN 1715-0868 OPTION-CLOSED GAMES RICHARD J. NOWAKOWSKI AND PAUL OTTAWAY Abstract. We consider the class of combinatorial games with the property that each player s move
More informationSlow k-nim. Vladimir Gurvich a
R u t c o r Research R e p o r t Slow k-nim Vladimir Gurvich a Nhan Bao Ho b RRR 3-2015, August 2015 RUTCOR Rutgers Center for Operations Research Rutgers University 640 Bartholomew Road Piscataway, New
More informationFixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks Adrien Richard To cite this version: Adrien Richard. Fixed point theorems for Boolean networks expressed in terms of
More informationPeriodicity and Other Structure in a Colorful Family of Nim-like Arrays
Periodicity and Other Structure in a Colorful Family of Nim-like Arrays Lowell Abrams Department of Mathematics The George Washington University Washington, DC 20052 U.S.A. labrams@gwu.edu Dena S. Cowen-Morton
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 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 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 informationAvalanche Polynomials of some Families of Graphs
Avalanche Polynomials of some Families of Graphs Dominique Rossin, Arnaud Dartois, Robert Cori To cite this version: Dominique Rossin, Arnaud Dartois, Robert Cori. Avalanche Polynomials of some Families
More informationPaths with two blocks in n-chromatic digraphs
Paths with two blocks in n-chromatic digraphs Stéphan Thomassé, Frédéric Havet, Louigi Addario-Berry To cite this version: Stéphan Thomassé, Frédéric Havet, Louigi Addario-Berry. Paths with two blocks
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 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 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 informationAbstract. We dene the family of locally path-bounded digraphs, which is a
Innite cyclic impartial games Aviezri S. Fraenkel and Ofer Rahat Department of Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot 76, Israel Abstract. We dene the family of
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 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 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 information#G03 INTEGERS 10 (2010), MIN, A COMBINATORIAL GAME HAVING A CONNECTION WITH PRIME NUMBERS
#G03 INTEGERS 10 (2010), 765-770 MIN, A COMBINATORIAL GAME HAVING A CONNECTION WITH PRIME NUMBERS Grant Cairns Department of Mathematics, La Trobe University, Melbourne, Australia G.Cairns@latrobe.edu.au
More informationBERGE VAISMAN AND NASH EQUILIBRIA: TRANSFORMATION OF GAMES
BERGE VAISMAN AND NASH EQUILIBRIA: TRANSFORMATION OF GAMES Antonin Pottier, Rabia Nessah To cite this version: Antonin Pottier, Rabia Nessah. BERGE VAISMAN AND NASH EQUILIBRIA: TRANS- FORMATION OF GAMES.
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 informationBEATTY SEQUENCES AND WYTHOFF SEQUENCES, GENERALIZED
BEATTY SEQUENCES AND WYTHOFF SEQUENCES, GENERALIZED CLARK KIMBERLING Abstract. Joint rankings of certain sets yield sequences called lower and upper s-wythoff sequences. These generalizations of the classical
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 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 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 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 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 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 informationMultiple sensor fault detection in heat exchanger system
Multiple sensor fault detection in heat exchanger system Abdel Aïtouche, Didier Maquin, Frédéric Busson To cite this version: Abdel Aïtouche, Didier Maquin, Frédéric Busson. Multiple sensor fault detection
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 informationDifferential approximation results for the Steiner tree problem
Differential approximation results for the Steiner tree problem Marc Demange, Jérôme Monnot, Vangelis Paschos To cite this version: Marc Demange, Jérôme Monnot, Vangelis Paschos. Differential approximation
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 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 informationSome Generalized Euclidean and 2-stage Euclidean number fields that are not norm-euclidean
Some Generalized Euclidean and 2-stage Euclidean number fields that are not norm-euclidean Jean-Paul Cerri To cite this version: Jean-Paul Cerri. Some Generalized Euclidean and 2-stage Euclidean number
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 informationOn additive decompositions of the set of primitive roots modulo p
On additive decompositions of the set of primitive roots modulo p Cécile Dartyge, András Sárközy To cite this version: Cécile Dartyge, András Sárközy. On additive decompositions of the set of primitive
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 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 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 informationIMPROVEMENTS ON CHOMP. Xinyu Sun Department of Mathematics, Temple University, Philadelphia, PA 19122, USA.
IMPROVEMENTS ON CHOMP Xinyu Sun Department of Mathematics, Temple University, Philadelphia, PA 191, USA xysun@math.temple.edu Received: 10/16/01, Revised: 4/9/0, Accepted: 5/17/0, Published: 5/0/0 Abstract
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 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 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 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 informationFinite volume method for nonlinear transmission problems
Finite volume method for nonlinear transmission problems Franck Boyer, Florence Hubert To cite this version: Franck Boyer, Florence Hubert. Finite volume method for nonlinear transmission problems. Proceedings
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 informationOn sl3 KZ equations and W3 null-vector equations
On sl3 KZ equations and W3 null-vector equations Sylvain Ribault To cite this version: Sylvain Ribault. On sl3 KZ equations and W3 null-vector equations. Conformal Field Theory, Integrable Models, and
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 information