相关论文: Graph bundles and Ricci-flatness

Inspired by asymptotically flat manifolds, we introduce the concept of asymptotically flat graphs and define the discrete ADM mass on them. We formulate the discrete positive mass conjecture based on the scalar curvature in the sense of…

To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. It was shown earlier that the splice diagram determines the universal abelian cover of the manifold. We will in this article…

A graph $X$ is said to be unstable if the direct product $X\times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is non-trivially unstable if it is…

For smooth families of projective algebraic curves, we extend the notion of intersection pairing of metrized line bundles to a pairing on line bundles with flat relative connections. In this setting, we prove the existence of a canonical…

The series-parallel (SP) graphs are those containing no topological $K_{_4}$ and are considered trivial. We relax the prohibition distinguishing the SP graphs by forbidding only embeddings of $K_{_4}$ whose edges with both ends 3-valent…

A finite simple graph is called a bi-Cayley graph over a group $H$ if it has a semiregular automorphism group, isomorphic to $H,$ which has two orbits on the vertex set. Cubic vertex-transitive bi-Cayley graphs over abelian groups have been…

For sufficiently ample linear systems on rational surfaces we show that a very general associated Brauer-Severi surface bundle is not stably rational.

It has been recently proposed that the natural connectivity can be used to characterize efficiently the robustness of complex networks. The natural connectivity quantifies the redundancy of alternative routes in the network by evaluating…

A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…

In this paper, we show that Graph Isomorphism (GI) is not $\textsf{AC}^{0}$-reducible to several problems, including the Latin Square Isotopy problem, isomorphism testing of several families of Steiner designs, and isomorphism testing of…

Given a fiber bundle, we construct a differential graded Lie algebra model for the classifying space of the monoid of homotopy equivalences of the base covered by a fiberwise isomorphism of the total space.

A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson.

We formulate a nonlinear continuum model of a graphene sheet supported by a flat rigid substrate. The sheet is parallel to the substrate and loaded on a pair of opposite edges. A typical cross-section of the sheet is modeled as an elastica.…

Curvature is a fundamental geometric characteristic of smooth spaces. In recent years different notions of curvature have been developed for combinatorial discrete objects such as graphs. However, the connections between such discrete…

We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

A graph $\Gamma$ is said to be a semi-Cayley graph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. We say that $\Gamma$ is normal if $G$ is a normal subgroup of ${\rm Aut}(\Gamma)$. We…

Let $Y$ be a normal and projective variety over an algebraically closed field $k$ and $V$ a vector bundle over $Y$. We prove that if there exist a $k$-scheme $X$ and a finite surjective morphism $g:X\to Y$ that trivializes $V$ then $V$ is…

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian…

A $\mathbb Q$-conic bundle is a proper morphism from a threefold with only terminal singularities to a normal surface such that fibers are connected and the anti-canonical divisor is relatively ample. We study the structure of $\mathbb…