<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ArrayToPureCubicalComplex</code>( <var class="Arg">A</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs an integer array <span class="SimpleMath">\(A\)</span> of dimension <span class="SimpleMath">\(d\)</span> and an integer <span class="SimpleMath">\(n\)</span>. It returns a d-dimensional pure cubical complex corresponding to the black/white "image" determined by the threshold <span class="SimpleMath">\(n\)</span> and the values of the entries in <span class="SimpleMath">\(A\)</span>. (Integers below the threshold correspond to a black pixel, and higher integers correspond to a white pixel.)</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ FramedPureCubicalComplex</code>( <var class="Arg">M</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(M\)</span> and returns the pure cubical complex with a border of zeros attached the each face of the boundary array M!.boundaryArray. This function just adds a bit of space for performing operations such as thickenings to <span class="SimpleMath">\(M\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ RandomCubeOfPureCubicalComplex</code>( <var class="Arg">M</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(M\)</span> and returns a pure cubical complex <span class="SimpleMath">\(R\)</span> with precisely the same dimensions as <span class="SimpleMath">\(M\)</span>. The complex <span class="SimpleMath">\(R\)</span> consist of one cube selected at random from <span class="SimpleMath">\(M\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PureCubicalComplexIntersection</code>( <var class="Arg">S</var>, <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs two pure cubical complexes with common dimension and array size. It returns the intersection of the two complexes. (An entry in the binary array of the intersection has value 1 if and only if the corresponding entries in the binary arrays of S and T both have value 1.)</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PureCubicalComplexUnion</code>( <var class="Arg">S</var>, <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs two pure cubical complexes with common dimension and array size. It returns the union of the two complexes. (An entry in the binary array of the union has value 1 if and only if at least one of the corresponding entries in the binary arrays of S and T has value 1.)</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PureCubicalComplexDifference</code>( <var class="Arg">S</var>, <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs two pure cubical complexes with common dimension and array size. It returns the difference S-T. (An entry in the binary array of the difference has value 1 if and only if the corresponding entry in the binary array of S is 1 and the corresponding entry in the binary array of T is 0.)</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ReadImageAsPureCubicalComplex</code>( <var class="Arg">str</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Reads an image file <span class="SimpleMath">\(str\)</span> (= "file.png", "file.eps", "file.bmp" etc) and an integer <span class="SimpleMath">\(n\)</span> between 0 and 765. It returns a 2-dimensional pure cubical complex based on the black/white version of the image determined by the threshold <span class="SimpleMath">\(n\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ReadLinkImageAsPureCubicalComplex</code>( <var class="Arg">str</var> )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ReadLinkImageAsPureCubicalComplex</code>( <var class="Arg">str</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Reads an image file <span class="SimpleMath">\(str\)</span> (= "file.png", "file.eps", "file.bmp" etc) containing a knot or link diagram, and optionally a positive integer <span class="SimpleMath">\(n\)</span>. The integer <span class="SimpleMath">\(n\)</span> should be a little larger than the line thickness in the link diagram, and if not provided then <span class="SimpleMath">\(n\)</span> is set equal to 10. The function tries to output the corresponding knot or link as a 3-dimensional pure cubical complex. Ideally the link diagram should be produced with line thickness 6 in Xfig, and the under-crossing spaces should not be too large or too small or too near one another. The function does not always succeed: it applies several checks, and if one of these checks fails then the function returns "fail".</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ReadImageSequenceAsPureCubicalComplex</code>( <var class="Arg">dir</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Reads the name of a directory <span class="SimpleMath">\(dir\)</span> containing a sequence of image files (ordered alphanumerically), and an integer <span class="SimpleMath">\(n\)</span> between 0 and 765. It returns a 3-dimensional pure cubical complex based on the black/white version of the images determined by the threshold <span class="SimpleMath">\(n\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Size</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>This returns the number of non-zero entries in the binary array of the cubical complex, or pure cubical complex T.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Dimension</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>This returns the dimension of the cubical complex, or pure cubical complex T.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ WritePureCubicalComplexAsImage</code>( <var class="Arg">T</var>, <var class="Arg">str1</var>, <var class="Arg">str2</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a 2-dimensional pure cubical complex T, and a filename <span class="SimpleMath">\(str1\)</span> followed by its extension <span class="SimpleMath">\(str2\)</span> (e.g. <span class="SimpleMath">\(str1\)</span>="myfile" followed by <span class="SimpleMath">\(str2\)</span>="png"). A black/white image is saved to the file.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ViewPureCubicalComplex</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ViewPureCubicalComplex</code>( <var class="Arg">T</var>, <var class="Arg">str</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a 2-dimensional pure cubical complex T, and optionally a command such as <span class="SimpleMath">\(str\)</span>="mozilla" for viewing image files. A black/white image is displayed.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Homology</code>( <var class="Arg">T</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Homology</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex, or cubical complex, or simplicial complex <span class="SimpleMath">\(T\)</span> and a non-negative integer <span class="SimpleMath">\(n\)</span>. It returns the n-th integral homology of <span class="SimpleMath">\(T\)</span> as a list of torsion integers. If no value of <span class="SimpleMath">\(n\)</span> is input then the list of all homologies of <span class="SimpleMath">\(T\)</span> in dimensions 0 to Dimension(T) is returned .</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Bettinumbers</code>( <var class="Arg">T</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Bettinumbers</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex, or cubical complex, simplicial complex or chain complex <span class="SimpleMath">\(T\)</span> and a non-negative integer <span class="SimpleMath">\(n\)</span>. The rank of the n-th rational homology group <span class="SimpleMath">\(H_n(T,\mathbb Q)\)</span> is returned. If no value for n is input then the list of Betti numbers in dimensions 0 to Dimension(T) is returned .</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ DirectProductOfPureCubicalComplexes</code>( <var class="Arg">M</var>, <var class="Arg">N</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs two pure cubical complexes <span class="SimpleMath">\(M,N\)</span> and returns their direct product <span class="SimpleMath">\(D\)</span> as a pure cubical complex. The dimension of <span class="SimpleMath">\(D\)</span> is the sum of the dimensions of <span class="SimpleMath">\(M\)</span> and <span class="SimpleMath">\(N\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ SuspensionOfPureCubicalComplex</code>( <var class="Arg">M</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(M\)</span> and returns a pure cubical complex with the homotopy type of the suspension of <span class="SimpleMath">\(M\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ EulerCharacteristic</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex, or cubical complex, or simplicial complex <span class="SimpleMath">\(T\)</span> and returns its Euler characteristic.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PathComponentOfPureCubicalComplex</code>( <var class="Arg">T</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> and an integer <span class="SimpleMath">\(n\)</span> in the rane 1, ..., Bettinumbers(T)[1] . It returns the n-th path component of <span class="SimpleMath">\(T\)</span> as a pure cubical complex. The value <span class="SimpleMath">\(n=0\)</span> is also allowed, in which case the number of path components is returned.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ChainComplex</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex, or cubical complex, or simplicial complex <span class="SimpleMath">\(T\)</span> and returns the (often very large) cellular chain complex of <span class="SimpleMath">\(T\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ChainComplexOfPair</code>( <var class="Arg">T</var>, <var class="Arg">S</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex or cubical complex <span class="SimpleMath">\(T\)</span> and subcomplex <span class="SimpleMath">\(S\)</span>. It returns the quotient <span class="SimpleMath">\(C(T)/C(S)\)</span> of cellular chain complexes.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ExcisedPureCubicalPair</code>( <var class="Arg">T</var>, <var class="Arg">S</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> and subcomplex <span class="SimpleMath">\(S\)</span>. It returns the pair <span class="SimpleMath">\([T\setminus intS, S\setminus intS])\)</span> of pure cubical complexes where <span class="SimpleMath">\(intS\)</span> is the pure cubical complex obtained from <span class="SimpleMath">\(S\)</span> by removing its boundary.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ChainMapOfPureCubicalPairs</code></td><td class="tdright">( global variable )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(N\)</span> and subcomplexes <span class="SimpleMath">\(M\)</span>, <span class="SimpleMath">\(T\)</span> and <span class="SimpleMath">\(S\)</span> in <span class="SimpleMath">\(T\)</span>. It returns the chain map <span class="SimpleMath">\(C(M/S) \rightarrow C(N/T)\)</span> of quotient cellular chain complexes.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ContractPureCubicalComplex</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> of dimension <span class="SimpleMath">\(d\)</span> and removes <span class="SimpleMath">\(d\)</span>-dimensional cells from <span class="SimpleMath">\(T\)</span> without changing the homotopy type of <span class="SimpleMath">\(T\)</span>. When the function has been applied, no further <span class="SimpleMath">\(d\)</span>-cells can be removed from <span class="SimpleMath">\(T\)</span> without changing its homotopy type. This function modifies <span class="SimpleMath">\(T\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ContractedComplex</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> and returns a structural copy of the complex obtained from <span class="SimpleMath">\(T\)</span> by applying the function ContractPureCubicalComplex(T).</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ZigZagContractedPureCubicalComplex</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> and returns a homotopy equivalent pure cubical complex <span class="SimpleMath">\(S\)</span>. The aim is for <span class="SimpleMath">\(S\)</span> to involve fewer cells than <span class="SimpleMath">\(T\)</span> and certainly to involve no more cells than <span class="SimpleMath">\(T\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ContractCubicalComplex</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a cubical complex <span class="SimpleMath">\(T\)</span> and removes cells without changing the homotopy type of <span class="SimpleMath">\(T\)</span>. It changes <span class="SimpleMath">\(T\)</span>. In particular, it adds the components T.vectors and T.rewrite of a discrete vector field.</p>
<p>At present this function only works for cubical complexes of dimension 2 or 3.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ DVFReducedCubicalComplex</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a cubical complex <span class="SimpleMath">\(T\)</span> and returns a non-regular cubical complex <span class="SimpleMath">\(R\)</span> by constructing a discrete vector field. The vector field is designed to minimize the number of critical cells in <span class="SimpleMath">\(R\)</span> at the cost of allowing cell attaching maps that are not homeomorphisms on boundaries.</p>
<p>At present this function works only for 2- and 3-dimensional cubical complexes.</p>
<p>The function ChainComplex(R) can be used to obtain the cellular chain complex of <span class="SimpleMath">\(R\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ SkeletonOfCubicalComplex</code>( <var class="Arg">T</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a cubical complex, or pure cubical complex <span class="SimpleMath">\(T\)</span> and positive integer <span class="SimpleMath">\(n\)</span>. It returns the <span class="SimpleMath">\(n\)</span>-skeleton of <span class="SimpleMath">\(T\)</span> as a cubical complex.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ContractibleSubomplexOfPureCubicalComplex</code></td><td class="tdright">( global variable )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> and returns a maximal contractible pure cubical subcomplex.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AcyclicSubomplexOfPureCubicalComplex</code></td><td class="tdright">( global variable )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> and returns a (not necessarily connected) pure cubical subcomplex having trivial homology in all degrees greater than <span class="SimpleMath">\(0\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ HomotopyEquivalentMaximalPureCubicalSubcomplex</code>( <var class="Arg">T</var>, <var class="Arg">S</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> together with a pure cubical subcomplex <span class="SimpleMath">\(S\)</span>. It returns a pure cubical subcomplex <span class="SimpleMath">\(H\)</span> of <span class="SimpleMath">\(T\)</span> which contains <span class="SimpleMath">\(S\)</span> and is maximal with respect to the property that it is homotopy equivalent to <span class="SimpleMath">\(S\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ HomotopyEquivalentMinimalPureCubicalSubcomplex</code>( <var class="Arg">T</var>, <var class="Arg">S</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> together with a pure cubical subcomplex <span class="SimpleMath">\(S\)</span>. It returns a pure cubical subcomplex <span class="SimpleMath">\(H\)</span> of <span class="SimpleMath">\(T\)</span> which contains <span class="SimpleMath">\(S\)</span> and is minimal with respect to the property that it is homotopy equivalent to <span class="SimpleMath">\(T\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ BoundaryOfPureCubicalComplex</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> and returns its boundary as a pure cubical complex. The boundary consists of all cubes which have one or more facets that lie in just the one cube.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ SingularitiesOfPureCubicalComplex</code>( <var class="Arg">T</var>, <var class="Arg">radius</var>, <var class="Arg">tolerance</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> together with a positive integer "radius" and an integer "tolerance" in the range 1..100. It returns the pure cubical subcomplex of those cells in the boundary where the boundary is not differentiable. (The method for deciding differentiability at a point is crude/discrete, prone to errors and depends on the radius and tolerance.)</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ThickenedPureCubicalComplex</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> and returns a pure cubical complex <span class="SimpleMath">\(S\)</span>. If a euclidean cube is in <span class="SimpleMath">\(T\)</span> then this cube and all its neighbouring cubes are included in <span class="SimpleMath">\(S\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ CropPureCubicalComplex</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> and returns a pure cubical complex <span class="SimpleMath">\(S\)</span> obtained from <span class="SimpleMath">\(T\)</span> by removing any "zero boundary sheets" of the binary array. Thus <span class="SimpleMath">\(S\)</span> and <span class="SimpleMath">\(T\)</span> are isometric as euclidean spaces but there may be fewer zero entries in the binary array for <span class="SimpleMath">\(S\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ MorseFiltration</code>( <var class="Arg">M</var>, <var class="Arg">i</var>, <var class="Arg">t</var>, <var class="Arg">bool</var> )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ MorseFiltration</code>( <var class="Arg">M</var>, <var class="Arg">i</var>, <var class="Arg">t</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(M\)</span> of dimension <span class="SimpleMath">\(d\)</span>, an integer <span class="SimpleMath">\(i\)</span> between <span class="SimpleMath">\(1\)</span> and <span class="SimpleMath">\(d\)</span>, a positive integer <span class="SimpleMath">\(t\)</span> and a boolean value True or False. The function returns a list <span class="SimpleMath">\([M_1, M_2, ..., M_t]\)</span> of pure cubical complexes with <span class="SimpleMath">\(M_k\)</span> a subcomplex of <span class="SimpleMath">\(M_{k+1}\)</span>. The list is constructed by setting all slices of <span class="SimpleMath">\(M\)</span> perpendicular to the <span class="SimpleMath">\(i\)</span>-th axis equal to zero if they meet the <span class="SimpleMath">\(i\)</span>th axis at a sufficiently high coordinate (if bool=True) or sufficiently low coordinate (if bool=False).</p>
<p>If the variable bool is not specified then it is assumed to have the value True.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ComplementOfPureCubicalComplex</code>( <var class="Arg">T</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(T\)</span> and returns a pure cubical complex <span class="SimpleMath">\(S\)</span>. A euclidean cube is in <span class="SimpleMath">\(S\)</span> precisely when the cube is not in <span class="SimpleMath">\(T\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PureCubicalComplexToTextFile</code>( <var class="Arg">file</var>, <var class="Arg">M</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(M\)</span> and a string containing the address of a file. A representation of this complex is written to the file in a format that can be read by the CAPD (Computer Assisted Proofs in Dynamics) software developed by Marian Mrozek and others.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ThickeningFiltration</code>( <var class="Arg">M</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ThickeningFiltration</code>( <var class="Arg">M</var>, <var class="Arg">n</var>, <var class="Arg">k</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a pure cubical complex <span class="SimpleMath">\(M\)</span> and a positive integer <span class="SimpleMath">\(n\)</span>. It returns a filtered pure cubical complex constructed frim <span class="SimpleMath">\(n\)</span> thickenings of <span class="SimpleMath">\(M\)</span>. If a positive integer <span class="SimpleMath">\(k\)</span> is supplied as an optional third argument, then each step of the filtration is obtained from a <span class="SimpleMath">\(k\)</span>-fold thickening.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Dendrogram</code>( <var class="Arg">M</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a filtered pure cubical complex <span class="SimpleMath">\(M\)</span> and returns data that specifies the dendrogram (or phylogenetic tree) describing how path components are born and then merge during the filtration.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ DendrogramDisplay</code></td><td class="tdright">( global variable )</td></tr></table></div>
<p>Inputs a filtered pure cubical complex <span class="SimpleMath">\(M\)</span>, or alternatively inputs the out from the command Dendrogram(M), and then uses GraphViz software to display the path component dendrogram of <span class="SimpleMath">\(M\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ DendrogramToPersistenceMat</code>( <var class="Arg">D</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs the output of the function Dendrogram(M) and returns the corresponding degree 0 Betti bar code.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ReadImageAsFilteredPureCubicalComplex</code>( <var class="Arg">file</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a string containing the path to an image file, together with a positive integer n. It returns a filtered pure cubical complex of filtration length <span class="SimpleMath">\(n\)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ComplementOfFilteredPureCubicalComplex</code>( <var class="Arg">M</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a filtered pure cubical complex <span class="SimpleMath">\(M\)</span> and returns the complement as a filtered pure cubical complex.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PersistentHomologyOfFilteredPureCubicalComplex</code>( <var class="Arg">M</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a filtered pure cubical complex <span class="SimpleMath">\(M\)</span> and a non-negative integer <span class="SimpleMath">\(n\)</span>. It returns the degree <span class="SimpleMath">\(n\)</span> persistent homology of <span class="SimpleMath">\( M\)</span> with rational coefficients.</p>
¤ Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.0.32Bemerkung:
Wie Sie bei der Firma Beratungs- und Dienstleistungen beauftragen können
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
