Clearly, two isomorphic designs are statistically equivalent. Design catalogs should therefore contain only designs unique up to isomorphism.doi:doi:http://dx.doi.org/ShrivastavaAbhishek Kumar
The XX chromosome isomorphism denotes their homology; additionally, we assume that asynapsis may be caused not by a lack of homology between isomorphic XX but by their early inactivation and specific heterochromatization of some regions of at least one of the X chromosomes. In other words, we ...
the maps C→ C' which induce isomorphisms on (co)homology. To describe it, Verdier introduced the notion of a triangulated category. The quotient category K(A) of Ch(A), whose morphisms are the chain homotopy equivalence classes of maps, is triangulated; D(A), which is formed from K(...
In particular, there are finitely many tiles up to translation. Two tilings T1 and 72 are said to be locally isomorphic if every patch of Tj can be found in 72 and vice versa (again, the patches are identified by translations). Local isomorphism is an equivalence relation; the equivalence ...
This work deals with the problem of isomorphism of simple graphs without selfloops and gives a proposal for a canonical representation of graphs and an efficient deterministic procedure to find this representation. The article is disposed as follows: Section 1 defines the topological and computational...
For n = 2kl, l ∈ ℕ, this bound is sharp, and we prove that the corresponding extremal graph is unique up to isomorphism. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 227–243, 2000PetraLehrstuhlJohannLehrstuhlWiley...
Design catalogs should therefore contain only designs unique up to isomorphism.;There are two computational challenges in generating such catalogs. Firstly, testing two designs for isomorphism is computationally hard due to the large number of possible relabelings, and, secondly, the number of designs...
For k less than or equal ton/2 we prove m (n,k) less than or equal to n(2)/4 + (k - 1)n/4 For n = 2k/, / is an element of N, this bound is sharp, and we prove that the corresponding extremal graph is unique up to isomorphism. (C) 2000 John Wiley & Sons, Inc. ...
We characterize, in terms of their cyclic flats, matroids that are irreducible with respect to free product, and prove that the factorization of a matroid into a free product of irreducibles is unique up to isomorphism. We use these results to determine, for K a field of characteristic zero...
The image of an oriented spatial polygonal arc under the orthogonal projection from the 3-space to a plane along a unit normal vector is not always any arc diagram. It is shown that an arc diagram unique up to isomorphisms which is determined only by the unit normal vector can be ...