Pasar al contenido principal

SINGULARIDADES. METODOS VALORATIVOS Y COMBINATORIOS. CODIGOS ALGEBRAICOS Y DE RED.

PID2022-138906NB-C21

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2022
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE VALLADOLID

Resultados relacionados

Resultados totales (Incluyendo duplicados): 6
Encontrada(s) 1 página(s)

RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Software de investigación Software (Software)

A package for computing the set of affine C-semigroups with fixed Frobenius element and non-consecutive small elements. 

  • Tapia Ramos, Raquel
  • Vigneron Tenorio, Alberto
This is a Mathematica package for computing the set of affine C-semigroups with fixed Frobenius element f and non-consecutive small elements
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

A computational Approach to the Study of Finite-Complement Submonids of an Affine Cone

  • Rosales, J.C.
  • Tapia Ramos, Raquel
  • Vigneron Tenorio, Alberto
Let C⊆Np be an integer cone. A C-semigroup S⊆C is an affine semigroup such that the set C\S is finite. Such C-semigroups are central to our study. We develop new algorithms for computing C-semigroups with specified invariants, including genus, Frobenius element, and their combinations, among other invariants. To achieve this, we introduce a new class of C-semigroups, termed B-semigroups. By fixing the degree lexicographic order, we also research the embedding dimension for both ordinary and mult-embedded N2-semigroups. These results are applied to test some generalizations of Wilf’s conjecture.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

On Ideals of Submonoids of Power Monoids

  • García García, Juan Ignacio
  • Marín Aragón, Daniel
  • Vigneron Tenorio, Alberto
Let (Formula presented.) be a numerical monoid, while a (Formula presented.) -monoid S is a monoid generated by a finite number of finite non-empty subsets of (Formula presented.). That is, S is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. This work provides an algorithm for computing the ideals associated with some (Formula presented.) -monoids. These are the key to studying some factorization properties of (Formula presented.) -monoids and some additive properties of sumsets. This approach links computational commutative algebra with additive number theory.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

On p-Frobenius of Affine Semigroups

  • García Barroso, Evelia R.
  • García García, Juan Ignacio
  • Santana Sánchez, Luis José
  • Vigneron Tenorio, Alberto
This paper studies the p-Frobenius vector of affine semigroups . Defined with respect to a graded monomial order, the p-Frobenius vector represents the maximum element with at most p factorizations within S. We develop efficient algorithms for computing these vectors and analyze their behavior under the gluing operations with .
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Stable and optimal conductance recovery on networks

  • Carmona Mejías, Ángeles|||0000-0001-7713-1066
  • Encinas Bachiller, Andrés Marcos|||0000-0001-5588-0373
  • Jiménez Jiménez, María José|||0000-0003-3502-462X
  • Samperio Valdivieso, Álvaro
This paper extends our previous work on the discrete inverse conductance problem on spider networks. Our approach leverages polynomial optimization techniques, incorporating a regularization term to stabilize the inverse problem that penalises the deviation from a piecewise constant conductance hypothesis. Here, we show examples of the stability of the conductance recovery even in cases in which the real conductance does not satisfy the piecewise constant property. We provide a comprehensive analysis of the error behavior with respect to the penalty parameter, demonstrating the effectiveness of our method in various network scenarios. Finally, we look for optimality guarantees for the numerical solution of the polynomial optimization problem. This work significantly contributes to the field of applied inverse problems, offering robust strategies for conductance recovery in complex network structures., The authors thank the anonymous referees for their careful reading and insightful remarks, which have helped improve both the presentation and the results of this paper. This work has been partially supported by the Spanish Research Council (Ministerio de Ciencia e Innovación) under project PID2021-122501NB-I00 and PID2022-138906NB-C21, by the Universitat Politècnica de Catalunya under funds AGRUPS-UPC 2023, and by the Generalitat goverment under funds Producte 2025, Indùstria del coneixement. Moreover, Á. Samperio was also supported by a FPI grant of the Research Project PGC2018-096446-BC21., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Stable and optimal conductance recovery on networks

  • Carmona Mejías, Ángeles
  • Encinas Bachiller, Andrés Marcos
  • Jiménez Jiménez, María José
  • Samperio Valdivieso, Álvaro
This paper extends our previous work on the discrete inverse conductance problem on spider networks. Our approach leverages polynomial optimization techniques, incorporating a regularization term to stabilize the inverse problem that penalises the deviation from a piecewise constant conductance hypothesis. Here, we show examples of the stability of the conductance recovery even in cases in which the real conductance does not satisfy the piecewise constant property. We provide a comprehensive analysis of the error behavior with respect to the penalty parameter, demonstrating the effectiveness of our method in various network scenarios. Finally, we look for optimality guarantees for the numerical solution of the polynomial optimization problem. This work significantly contributes to the field of applied inverse problems, offering robust strategies for conductance recovery in complex network structures., The authors thank the anonymous referees for their careful reading and insightful remarks, which have helped improve both the presentation and the results of this paper. This work has been partially supported by the Spanish Research Council (Ministerio de Ciencia e Innovación) under project PID2021-122501NB-I00 and PID2022-138906NB-C21, by the Universitat Politècnica de Catalunya under funds AGRUPS-UPC 2023, and by the Generalitat goverment under funds Producte 2025, Indùstria del coneixement. Moreover, Á. Samperio was also supported by a FPI grant of the Research Project PGC2018-096446-BC21., Peer Reviewed, Postprint (published version)