Related papers: Multigraded Betti numbers of some path ideals
Upper bounds on the topological Betti numbers of Vietoris-Rips complexes are established, and examples of such complexes with high Betti numbers are given.
Let $B$ be a bidirected multigraph with signing $\sigma$, let $X$ be a set of vertices in $B$, and let $k$ be a non-negative integer. For any pair of vertex sets $S,T\subset V(B)$ satisfying $X\cap S = X\cap T$, we denote by $B_{S,T}$ the…
We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe…
We show that Kimura's necessary and sufficient condition for the non-vanishingness of multigraded Betti numbers of chordal graphs can be extended to the wider class of weakly chordal graphs.
In this paper, we present a foundation study for proper colouring of edge-set graphs. The authors consider that a detailed study of the colouring of edge-set graphs corresponding to the family of paths is best suitable for such foundation…
The $t$-connected ideal of a graph $G$ is generated by all connected induced subgraphs of $G$ with $t$ vertices. When $t = 2$, this coincides with the usual edge ideal of the graph. Following the work of Faridi et al., we give a…
We study the set of all determinants of adjacency matrices of graphs with a given number of vertices.
In this paper we compute Gr\"obner bases for determinantal ideals of the form $I_{1}(XY)$, where $X$ and $Y$ are both matrices whose entries are indeterminates over a field $K$. We use the Gr\"obner basis structure to determine Betti…
Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are…
Two method for computation of the spectra of certain infinite graphs are suggested. The first one can be viewed as a reversed Gram--Schmidt orthogonalization procedure. It relies heavily on the spectral theory of Jacobi matrices. The second…
Using the addition technique, we present polynomial identities for the Betti and Poincar\'e polynomials of reduced plane curves.
We introduce the notion of a partial Betti splitting of a homogeneous ideal, generalizing the notion of a Betti splitting first given by Francisco, H\`a, and Van Tuyl. Given a homogeneous ideal $I$ and two ideals $J$ and $K$ such that $I =…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
We consider the multiplier ideals of the ideal of a reduced union of lines through the origin in C^3. For general arrangements of lines, we calculate the multiplier ideals.
We give explicit formulas for the asymptotic Betti numbers of the unordered configuration spaces of an arbitrary finite graph over an arbitrary field.
Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…
The paper presents some bipartite graph $L_{k,n}$, so called $(k,n)$-level graph, that arise by taking $k$-th and $(n-k)$-th levels of $n$-dimensional Boolean algebra. Two results are establised: (1) precise description of a distance (a…
We prove upper bounds for the graded Betti numbers of Stanley-Reisner rings of balanced simplicial complexes. Along the way we show bounds for Cohen-Macaulay graded rings $S/I$, where $S$ is a polynomial ring and $I\subseteq S$ is an…
Graphs with bounded treewidth and bounded maximum degree are known to have tree-partitions of bounded width. What can be said if the bounded treewidth assumption is strengthened to bounded pathwidth? We prove that every graph with bounded…
Existing multi-relational graph neural networks use one of two strategies for identifying informative relations: either they reduce this problem to low-level weight learning, or they rely on handcrafted chains of relational dependencies,…