Classification Problem for Graphs and Lattices is Wild

R. Lipyanski; N. Vanetik

doi:10.1007/s10958-013-1363-0

Classification Problem for Graphs and Lattices is Wild

R. Lipyanski, N. Vanetik

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

The classification problem for finite and infinite algebraic lattices has also been extensively addressed. A wild classification problem contains the classification problem of pairs of matrices up to simultaneous similarity. In this paper, we prove that the classification problem for graphs is wild by reducing the classification problem for finite 2-nilpotent p-groups to the classification problem for graphs.

Original language	English
Pages (from-to)	776-780
Number of pages	5
Journal	Journal of Mathematical Sciences
Volume	191
Issue number	6
DOIs	https://doi.org/10.1007/s10958-013-1363-0
State	Published - 1 Jun 2013

ASJC Scopus subject areas

Statistics and Probability
General Mathematics
Applied Mathematics

Access to Document

10.1007/s10958-013-1363-0

Cite this

@article{6514b680ab354ea6816811c243bde3ea,

title = "Classification Problem for Graphs and Lattices is Wild",

abstract = "The classification problem for finite and infinite algebraic lattices has also been extensively addressed. A wild classification problem contains the classification problem of pairs of matrices up to simultaneous similarity. In this paper, we prove that the classification problem for graphs is wild by reducing the classification problem for finite 2-nilpotent p-groups to the classification problem for graphs.",

author = "R. Lipyanski and N. Vanetik",

year = "2013",

month = jun,

day = "1",

doi = "10.1007/s10958-013-1363-0",

language = "English",

volume = "191",

pages = "776--780",

journal = "Journal of Mathematical Sciences",

issn = "1072-3374",

publisher = "Springer Science and Business Media Deutschland GmbH",

number = "6",

}

TY - JOUR

T1 - Classification Problem for Graphs and Lattices is Wild

AU - Lipyanski, R.

AU - Vanetik, N.

PY - 2013/6/1

Y1 - 2013/6/1

N2 - The classification problem for finite and infinite algebraic lattices has also been extensively addressed. A wild classification problem contains the classification problem of pairs of matrices up to simultaneous similarity. In this paper, we prove that the classification problem for graphs is wild by reducing the classification problem for finite 2-nilpotent p-groups to the classification problem for graphs.

AB - The classification problem for finite and infinite algebraic lattices has also been extensively addressed. A wild classification problem contains the classification problem of pairs of matrices up to simultaneous similarity. In this paper, we prove that the classification problem for graphs is wild by reducing the classification problem for finite 2-nilpotent p-groups to the classification problem for graphs.

UR - http://www.scopus.com/inward/record.url?scp=84884983790&partnerID=8YFLogxK

U2 - 10.1007/s10958-013-1363-0

DO - 10.1007/s10958-013-1363-0

M3 - Article

AN - SCOPUS:84884983790

SN - 1072-3374

VL - 191

SP - 776

EP - 780

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

IS - 6

ER -

Classification Problem for Graphs and Lattices is Wild

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this