arXiv Analytics

Sign in

arXiv:1003.0637 [math.CO]AbstractReferencesReviewsResources

The problem of Buchstaber number and its combinatorial aspects

Anton Ayzenberg

Published 2010-03-02Version 1

For any simplicial complex on m vertices a moment-angle complex Z_K embedded in C^m can be defined. There is a canonical action of a torus T^m on Z_K, but this action fails to be free. The Buchstaber number is the maximal integer s(K) for which there exists a subtorus of rank s(K) acting freely on Z_K. The similar definition can be given for real Buchstaber number. We study these invariants using certain sequences of simplicial complexes called universal complexes. Some general properties of Buchstaber numbers follow from combinatorial properties of universal complexes. In particular, we investigate the additivity of Buchstaber invariant.

Related articles: Most relevant | Search more
arXiv:1004.2375 [math.CO] (Published 2010-04-14, updated 2010-08-23)
On some combinatorial properties of the orbits on subsets
arXiv:2206.05613 [math.CO] (Published 2022-06-11)
Barcode Posets: Combinatorial Properties and Connections
arXiv:math/0409287 [math.CO] (Published 2004-09-16)
Some combinatorial aspects of composition of a set of functions