A Tentative Answer to the Castel-San Pietro Problem
Séminaire lotharingien de combinatoire, Tome 13 (1985)
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
The authors give a simple but unuseful algorithm for quasi g-circulant embedding of skew trideterminants in the theory of patroids over chaotic sets, with applications to the breakfast-lunch-dinner problem. The following versions are available:
@article{SLC_1985_13_a13,
author = {Bagarret Krewerlienco and Peter Paul Roman Barnabhofer},
title = {A {Tentative} {Answer} to the {Castel-San} {Pietro} {Problem}},
journal = {S\'eminaire lotharingien de combinatoire},
publisher = {mathdoc},
volume = {13},
year = {1985},
url = {http://geodesic.mathdoc.fr/item/SLC_1985_13_a13/}
}
Bagarret Krewerlienco; Peter Paul Roman Barnabhofer. A Tentative Answer to the Castel-San Pietro Problem. Séminaire lotharingien de combinatoire, Tome 13 (1985). http://geodesic.mathdoc.fr/item/SLC_1985_13_a13/