65 citations
- University of ConnecticutUS3 papers
- Austin Peay State UniversityUS2 papers
- Winthrop UniversityUS2 papers
- Auburn UniversityUS1 paper
- California Institute of TechnologyUS1 paper
- Clayton State UniversityUS1 paper
- Délégation Paris 7FR1 paper
- Harvard UniversityUS1 paper
- Harvard University PressUS1 paper
- Howard UniversityUS1 paper
- Institut de Recherche en Informatique FondamentaleFR1 paper
- Institut national de recherche en sciences et technologies du numériqueFR1 paper
11 papers · 1 filter
The birational Lalanne-Kreweras involution
Sam Hopkins, Michael Joseph
The Lalanne-Kreweras involution is an involution on the set of Dyck paths which combinatorially exhibits the symmetry of the number of valleys and major index statistics. We define…
A birational lifting of the Stanley-Thomas word on products of two chains
Michael Joseph, Tom Roby
The dynamics of certain combinatorial actions and their liftings to actions at the piecewise-linear and birational level have been studied lately with an eye towards questions of p…
Minimum Coprime Labelings of Generalized Petersen and Prism Graphs
John Asplund, N. Bradley Fox
A coprime labeling of a graph of order is an assignment of distinct positive integer labels in which adjacent vertices have relatively prime labels. Restricting labels to only…
Enclosings of Decompositions of Complete Multigraphs in -Edge-Connected -Factorizations
John Asplund, Pierre Charbit, Carl Feghali
A decomposition of a multigraph is a partition of its edges into subgraphs . It is called an -factorization if every is -regular and spanning.…
with cyclic 2-intersecting Gray codes: or
John Asplund, Melissa Keranen
A is a pair where contains points and contains -element subsets of so that each pair in appears in exactly b…
New Perspectives on Neighborhood-Prime Labelings of Graphs
John Asplund, N. Bradley Fox, Arran Hamm
Neighborhood-prime labeling is a variation of prime labeling. A labeling is a neighborhood-prime labeling if for each vertex with degree greater t…