Related papers: Modular, $k$-noncrossing diagrams

Surprisingly, the order-$k$ Voronoi diagram of line segments had received no attention in the computational-geometry literature. It illustrates properties surprisingly different from its counterpart for points; for example, a single…

Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function…

A matrix is $k$-nonnegative if all its minors of size $k$ or less are nonnegative. We give a parametrized set of generators and relations for the semigroup of $k$-nonnegative $n\times n$ invertible matrices in two special cases: when $k =…

We define iteration over a two dimensional manifold as analog of iteration over a path defined by Chen. We give several applications. Some of them include constructions of non-abelian modular symbol for $SL(3,\Z)$ and for $SL_{2/K}$, where…

Seymour's famous decomposition theorem for regular matroids states that any totally unimodular (TU) matrix can be constructed through a series of composition operations called $k$-sums starting from network matrices and their transposes and…

We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…

Dual graphs have been applied to model RNA secondary structures. The purpose of the paper is two-fold: we present new graph-theoretic properties of dual graphs to validate the further analysis and classification of RNAs using these…

The boundary seam algebras $\mathsf{b}_{n,k}(\beta=q+q^{-1})$ were introduced by Morin-Duchesne, Ridout and Rasmussen to formulate algebraically a large class of boundary conditions for two-dimensional statistical loop models. The…

For non-negative integers~$k$, we consider graphs in which every vertex has exactly $k$ vertices at distance~$2$, i.e., graphs whose distance-$2$ graphs are $k$-regular. We call such graphs $k$-metamour-regular motivated by the terminology…

The cross gramian matrix is a tool for model reduction and system identification, but it is only computable for square control systems. For symmetric systems the cross gramian possesses a useful relation to the system's associated Hankel…

We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…

Let M be a module over a commutative ring R. In this paper, we continue our study of annihilating-submodule graph AG(M) which was introduced in (The Zariski topology-graph of modules over commutative rings, Comm. Algebra., 42 (2014),…

We consider framed chord diagrams, i.e. chord diagrams with chords of two types. It is well known that chord diagrams modulo 4T-relations admit Hopf algebra structure, where the multiplication is given by any connected sum with respect to…

We present an algorithm for the efficient generation of all pairwise non-isomorphic cycle permutation graphs, i.e. cubic graphs with a $2$-factor consisting of two chordless cycles, non-hamiltonian cycle permutation graphs and permutation…

For an integer $k\geq 1$, a graph is called a $k$-circulant if its automorphism group contains a cyclic semiregular subgroup with $k$ orbits on the vertices. We show that, if $k$ is even, there exist infinitely many cubic arc-transitive…

For many of the unsolved problems concerning cycles and matchings in graphs it is known that it is sufficient to prove them for \emph{snarks}, the class of nontrivial 3-regular graphs which cannot be 3-edge coloured. In the first part of…

We consider the graphs whose edges are marked by the integers (weights) from $0$ to $q-1$ (zero corresponds to no-edge). Such graph is called additive if its vertices can be marked in such a way that the weight of every edge is equal to the…

In this note, we prove that every non-complete $(k+1)$-critical graph contains cycles of all lengths modulo $k$, where $k=4,5$.

A drawing of a graph in the plane is {\it pseudolinear} if the edges of the drawing can be extended to doubly-infinite curves that form an arrangement of pseudolines, that is, any pair of edges crosses precisely once. A special case are…

Motivated by the work of Anstee, Griggs, and Sali on forbidden submatrices and the extremal sat-function for graphs, we introduce sat-type problems for matrices. Let F be a family of k-row matrices. A matrix M is called F-admissible if M…