相关论文: Sheaves on Graphs and Their Homological Invariants

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

Let H be a homology theory for algebraic varieties over a field k. To a complete k-variety X, one naturally attaches an ideal of the coefficient ring H(k). We show that, when X is regular, this ideal depends only on the upper Chow motive of…

We generalize the notion of a small sheaf of sets over a topological space or manifold to define the notion of a small stack of groupoids over an \'etale topological or differentiable stack. We then provide a construction analogous to the…

We consider the intersection $\mathfrak{M}(A)$ of all maximal ideals of an evolution algebra $A$ and study the structure of the quotient $A/\M(A)$. In a previous work, maximal ideals have been related to hereditary subsets of a graph…

We give an excess theorem for spherical 2-designs. This theorem is a dual version of the spectral excess theorem for graphs, which gives a characterization of distance-regular graphs, among regular graphs in terms of the eigenvalues and the…

Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem of of distributive bounded lattices expanded by modalities (functions distributing over joins) as the continuous sections of sheaves. Our…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

Let X be a non-empty finite set and alpha a symmetric bilinear form on a real finite dimensional vector space E. We say that a set GG={U_i | i in X} of linear lines in E is an isometric sheaf, if there exist generators u_i of the lines U_i,…

Graph neural networks (GNNs) have achieved tremendous success on multiple graph-based learning tasks by fusing network structure and node features. Modern GNN models are built upon iterative aggregation of neighbor's/proximity features by…

The spectral side of the (conjectural) Betti geometric Langlands correspondence concerns sheaves on the character stack of an algebraic curve; in particular, the categories in question are manifestly invariant under deformations of the…

In an earlier paper, the authors considered three types of graphs, and three equivalence relations, defined on a group, viz.\ the power graph, enhanced power graph, and commuting graph, and the relations of equality, conjugacy, and same…

In this article we address the length of perverse sheaves arising as direct images of rank one local systems on complements of hyperplane arrangements. In the case of a cone over an essential line arrangement with at most triple points, we…

Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…

We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share must form a connected subgraph of this graph. This framework…

We introduce a new graph invariant \Lambda(G) that we call maxmaxflow, and put it in the context of some other well-known graph invariants, notably maximum degree and its relatives. We prove the equivalence of two "dual" definitions of…

We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorialoptimization. We show how invariance of hyperfiniteness of graphings under local isomorphism…

In this work, we introduce a novel evaluation framework for generative models of graphs, emphasizing the importance of model-generated graph overlap (Chanpuriya et al., 2021) to ensure both accuracy and edge-diversity. We delineate a…

This paper concerns a theoretical approach that combines topological data analysis (TDA) and sheaf theory. Topological data analysis, a rising field in mathematics and computer science, concerns the shape of the data and has been proven…

A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…

Using the discriminant modular form and the Noether formula it is possible to write the admissible self-intersection of the relative dualising sheaf of a semistable hyperelliptic curve over a number field or function field as a sum, over…