Related papers: de Bruijn arrays for L-fillings
In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley…
In this paper, the author gives two methods to construct complete Lie algebras. Both methods show that the derivation algebras of some Lie algebras are complete.
We give a construction of an L-infinity map from any L-infinity algebra into its truncated Chevalley-Eilenberg complex as well as its cyclic and A-infinity analogues. This map fits with the inclusion into the full Chevalley-Eilenberg…
The main objective of this project is to determine all irreducible modules of a given modular Lie algebra. In contrast to ordinary Lie algebras, modular Lie algebras require an additional structure known as the p-mapping. The minimal…
Brane tilings are efficient mnemonics for Lagrangians of N=2 Chern-Simons-matter theories. Such theories are conjectured to arise on M2-branes probing singular toric Calabi-Yau fourfolds. In this paper, a simple modification of the…
Except for Koshy who devotes seven pages to applications of Fibonacci Numbers to electric circuits, most books and the Fibonacci Quarterly have been relatively silent on applications of graphs and electric circuits to Fibonacci numbers.…
In this paper, we study the moduli space of all complex 5-dimensional Lie algebras, realizing it as a stratification by orbifolds, which are connected by jump deformations. The orbifolds are given by the action of finite groups on very…
For positive integers $k,n$, a de Bruijn sequence $B(k,n)$ is a finite sequence of elements drawn from $k$ characters whose subwords of length $n$ are exactly the $k^n$ words of length $n$ on $k$ characters. This paper introduces the…
In this article, we show how to transform a colored de Bruijn graph (dBG) into a practical index for processing massive sets of sequencing reads. Similar to previous works, we encode an instance of a colored dBG of the set using BOSS and a…
In this paper, we study moduli spaces of 2-dimensional complex associative algebras. We give a complete calculation of the cohomology of every element in the moduli space, as well as compute their versal deformations.
Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…
This note is but a research announcement, summarizing and explaining results proven and detailed in forthcoming papers. When one studies families of objects over curves, and the objects are parametrized by a Deligne-Mumford stack M, then…
For any positive integers l and m, a set of integers is said to be (weakly) l-sum-free modulo m if it contains no (pairwise distinct) elements $x_1,x_2,...,x_l,y$ satisfying the congruence $x_1+\...+x_l\equiv y\bmod{m}$. It is proved that,…
We calculate the generating functions for the number of tilings of rectangles of various widths by the right tromino, the $L$ tetromino, and the $T$ tetromino. This allows us to place lower bounds on the entropy of tilings of the plane by…
A constructive method is provided that outputs a directed graph which is named a broken crown graph, containing $5n-9$ vertices and $k$ Hamiltonian cycles for any choice of integers $n \geq k \geq 4$. The construction is not designed to be…
A connected planar cubic graph is called an $m$-barrel fullerene and denoted by $F(m,k)$, if it has the following structure: The first circle is an $m$-gon. Then $m$-gon is bounded by $m$ pentagons. After that we have additional k layers of…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
Regular $A_n$-crystals are certain edge-colored directed graphs which are related to representations of the quantized universal enveloping algebra $U_q(\mathfrak{sl}_{n+1})$. For such a crystal $K$ with colors $1,2,...,n$, we consider its…
Using the combinatorial information of a Brauer configuration is possible to compute each entry of the Cartan matrix of the algebra associated to the Brauer configuration.
In this paper, we present a detailed study of the reach distance-layer structure of the De Bruijn and Kautz digraphs, and we apply our analysis to the performance evaluation of deflection routing in De Bruijn and Kautz networks. Concerning…