On the number of L-shapes in embedding dimension four
Combinatorics
2015-05-07 v1
Abstract
\textit{Minimum distance diagrams}, also known as \textit{\textsf{L}--shapes}, have been used to study some properties related to \textit{weighted Cayley digraphs} of \textit{degree} two and \textit{embedding dimension three numerical semigroups}. In this particular case, it has been shown that these discrete structures have at most two related \textsf{L}--shapes. These diagrams are proved to be a good tool for studing \textit{factorizations} and the \textit{catenary degree} for semigroups and \textit{diameter} and \textit{distance} between vertices for digraphs.
Keywords
Cite
@article{arxiv.1505.01464,
title = {On the number of L-shapes in embedding dimension four},
author = {F. Aguiló-Gost and P. A. García-Sánchez and D. Llena},
journal= {arXiv preprint arXiv:1505.01464},
year = {2015}
}