On the number of L-shapes in embedding dimension four numerical semigroups

Minimum distance diagrams, also known as L-shapes, have been used to study some properties related to weighted Cayley digraphs of degree two and embedding dimension three numerical semigroups. In this particular case, it has been shown that these discrete structures have at most two related L-shapes...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics Vol. 338; no. 12; pp. 2168 - 2178
Main Authors: Aguiló-Gost, F., García-Sánchez, P.A., Llena, D.
Format: Journal Article Publication
Language:English
Published: Elsevier B.V 06.12.2015
Subjects:
05 Combinatorics
05C Graph theory
11 Number theory
11D Diophantine equations
Analogue
Catenaries
Classificació AMS
Combinatorial analysis
Combinatòria
Factorization
Grafs, Teoria de
Graph theory
Group theory
L-shape
LOOP NETWORKS
Matemàtica discreta
Matemàtiques i estadística
Mathematical models
Numerical semigroup
Teoria de grafs
Weighted Cayley digraph
Àrees temàtiques de la UPC
Numerical semigroup
L-shape
Weighted Cayley digraph
Factorization
ISSN:0012-365X, 1872-681X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Minimum distance diagrams, also known as L-shapes, have been used to study some properties related to weighted Cayley digraphs of degree two and embedding dimension three numerical semigroups. In this particular case, it has been shown that these discrete structures have at most two related L-shapes. These diagrams are proved to be a good tool for studying factorizations and the catenary degree for semigroups and diameter and distance between vertices for digraphs. This maximum number of L-shapes has not been proved to be kept when increasing the degree of digraphs or the embedding dimension of semigroups. In this work we give a family of embedding dimension four numerical semigroups Sn, for odd n≥5, such that the number of related L-shapes is n+32. This family has her analogue to weighted Cayley digraphs of degree three. Therefore, the number of L-shapes related to numerical semigroups can be as large as wanted when the embedding dimension is at least four. The same is true for weighted Cayley digraphs of degree at least three. This fact has several implications on the combinatorics of factorizations for numerical semigroups and minimum paths between vertices for weighted digraphs.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2015.05.019