Cameron–Fon-Der-Flaass IBIS Theorem
Script error: No such module "AfC submission catcheck".
In mathematics, Cameron–Fon-Der-Flaass IBIS Theorem arises in the dynamical algebraic combinatorics. The theorem was discovered in 1995 by two mathematicians Peter Cameron and Dima Fon-Der-Flaas.[1] The theorem is considered to be a link between group theory and graph theory as it studies redundancy of a group.[2][1]
Statement[edit]
Let be a permutational group of , then the following will be similar.
- Irredundant bases of are stored by re-ordering.
- The bases of matroid are formed due to the irredundant bases of .
- Every irredundant base of got the same size.
References[edit]
- ↑ 1.0 1.1 Patrias, Rebecca; Pechenik, Oliver (2020). "Dynamics of plane partitions: Proof of the Cameron–Fon-Der-Flaass conjecture". Forum of Mathematics, Sigma. 8: 62. doi:10.1017/fms.2020.61. ISSN 2050-5094.
- ↑ Cameron, P. J; Fon-Der-Flaass, D. G (1995-11-01). "Bases for permutation groups and matroids". European Journal of Combinatorics. 16 (6): 537–544. doi:10.1016/0195-6698(95)90035-7. ISSN 0195-6698.
 | This mathematics-related article is a stub. You can help EverybodyWiki by expanding it. |
This article "Cameron–Fon-Der-Flaass IBIS Theorem" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Cameron–Fon-Der-Flaass IBIS Theorem. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
