Related papers: The classification problem for graphs and lattices…
We introduce the wild number of an edge-colored graph as a measure of how close an edge-colored graph is to having a spanning tree in every color. This combinatorial concept originates in the algebraic theory of generalized graph splines.…
Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
The theory of Leavitt path algebras is intrinsically related, via graphs, to the theory of symbolic dynamics and $C^*$-algebras where the major classification programs have been a domain of intense research in the last 50 years. In this…
We prove that every finite dimensional algebra over an algebraically closed field is either derived tame or derived wild. The proof is based on the technique of matrix problems (boxes and reduction algorithm). It implies, in particular,…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
In the present paper we obtain the list of algebras, up to isomorphism, such that closure of any complex finite-dimensional algebra contains one of the algebra of the given list.
Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.
We introduce a class of ${\mathbb{Z}}_N$ graded discrete Lax pairs, with $N\times N$ matrices, linear in the spectral parameter. We give a classification scheme for such Lax pairs and the associated discrete integrable systems. We present…
The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…
We study automorphic Lie algebras and their applications to integrable systems. Automorphic Lie algebras are a natural generalisation of celebrated Kac-Moody algebras to the case when the group of automorphisms is not cyclic. They are…
In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…
We extend the clique-coclique inequality, previously known to hold for graphs in association schemes and vertex-transitive graphs, to graphs in homogeneous coherent configurations and 1-walk regular graphs. We further generalize it to a…
This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…
In this paper, we consider the problem of counting and sampling structures in graphs. We define a class of "edge universal labeling problems"---which include proper $k$-colorings, independent sets, and downsets---and describe simple…
This is an elementary introduction to the Hodge Laplacian on a graph, a higher-order generalization of the graph Laplacian. We will discuss basic properties including cohomology and Hodge theory. The main feature of our approach is…
We discuss the linearization of a non-autonomous nonlinear partial difference equation belonging to the Boll classification of quad-graph equations consistent around the cube. We show that its Lax pair is fake. We present its generalized…
We describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…