Related papers: Weak Heffter Arrays and biembedding graphs on non-…
A weak homomorphism from a graph G to a graph H is a mapping f from V(G) to V(H), where either f(x) = f(y) or {f(x), f(y)} is an element of E(H), and this holds for all {x, y} in E(G). A rectangular grid graph is formed by taking the…
To a bicomplex one can associate two natural filtrations, the column and row filtrations, and then two associated spectral sequences. This can be generalized to $N$-multicomplexes. We present a family of model category structures on the…
Covering arrays are combinatorial objects that have been successfully applied in the design of test suites for testing systems such as software, circuits and networks, where failures can be caused by the interaction between their…
Given $q$-uniform hypergraphs ($q$-graphs) $F,G$ and $H$, where $G$ is a spanning subgraph of $F$, $G$ is called weakly $H$-saturated in $F$ if the edges in $E(F)\setminus E(G)$ admit an ordering $e_1,\dots, e_k$ so that for all $i\in [k]$…
All rational semisimple braided tensor categories are representation categories of weak quasi Hopf algebras. To proof this result we construct for any given category of this kind a weak quasi tensor functor to the category of finite…
A graph is $k$-degenerate if every subgraph $H$ has a vertex $v$ with $d_{H}(v) \leq k$. The class of degenerate graphs plays an important role in the graph coloring theory. Observed that every $k$-degenerate graph is $(k + 1)$-choosable…
We study convex polyhedra in $\mathbb{R}\mathbb{P}^3$ with all their vertices on a sphere. We do not require, in particular, that the polyhedra lie in the interior of the sphere, hence the term "weakly inscribed". Such polyhedra can be…
Graphons are analytic objects representing limits of convergent sequences of graphs. Lov\'asz and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determined by finitely many graph densities, has a simple…
A weakly reflective submanifold is a minimal submanifold of a Riemannian manifold which has a certain symmetry at each point. In this paper we introduce this notion into a class of proper Fredholm (PF) submanifolds in Hilbert spaces and…
Metacirculants are a rich resource of many families of interesting graphs, and weak metacirculants are generalizations of them. A graph is called a {\em split weak metacirculant} if it has a vertex-transitive split metacyclic automorphism…
In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…
We study the notion of weak amalgamation in the context of diagonal conjugacy classes. Generalizing results of Kechris and Rosendal, we prove that for every countable structure $M$, Polish group $G$ of permutations of $M$, and $n \geq 1$,…
An $(\alpha,\beta)$-spanner of a weighted graph $G=(V,E)$, is a subgraph $H$ such that for every $u,v\in V$, $d_G(u,v) \le d_H(u,v)\le\alpha\cdot d_G(u,v)+\beta$. The main parameters of interest for spanners are their size (number of edges)…
Weak (Hopf) bialgebras are described as (Hopf) bimonoids in appropriate duoidal (also known as 2-monoidal) categories. This interpretation is used to define a category wba of weak bialgebras over a given field. As an application, the "free…
A mapping $\alpha : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we…
Let $\mathscr{H}^2$ denote the space of ordinary Dirichlet series with square summable coefficients, and let $\mathscr{H}^2_0$ denote its subspace consisting of series vanishing at $+\infty$. We investigate the weak product spaces…
Heterogeneous graphs (HGs) also known as heterogeneous information networks have become ubiquitous in real-world scenarios; therefore, HG embedding, which aims to learn representations in a lower-dimension space while preserving the…
The paper presents geometric models for the set WO of weak orders on a finite set. In particulary, WO is modeled as a set of vertices of a cubical subdivision of a permutahedron. This approach is an alternative to the usual representation…
There are a dozen definitions of weak higher categories, all of which loosen the notion of composition of arrows. A new approach is presented here, where instead the notion of identity arrow is weakened -- these are tentatively called fair…
We present HARP, a novel method for learning low dimensional embeddings of a graph's nodes which preserves higher-order structural features. Our proposed method achieves this by compressing the input graph prior to embedding it, effectively…