arXiv Analytics

Sign in

arXiv:2105.09826 [math.CO]AbstractReferencesReviewsResources

Incidence Monoids: Automorphisms and Complexity

Mahir Bilen Can

Published 2021-05-20Version 1

The algebraic monoid structure of an incidence algebra is investigated. We show that the multiplicative structure alone determines the algebra automorphisms of the incidence algebra. We present a formula that expresses the complexity of the incidence monoid with respect to the two sided action of its maximal torus in terms of the zeta polynomial of the poset. In addition, we characterize the finite (connected) posets whose incidence monoids have complexity $\leq 1$. Finally, we determine the covering relations of the adherence order on the incidence monoid of a star poset.

Comments: The final version of this article will appear in the Semigroup Forum
Categories: math.CO, math.AG, math.RA
Related articles: Most relevant | Search more
arXiv:math/0503511 [math.CO] (Published 2005-03-24, updated 2005-04-21)
The Complexity of Pebbling and Cover Pebbling
arXiv:1111.1799 [math.CO] (Published 2011-11-08, updated 2011-11-12)
The complexity of the $q$-analog of the $n$-cube
arXiv:2108.13090 [math.CO] (Published 2021-08-30)
Undirected determinant, permanent and their complexity