Effective Generation of Subjectively Random Binary Sequences

We present an algorithm for effectively generating binary sequences which would be rated by people as highly likely to have been generated by a random process, such as flipping a fair coin.Comment: Introduction and Section 6 revise

On infinite words avoiding a finite set of squares

Building an infinite square-free word by appending one letter at a time while simultaneously avoiding the creation of squares is most likely to fail. When the alphabet has two letters this approach is impossible. When the alphabet has three or more letters, one will most probably create a word in which the addition of any letter invariably creates a square. When one restricts the set of undesired squares to a finite one, this can be possible. We study the constraints on the alphabet and the set of squares which permit this approach to work.Comment: 18 page

On the hypersurface orbital varieties of sl(N,C)

We study the structure of hypersurface orbital varieties of sl(N,C) (those that are hypersurfaces in the nilradical of some parabolic subalgebra) and how information about this structure is encoded in the standard Young tableau associated to it by the Robinson-Schensted algorithm. We present a conjecture for the exact form of the unique non-linear defining equations of hypersurface orbital varieties and proofs of the conjecture in certain cases.Comment: 17 page