Related papers: Relative Heffter arrays and biembeddings

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

Let $m$ a positive integer, not divisible by 2,3,5,7. We generalize the classification of basic quasi-Hopf algebras over cyclic groups of prime order given in \cite{EG3} to the case of cyclic groups of order $m$. To this end, we introduce a…

We introduce $(k,l)$-regular maps, which generalize two previously studied classes of maps: affinely $k$-regular maps and totally skew embeddings. We exhibit some explicit examples and obtain bounds on the least dimension of a Euclidean…

This is the first of four articles studying some slight generalisations H(n,m) of Khovanov's diagram algebra, as well as quasi-hereditary covers K(n,m) of these algebras in the sense of Rouquier, and certain infinite dimensional limiting…

The focus of this thesis is the study and construction of covering arrays, relying on maximal period sequences and other tools from finite fields. A covering array of strength $t$, denoted $\mathrm{CA}(N; t, k,v)$, is an $N\times k$ array…

Let $G$ and $H$ be disjoint embeddings of complete graphs $K_m$ and $K_n$ in $\mathbb{R}^3$ such that some cycle in $G$ links a cycle in $H$ with non-zero linking number. We say that $G$ and $H$ are *weakly linked* if the absolute value of…

In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using…

We present SeVeN (Semantic Vector Networks), a hybrid resource that encodes relationships between words in the form of a graph. Different from traditional semantic networks, these relations are represented as vectors in a continuous vector…

Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi:…

This paper studies a general class of Iterated Function Systems (IFS). No contractivity assumptions are made, other than the existence of some compact attractor. The possibility of escape to infinity is considered. Our present approach is…

A Robinson similarity matrix is a symmetric matrix where the entry values on all rows and columns increase toward the diagonal. Decompose the Robinson matrix into the sum of k {0, 1}-matrices, then these k {0, 1}-matrices are the adjacency…

We study the (complex) Hecke algebra $\mathcal{H}_S(\mathbf{q})$ of a finite simply-laced Coxeter system $(W,S)$ with independent parameters $\mathbf{q} \in \left( \mathbb{C} \setminus\{\text{roots of unity}\} \right)^S$. We construct its…

Consider the following classes of pairs consisting of a group and a finite collection of subgroups: $\mathcal{C}= \left\{ (G,\mathcal H) \mid \text{$\mathcal{H}$ is hyperbolically embedded in $G$} \right\}$ and $ \mathcal{D}= \left\{…

An ordinary voltage graph embedding of a graph in a surface encodes a certain kind of highly symmetric covering space of that surface. Given an ordinary voltage graph embedding of a graph $G$ in a surface with voltage group $A$ and a…

Relational representation learning transforms relational data into continuous and low-dimensional vector representations. However, vector-based representations fall short in capturing crucial properties of relational data that are complex…

A network embedding is a representation of a large graph in a low-dimensional space, where vertices are modeled as vectors. The objective of a good embedding is to preserve the proximity between vertices in the original graph. This way,…

To study operator algebras with symmetries in a wide sense we introduce a notion of {\em relative convolution operators} induced by a Lie algebra. Relative convolutions recover many important classes of operators, which have been already…

Given non-negative integers m, n, h and k with $ m\geq h>1 $ and $ n\geq k>1, $an [h-k]-bipartite hypertournament on $ m+n$ vertices is a triple $(U,V,A) $, where U and V are two sets of vertices with $| U| =m$ and $ | V| =n,$ and $A$ is a…

We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…

Vector representations of graphs and relational structures, whether hand-crafted feature vectors or learned representations, enable us to apply standard data analysis and machine learning techniques to the structures. A wide range of…