6 papers
Letter frequency in shifts of finite type with one forbidden word
Miklós Bóna, Balázs Maga, Jacob Richey
This work considers combinatorial and statistical aspects of {\em{shifts of finite type}}, which are families of words over a finite alphabet which avoid a fixed class of {\emph{fo…
Local Density of Activated Random Walk on
Christopher Hoffman, Jacob Richey, Hyojeong Son
We consider one-dimensional activated random walk (ARW) on started from a `point source' initial condition, with many particles at the origin and no other particles. W…
Explosivity in 1-d Activated Random Walk
Nicolas Forien, Christopher Hoffman, Tobias Johnson +3
We show that Activated Random Walk on is explosive above criticality. That is, activating a single particle in a supercritical state of sleeping particles triggers an…
The odometer in subcritical activated random walk
Tobias Johnson, Jacob Richey
We consider the activated random walk particle system, a model of self-organized criticality, on with i.i.d.-Bernoulli initial configuration. We show that at subcritic…
Word length, bias and bijections in Penney's ante
Mathew Drexel, Xuanshan Peng, Jacob Richey
Fix two words over the binary alphabet , and generate iid Bernoulli bits until one of the words occurs in sequence. This setup, commonly known as Penney's ante, was p…
Shifts of Finite Type Obtained by Forbidding a Single Pattern
Nishant Chandgotia, Brian Marcus, Jacob Richey +1
Given a finite word , Guibas and Odlyzko (J. Combin. Theory Ser. A, 30, 1981, 183-208) showed that the autocorrelation polynomial of , which records the set of self-…