Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Casali, M. R."'
Autor:
Casali, M. R., Cristofori, P.
Publikováno v:
Ann. Inst. Henri Poincar\'e Comb. Phys. Interact. 10 (2023), no. 1, pp.121-158
(d+1)-colored graphs, i.e. edge-colored graphs that are (d+1)-regular, have already been proved to be a useful representation tool for compact PL d-manifolds, thus extending the theory (known as crystallization theory) originally developed for the cl
Externí odkaz:
http://arxiv.org/abs/1912.01302
Publikováno v:
J. Knot Theory Ramifications 25, 1650005 (2016)
Simple crystallizations are edge-coloured graphs representing PL 4-manifolds with the property that the 1-skeleton of the associated triangulation equals the 1-skeleton of a 4-simplex. In the present paper, we prove that any (simply-connected) PL $4$
Externí odkaz:
http://arxiv.org/abs/1410.3321
Autor:
Casali, M. R., Cristofori, P.
Publikováno v:
Electron. J. Combin., 22(4) #P4.25, 1--25, 2015
We describe an algorithm to subdivide automatically a given set of PL n-manifolds (via coloured triangulations or, equivalently, via crystallizations) into classes whose elements are PL-homeomorphic. The algorithm, implemented in the case n=4, succee
Externí odkaz:
http://arxiv.org/abs/1408.0378
Autor:
Casali, M. R., Cristofori, P.
Publikováno v:
Journal of Knot Theory and its Ramifications 17 (2008), no.5, 579-599
The present paper follows the computational approach to 3-manifold classification via edge-coloured graphs, already performed by several authors with respect to orientable 3-manifolds up to 28 coloured tetrahedra, non-orientable 3-manifolds up to 26
Externí odkaz:
http://arxiv.org/abs/math/0606359
Autor:
Casali, M. R., Cristofori, P.
Publikováno v:
Acta Appl. Math. 92(2), 113-123 (2006)
By means of a slight modification of the notion of GM-complexity, the present paper performs a graph-theoretical approach to the computation of (Matveev's) complexity for closed orientable 3-manifolds. In particular, the existing crystallization cata
Externí odkaz:
http://arxiv.org/abs/math/0411633
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.