Results 21 to 30 of about 939,183 (156)
Representing Reversible Cellular Automata with Reversible Block Cellular Automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 Cellular automata are mappings over infinite lattices such that each cell is updated according tothe states around it and a unique local function.Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size ...
Jérôme Durand-Lose
doaj +1 more source
Computational Geometry Column 39 [PDF]
, 2000 The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane.Comment: 4 pages, 2 figures. To appear in SIGACT News and in Int. J. Comp.
O'Rourke, Joseph
core +3 more sources
Periodic Patterns in Orbits of Certain Linear Cellular Automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 We discuss certain linear cellular automata whose cells take values in a finite field. We investigate the periodic behavior of the verticals of an orbit of the cellular automaton and establish that there exists, depending on the characteristic of the ...
André Barbé, Fritz Haeseler
doaj +1 more source
Ununfoldable Polyhedra with Convex Faces [PDF]
, 2001 Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra.
Bern, Marshall +5 more
core +6 more sources
On the Ehrenfeucht-Mycielski Balance Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In 1992, A. Ehrenfeucht and J. Mycielski defined a seemingly pseudorandom binary sequence which has since been termed the EM-sequence. The balance conjecture for the EM-sequence, still open, is the conjecture that the sequence of EM-sequence initial ...
John C. Kieffer, W. Szpankowski
doaj +1 more source
Why almost all satisfiable $k$-CNF formulas are easy [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Finding a satisfying assignment for a $k$-CNF formula $(k \geq 3)$, assuming such exists, is a notoriously hard problem. In this work we consider the uniform distribution over satisfiable $k$-CNF formulas with a linear number of clauses (clause-variable ...
Amin Coja-Oghlan +2 more
doaj +1 more source
Larger than Life: Digital Creatures in a Family of Two-Dimensional Cellular Automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 We introduce the Larger than Life family of two-dimensional two-state cellular automata that generalize certain nearest neighbor outer totalistic cellular automaton rules to large neighborhoods.
Kellie M. Evans
doaj +1 more source
A Bijection for Directed-Convex Polyominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this paper we consider two classes of lattice paths on the plane which use \textitnorth, \textiteast, \textitsouth,and \textitwest unitary steps, beginningand ending at (0,0).We enumerate them according to the number ofsteps by means of bijective ...
Alberto Del Lungo +3 more
doaj +1 more source
Dispelling the N^3 myth for the Kt jet-finder [PDF]
, 2005 At high-energy colliders, jets of hadrons are the observable counterparts of the perturbative concepts of quarks and gluons. Good procedures for identifying jets are central to experimental analyses and comparisons with theory.
Abazov +45 more
core +3 more sources
A Sequential Search Distribution: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 The distribution for the number of searches needed to find k of n lost objects is expressed in terms of a refinement of the q-Eulerian polynomials, for which formulae are developed involving homogeneous symmetric polynomials. In the case when k=n and the
Travis Herbranson, Don Rawlings
doaj +1 more source