「isomorphic」の共起表現一覧(1語右で並び替え)
該当件数 : 67件
der of brown algae (class Phaeophyceae) with | isomorphic alternation of generations. |
tween two graphs, then the graphs are called | isomorphic and we write . |
can only be minors of each other if they are | isomorphic because any nontrivial minor operation remov |
s (with the standard ordering) are not order | isomorphic, because, even though the sets are of the sa |
rect product, but in the central product two | isomorphic central subgroups of the smaller groups are |
A. Banyaga, On | Isomorphic Classical Diffeomorphism Groups. |
mming languages that are high-level abstract | isomorphic copies of von Neumann architectures. |
cted 1-dimensional Lie group is analytically | isomorphic either to the additive group of real numbers |
pes; that is, they are convex polytopes with | isomorphic face lattices. |
G1 and G2 are | isomorphic if and only if there exists a permutation ma |
hitney, states that two connected graphs are | isomorphic if and only if their line graphs are isomorp |
the graph, two labeled graphs are said to be | isomorphic if the corresponding underlying unlabeled gr |
Tonnetz aligned with the notes of an | isomorphic keyboard. |
However, if graphs that are | isomorphic may nonetheless be considered as distinct ob |
For this approach there is a formal and | isomorphic method of transforming from the transition g |
Also in this case, twisted curves are | isomorphic over the field extension given by the twist |
SmartClient is an Ajax framework created by | Isomorphic Software. |
are often considered equivalent if they have | isomorphic symmetry groups. |
the same order type just when they are order | isomorphic, that is, when there exists a bijection f: X |
e vertex-deleted subgraphs of two graphs are | isomorphic, then the corresponding vertices must have t |
Every subordering is | isomorphic to an initial segment. |
self-complementary graph is a graph that is | isomorphic to its own complement. |
Any hypertree is | isomorphic to some family of subtrees of a tree. |
: What is the largest induced subgraph of G1 | isomorphic to an induced subgraph of G2? |
he open interval (0,1) of rationals is order | isomorphic to the rationals (since |
ar, every 1-dimensional Lie group is locally | isomorphic to R. |
the trivial ring since every trivial ring is | isomorphic to any other (under a unique isomorphism). |
Any totally ordered set that is not | isomorphic to R but satisfies (1) - (4) is known as a S |
eory, every set-like extensional relation is | isomorphic to set-membership on a (non-unique) transiti |
The curves obtained are | isomorphic to the starting curve over the field extensi |
The Hasse diagram of this lattice is | isomorphic to the vertex-edge incidence graph of an ass |
Its full automorphism group is | isomorphic to the dihedral group D8 of order 16, the gr |
pentachoric [3,3,3] symmetry, of order 120, | isomorphic to the permutations of five elements, becaus |
theorem states that any Boolean algebra B is | isomorphic to the algebra of clopen subsets of its Ston |
This group is | isomorphic to A4, the alternating group on 4 elements, |
Tietze's graph is | isomorphic to the graph J3, part of an infinite family |
, then by the Mostowski collapse lemma it is | isomorphic to a transitive model of ZF and such a trans |
Archimedean valued fields are isometrically | isomorphic to a subfield of the complex numbers with a |
By construction, the ladder graph Ln is | isomorphic to the grid graph G2,n and looks like a ladd |
egree φ(n) and its Galois group is naturally | isomorphic to the multiplicative group of units of the |
lgebraic data types with one constructor are | isomorphic to a product type. |
group by its level 2 congruence subgroup is | isomorphic to the alternating group of order 60 on 5 po |
3) and (23), forming the symmetry group C3v, | isomorphic to S3. |
Every Heyting algebra is | isomorphic to one of the form HT. To see this, let H be |
in any infinite set of graphs, one graph is | isomorphic to a minor of another. |
isometry group contains a subgroup which is | isomorphic to the (rotation) group SO(3) and the orbits |
terms of the rotation group SO(2), which is | isomorphic to U(1). |
ive graph and its full automorphism group is | isomorphic to the dihedral group of order 20, the group |
d and demonstrated that the Moyal bracket is | isomorphic to the quantum commutator, and thus that the |
e exists an integer n > 0 such that Fn(G) is | isomorphic to G. |
ains an induced subgraph of at least k edges | isomorphic to an induced subgraph of G2 is NP-complete. |
Its automorphism group has order 12, and is | isomorphic to the dihedral group D6, the group of symme |
It is | isomorphic to the direct product of the symmetric group |
weak order provided that the poset (X, ≤) is | isomorphic to a countable collection of sets ordered by |
ry bisimulation-minimal set-like relation is | isomorphic to a unique transitive class. |
e structure under the membership relation is | isomorphic to (X, R), and the isomorphism is unique. |
mma: every well-founded set-like relation is | isomorphic to set-membership on a (non-unique, and not |
Additionally, when a new type is declared as | isomorphic to an existing type, any type class instance |
G1 is | isomorphic to an induced subgraph of G2 if there is an |
other side, and k edges contains a subgraph | isomorphic to Ka,b. |
case and one or more self-referential cases, | isomorphic to the data type. |
an-Sims graph is a group of order 88,704,000 | isomorphic to the semidirect product of the Higman-Sims |
nd the lattice of its subvarieties is dually | isomorphic to the lattice of normal modal logics. |
of dependency graphs (such as Petri nets) is | isomorphic to that of trace monoids, and thus, one can |
uartic twist, one obtain four curves: one is | isomorphic to E, one is its quadratic twist, and only t |
he state of the object would be identical or | isomorphic with the values accessible from the object's |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|