Zobrazeno 1 - 10
of 272
pro vyhledávání: '"Neil J. A. Sloane"'
Publikováno v:
The Electronic Journal of Combinatorics, 27(1)
Number the cells of a (possibly infinite) chessboard in some way with the numbers 0, 1, 2, ... Consider the cells in order, placing a queen in a cell if and only if it would not attack any earlier queen. The problem is to determine the positions of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0ce8457fbc470e7e63ddd56af4e62c4
https://doi.org/10.37236/8905
https://doi.org/10.37236/8905
Autor:
Neil J. A. Sloane
Publikováno v:
Towards Mechanized Mathematical Assistants ISBN: 9783540730835
Calculemus/MKM
Calculemus/MKM
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences. It is freely available on the Web (http://www.research.att.com/~njas/sequences/) and is widely used. There are several ways in which it benefits re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::953f8cfc18ad1435986ed86b30c87a12
https://doi.org/10.1515/9780691197944-009
https://doi.org/10.1515/9780691197944-009
Autor:
Neil J. A. Sloane, C. Goodman-Strauss
An elementary method is described for finding the coordination sequences for a tiling, based on coloring the underlying graph. We illustrate the method by first applying it to the two kinds of vertices (tetravalent and trivalent) in the Cairo (or dua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3122196037752a227a4af6f0e439a21
In the gift exchange game there are n players and n wrapped gifts. When a player's number is called, that person can either choose one of the remaining wrapped gifts, or can "steal" a gift from someone who has already unwrapped it, subject to the res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7108c9fad1a2923c454c99debbe82a43
Publikováno v:
The College Mathematics Journal. 43:43-50
We investigate what arithmetic would look like if carry digits into other digit position were ignored, so that 9 + 4 = 3, 5 + 5 = 0, 9 X 4 = 6, 5 X 4 = 0, and so on. For example, the primes are now 21, 23, 25, 27, 29, 41, 43, 45, 47, ... .
7 pag
7 pag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4733efed74b6df41b38153ae9b6e7f9
https://doi.org/10.4169/college.math.j.43.1.043
https://doi.org/10.4169/college.math.j.43.1.043
Publikováno v:
IEEE Transactions on Information Theory. 55:1051-1060
We present a novel technique for encoding and decoding constant weight binary vectors that uses a geometric interpretation of the codebook. Our technique is based on embedding the codebook in a Euclidean space of dimension equal to the weight of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::604e82bb5b7119123c30ac1444883b81
https://doi.org/10.1109/tit.2008.2011441
https://doi.org/10.1109/tit.2008.2011441
Publikováno v:
Discrete & Computational Geometry. 41:232-248
Let v 1,…,v n be unit vectors in ℝn such that v i ⋅v j =−w for i≠j, where $-1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a40dbfe31199cfa75d201b27aa653ff6
https://doi.org/10.1007/s00454-008-9086-6
https://doi.org/10.1007/s00454-008-9086-6
Autor:
Neil J. A. Sloane, John H. Conway
Publikováno v:
Advances in Mathematics of Communications. 1:257-260
The mean-centered cuboidal (or m.c.c.) lattice is known to be the optimal packing and covering among all isodual three-dimensional lattices. In this note we show that it is also the best quantizer. It thus joins the isodual lattices $\mathbb Z$, $A_2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::143b0de4900391cb0081506a059e32cc
https://doi.org/10.3934/amc.2007.1.257
https://doi.org/10.3934/amc.2007.1.257
Autor:
James A. Sellers, Neil J. A. Sloane
Publikováno v:
Discrete Mathematics. 294(3):259-274
A partition n = p 1 + p 2 + ⋯ + p k with 1 ⩽ p 1 ⩽ p 2 ⩽ ⋯ ⩽ p k is called non-squashing if p 1 + ⋯ + p j ⩽ p j + 1 for 1 ⩽ j ⩽ k - 1 . Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70f422b6cf876970b3678a89c082e9f4
Publikováno v:
Finite Fields and Their Applications. 10(4):540-550
For any q which is a power of 2 we describe a finite subgroup of the group of invertible complex q by q matrices under which the complete weight enumerators of generalized doubly-even self-dual codes over the field with q elements are invariant. An e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b16ec8959cb56a8b5b676b51d51ada50