Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Isomorphism problem of Coxeter groups (view), Graph isomorphism problem (view), Subgraph isomorphism problem (view), Group isomorphism problem (view), Induced subgraph isomorphism problem (view)

searching for Isomorphism problem 27 found (100 total)

alternate case: isomorphism problem

Free probability (682 words) [view diff] exact match in snippet view article find links to article

Voiculescu around 1986 in order to attack the free group factors isomorphism problem, an important unsolved problem in the theory of operator algebras

Maximum common subgraph (97 words) [view diff] no match in snippet view article find links to article

In graph theory and theoretical computer science, a maximum common subgraph may mean either: Maximum common induced subgraph, a graph that is an induced

William Lawrence Kocay (224 words) [view diff] exact match in snippet view article find links to article

mathematical software, the graph reconstruction problem, the graph isomorphism problem, projective geometry, Hamiltonian cycles, planarity, graph embedding

Nielsen transformation (2,538 words) [view diff] exact match in snippet view article find links to article

particularly simple case of the word problem for groups and the isomorphism problem for groups asks if a finitely presented group is the trivial group

Color-coding (1,988 words) [view diff] exact match in snippet view article find links to article

of a given length, and more generally it applies to the subgraph isomorphism problem (an NP-complete problem), where it yields polynomial time algorithms

Circulant graph (1,310 words) [view diff] exact match in snippet view article find links to article

polynomial-time recognition algorithm for circulant graphs, and the isomorphism problem for circulant graphs can be solved in polynomial time. Small Ramsey

Klaus Wilhelm Roggenkamp (1,374 words) [view diff] exact match in snippet view article find links to article

group rings, dealing with problems connected with the "integral isomorphism problem", which was proposed by Graham Higman in his 1940 doctoral dissertation

Toida's conjecture (383 words) [view diff] exact match in snippet view article find links to article

October–December 1977 Klin, M.H. and R. Poschel: The Konig problem, the isomorphism problem for cyclic graphs and the method of Schur rings, Algebraic methods

Hyperbolic group (2,756 words) [view diff] exact match in snippet view article find links to article

hyperbolic groups have a decidable marked isomorphism problem. It is notable that this means that the isomorphism problem, orbit problems (in particular the

John Stillwell (759 words) [view diff] exact match in snippet view article find links to article

ISBN 978-0691234366 Stillwell, John (1982). "The word problem and the isomorphism problem for groups". Bulletin of the American Mathematical Society. (N.S

Differentiable manifold (9,497 words) [view diff] exact match in snippet view article find links to article

3-manifolds, such as Mostow rigidity and Sela's algorithm for the isomorphism problem for hyperbolic groups. The classification of n-manifolds for n greater

Fox derivative (496 words) [view diff] case mismatch in snippet view article find links to article

MR 0053938. Fox, Ralph (March 1954). "Free Differential Calculus, II: The Isomorphism Problem of Groups". Annals of Mathematics. 59 (2): 196–210. doi:10.2307/1969686

Stathis Zachos (601 words) [view diff] exact match in snippet view article find links to article

interactive proof systems and probabilistic quantifiers, is that the graph isomorphism problem is not likely to be NP-complete (joint with R. Boppana, J. Hastad)

Rips machine (919 words) [view diff] exact match in snippet view article find links to article

Bass–Serre theory, is a key tool in the work of Sela on solving the isomorphism problem for (torsion-free) word-hyperbolic groups, Sela's version of the

Periodic graph (crystallography) (2,541 words) [view diff] exact match in snippet view article

since an equilibrium position is a normal form, the crystal net isomorphism problem (i.e., the query whether two given crystal nets are isomorphic as

Michael Brin Prize in Dynamical Systems (952 words) [view diff] exact match in snippet view article find links to article

broad class of non-amenable groups and solution of the long-standing isomorphism problem for Bernoulli actions of such groups. 2018 : Mike Hochman for his

Algebraically closed group (1,424 words) [view diff] exact match in snippet view article find links to article

groups. J. London Math. Soc. 27, 227-242 (1952) B.H. Neumann: The isomorphism problem for algebraically closed groups. In: Word Problems, pp 553–562. Amsterdam:

Periodic graph (geometry) (2,096 words) [view diff] exact match in snippet view article

isomorphic, although not necessarily homotopic. Even though the graph isomorphism problem is polynomial time reducible to crystal net topological equivalence

Grundy number (1,355 words) [view diff] case mismatch in snippet view article find links to article

Jaroslav; Ossona de Mendez, Patrice (2012), "18.3 The Subgraph Isomorphism Problem and Boolean Queries", Sparsity: Graphs, Structures, and Algorithms

USC-Lockheed Martin Quantum Computing Center (1,094 words) [view diff] exact match in snippet view article find links to article

"Experimental quantum annealing: case study involving the graph isomorphism problem". Scientific Reports. 5 (1): 11168. arXiv:1503.06453. Bibcode:2015NatSR

History of group theory (3,571 words) [view diff] exact match in snippet view article find links to article

important embedding properties of semigroups into groups, studied the isomorphism problem of group rings, established the Malçev correspondence for polycyclic

Aanderaa–Karp–Rosenberg conjecture (3,557 words) [view diff] exact match in snippet view article find links to article

a subgraph isomorphic to any given graph (the so-called subgraph isomorphism problem), the best known lower bound is Ω ( n 3 / 2 ) {\displaystyle \Omega

Jingbo Wang (1,129 words) [view diff] exact match in snippet view article find links to article

Brendan L; Wang, Jingbo B (2008). "A classical approach to the graph isomorphism problem using quantum walks". Journal of Physics A: Mathematical and Theoretical

Bass–Serre theory (5,901 words) [view diff] exact match in snippet view article find links to article

Bass–Serre theory, is a key tool in the work of Sela on solving the isomorphism problem for (torsion-free) word-hyperbolic groups, Sela's version of the

Book embedding (8,167 words) [view diff] exact match in snippet view article find links to article

number is zero. As a consequence of bounded expansion, the subgraph isomorphism problem, of finding whether a pattern graph of bounded size exists as a subgraph

Network motif (10,371 words) [view diff] exact match in snippet view article find links to article

classification time of sampled sub-graphs that requires solving the graph isomorphism problem for each sub-graph sample. Additionally, an extra computational effort

Weisfeiler Leman graph isomorphism test (2,701 words) [view diff] exact match in snippet view article find links to article

therefore the labels. This can be used for kernelization of the graph isomorphism problem. Note that not every map of vertices that respects the labels gives