相关论文: Finite dimensional point derivations for graph alg…

We introduce the concept of a family of finite directed graphs (order 1) which are directed graphs derived from an infinite directed graph (order 1), called the 1-root digraph. The 1-root digraph has four fundamental properties which are;…

We view the determinant and permanent as functions on directed weighted graphs and introduce their analogues for the undirected graphs. We prove that the task of computing the undirected determinants as well as permanents for planar graphs,…

This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…

Let $T$ be a set, of {\em types}, and let $\iota,o:T\to\oZ_+$. A {\em $T$-diagram} is a locally ordered directed graph $G$ equipped with a function $\tau:V(G)\to T$ such that each vertex $v$ of $G$ has indegree $\iota(\tau(v))$ and…

In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…

Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs…

To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…

We prove a version of Bass' finitistic dimension conjecture for path algebras over arbitrary directed graphs. It is known that the path algebra of a finite directed graph is hereditary, hence it has finite finitistic dimension, when the…

Here, we suggest a method to represent general directed uniform and non-uniform hypergraphs by different connectivity tensors. We show many results on spectral properties of undirected hypergraphs also hold for general directed uniform…

We classify the category of finite-dimensional real division composition algebras having a non-abelian Lie algebra of derivations. Our complete and explicit classification is largely achieved by introducing the concept of a…

A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more…

On the one hand the algebras of linear operators here act on finite-dimensional vector spaces, and on the other hand the point of view is generally an analysts'. Also, one might think of algebras as being used to add more data to basic…

In this paper we introduce and investigate the notions of diagrams and discrete extensions in the study of finitary $2$-representations of finitary $2$-categories.

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…

For endofunctors of varieties preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper…

There has been intensive work on the parameterized complexity of the typically NP-hard task to edit undirected graphs into graphs fulfilling certain given vertex degree constraints. In this work, we lift the investigations to the case of…

We study operator algebras associated to integral domains. In particular, with respect to a set of natural identities we look at the possible nonselfadjoint operator algebras which encode the ring structure of an integral domain. We show…

We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…

A problem by Diestel is to extend algebraic flow theory of finite graphs to infinite graphs with ends. In order to pursue this problem, we define an A-flow and non-elusive H-flow for arbitrary graphs and for abelian topological Hausdorff…

We initiate a study on a range of new generalized derivations of finite-dimensional Lie algebras over an algebraically closed field of characteristic zero. This new generalization of derivations has an analogue in the theory of associative…