相关论文: Linear Connections on Graphs

In this paper we show how connections and their generalizations on transitive Lie algebroids are related to the notion of connections in the framework of the derivation-based noncommutative geometry. In order to compare the two…

A degeneration of curves gives rise to an interesting relation between linear systems on curves and on graphs. In this paper, we consider the case of linear pencils and as an application, we obtain some results on pencils on real curves.

We establish several new relations between the discrete transition operator, the continuous Laplacian and the averaging operator associated with combinatorial and metric graphs. It is shown that these operators can be expressed through each…

We introduce the linear connection in the noncommutative geometry model of the product of continuous manifold and the discrete space of two points. We discuss its metric properties, define the metric connection and calculate the curvature.…

Let $L$ be a finite-dimensional non-abelian Lie algebra with the center $Z(L)$. In this paper, we define a non-commuting graph associated with $L$ as the graph whose vertex set is the projective space of the quotient algebra $L/Z(L)$, and…

This article introduces and studies a new class of graphs motivated by discrete curvature. We call a graph resistance nonnegative if there exists a distribution on its spanning trees such that every vertex has expected degree at most two in…

Almost hypercomplex manifolds with Hermitian and anti-Hermitian metrics are considered. A linear connection $D$ is introduced such that the structure of these manifolds is parallel with respect to D. Of special interest is the class of the…

Following the previous authors works (joint with I.A.Dynnikov) we develop a theory of the discrete analogs of the differential-geometrical (DG) connections in the triangulated manifolds. We study a nonstandard discretization based on the…

We introduce a new variant of the coarse Baum-Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum-Connes conjecture. We prove this conjecture for many coarsely disconnected spaces that…

We consider general integrable systems on graphs as discrete flat connections with the values in loop groups. We argue that a certain class of graphs is of a special importance in this respect, namely quad-graphs, the cellular…

For a simplicial manifold we construct the differential geometry structure and use it to investigate linear connections, metric and gravity. We discuss and compare three main approaches and calculate the resulting gravity action…

Connectivity is a fundamental property of quantum graphs, previously studied in the operator system model for matrix quantum graphs and via graph homomorphisms in the quantum adjacency matrix model. In this paper, we develop an algebraic…

Teleparallel gravity models, in which the curvature and the nonmetricity of spacetime are both set zero, are widely studied in the literature. We work a different teleparallel theory, in which the curvature and the torsion of spacetime are…

The question of whether or not any zero torsion linear map on a non abelian real Lie algebra g is necessarily an extension of some CR-structure is considered and answered in the negative. Two examples are provided, one in the negative and…

In this paper, we introduce a graph structure called linear dependence graph of a finite dimensional vector space over a finite field. Some basic properties of the graph like connectedness, completeness, planarity, clique number, chromatic…

The central structure in various versions of noncommutative geometry is a differential calculus on an associative algebra. This is an analogue of the calculus of differential forms on a manifold. In this short review we collect examples of…

To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…

We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the…

Algebraic curves have a discrete analogue in finite graphs. Pursuing this analogy we prove a Torelli theorem for graphs. Namely, we show that two graphs have the same Albanese torus if and only if the graphs obtained from them by…

We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…