8 citations · 9 across the 4 of their papers we have counts for
4 papers
Fibonacci Identities and Graph Colorings
Christopher J. Hillar, Troels Windfeldt
We generalize both the Fibonacci and Lucas numbers to the context of graph colorings, and prove some identities involving these numbers. As a corollary we obtain new proofs of some…
Minimal Generators for Symmetric Ideals
Christopher J. Hillar, Troels Windfeldt
Let be a field, and let be the polynomial ring in an infinite collection of indeterminates over . Let be the symmetric group of . The g…
Algebraic Characterization of Uniquely Vertex Colorable Graphs
Christopher J. Hillar, Troels Windfeldt
The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that -colorability…
A Note on the Quantum Query Complexity of the Hidden Subgroup Problem
Troels Windfeldt
We are concerned with the Hidden Subgroup Problem for finite groups. We present a simplified analysis of a quantum algorithm proposed by Hallgren, Russell and Ta-Shma as well as a…