Related papers: A K\"{u}nneth Formula of Hypergraphs
In this paper we will prove a super-analogue of a well-known result by Kontsevich which states that the homology of a certain complex which is generated by isomorphism classes of oriented graphs can be calculated as the Lie algebra homology…
We describe a graded extension of the usual Hecke algebra: it acts in a graded fashion on the cohomology of an arithmetic group $\Gamma$. Under favorable conditions, the cohomology is freely generated in a single degree over this graded…
Knowledge graph embedding (KGE) is a technique that enhances knowledge graphs by addressing incompleteness and improving knowledge retrieval. A limitation of the existing KGE models is their underutilization of ontologies, specifically the…
We generalize the construction of the Heegaard Floer homology for a singular knot to that for a balanced bipartite graph. For a given graph, we provide a combinatorial description of the Euler characteristic of its Heegaard Floer homology…
Given a closed, convex and pointed cone K in R^n, we present a result which infers K-irreducibility of sets of K-quasipositive matrices from strong connectedness of certain bipartite digraphs. The matrix-sets are defined via products, and…
For a positive integer $k$ and a graph $H$ on $k$ vertices, we are interested in the inducibility of $H$, denoted $\mathrm{ind}(H)$, which is defined as the maximum possible probability that choosing $k$ vertices uniformly at random from a…
Let $\Gamma$ be a discrete group of finite virtual cohomological dimension with certain finiteness conditions of the type satisfied by arithmetic groups. We define a representation ring for $\Gamma$, determined on its elements of finite…
Counting homomorphisms from a graph $H$ into another graph $G$ is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where \emph{both} graphs $H$ and $G$ stem from given classes of graphs:…
We characterize which automorphisms of an arbitrary complete bipartite graph $K_{n,m}$ can be induced by a homeomorphism of some embedding of the graph in $S^3$.
A parametrized spectrum E is a family of spectra E_x continuously parametrized by the points x of a topological space X. We take the point of view that a parametrized spectrum is a bundle-theoretic geometric object. When R is a ring…
A graph $\Gamma$ is $k$-connected-homogeneous ($k$-CH) if $k$ is a positive integer and any isomorphism between connected induced subgraphs of order at most $k$ extends to an automorphism of $\Gamma$, and connected-homogeneous (CH) if this…
The K\"unneth formula is one of the basic tools for computing cohomology. Its validity for foliated cohomology, that is, for the tangential de Rham cohomology of a foliated manifold, is investigated. The main difficulty encountered is the…
For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…
Associated to any uniform finite layered graph Gamma there is a noncommutative graded quadratic algebra A(Gamma) given by a construction due to Gelfand, Retakh, Serconek and Wilson. It is natural to ask when these algebras are Koszul.…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
We prove a general formula for the intersection form of two arbitrary monomials in boundary divisors. Furthermore we present a tree basis of the cohomology of $\overline {M}_{0,n}$. With the help of the intersection form we determine the…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical…
We propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for…
Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…