相关论文: Sheaves on Graphs and Their Homological Invariants
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…
The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, $\mathbb{F}_2$. In this paper, we study Cheeger-type…
We use sheaf theory and the six operations to define and study the (equivariant) homology of stacks. The construction makes sense in the algebraic, complex-analytic, or even topological categories.
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…
As an analogy of superalgebra of multivector fields with the Schounte bracket, we introduce a non-trivial superbracket on differential forms of manifold. We show properties of this new superalgebra. We extend this superalgebra by adding one…
We lift the Lefschetz number from an algebraic invariant of maps between spaces to an invariant of morphisms of data over the spaces.
We investigate the maximum size of graph families on a common vertex set of cardinality $n$ such that the symmetric difference of the edge sets of any two members of the family satisfies some prescribed condition. We solve the problem…
We introduce the notion of a higher covering diagram in a base $\infty$-category $\mathcal{C}$. The theory of higher covering diagrams in $\mathcal{C}$ will be shown to recover various descent conditions known from the $\infty$-categorical…
This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. More precisely, in the family of of $d$-regular graphs, which graph $G$ maximizes/minimizes the…
For a given number of colors, $s$, the guessing number of a graph is the (base $s$) logarithm of the cardinality of the largest family of colorings of the vertex set of the graph such that the color of each vertex can be determined from the…
We define the notion of a sheaf over a complex of groups. As an application, we give a criterion for the developability of a complex of groups. When the developability is witnessed by a morphism to $\mathrm{GL}(V)$ for some $V$, our…
Heterophilic Graph Neural Networks (HGNNs) have shown promising results for semi-supervised learning tasks on graphs. Notably, most real-world heterophilic graphs are composed of a mixture of nodes with different neighbor patterns,…
We describe the E-infinity algebra structure on the complex of singular cochains of a topological space, in the context of sheaf theory. As a first application, for any algebraic variety we define a weight filtration compatible with its…
We develop a sheaf cohomology theory of algebraic varieties over an algebraically closed non-trivially valued non-archimedean field $K$ based on Hrushovski-Loeser's stable completion. In parallel, we develop a sheaf cohomology of definable…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
A topos theoretic generalisation of the category of sets allows for modelling spaces which vary according to time intervals. Persistent homology, or more generally, persistence is a central tool in topological data analysis, which examines…
We introduce an original notion of extra-fine sheaf on a topological space, and a variant (hyper-extra-fine) for which \v{C}ech cohomology in strictly positive degree vanishes. We provide a characterization of such sheaves when the…
Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…
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 study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…