Related papers: On the linear algebra of local complementation
A linear graph is a graph whose vertices are totally ordered. Biological and linguistic sequences with interactions among symbols are naturally represented as linear graphs. Examples include protein contact maps, RNA secondary structures…
The algebraic connectivity $a(G)$ of a graph $G$ is defined as the second smallest eigenvalue of its Laplacian matrix $L(G)$. It also admits a variational characterization as the minimum of a quadratic form associated with $L(G)$, subject…
Let G be a connected complex simple Lie group with maximal compact subgroup U. Let g be the Lie algebra of G, and X = G/U be the associated Riemannian globally symmetric space of type IV. We have constructed three types of arithmetic…
We study two classes of inverse semigroups built from directed graphs, namely graph inverse semigroups and a new class of semigroups that we refer to as Leavitt inverse semigroups. These semigroups are closely related to graph…
Symmetric homology is an analog of cyclic homology in which the cyclic groups are replaced by symmetric groups. The foundations for the theory of symmetric homology of algebras are developed in the context of crossed simplicial groups using…
The connection between symmetries and linearizations of discrete-time dynamical systems is being inverstigated. It is shown, that existence of semigroup structures related to the vector field and having linear representations enables…
We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…
We study the problem of matrix Lie algebra conjugacy. Lie algebras arise centrally in areas as diverse as differential equations, particle physics, group theory, and the Mulmuley--Sohoni Geometric Complexity Theory program. A matrix Lie…
The adjacency matrix is the most fundamental and intuitive object in graph analysis that is useful not only mathematically but also for visualizing the structures of graphs. Because the appearance of an adjacency matrix is critically…
The adjacency matrix of a symplectic dual polar graph restricted to the eigenspaces of an abelian automorphism subgroup is shown to act as the adjacency matrix of a weighted subspace lattice. The connection between the latter and…
The object of this paper is to transform a set of local chain complexes to a single global complex using an equivalence relation of congruence of cells, solving topologically the numerical inaccuracies of floating-point arithmetics. While…
We show that if two tensor algebras of topological graphs are algebraically isomorphic, then the graphs are locally conjugate. Conversely, if the base space is at most one dimensional and the edge space is compact, then locally conjugate…
We give an accessible introduction into the theory of lower central series of associative algebras, exhibiting the interplay between algebra, geometry and representation theory that is characteristic for this subject, and to discuss some…
The eccentricity matrix $\epsilon(G)$, of a connected graph $G$ is obtained by retaining the maximum distance from each row and column of the distance matrix of $G$ and the other entries are assigned with 0. In this paper, we discuss the…
A presentation by generators and relations of the $n$th symmetric power $B$ of a commutative algebra $A$ over a field of characteristic zero or greater than $n$ is given. This is applied to get information on a minimal homogeneous…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
Lando framed graph bialgebra is generated by framed graphs modulo 4-term relations. We provide an explicit set of generators of its primitive subspace and a description of the set of relations between the generators. We also define an…
The free energy of a field theory can be considered as a functional of the free correlation function. As such it obeys a nonlinear functional differential equation which can be turned into a recursion relation. This is solved order by order…
In this paper we construct inverse bijections between two sequences of finite sets. One sequence is defined by planar diagrams and the other by lattice walks. G. Kuperberg has shown that the number of elements in these two sets are equal.…