Results 1  10
of
11
The Encyclopedia of Integer Sequences
"... This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs ..."
Abstract

Cited by 627 (15 self)
 Add to MetaCart
This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs to generate the sequence, references, links to relevant web pages, and other
On Kleene Algebras and Closed Semirings
, 1990
"... Kleene algebras are an important class of algebraic structures that arise in diverse areas of computer science: program logic and semantics, relational algebra, automata theory, and the design and analysis of algorithms. The literature contains several inequivalent definitions of Kleene algebras and ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
Kleene algebras are an important class of algebraic structures that arise in diverse areas of computer science: program logic and semantics, relational algebra, automata theory, and the design and analysis of algorithms. The literature contains several inequivalent definitions of Kleene algebras and related algebraic structures [2, 14, 15, 5, 6, 1, 10, 7]. In this paper we establish some new relationships among these structures. Our main results are: There is a Kleene algebra in the sense of [6] that is not *continuous. The categories of *continuous Kleene algebras [5, 6], closed semirings [1, 10] and Salgebras [2] are strongly related by adjunctions. The axioms of Kleene algebra in the sense of [6] are not complete for the universal Horn theory of the regular events. This refutes a conjecture of Conway [2, p. 103]. Righthanded Kleene algebras are not necessarily lefthanded Kleene algebras. This verifies a weaker version of a conjecture of Pratt [15].
Covering arrays and intersecting codes
 Journal of Combinatorial Designs
, 1993
"... A tcovering array is a set of k binary vectors of length n with the property that, in any t coordinate positions, all 2t possibilities occur at least once. Such arrays are used for example in circuit testing, and one wishes to minimize k for given values of n and t. The case t = 2 was solved by Rkn ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
A tcovering array is a set of k binary vectors of length n with the property that, in any t coordinate positions, all 2t possibilities occur at least once. Such arrays are used for example in circuit testing, and one wishes to minimize k for given values of n and t. The case t = 2 was solved by Rknyi, Katona, and Kleitman and Spencer. The present article is concerned with the case t = 3, where important (but unpublished) contributions were made by Busschbach and Roux in the 1980s. One of the principal constructions makes use of intersecting codes (linear codes with the property that any two nonzero codewords meet). This article studies the properties of 3covering arrays and intersecting codes, and gives a table of the best 3covering arrays presently known. For large n the minimal k satisfies 3.21256 < k / log n < 7.56444. 01993
What Are All the Best Sphere Packings in Low Dimensions?
 DISCRETE & COMPUTATIONAL GEOMETRY 9
, 1995
"... We describe what may be all the best packings of nonoverlapping equal spheres in dimensions n < 10, where "best" means both having the highest density and not permitting any local improvement. For example, the best fivedimensional sphere packings are parametrized by the 4colorings of the onedimen ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We describe what may be all the best packings of nonoverlapping equal spheres in dimensions n < 10, where "best" means both having the highest density and not permitting any local improvement. For example, the best fivedimensional sphere packings are parametrized by the 4colorings of the onedimensional integer lattice. We also find what we believe to be the exact numbers of "uniform" packings among these, that is, those in which the automorphism group acts transitively. These assertions depend on certain plausible but as yet unproved postulates. Our work may be regarded as a continuation of Lfiszl6 Fejes T6th's work on solid packings.
Codes over GF(4) and complex lattices
 J
"... This paper studies the relationship between errorcorrecting codes over GF(4) and complex lattices (more precisely, H[o]modules in @“, where w = e*n’l*). The thetafunctions of selfdual lattices are characterized. Two general methods are presented for constructing lattices from codes. Several exam ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper studies the relationship between errorcorrecting codes over GF(4) and complex lattices (more precisely, H[o]modules in @“, where w = e*n’l*). The thetafunctions of selfdual lattices are characterized. Two general methods are presented for constructing lattices from codes. Several examples are given, including a new lattice spherepacking in IWas. 1.
GoldbergCoxeter Construction for 3 and 4valent Plane Graphs
, 2004
"... We consider the GoldbergCoxeter construction GC k,l (G 0 ) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a plane graph from any 3 or 4valent plane graph for integer parameters k, l.Azigzag in a plane graph is a circuit of ed ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We consider the GoldbergCoxeter construction GC k,l (G 0 ) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a plane graph from any 3 or 4valent plane graph for integer parameters k, l.Azigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face; a central circuit in a 4valent plane graph G is a circuit of edges, such that no two consecutive edges belong to the same face. We study the zigzag (or central circuit) structure of the resulting graph using the algebraic formalism of the moving group,the(k, l)product and a finite index subgroup of SL 2 (Z), whose elements preserve the above structure. We also study the intersection pattern of zigzags (or central circuits) of GC k,l (G 0 ) and consider its projections, obtained by removing all but one zigzags (or central circuits).
H.: Intricate Isohedral Tilings of 3D Euclidean Space, Bridges Conference
"... Various methods to create intricate tilings of 3D space are presented. They include modulated extrusions of 2D Escher tilings, freeform deformations of the fundamental domain of various 3D symmetry groups, highly symmetrical polyhedral toroids of genus 1, highergenus cage structures derived from t ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Various methods to create intricate tilings of 3D space are presented. They include modulated extrusions of 2D Escher tilings, freeform deformations of the fundamental domain of various 3D symmetry groups, highly symmetrical polyhedral toroids of genus 1, highergenus cage structures derived from the cubic lattice as well as from the diamond and triamond lattices, and finally interlinked tiles with the connectivity of simple knots.
unknown title
, 2008
"... Mass formulas for local Galois representations to wreath products and cross products ∗ ..."
Abstract
 Add to MetaCart
Mass formulas for local Galois representations to wreath products and cross products ∗
PROGRAMMING PEARL O(1) reversible tree navigation without cycles
, 2004
"... Imperative programmers often use cyclically linked trees in order to achieve O(1) navigation time to neighbours. Some logic programmers believe that cyclic terms are necessary to achieve the same in logicbased languages. An old but littleknown technique provides O(1) time and space navigation with ..."
Abstract
 Add to MetaCart
Imperative programmers often use cyclically linked trees in order to achieve O(1) navigation time to neighbours. Some logic programmers believe that cyclic terms are necessary to achieve the same in logicbased languages. An old but littleknown technique provides O(1) time and space navigation without cyclic links, in the form of reversible predicates. A small modification provides O(1) amortised time and space editing. 1 The problem When imperative programmers think of lists, they commonly choose doubly linked lists, instead of the singly linked lists that logic and functional programmers use. In the same way, it is extremely common for trees to be given parent links, whether they are really needed or not. A typical C example might be typedef int Datum; typedef struct TreeRec *TreePtr;