Now showing items 1-20 of 26

• A geometric approach to dense Cayley digraphs of finite Abelian groups ﻿

(Elsevier, 2016)
Conference report
Open Access
We give a method for constructing infinite families of dense (or eventually likely dense) Cayley digraphs of finite Abelian groups. The diameter of the digraphs is obtained by means of the related {\em minimum distance ...
• A geometric approach to dense Cayley digraphs of finite Abelian groups ﻿

(2016)
Article
Open Access
We give a method for constructing infinite families of dense (or eventually likely dense) Cayley digraphs of finite Abelian groups. The diameter of the digraphs is obtained by means of the related minimum distance diagrams. ...
• A preliminary model for optimal load distribution in heterogeneous smart environments ﻿

(2019)
Conference report
Restricted access - publisher's policy
Smart cities are becoming popular and, with them, a plethora of resources is emerging turning into a massive concentration of computing devices. In such environments, the deployment of a smart resources management system ...
• Abelian Cayley digraphs with asymptotically large order for any given degree ﻿

(2016-04-29)
Article
Open Access
Abelian Cayley digraphs can be constructed by using a generalization to Z(n) of the concept of congruence in Z. Here we use this approach to present a family of such digraphs, which, for every fixed value of the degree, ...
• An algorithm to compute the primitive elements of an embedding dimension three numerical semigroups ﻿

(2014)
Article
Open Access
We give an algorithm to compute the set of primitive elements for an embedding dimension three numerical semigroups. We show how we use this procedure in the study of the construction of L-shapes and the tame degree of the ...
• Aprenentatge de càlcul ﻿

(Edicions UPC, 2002)
Book
Conté: 1. Successions, continuïtat i derivació. 2. Integració i sèries.
• Clasificación de 3-semigrupos numéricos mediante L-formas ﻿

Conference report
Restricted access - publisher's policy
Un semigrupo num erico generado por tres elementos tiene asociadas una o dos teselaciones peri odicas del plano generadas por una baldosa en forma de L. Se conocen algunas propiedades combinatorias del semigrupo en t ...
• Classification of numerical 3-semigroups by means of L-shapes ﻿

(2014-06-01)
Article
Open Access
We recall L-shapes, which are minimal distance diagrams, related to weighted 2-Cayley digraphs, and we give the number and the relation between minimal distance diagrams related to the same digraph. On the other hand, we ...
• Computing denumerants in numerical 3-semigroups ﻿

(2018)
Article
Open Access
As far as we know, usual computer algebra packages can not compute denumerants for almost medium (about a hundred digits) or almost medium-large (about a thousand digits) input data in a reasonably time cost on an ordinary ...
• Control – 1A de Matemàtica Discreta [Curs 2019-2020] - Q2 ﻿

(Universitat Politècnica de Catalunya, 2020-03-30)
Exam
• Control – 1B de Matemàtica Discreta [Curs 2019-2020] - Q2 ﻿

(Universitat Politècnica de Catalunya, 2020-03-30)
Exam
• Denumerants of 3-numerical semigroups ﻿

(2014)
Article
Open Access
Denumerants of numerical semigroups are known to be difficult to obtain, even with small embedding dimension of the semigroups. In this work we give some results on denumerants of 3-semigroups S=<a,b,c>S=<a,b,c>. Closed ...
• Examen de Teoria de Grafs - MATD [Curs 20202021] - Q2 ﻿

(Universitat Politècnica de Catalunya, 2021-03-26)
Exam
• Factorization and catenary degree in 3-generated numerical semigroups ﻿

(2009-08-01)
Article
Restricted access - publisher's policy
Given a numerical semigroup S(A), generated by A = {a,b,N} ⊂ N with 0 < a < b < N and gcd(a,b,N) = 1, we give a parameterization of the set F(m;A) = {(x, y, z) ∈ $N^3$ | xa + yb + zN = m} for any m ∈ S(A). We also give the ...
• Familias infinitas de digrafos de Cayley de grado 2 óptimos sobre grupos abelianos finitos ﻿

Conference report
Restricted access - publisher's policy
Sea GN un grupo abeliano finito de orden N. Para cada conjunto de generadores f, g = GN, consideremos el digrafo de Cayley Cay(GN, {f, g}). Seg´un sea GN c´ıclico o no c´ıclico, podemos obtener un di´ametro ´optimo ...
• MATEMÀTICA DISCRETA (Examen 1r quadrimestre) [Curs 2019-2020] ﻿

(Universitat Politècnica de Catalunya, 2019-11-06)
Exam
• MATEMÀTICA DISCRETA (Examen final - 1r quadrimestre) [Curs 2019-2020] ﻿

(Universitat Politècnica de Catalunya, 2020-01-13)
Exam
• MATEMÀTICA DISCRETA (Examen final - 1r quadrimestre) [Curs 2020-2021] ﻿

(Universitat Politècnica de Catalunya, 2021-01-15)
Exam