Related papers: A K\"{u}nneth Formula of Hypergraphs

We demonstrate under appropriate finiteness conditions that a coarse embedding induces an inequality of homological Dehn functions. Applications of the main results include a characterization of what finitely presentable groups may admit a…

In their celebrated paper [Ramsey-Type Theorems, Discrete Appl. Math. 25 (1989) 37-52], Erd\H{o}s and Hajnal asked the following: is it true, that for any finite graph H there exists a constant c(H) such that for any finite graph G, if G…

This is a common introduction to math.RT/0101170, math.RT/0306333, math.RT/0506043, math.RT/0601028. Compared to these references there are new results including (i) a description of a separable closure of an extension of transcendence…

We generalize the notion of K\"ulshammer ideals to the setting of a graded category. This allows us to define and study some properties of K\"ulshammer type ideals in the graded center of a triangulated category and in the Hochschild…

A covering of k-graphs (in the sense of Pask-Quigg-Raeburn) induces an embedding of universal C*-algebras. We show how to build a (k+1)-graph whose universal algebra encodes this embedding. More generally we show how to realise a direct…

For a smooth compact submanifold $K$ of a Riemannian manifold $Q$, its unit conormal bundle $\Lambda_K$ is a Legendrian submanifold of the unit cotangent bundle of $Q$ with a canonical contact structure. Using pseudo-holomorphic curve…

In this paper, we show that for all $k\geq 10^8$, every graph with minimum degree $k$ and girth at least $10^8$ contains an induced subdivision of a $K_{k+1}$. This answers a problem asked by K\"uhn and Osthus (originally attributed to…

A (simple) hypergraph is a family H of pairwise incomparable sets of a finite set. We say that a hypergraph H is a domination hypergraph if there is at least a graph G such that the collection of minimal dominating sets of G is equal to H.…

We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…

A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit label. We define the adjacency, incidence, Kirchoff Laplacian and normalized Laplacian of a complex unit hypergraph and study each of them.…

A set of vertices in a graph is a Hamiltonian subset if it induces a subgraph containing a Hamiltonian cycle. Kim, Liu, Sharifzadeh and Staden proved that among all graphs with minimum degree $d$, $K_{d+1}$ minimises the number of…

A connected graph $G$ is of QE class if it admits a quadratic embedding in a Hilbert space, or equivalently if the distance matrix is conditionally negative definite, or equivalently if the quadratic embedding constant $\mathrm{QEC}(G)$ is…

We show that pseudovarieties of finitely generated algebras, i.e., classes $C$ of finitely generated algebras closed under finite products, homomorphic images, and subalgebras, can be described via a uniform structure $U$ on the free…

We extend the computations in our prior work to find the cohomology in degree five of a congruence subgroup Gamma of SL_4(Z) with coefficients in Sym^g(K^4), twisted by a nebentype character eta, along with the action of the Hecke algebra.…

Exploiting the graph product structure and results concerning amalgamated free products of C*-algebras we provide an explicit computation of the K-theoretic invariants of right-angled Hecke C*-algebras, including concrete algebraic…

The kth finite subset space of a topological space X is the space exp_k X of non-empty finite subsets of X of size at most k, topologised as a quotient of X^k. The construction is a homotopy functor and may be regarded as a union of…

Let $H$ be a fixed undirected graph on $k$ vertices. The $H$-hitting set problem asks for deleting a minimum number of vertices from a given graph $G$ in such a way that the resulting graph has no copies of $H$ as a subgraph. This problem…

An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…

In this paper hypergraph Lambek calculus ($\mathrm{HL}$) is presented. This formalism aims to generalize the Lambek calculus ($\mathrm{L}$) to hypergraphs as hyperedge replacement grammars extend context-free grammars. In contrast to the…

In a previous work (arXiv:0806.1503v2), we defined a family of subcomplexes of the $n$-dimensional half cube by removing the interiors of all half cube shaped faces of dimension at least $k$, and we proved that the homology of such a…