2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2022★ 2 cited
The Clique Structure of Johnson Graphs
Pavel Shuldiner, R. Wayne Oldford
Motivated by an approach to visualization of high dimensional statistical data given in Hurley and Oldford (2011), this work examines the clique structure of Johnson…
math.CO2022
How many cliques can a clique cover cover?
Pavel Shuldiner, R. Wayne Oldford
This work examines the problem of clique enumeration on a graph by exploiting its clique covers. The principle of inclusion/exclusion is applied to determine the number of cliques…
math.PR2021★ 1 cited
Bernoulli Sums: The only random variables that count
Pavel Shuldiner, R. W. Oldford
A novel multinomial theorem for commutative idempotents is shown to lead to new results about the moments, central moments, factorial moments, and their generating functions for an…