Danny Rorabaugh

activity

20142023

most citedToward the Combinatorial Limit Theory of Free Words

3 citations · 10 across the 11 of their papers we have counts for

collaborators

Showing 2015 · math.COShow all

4 papers · 2 filters

math.CO2015★ 1 cited

List-antimagic labeling of vertex-weighted graphs

Zhanar Berikkyzy, Axel Brandt, Sogol Jahanbekam +2

A graph $G$ is $k$ - $w e i g h t e d - l i s t - an t ima g i c$ if for any vertex weighting $ω : V (G) \to R$ and any list assignment $L : E (G) \to 2^{R}$ with $|L(e)|\geq |E(G)|…

math.CO2015★ 3 cited

Asymptotic Density of Zimin Words

Joshua Cooper, Danny Rorabaugh

Word $W$ is an instance of word $V$ provided there is a homomorphism $ϕ$ mapping letters to nonempty words so that $ϕ (V) = W$ . For example, taking $ϕ$ such that $ϕ (c) = f r$ , $ϕ (o) = e$ …

math.CO2015★ 3 cited

Toward the Combinatorial Limit Theory of Free Words

Danny Rorabaugh

Free words are elements of a free monoid, generated over an alphabet via the binary operation of concatenation. Casually speaking, a free word is a finite string of letters. Hencef…

math.CO2015

Density dichotomy in random words

Joshua Cooper, Danny Rorabaugh

Word $W$ is said to encounter word $V$ provided there is a homomorphism $ϕ$ mapping letters to nonempty words so that $ϕ (V)$ is a substring of $W$ . For example, taking $ϕ$ such tha…