Related papers: Modular, $k$-noncrossing diagrams
A nut graph is a simple graph whose adjacency matrix is singular with $1$-dimensional kernel such that the corresponding eigenvector has no zero entries. In 2020, Fowler et al. characterised for each $d \in \{3,4,\ldots,11\}$ all values $n$…
The symmetric inverse monoid, SIM(n), is the set of all partial one-to-one mappings from the set {1, 2, ... , n} to itself under the operation of composition. Earlier research on the symmetric inverse monoid delineated the process for…
Understanding the relationship between mock modular forms and quantum modular forms is a problem of current interest. Both mock and quantum modular forms exhibit modular-like transformation properties under suitable subgroups of…
A blocking quadruple (BQ) is a quadruple of vertices of a graph such that any two vertices of the quadruple either miss (have no neighbours on) some path connecting the remaining two vertices of the quadruple, or are connected by some path…
Gareth Jones asked during the 2014 SIGMAP conference for examples of regular dessins with nonabelian fields of moduli. In this paper, we first construct dessins whose moduli fields are nonabelian Galois extensions of the form…
Graphs are ubiquitous data structures for representing interactions between entities. With an emphasis on the use of graphs to represent chemical molecules, we explore the task of learning to generate graphs that conform to a distribution…
We define $k$-dimensional digraphs and initiate a study of their spectral theory. The $k$-dimensional digraphs can be viewed as generating graphs for small categories called $k$-graphs. Guided by geometric insight, we obtain several new…
In this paper we analyze the length-spectrum of blocks in $\gamma$-structures. $\gamma$-structures are a class of RNA pseudoknot structures that plays a key role in the context of polynomial time RNA folding. A $\gamma$-structure is…
This introductory paper studies a class of real analytic functions on the upper half plane satisfying a certain modular transformation property. They are not eigenfunctions of the Laplacian and are quite distinct from Maass forms. These…
A graph $G = (V, E)$ is said to be word-representable if a word $w$ can be formed using the letters of the alphabet $V$ such that for every pair of vertices $x$ and $y$, $xy \in E$ if and only if $x$ and $y$ alternate in $w$. A…
The symplectic graph Sp(2d, q) is the collinearity graph of the symplectic space of dimension 2d over a finite field of order q. A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1, lambda_2 ,m,n) if…
The {\em Fibonacci cube} of dimension $n$, denoted as $\Gamma\_n$, is the subgraph of $n$-cube $Q\_n$ induced by vertices with no consecutive 1's. We study the maximum number of disjoint subgraphs in $\Gamma\_n$ isomorphic to $Q\_k$, and…
Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…
A drawing of a graph is {\em pseudolinear} if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The {\em pseudolinear crossing number} of a graph $G$ is the minimum number of pairwise…
This work deals with the construction of networks of topological defects in models described by a single complex scalar field. We take advantage of the deformation procedure recently used to describe kinklike defects in order to build…
A g-circulant matrix of order n is defined as a matrix of order n where each row is a right cyclic shift in g-places to the preceding row. Using number theory, certain nonnegative g-circulant real matrices are constructed. In particular, it…
We develop a new ensemble of modular random graphs in which degree-degree correlations can be different in each module and the inter-module connections are defined by the joint degree-degree distribution of nodes for each pair of modules.…
The sum-essential graph $ \mathcal{S}_R(M) $ of a left $R$-module $M$ is a graph whose vertices are all nontrivial submodules of $M$ and two distinct submodules are adjacent iff their sum is an essential submodule of $M$. Properties of the…
We introduce, for every surface {\Sigma}, a two-way connection between FO transductions (first-order logical transformations) of the graphs embeddable in {\Sigma} and a certain variant of fan-crossing drawings of graphs in {\Sigma}. If the…
Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…