Related papers: Incidence Hypergraphs: Box Products & the Laplacia…

We focus on working on incidence rings, a class of (possibly infinite) matrix rings indexed by ordered sets. Some general properties about them are given, including how they are always the inverse limit of finite matrix rings, giving a…

Boxicity of a graph $G(V,$ $E)$, denoted by $box(G)$, is the minimum integer $k$ such that $G$ can be represented as the intersection graph of axis parallel boxes in $\mathbb{R}^k$. The problem of computing boxicity is inapproximable even…

We continue the study of the quantum marginal independence problem, namely the question of which faces of the subadditivity cone are achievable by quantum states. We introduce a new representation of the patterns of marginal independence…

In this article, we obtain two sets of results. The first set of complete results are exclusively for the case of the bi-disc while the second set of results describe in part, which of these carry over to the general case of the poly-disc:…

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…

An Horizontal Visibility Graph (for short, HVG) is defined in association with an ordered set of non-negative reals. HVGs realize a methodology in the analysis of time series, their degree distribution being a good discriminator between…

One can represent Schwartz distributions with values in a vector bundle $E$ by smooth sections of $E$ with distributional coefficients. Moreover, any linear continuous operator which maps $E$-valued distributions to smooth sections of…

A k-dimensional box is the Cartesian product R_1 x R_2 x ... x R_k where each R_i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G) is the minimum integer k such that G is the intersection graph of a…

We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…

A box is the cartesian product of real intervals, which are either bounded or equal to $\mathbb{R}$. A box is said to be $d$-local if at most $d$ of the intervals are bounded. In this paper, we investigate the recently introduced local…

It is known that there is a weak-equivalence between the geometric realization of a simplicially enriched small category and its cofibrant replacement [12]. In this paper, we show that when only small categories are considered there exists…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

Similarity notions between vertices in a graph, such as structural and regular equivalence, are one of the main ingredients in clustering tools in complex network science. We generalise structural and regular equivalences for undirected…

We study P\'olya urns on hypergraphs and prove that, when the incidence matrix of the hypergraph is injective, there exists a point $v=v(H)$ such that the random process converges to $v$ almost surely. We also provide a partial result when…

This paper is the continuation of the research of the author and his colleagues of the {\it canonical} decomposition of graphs. The idea of the canonical decomposition is to define the binary operation on the set of graphs and to represent…

Several variants of hypergraph products have been introduced as generalizations of the strong and direct products of graphs. Here we show that only some of them are associative. In addition to the Cartesian product, these are the minimal…

Let $X$ be a compact Kahler manifold and $L\to X$ a quantizing holomorphic Hermitian line bundle. To immersed Lagrangian submanifolds $\Lambda$ of $X$ satisfying a Bohr-Sommerfeld condition we associate sequences $\{ |\Lambda, k\rangle…

In this paper, we study 2-representations of 2-quantum groups (in the sense of Rouquier and Khovanov-Lauda) categorifying tensor products of irreducible representations. Our aim is to construct knot homologies categorifying…

The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…

We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…