C. Hillar

activity

20022010

most citedDeciphering subsampled data: adaptive compressive sampling as a principle of brain communication

18 citations · 33 across the 17 of their papers we have counts for

collaborators

Showing 2006Show all

4 papers · 1 filter

math.RA2006

An elementary and constructive solution to Hilbert's 17th Problem for matrices

Christopher J. Hillar, Jiawang Nie

We give a short and elementary proof of a theorem of Procesi, Schacher and (independently) Gondard, Ribenboim that generalizes a famous result of Artin. Let $A$ be an $n \times n$ …

math.AC2006

Minimal Generators for Symmetric Ideals

Christopher J. Hillar, Troels Windfeldt

Let $K$ be a field, and let $R = K [X]$ be the polynomial ring in an infinite collection $X$ of indeterminates over $K$ . Let $S_{X}$ be the symmetric group of $X$ . The g…

math.CO2006★ 1 cited

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 $k$ -colorability…

math.GR2006★ 2 cited

Automorphisms of finite Abelian groups

Christopher J. Hillar, Darren Rhea

We give an accessible and modern description of the automorphisms of a finite abelian group $G$ . Included is an explicit formula for the cardinality of $A u t (G)$ .