Related papers: Weak Heffter Arrays and biembedding graphs on non-…

This paper studies planar drawings of graphs in which each vertex is represented as a point along a sequence of horizontal lines, called levels, and each edge is either a horizontal segment or a strictly $y$-monotone curve. A graph is…

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,…

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Hadamard diagonalizable graphs are undirected graphs for which the corresponding Laplacian is diagonalizable by a Hadamard matrix. Such graphs have been studied in the context of quantum state transfer. Recently, the concept of a weak…

We propose a scheme for generating a weakly chordal graph on n vertices with m edges. In this method, we first construct a tree and then generate an orthogonal layout (which is a weakly chordal graph on the n vertices) based on this tree.…

This work extends the idea of matched pairs presented by Majid in \cite{Majid} and Takeuchi in \cite{Takeuchi} for the context of weak bialgebras and weak Hopf algebras. We introduce, also inspired by partial matched pairs…

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

This is partly a survey and partly a research article. Some known results and open problems about Kaehler groups (fundamental groups of compact Kaehler manifolds) are discussed. A new notion of Kaehler homomorphism is introduced. This is a…

We show that the image of repeated differentiation on weak cusp forms is precisely the subspace which is orthogonal to the space of weakly holomorphic modular forms. This gives a new interpretation of the weakly holomorphic Hecke…

In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…

Based on the novel notion of `weakly counital fusion morphism', regular weak multiplier bimonoids in braided monoidal categories are introduced. They generalize weak multiplier bialgebras over fields and multiplier bimonoids in braided…

The notion of graph cover, also known as locally bijective homomorphism, is a discretization of covering spaces known from general topology. It is a pair of incidence-preserving vertex- and edge-mappings between two graphs, the…

We show that the billiard in a regular polygon is weak mixing in almost every invariant surface, except in the trivial cases which give rise to lattices in the plane (triangle, square and hexagon). More generally, we study the problem of…

We define a homotopy relation between arrows of a category with weak equivalences, and give a condition under which the quotient by the homotopy relation yields the homotopy category. In the case of the fibrant-cofibrant objects of a model…

By following the ideas underpinning the well-established ``homogeneous model'' of an $n$-dimensional Euclidean space, we investigate whether the motion group or the weak motion group of an $n$-dimensional affine metric space on a vector…

Developing an idea of Kapranov and Voevodsky, we introduce a model of weak omega-categories based on directed complexes, combinatorial presentations of pasting diagrams. We propose this as a convenient framework for higher-dimensional…

We introduce a notion of weak convergence in arbitrary metric spaces. Metric functionals are key in our analysis: weak convergence of sequences in a given metric space is tested against all the metric functionals defined on said space. When…

Motivated by recent work of Bukh and Nivasch on one-sided $\varepsilon$-approximants, we introduce the notion of \emph{weighted $\varepsilon$-nets}. It is a geometric notion of approximation for point sets in $\mathbb{R}^d$ similar to…

A graph $G$ is almost hypohamiltonian (a.h.) if $G$ is non-hamiltonian, there exists a vertex $w$ in $G$ such that $G - w$ is non-hamiltonian, and $G - v$ is hamiltonian for every vertex $v \ne w$ in $G$. The second author asked in [J.…

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…