J. Sawada

activity

20062026

most citedOn Prefix Normal Words and Prefix Normal Forms

19 citations · 73 across the 21 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018★ 1 cited

Constructing de Bruijn sequences by concatenating smaller universal cycles

Daniel Gabric, Joe Sawada

We present sufficient conditions for when an ordering of universal cycles $α_{1}, α_{2}, \dots, α_{m}$ for disjoint sets $S_{1}, S_{2}, \dots, S_{m}$ can be conca…

math.CO2018★ 8 cited

Gray codes and symmetric chains

Petr Gregor, Sven Jäger, Torsten Mütze +2

We consider the problem of constructing a cyclic listing of all bitstrings of length $2 n + 1$ with Hamming weights in the interval $[n + 1 - ℓ, n + ℓ]$ , where $1 \leq ℓ \leq n + 1$ , by…

math.CO2018★ 1 cited

A Pascal-like Bound for the Number of Necklaces with Fixed Density

I. Heckenberger, J. Sawada

A bound resembling Pascal's identity is presented for binary necklaces with fixed density using Lyndon words with fixed density. The result is generalized to k-ary necklaces and Ly…