|
Zeon algebras can be thought of as commutative analogues of fermion algebras, and they can be constructed as subalgebras within Clifford algebras of appropriate signature. Their inherent combinatorial properties make them useful for applications in graph enumeration problems and evaluating functions defined on partitions. In this paper, kth roots of invertible zeon elements are considered. More specifically, conditions for existence of roots are established, numbers of existing roots are determined, and computational methods for constructing roots are developed. Recursive and closed formulas are presented, and specific low-dimensional examples are computed with Mathematica. Interestingly, Stirling numbers of the first kind appear among coefficients in the closed formulas.
|
|