The notion of a 1-vertex transfer matrix for multidimensional codes. It is shown that the capacity of such codes, or the topological entropy, can be expressed as the limit of the logarithm of spectral radii of 1-vertex transfer matrices. Storage and computations using the 1-vertex transfer matrix are much smaller than storage and computations needed for the standard transfer matrix. The method ...

The notion of a 1-vertex transfer matrix for multi-dimensional codes is introduced. It is shown that the capacity of such codes, or the topological entropy, can be expressed as the limit of the logarithm of spectral radii of 1-vertex transfer matrices. Storage and computations using the 1-vertex transfer matrix are much smaller than storage and computations needed for the standard transfer matr...

We prove a number of results on the structure and enumeration of palindromes and antipalindromes. In particular, we study conjugates of palindromes, palindromic pairs, rich words, and the counterparts of these notions for antipalindromes.

We present evidence for a novel relational luring effect (RLE) in recognition memory. Participants performed a continuous associative recognition task in which they had to discriminate between new, old and recombined word pairs. Participants made more false alarms and responded more slowly to lures (TABLE CLOTH) that were relationally similar to studied pairs (FLOOR CARPET). RTs and false alarm...

In this paper we consider the following problems: how many different subsets of Σ can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such subsets are represented by words of length t? For the first problem, we give upper and lower bounds of the form α 2 n in the binary case. For the second problem, we giv...

The CDF and D0 collaborations at Fermilab’s Tevatron pp̄ collider have in place an extensive program to measure fundamental properties of the top quark. Recent results from Run I ( √ s = 1.8 TeV) and Run II ( √ s = 1.96 TeV) on the top quark’s production, mass, and decays are presented here. All results are consistent within their uncertainties with the Standard Model expectations for the top qu...

We present two variations of Duval’s algorithm for computing the Lyndon factorization of a word. The first algorithm is designed for the case of small alphabets and is able to skip a significant portion of the characters of the string, for strings containing runs of the smallest character in the alphabet. Experimental results show that it is faster than Duval’s original algorithm, more than ten...

Observations are generated according to a regression with normal error as a function of time, when the process is in control. The process potentially changes at some unknown point of time and then the ensuing observations are normal with the same mean function plus an arbitrary function under suitable regularity conditions. The problem is to obtain a stopping rule that is optimal in the sense t...