Bases in Systems of Simplices and Chambers
Tatiana Alekseyevskaya
Abstract
We consider a finite set E of points in the n-dimensional affine space and two sets of objects that are generated by the set E: the system Σ of n-dimensional simplices with vertices in E and the system Γ of chambers. The incidence matrix A= aσ, γ, σ∈ Σ, γ∈ Γ, induces the notion of linear independence among simplices (and among chambers). We present an algorithm of construction of bases of simplices (and bases of chambers). For the case n=2 such an algorithm was described in the author's paper Combinatorial bases in systems of simplices and chambers (Discrete Mathematics 157 (1996) 15--37). However, the case of n-dimensional space required a different technique. It is also proved that the constructed bases of simplices are geometrical.
Create a lesson
Related papers
Decay-Ramsey Sequences
Francesco Di Braccio, Simon Griffiths, Pedram Noohi et al.
Hypergraphs with the smallest Hall ratio are still hard to colour
Veronica Bitonti, Freddie Illingworth, Pedram Noohi et al.
The k-color poset Ramsey number of the diamond is 2k
Tom Bohman, Will Cong, Quentin Dubroff et al.
Intersecting families of loose spanning hypertrees
Yury Person, Thomas Schweser
The terminal leave in random greedy hypergraph matching
Peter Keevash
Two Perfect One-Factorizations of K92
Tomasz Maciosowski