相关论文: Betti numbers of unordered configuration spaces of…

We give explicit formulas for the Betti numbers, both stable and unstable, of the unordered configuration spaces of an arbitrary surface of finite type.

We give explicit formulas for the asymptotic Betti numbers of the unordered configuration spaces of an arbitrary finite graph over an arbitrary field.

We compute the Betti numbers of the edge rings of multi-path graphs using the \emph{induced-subgraph approach} introduced in \cite{WL1}. Here, a multi-path graph refers to a simple graph composed of several paths that have the same starting…

We create the unlabeled or vertex-labeled graphs with up to 10 edges and up to 10 vertices and classify them by a set of standard properties: directed or not, vertex-labeled or not, connectivity, presence of isolated vertices, presence of…

We compute the multigraded Betti numbers of edge ideals for weighted oriented crown graphs using a novel approach. This approach, which we still call the \emph{induced subgraph approach}, originates from our prior work on computing Betti…

We introduce a novel approach named the {\it induced-subgraph approach} for investigating the Betti numbers of normal edge rings. Utilizing this approach, we compute all the multi-graded Betti numbers of the edge rings associated with…

Using a method of F\'elix and Thomas we compute the Betti numbers of unordered configuration spaces of the torus.

We study mathematical expectations of Betti numbers of configuration spaces of planar linkages, viewing the lengths of the bars of the linkage as random variables. Our main result gives an explicit asymptotic formulae for these mathematical…

We determine all possible triples of depth, dimension, and regularity of edge ideals of weighted oriented graphs with a fixed number of vertices. Also, we compute all the possible Betti table sizes of edge ideals of weighted oriented trees…

We compute the Betti numbers of the geometric spaces associated to nonrational simple convex polytopes and find that they depend on the combinatorial type of the polytope exactly as in the rational case. This shows that the combinatorial…

We study the Betti tables of reducible algebraic curves with a focus on connected line arrangements and provide a general formula for computing the quadratic strand of the Betti table for line arrangements that satisfy certain hypotheses.…

A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, called queues. The stack (queue) number of a graph is the…

In this paper we introduce the concept of characteristic number that are proven to be useful in the study of the combinatorics of graph cohomology. We claim that it is a good combinatorial counterpart for geometric Betti numbers. We then…

An ordered graph is a graph with a total order over its vertices. A linear layout of an ordered graph is a partition of the edges into sets of either non-crossing edges, called stacks, or non-nesting edges, called queues. The stack (queue)…

The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…

In this article bipartite planar graphs St_r are investigated, r the number of their plane regions. Bounds for the graded Betti numbers and the projective dimension of the quotient ring associated to such graphs are discussed. We prove that…

In this paper, we establish Betti number estimates for graphs with non-negative Ollivier curvature, and for graphs with non-negative Bakry-\'Emery curvature, providing a discrete analogue of a classical result by Bochner for manifolds.…

We characterise the structure of those graphs of a given order which maximise the number of connected induced subgraphs for seven different graph classes, each with other prescribed parameters like minimum degree, independence number,…

A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…

We define the crosscap number of a 2-component link as the minimum of the first Betti numbers of connected, non-orientable surfaces bounding the link. We discuss some properties of the crosscap numbers of 2-component links.