7 papers
Asymptotics of Weighted Reflectable Walks in
Torin Greenwood, Samuel Simon
Lattice walks are used to model various physical phenomena. In particular, walks within Weyl chambers connect directly to representation theory via the Littelmann path model. We de…
Constructions and restrictions for balanced splittable Hadamard matrices
Jonathan Jedwab, Shuxing Li, Samuel Simon
A Hadamard matrix is balanced splittable if some subset of its rows has the property that the dot product of every two distinct columns takes at most two values. This definition wa…
The asymptotics of reflectable weighted walks in arbitrary dimension
Marni Mishna, Samuel Simon
Gessel and Zeilberger generalized the reflection principle to handle walks confined to Weyl chambers, under some restrictions on the allowable steps. For those models that are inva…
Which graphs occur as -graphs?
Matt DeVos, Adam Dyck, Jonathan Jedwab +1
The -graph of a graph is the graph whose vertices are labelled by the minimum dominating sets of , in which two vertices are adjacent when their corresponding minimum dom…
An infinite class of unsaturated rooted trees corresponding to designable RNA secondary structures
Jonathan Jedwab, Tara Petrie, Samuel Simon
An RNA secondary structure is designable if there is an RNA sequence which can attain its maximum number of base pairs only by adopting that structure. The combinatorial RNA design…
Linking systems of difference sets
Jonathan Jedwab, Shuxing Li, Samuel Simon
A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of sys…
On the Hamiltonicity of the -regular graph game
Jeremy Meza, Samuel Simon
We consider a game played on an initially empty graph where two players alternate drawing an edge between vertices subject to the condition that no degree can exceed . We show t…