Related papers: Algebraic Properties of a Hypergraph Lifting Map
In this paper, we define the non-commuting graph associated to a Lie algebra L and obtain some basic graph properties such as connectivity, diameter, girth, Hamiltonian and Eulerian. Moreover, planarity, outer planarity and isomorphism…
We study Ramsey expansions of certain homogeneous 3-hypertournaments. We show that they exhibit an interesting behaviour and, in one case, they seem not to submit to current gold-standard methods for obtaining Ramsey expansions. This makes…
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…
The Ramsey's theorem says that a graph with sufficiently many vertices contains a clique or stable set with many vertices. Now we attach some parameter to every vertex, such as degree. Consider the case a graph with sufficiently many…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
After a somewhat rocky start, geometry and topology have established a foothold in machine learning. Message passing, either on graphs or higher-order complexes, is one of the main drivers of geometric deep learning, and paradigms that were…
Lifting exploits symmetries in probabilistic graphical models by using a representative for indistinguishable objects, allowing to carry out query answering more efficiently while maintaining exact answers. In this paper, we investigate how…
We study the relationship between two key concepts in the theory of (di)graphs: the quotient digraph, and the lift $\Gamma^{\alpha}$ of a base (voltage) digraph. These techniques contract or expand a given digraph in order to study its…
A bowtie is a graph consisting of two triangles with one vertex identified. We show that the class of all (countable) graphs not containing a bowtie as a subgraph has a Ramsey lift (expansion). This solves one of the old problems in the…
We construct liftings of reduction maps from CM points to supersingular points for general quaternion algebras and use these liftings to establish a precise correspondence between CM points on indefinite quaternion algebras with a given…
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
A {\em $3$-graph} is a connected cubic graph such that each vertex is is equipped with a cyclic order of the edges incident with it. A {\em weight system} is a function $f$ on the collection of $3$-graphs which is {\em antisymmetric}:…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
The great advances of learning-based approaches in image processing and computer vision are largely based on deeply nested networks that compose linear transfer functions with suitable non-linearities. Interestingly, the most frequently…
We introduce the notion of a lowering-raising (or LR) triple of linear transformations on a nonzero finite-dimensional vector space. We show how to normalize an LR triple, and classify up to isomorphism the normalized LR triples. We…
Given a graph $G$ and a collection $\mathcal C$ of subsets of $\mathbb{R}^d$ indexed by the subsets of vertices of $G$, a constrained drawing of $G$ is a drawing, where each edge is drawn inside some set from $\mathcal C$, in such a way…
Let $K_m^{(3)}$ denote the complete $3$-uniform hypergraph on $m$ vertices and $S_n^{(3)}$ the $3$-uniform hypergraph on $n+1$ vertices consisting of all $\binom{n}{2}$ edges incident to a given vertex. Whereas many hypergraph Ramsey…
We interpret augmented racks as a certain kind of multiplicative graphs and show that this point of view is natural for defining rack homology. We also define the analogue of the group algebra for these objects; in particular, we see how…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
There has been a great deal of research on graphs defined on algebraic structures in the last two decades. In this paper we begin an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this…