|
Dal'nevostochnyi Matematicheskii Zhurnal, 2011, Volume 11, Number 2, Pages 113–139
(Mi dvmg216)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Connection between Buchstaber invariants and generalized chromatic numbers
A. A. Aizenberg M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
Let $K$ be a combinatorial simplicial complex. The work is devoted to $s(K)$ and $s_{\mathbb R}(K)$ – complex and real Buchstaber numbers which are combinatorial invariants of a simplicial complex $K$. The main tool in the study of these invariants is the notion of characteristic function, which can be regarded as an analogue of proper coloring in the graph theory. This analogy allows to prove estimations connecting Buchstaber numbers and chromatic number. It is shown in the work that real and complex Buchstaber numbers are not equal on the class of simplicial complexes. Also we provide an example of simplicial complexes $K$ and $L$ such that $s(K*L)\ne s(K)+s(L)$. The similarity between real Buchstaber number and chromatic number led to the notion of characteristic polynomial of simplicial complex. This polynomial takes values equal to the number of characteristic functions and possesses properties similar to those of a chromatic polynomial of a graph.
The main results of the paper were reported on the section talk at the International conference “Toric Topology and Automorphic Functions” (September, 5–10th, 2011, Khabarovsk, Russia).
Key words:
simplicial complex, Buchstaber invariant, characteristic function, linearly independent coloring, chromatic number, chromatic polynomial, binary matroid.
Received: 30.09.2011
Citation:
A. A. Aizenberg, “Connection between Buchstaber invariants and generalized chromatic numbers”, Dal'nevost. Mat. Zh., 11:2 (2011), 113–139
Linking options:
https://www.mathnet.ru/eng/dvmg216 https://www.mathnet.ru/eng/dvmg/v11/i2/p113
|
Statistics & downloads: |
Abstract page: | 433 | Full-text PDF : | 144 | References: | 57 | First page: | 1 |
|