Estimating Matveev's complexity via crystallization theory
نویسندگان
چکیده
منابع مشابه
Estimating Matveev's complexity via crystallization theory
In [M.R. Casali, Computing Matveev’s complexity of non-orientable 3-manifolds via crystallization theory, Topology Appl. 144(1–3) (2004) 201–209], a graph-theoretical approach toMatveev’s complexity computation is introduced, yielding the complete classification of closed non-orientable 3-manifolds up to complexity six. The present paper follows the same point-of view, making use of crystalliza...
متن کاملCatalogues of PL-manifolds and complexity estimations via crystallization theory
Crystallization theory is a graph-theoretical representation method for compact PL-manifolds of arbitrary dimension, with or without boundary, which makes use of a particular class of edge-coloured graphs, which are dual to coloured (pseudo-) triangulations. These graphs are usually called gems, i.e. Graphs Encoding Manifolds, or crystallizations if the associated triangulation has the minimal ...
متن کاملMatveev ’ S Complexity via Crystallization Theory : the Orientable Case ∗
Following the notion of GM-complexity introduced in [8], the present paper performs a graph-theoretical approach to (Matveev’s) complexity computation for closed orientable 3-manifolds. In particular, upper bounds for Matveev’s complexity of closed orientable 3-manifolds triangulated by 28 tetrahedra at most (which are encoded by existing crystallization catalogue C28 due to [17]) are proved to...
متن کاملDerandomization via complexity theory
Noam Nisan constructed pseudo random number generators which convert O(S log R) truly random bits to R bits that appear random to any algorithm that runs in SPACE(S). D Sivakumar, demonstrated that a large class of probabilistic algorithms can be derandomized using Nisan’s construction. This class of algorithms is characterized by the fact that each probabilistic algorithm can thought of as a s...
متن کاملChaos/Complexity Theory and Education
Sciences exist to demonstrate the fundamental order underlying nature. Chaos/complexity theory is a novel and amazing field of scientific inquiry. Notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (Retrieved from http://www.inc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.07.021