Doctoral thesis
Loading...
License
Using this material is possible in accordance with the relevant provisions of fair use or other exceptions provided by law. Other use requires the consent of the holder.Obliczenia symboliczne i algorytmy kombinatoryczne w spektralnej klasyfikacji skończonych zbiorów częściowo uporządkowanych
Author
Gąsiorek, Marcin
Promoter
Simson, Daniel
Publication date
2018-12-04
Abstract (EN)
The main subject of the research presented in the dissertation is the Coxeter spectral classification of finite connected partially ordered sets (posets) 𝐼�, encoded in the form of incidence matrices 𝐶�𝐼� ∈ 𝕄�|𝐼�|(ℤ), by means of symbolic and combinatorial algorithms.
Keywords EN
Dynkin type
Coxeter spectrum
Coxeter polynomial
Coxeter matrix
Euclidean diagram
Dynkin diagram
nonnegative quadratic form
positive quadratic form
quadratic form
nonnegative poset of corank two
principal poset
positive poset
partially ordered set
symbolic algorithms
combinatorial algorithms
Coxeter spectral classification
Alternative Title
Symbolic computations and combinatorial algorithms in spectral classification of finite partially ordered sets
Defence date
2018-12-14
Open access license
Fair use