6 papers · 1 filter
Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux
Daniel Herden, Markus Hunziker, Jonathan Meddaugh +9
Young tableaux are fundamental objects in algebraic combinatorics and representation theory, with operations such as promotion and jeu de taquin playing a central role in their str…
Chromatic numbers with open and nonzero local modular constraints
Daniel Herden, Jonathan Meddaugh, Mark R. Sepanski +9
In this paper, we explore chromatic numbers subject to various local modular constraints. For fixed , we consider proper integer colorings of a graph for which the closed an…
Chromatic numbers with closed local modular constraints
Daniel Herden, Jonathan Meddaugh, Mark R. Sepanski +9
Generalizing the notion of odd-sum colorings, a -labeling of a graph is called a closed coloring with remainder if the closed neighborhood label sum of ea…
Robinson-Schensted shapes arising from cycle decompositions
Martha Du Preez, William Q. Erickson, Jonathan Feigert +5
In the symmetric group , each element has an associated cycle type , a partition of that identifies the conjugacy class of . The Robinson-Schensted (RS) corre…
Limits and Periodicity of Metamour -Distance Graphs
William Q. Erickson, Daniel Herden, Jonathan Meddaugh +3
Given a finite simple graph , let denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in . In this paper…
On Criticality and Additivity of the Pseudoachromatic Number Under Join
Jonathan Meddaugh, Mark R. Sepanski, Yegnanarayanan Venkataraman
A vertex coloring of a graph is said to be pseudocomplete if, for any two distinct colors, there exists at least one edge with those two colors as its end vertices. The pseudoachro…