Geodesic
Reduced canonical forms of stoppers
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The reduced canonical form of a loopfree game $G$ is the simplest game infinitesimally close to $G$. Reduced canonical forms were introduced by Calistrate, and Grossman and Siegel provided an alternate proof of their existence. In this paper, we show that the Grossman–Siegel construction generalizes to find reduced canonical forms of certain loopy games.
DOI : 10.37236/1083
Classification : 91A46 
@article{10_37236_1083,
     author = {Aaron N. Siegel},
     title = {Reduced canonical forms of stoppers},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1083},
     zbl = {1137.91334},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1083/}
}
TY  - JOUR
AU  - Aaron N. Siegel
TI  - Reduced canonical forms of stoppers
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1083/
DO  - 10.37236/1083
ID  - 10_37236_1083
ER  - 
%0 Journal Article
%A Aaron N. Siegel
%T Reduced canonical forms of stoppers
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1083/
%R 10.37236/1083
%F 10_37236_1083
Aaron N. Siegel. Reduced canonical forms of stoppers. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1083

Cité par Sources :