4 citations · 6 across the 3 of their papers we have counts for
3 papers
math.QA2014★ 4 cited
A theorem on roots of unity and a combinatorial principle
Simon Lentner, Daniel Nett
Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatoria…
math.QA2014★ 1 cited
New -matrices for small quantum groups
Simon Lentner, Daniel Nett
In this article we construct a large family of -matrices for various extensions of small quantum groups by grouplike elements. The extensions are in correspondence to lattices b…
math.GR2008★ 1 cited
The Imprimitive Faithful Complex Characters of the Schur Covers of the Symmetric and Alternating Groups
Daniel Nett, Felix Noeske
Using combinatorics and character theory, we determine the imprimitive faithful complex characters, i.e., the irreducible faithful complex characters which are induced from proper…