http://sedici.unlp.edu.ar:80/handle/10915/94591 2026-11-04T00:21:57Z 2026-11-04T00:21:57Z Jalil, Nicolás Daher Juareguiberry, Graciana Fasano, María Victoria Coronel, Claudia Paola Oiberman, Alicia http://sedici.unlp.edu.ar:80/handle/10915/196945 2026-07-15T20:25:19Z 2025-07-01T00:00:00Z

Articulo Ludovica Pediátrica; vol. 28, no. 1 Introducción: El vínculo madre-lactante es el que se establece entre la madre y el bebé. Engloba a la comunicación y es el producto de un proceso comunicacional continuo. Para díadas sin dificultades en el desarrollo se utiliza la Escala de Observación del Vínculo Madre-Bebé. Dado que los lactantes con Síndrome de Down (SD) presentan mayores dificultades en el desarrollo, resulta necesario contar con instrumentos específicamente adaptados. El objetivo fue analizar la validez de contenido del perfil 1 de la escala mediante el juicio de expertos, para su uso en díadas madre-lactante con SD entre 0 y 8 meses. Material y métodos: Se realizó un estudio descriptivo con diseño mixto. Profesionales expertos con experiencia clínica evaluaron cada ítem de la escala según los criterios de suficiencia, claridad, coherencia y relevancia. Además, se recopilaron sugerencias cualitativas. El análisis cuantitativo incluyó el coeficiente V de Aiken por ítem y Kappa de Fleiss por criterio. Para los datos cualitativos se realizó el análisis temático de Braun y Clarke. El procesamiento estadístico se realizó con el software R versión 4.3.1 y SPSS versión 26. Resultados: Participaron 29 profesionales de diversas disciplinas. La mayoría de los ítems de la escala obtuvieron un V de Aiken ≥ 0,70 con significación (p < 0,05) para suficiencia, claridad, coherencia y relevancia, excepto la función sostén (V = 0,59; p = 0,229). El Kappa de Fleiss indicó concordancia leve en suficiencia (K = 0,19), moderado en claridad (K = 0,59) y sustancial en coherencia (K = 0,61) y relevancia (K = 0,70). El análisis temático identificó ajustes necesarios en todas las dimensiones, especialmente para la función sostén. Conclusión: El análisis de la validez de contenido basado en el juicio de expertos respalda la revisión y adaptación de la Escala de Observación del Vínculo Madre-Bebé para lactantes con Síndrome de Down.; Introduction: The mother-infant bond refers to the relationship established between the mother and her baby. It encompasses communication and is the result of a continuous communicational process. The Mother-Infant Bond Observation Scale was originally designed for dyads without developmental difficulties. Given that infants with Down syndrome (DS) are at increased risk of developing conditions that may compromise their development, it is essential to have instruments specifically adapted to this population. The aim of this study was to analyze the content validity of profile 1 of the scale through expert judgment, for its use with mother-infant dyads with DS between 0 and 8 months. Materials and Methods: A descriptive study with a mixed-methods design was conducted. Professional experts with clinical experience evaluated each item of the scale according to the criteria of sufficiency, clarity, coherence, and relevance. Qualitative suggestions were also collected. Quantitative analysis included Aiken’s V coefficient per item and Fleiss’ Kappa per criterion. Qualitative data were analyzed using the thematic analysis approach by Braun and Clarke. Statistical processing was performed using R version 4.3.1 and SPSS version 26. Results: Twenty-nine professionals from various disciplines participated. Most items obtained Aiken’s V ≥ 0.70 with statistical significance (p < 0.05) for sufficiency, clarity, coherence, and relevance, except for the holding function (V = 0.59; p = 0.229). Fleiss’ Kappa indicated slight agreement for sufficiency (K = 0.19), moderate for clarity (K = 0.59), and substantial for coherence (K = 0.61) and relevance (K = 0.70). Thematic analysis identified necessary adjustments in all dimensions, particularly regarding the holding function. Conclusion: The analysis of content validity based on expert judgment supports the revision and adaptation of the Mother-Baby Bond Observation Scale for infants with Down syndrome.

2025-07-01T00:00:00Z Introducción: El vínculo madre-lactante es el que se establece entre la madre y el bebé. Engloba a la comunicación y es el producto de un proceso comunicacional continuo. Para díadas sin dificultades en el desarrollo se utiliza la Escala de Observación del Vínculo Madre-Bebé. Dado que los lactantes con Síndrome de Down (SD) presentan mayores dificultades en el desarrollo, resulta necesario contar con instrumentos específicamente adaptados. El objetivo fue analizar la validez de contenido del perfil 1 de la escala mediante el juicio de expertos, para su uso en díadas madre-lactante con SD entre 0 y 8 meses. Material y métodos: Se realizó un estudio descriptivo con diseño mixto. Profesionales expertos con experiencia clínica evaluaron cada ítem de la escala según los criterios de suficiencia, claridad, coherencia y relevancia. Además, se recopilaron sugerencias cualitativas. El análisis cuantitativo incluyó el coeficiente V de Aiken por ítem y Kappa de Fleiss por criterio. Para los datos cualitativos se realizó el análisis temático de Braun y Clarke. El procesamiento estadístico se realizó con el software R versión 4.3.1 y SPSS versión 26. Resultados: Participaron 29 profesionales de diversas disciplinas. La mayoría de los ítems de la escala obtuvieron un V de Aiken ≥ 0,70 con significación (p < 0,05) para suficiencia, claridad, coherencia y relevancia, excepto la función sostén (V = 0,59; p = 0,229). El Kappa de Fleiss indicó concordancia leve en suficiencia (K = 0,19), moderado en claridad (K = 0,59) y sustancial en coherencia (K = 0,61) y relevancia (K = 0,70). El análisis temático identificó ajustes necesarios en todas las dimensiones, especialmente para la función sostén. Conclusión: El análisis de la validez de contenido basado en el juicio de expertos respalda la revisión y adaptación de la Escala de Observación del Vínculo Madre-Bebé para lactantes con Síndrome de Down. Introduction: The mother-infant bond refers to the relationship established between the mother and her baby. It encompasses communication and is the result of a continuous communicational process. The Mother-Infant Bond Observation Scale was originally designed for dyads without developmental difficulties. Given that infants with Down syndrome (DS) are at increased risk of developing conditions that may compromise their development, it is essential to have instruments specifically adapted to this population. The aim of this study was to analyze the content validity of profile 1 of the scale through expert judgment, for its use with mother-infant dyads with DS between 0 and 8 months. Materials and Methods: A descriptive study with a mixed-methods design was conducted. Professional experts with clinical experience evaluated each item of the scale according to the criteria of sufficiency, clarity, coherence, and relevance. Qualitative suggestions were also collected. Quantitative analysis included Aiken’s V coefficient per item and Fleiss’ Kappa per criterion. Qualitative data were analyzed using the thematic analysis approach by Braun and Clarke. Statistical processing was performed using R version 4.3.1 and SPSS version 26. Results: Twenty-nine professionals from various disciplines participated. Most items obtained Aiken’s V ≥ 0.70 with statistical significance (p < 0.05) for sufficiency, clarity, coherence, and relevance, except for the holding function (V = 0.59; p = 0.229). Fleiss’ Kappa indicated slight agreement for sufficiency (K = 0.19), moderate for clarity (K = 0.59), and substantial for coherence (K = 0.61) and relevance (K = 0.70). Thematic analysis identified necessary adjustments in all dimensions, particularly regarding the holding function. Conclusion: The analysis of content validity based on expert judgment supports the revision and adaptation of the Mother-Baby Bond Observation Scale for infants with Down syndrome. Colombo, Leonardo Eyrea Irazú, María Emma De Diego, David Martín Sánchez, María Daniela Zuccalli, Marcela http://sedici.unlp.edu.ar:80/handle/10915/194186 2026-05-08T20:20:58Z 2025-01-01T00:00:00Z

Articulo On time-dependent lagrangian systems over lie groups and variational integrators XLI Congreso Argentino de Mecánica Computacional (Buenos Aires, 11 al 14 de noviembre de 2025); Mecánica Computacional; vol. 42, no. 7 Los sistemas Lagrangianos mecánicos dependientes del tiempo son de gran interés en diversas ramas de la ingeniería y la física. En particular, en robótica, se consideran numerosos sistemas no autónomos, es decir, dependientes del tiempo. En este trabajo presentamos la dinámica de tales sistemas en grupos de Lie, considerando tanto variables temporales continuas como discretas. En este marco, abordamos el problema de integrar sus ecuaciones de movimiento mediante técnicas variacionales discretas. Ilustramos el enfoque con ejemplos sencillos cuyo espacio de configuración es el grupo euclidiano y proponemos sus versiones discretas. Asimismo, estudiamos un ejemplo en el grupo de rotaciones espaciales y, finalmente, discutimos posibles líneas de investigación futura orientadas al desarrollo de integradores variacionales para sistemas más generales.; Time-dependent Lagrangian mechanical systems are of great interest in various branches of engineering and physics. In particular, in robotics, many non-autonomous, that is time-dependent, Lagrangian systems are considered. In this work, we present the dynamics of such systems on Lie groups, considering both continuous and discrete time variables. Within this framework, we address the problem of integrating their equations of motion using discrete variational techniques. We illustrate the approach with simple examples whose configuration space is the Euclidean group, and propose their discrete counterparts. We also study an example on the group of spatial rotations, and finally discuss future research directions aimed at developing variational integrators for more general systems.

2025-01-01T00:00:00Z Los sistemas Lagrangianos mecánicos dependientes del tiempo son de gran interés en diversas ramas de la ingeniería y la física. En particular, en robótica, se consideran numerosos sistemas no autónomos, es decir, dependientes del tiempo. En este trabajo presentamos la dinámica de tales sistemas en grupos de Lie, considerando tanto variables temporales continuas como discretas. En este marco, abordamos el problema de integrar sus ecuaciones de movimiento mediante técnicas variacionales discretas. Ilustramos el enfoque con ejemplos sencillos cuyo espacio de configuración es el grupo euclidiano y proponemos sus versiones discretas. Asimismo, estudiamos un ejemplo en el grupo de rotaciones espaciales y, finalmente, discutimos posibles líneas de investigación futura orientadas al desarrollo de integradores variacionales para sistemas más generales. Time-dependent Lagrangian mechanical systems are of great interest in various branches of engineering and physics. In particular, in robotics, many non-autonomous, that is time-dependent, Lagrangian systems are considered. In this work, we present the dynamics of such systems on Lie groups, considering both continuous and discrete time variables. Within this framework, we address the problem of integrating their equations of motion using discrete variational techniques. We illustrate the approach with simple examples whose configuration space is the Euclidean group, and propose their discrete counterparts. We also study an example on the group of spatial rotations, and finally discuss future research directions aimed at developing variational integrators for more general systems. García, Gastón Andrés Gavarini, Fabio http://sedici.unlp.edu.ar:80/handle/10915/190022 2026-02-05T20:19:56Z 2022-01-01T00:00:00Z

Articulo Journal of Noncommutative Geometry; vol. 16, no. 3 We address the study of multiparameter quantum groups (MpQGs) at roots of unity, namely quantum universal enveloping algebras Uq (g) depending on a matrix of parameters q D q=(qᵢⱼ)ᵢ,ⱼ∈I . This is performed via the construction of quantum root vectors and suitable "integral forms” of Uq (g), a restricted one—generated by quantum divided powers and quantum binomial coefficients—and an unrestricted one—where quantum root vectors are suitably renormalized. The specializations at roots of unity of either form are the "MpQGs at roots of unity” we look for. In particular, we study special subalgebras and quotients of our MpQGs at roots of unity—namely, the multiparameter version of small quantum groups—and suitable associated quantum Frobenius morphisms, that link the MpQGs at roots of 1 with MpQGs at 1, the latter being classical Hopf algebras bearing a well precise Poisson-geometrical content. A key point in the discussion, often at the core of our strategy, is that every MpQG is actually a 2-cocycle deformation of the algebra structure of (a lift of) the "canonical” one-parameter quantum group by Jimbo–Lusztig, so that we can often rely on already established results available for the latter. On the other hand, depending on the chosen multiparameter q, our quantum groups yield (through the choice of integral forms and their specializations) different semiclassical structures, namely different Lie coalgebra structures and Poisson structures on the Lie algebra and algebraic group underlying the canonical one-parameter quantum group.

2022-01-01T00:00:00Z We address the study of multiparameter quantum groups (MpQGs) at roots of unity, namely quantum universal enveloping algebras Uq (g) depending on a matrix of parameters q D q=(qᵢⱼ)ᵢ,ⱼ∈I . This is performed via the construction of quantum root vectors and suitable "integral forms” of Uq (g), a restricted one—generated by quantum divided powers and quantum binomial coefficients—and an unrestricted one—where quantum root vectors are suitably renormalized. The specializations at roots of unity of either form are the "MpQGs at roots of unity” we look for. In particular, we study special subalgebras and quotients of our MpQGs at roots of unity—namely, the multiparameter version of small quantum groups—and suitable associated quantum Frobenius morphisms, that link the MpQGs at roots of 1 with MpQGs at 1, the latter being classical Hopf algebras bearing a well precise Poisson-geometrical content. A key point in the discussion, often at the core of our strategy, is that every MpQG is actually a 2-cocycle deformation of the algebra structure of (a lift of) the "canonical” one-parameter quantum group by Jimbo–Lusztig, so that we can often rely on already established results available for the latter. On the other hand, depending on the chosen multiparameter q, our quantum groups yield (through the choice of integral forms and their specializations) different semiclassical structures, namely different Lie coalgebra structures and Poisson structures on the Lie algebra and algebraic group underlying the canonical one-parameter quantum group. Cornejo, Juan Manuel San Martín, Hernán Javier http://sedici.unlp.edu.ar:80/handle/10915/164546 2024-04-08T20:47:23Z 2019-01-01T00:00:00Z

Objeto de conferencia XV Congreso Dr. Antonio Monteiro (Bahía Blanca, 5 al 7 de junio de 2019) En 2008 H.P. Sankappanavar introdujo y estudió a las álgebras de semi Heyting como una generalización de las álgebras de Heyting [3]. Más tarde, en 2011, definió a las álgebras de semi Heyting dualmente hemimórficas como una expansión de las álgebras de semi Heyting en términos de un hemimorfismo dual que generaliza la operación de De Morgan y el pseudocomplemento dual [4]. Las álgebras de Nelson fueron definidas por H. Rasiowa en [2]. Existe una relación cercana entre la variedad de las álgebras de Nelson y la variedad de las álgebras de Heyting, la cual fue estudiada por D. Vakarelov [6] y A. Sendlewski [5], entre otros. En [1] se extendió esta construcción en el contexto de las álgebras de semi Heyting y se obtuvo una nueva variedad cuyos miembros se denominaron álgebras de semi Nelson. En esta charla contaremos cómo se puede extender la relación entre las álgebras de semi Heyting y las álgebras de semi Nelson en el marco de las álgebras de semi Heyting dualmente hemimórficas. Para tal fin introduciremos y estudiaremos la variedad de las álgebras de semi Nelson dualmente hemimórficas. En particular, probaremos que la categoría de las álgebras de semi Heyting dualmente hemimórficas es equivalente a la categoría de las álgebras de semi Nelson centradas dualmente hemimórficas. Finalmente estudiaremos el reticulado de congruencias de las álgebras de semi Nelson dualmente hemimórficas.

2019-01-01T00:00:00Z En 2008 H.P. Sankappanavar introdujo y estudió a las álgebras de semi Heyting como una generalización de las álgebras de Heyting [3]. Más tarde, en 2011, definió a las álgebras de semi Heyting dualmente hemimórficas como una expansión de las álgebras de semi Heyting en términos de un hemimorfismo dual que generaliza la operación de De Morgan y el pseudocomplemento dual [4]. Las álgebras de Nelson fueron definidas por H. Rasiowa en [2]. Existe una relación cercana entre la variedad de las álgebras de Nelson y la variedad de las álgebras de Heyting, la cual fue estudiada por D. Vakarelov [6] y A. Sendlewski [5], entre otros. En [1] se extendió esta construcción en el contexto de las álgebras de semi Heyting y se obtuvo una nueva variedad cuyos miembros se denominaron álgebras de semi Nelson. En esta charla contaremos cómo se puede extender la relación entre las álgebras de semi Heyting y las álgebras de semi Nelson en el marco de las álgebras de semi Heyting dualmente hemimórficas. Para tal fin introduciremos y estudiaremos la variedad de las álgebras de semi Nelson dualmente hemimórficas. En particular, probaremos que la categoría de las álgebras de semi Heyting dualmente hemimórficas es equivalente a la categoría de las álgebras de semi Nelson centradas dualmente hemimórficas. Finalmente estudiaremos el reticulado de congruencias de las álgebras de semi Nelson dualmente hemimórficas. Cornejo, Juan Manuel San Martín, Hernán Javier http://sedici.unlp.edu.ar:80/handle/10915/164542 2024-04-08T20:47:31Z 2019-01-01T00:00:00Z

Objeto de conferencia XV Congreso Dr. Antonio Monteiro (Bahía Blanca, 5 al 7 de junio de 2019) En [2] los autores generalizan la construcción dada por Vakarelov en [5], donde se establece una relación entre las álgebras de Heyting y las álgebras de Nelson, en el contexto de las álgebras de semi-Heyting [4]. Para lograr este propósito introducen y estudian la variedad de álgebras de semi-Nelson. En esta charla mostraremos que existe una equivalencia entre la categoría de álgebras de semi-Heyting y la categoría de álgebras de semi-Nelson centradas considerando dos construcciones posibles [1]. También presentaremos ciertas conexiones entre la categoría de álgebras de semi-Nelson centradas y algunos resultados obtenidos en [3].

2019-01-01T00:00:00Z En [2] los autores generalizan la construcción dada por Vakarelov en [5], donde se establece una relación entre las álgebras de Heyting y las álgebras de Nelson, en el contexto de las álgebras de semi-Heyting [4]. Para lograr este propósito introducen y estudian la variedad de álgebras de semi-Nelson. En esta charla mostraremos que existe una equivalencia entre la categoría de álgebras de semi-Heyting y la categoría de álgebras de semi-Nelson centradas considerando dos construcciones posibles [1]. También presentaremos ciertas conexiones entre la categoría de álgebras de semi-Nelson centradas y algunos resultados obtenidos en [3]. Díaz Varela, Patricio Lubomirsky, Noemí http://sedici.unlp.edu.ar:80/handle/10915/164538 2024-04-08T20:47:33Z 2019-01-01T00:00:00Z

Objeto de conferencia The lattice of subvarieties of the variety MG XV Congreso Dr. Antonio Monteiro (Bahía Blanca, 5 al 7 de junio de 2019) Contenido: - T-normas. - Hoops y BL-algebras. - Subvariedad MG. - Λ(MG). - Bases ecuacionales. - Álgebras libres. - Bibliografía.; BL-algebras were introduced by Hájek (see [5]) to formalize fuzzy logics in which the conjunction is interpreted by continuous t-norms over the real interval [0;1]. These algebras form a variety, usually called BL. In this work we will concentrate in the subvariety MG ⊆ BL generated by the ordinal sum of the algebra [0;1]MV and the Gödel hoop [0;1]G, that is, generated by A = [0;1]MV ⊕ [0;1]G. Though it is well-known that [0;1]G is decomposable as an infinite ordinal sum of two-elements Boolean algebra, the idea is to treat it as a whole block. The elements of this block are the dense elements of the generating chain and the elements in [0;1]MV are usually called regular elements of A: The main advantage of this approach, is that unlike the work done in [3] and [1], when the number n of generators of the free algebra increase the generating chain remains fixed. This provides a clear insight of the role of the two main blocks of the generating chain in the description of the functions in the free algebra: the role of the regular elements and the role of the dense elements. We have a functional representation for the free algebra FreeMG (n). To define this functions we need to decompose the domain Aⁿ = ([0;1]MV ⊕ [0;1]G)ⁿ in a finite number of pieces. In each piece a function F ∈ FreeMG (n) coincides either with McNaughton functions or functions of FreeG (n). Using [2] and [4] we give a description of the elements in the lattice of subvarieties of the variety MG and the equational characterization of them.

2019-01-01T00:00:00Z Contenido: - T-normas. - Hoops y BL-algebras. - Subvariedad MG. - Λ(MG). - Bases ecuacionales. - Álgebras libres. - Bibliografía. BL-algebras were introduced by Hájek (see [5]) to formalize fuzzy logics in which the conjunction is interpreted by continuous t-norms over the real interval [0;1]. These algebras form a variety, usually called BL. In this work we will concentrate in the subvariety MG ⊆ BL generated by the ordinal sum of the algebra [0;1]MV and the Gödel hoop [0;1]G, that is, generated by A = [0;1]MV ⊕ [0;1]G. Though it is well-known that [0;1]G is decomposable as an infinite ordinal sum of two-elements Boolean algebra, the idea is to treat it as a whole block. The elements of this block are the dense elements of the generating chain and the elements in [0;1]MV are usually called regular elements of A: The main advantage of this approach, is that unlike the work done in [3] and [1], when the number n of generators of the free algebra increase the generating chain remains fixed. This provides a clear insight of the role of the two main blocks of the generating chain in the description of the functions in the free algebra: the role of the regular elements and the role of the dense elements. We have a functional representation for the free algebra FreeMG (n). To define this functions we need to decompose the domain Aⁿ = ([0;1]MV ⊕ [0;1]G)ⁿ in a finite number of pieces. In each piece a function F ∈ FreeMG (n) coincides either with McNaughton functions or functions of FreeG (n). Using [2] and [4] we give a description of the elements in the lattice of subvarieties of the variety MG and the equational characterization of them. Sagastume, Marta Susana San Martín, Hernán Javier http://sedici.unlp.edu.ar:80/handle/10915/164533 2024-04-08T20:47:42Z 2019-01-01T00:00:00Z

Publicacion seriada Notas de Lógica Matemática; no. 42 Con el propósito de dar una base para el estudio de temas en el área de Álgebra de la Lógica, fue propuesto y dictado por Marta Sagastume el curso "Álgebra del Cálculo Proposicional" en la Facultad de Ciencias Exactas de la Universidad Nacional de La Plata, Argentina, durante cinco años a partir del año 2002. Estaba destinado a licenciados y a alumnos avanzados en matemática e informática, y era un curso de postgrado u optativo de grado, según el caso. El Dr. Hernán San Martín fue uno de esos sufridos alumnos. Como prerrequisito se pedían los cursos con contenidos de Álgebra, Lógica y Teoría de Conjuntos que se dictaban en ambas carreras. Los apuntes escritos en esos años fueron el germen de este libro. Estos versaban sobre los cálculos proposicionales Clásico, Intuicionista e Infinitovalente de Łukasiewicz y sus correspondientes contrapartes algebraicas: las álgebras de Boole, las álgebras de Heyting y las MV- algebras. Al empezar a escribir el texto, creímos conveniente agregar temas que nos parecieron útiles para la formación en el área, como dualidades en la teoría de retículos, retículos residuados, ℓ-grupos y sus lógicas. Pretendemos reunir, en castellano y en un nivel accesible, varios temas que usualmente se encuentran dispersos en la literatura. Tratamos de que el texto sea autocontenido y de que se desarrollen los tópicos más abstractos a partir de ejemplos concretos, permitiendo así que la intuición ayude a la comprensión cabal de los conceptos y de su interrelación. Se muestran figuras, diagramas, ejemplos motivadores. Sacrificamos a veces la elegancia de la exposición en aras de hacerla más accesible al estudiante medio. Por ejemplo, se dan elementos de Álgebra Universal en tres etapas de dificultad creciente, en los capítulos 1, 7 y 10, a medida que se van necesitando los contenidos. Asimismo, se suprimen demostraciones muy técnicas y poco conceptuales.

2019-01-01T00:00:00Z Con el propósito de dar una base para el estudio de temas en el área de Álgebra de la Lógica, fue propuesto y dictado por Marta Sagastume el curso "Álgebra del Cálculo Proposicional" en la Facultad de Ciencias Exactas de la Universidad Nacional de La Plata, Argentina, durante cinco años a partir del año 2002. Estaba destinado a licenciados y a alumnos avanzados en matemática e informática, y era un curso de postgrado u optativo de grado, según el caso. El Dr. Hernán San Martín fue uno de esos sufridos alumnos. Como prerrequisito se pedían los cursos con contenidos de Álgebra, Lógica y Teoría de Conjuntos que se dictaban en ambas carreras. Los apuntes escritos en esos años fueron el germen de este libro. Estos versaban sobre los cálculos proposicionales Clásico, Intuicionista e Infinitovalente de Łukasiewicz y sus correspondientes contrapartes algebraicas: las álgebras de Boole, las álgebras de Heyting y las MV- algebras. Al empezar a escribir el texto, creímos conveniente agregar temas que nos parecieron útiles para la formación en el área, como dualidades en la teoría de retículos, retículos residuados, ℓ-grupos y sus lógicas. Pretendemos reunir, en castellano y en un nivel accesible, varios temas que usualmente se encuentran dispersos en la literatura. Tratamos de que el texto sea autocontenido y de que se desarrollen los tópicos más abstractos a partir de ejemplos concretos, permitiendo así que la intuición ayude a la comprensión cabal de los conceptos y de su interrelación. Se muestran figuras, diagramas, ejemplos motivadores. Sacrificamos a veces la elegancia de la exposición en aras de hacerla más accesible al estudiante medio. Por ejemplo, se dan elementos de Álgebra Universal en tres etapas de dificultad creciente, en los capítulos 1, 7 y 10, a medida que se van necesitando los contenidos. Asimismo, se suprimen demostraciones muy técnicas y poco conceptuales. Alcón, Liliana Graciela Gutiérrez, Marisa Mazzoleni, María Pía http://sedici.unlp.edu.ar:80/handle/10915/164530 2024-04-08T20:47:49Z 2010-01-01T00:00:00Z

Articulo IV Latin-American Workshop on Cliques in Graphs (Itaipava, Río de Janeiro, Brasil, 16 al 19 de noviembre de 2010); Matemática Contemporânea; vol. 39 An undirected graph G is called an EPT graph if it is the edge intersection graph of a family of paths in a tree. In this paper we de ne the concept of satellite of a clique and we give a necessary condition to be an EPT graph based on satellites of cliques. We characterize the minimal graphs which do not satisfy the previous condition, as a consequence we present a nite family of minimal forbidden subgraphs for the EPT class.

2010-01-01T00:00:00Z An undirected graph G is called an EPT graph if it is the edge intersection graph of a family of paths in a tree. In this paper we de ne the concept of satellite of a clique and we give a necessary condition to be an EPT graph based on satellites of cliques. We characterize the minimal graphs which do not satisfy the previous condition, as a consequence we present a nite family of minimal forbidden subgraphs for the EPT class. Castiglioni, José Luis Fernández, Víctor Mallea, Héctor Federico San Martín, Hernán Javier http://sedici.unlp.edu.ar:80/handle/10915/162756 2024-02-16T20:09:51Z 2019-01-01T00:00:00Z

Objeto de conferencia XV Congreso Dr. Antonio Monteiro (Bahía Blanca, 5 al 7 de junio de 2019) Un retículo hemi-implicativo es un álgebra (A,∧,∨,→,0,1) de tipo (2,2,2,0,0) tal que (A,∧,∨,0,1) es un retículo distributivo acotado y para toda a,b ∈ A, a → a = 1 y a∧(a →b) ≤ b. [2]. Escribamos hIL para indicar la variedad cuyos elementos son los retículos hemi-implicativos. Las álgebras de semi-Heyting, introducidas por Sankappanavar en [1] como una posible generalización de las álgebras de Heyting, forman una subvariedad propia, SH, de hIL. En esta charla mostraremos que SH se puede caracterizar, alternativamente, como la mayor subvariedad de hIL para la cual el retículo de filtros y el retículo de congruencias de cada elemento son isomorfos.

2019-01-01T00:00:00Z Un retículo hemi-implicativo es un álgebra (A,∧,∨,→,0,1) de tipo (2,2,2,0,0) tal que (A,∧,∨,0,1) es un retículo distributivo acotado y para toda a,b ∈ A, a → a = 1 y a∧(a →b) ≤ b. [2]. Escribamos hIL para indicar la variedad cuyos elementos son los retículos hemi-implicativos. Las álgebras de semi-Heyting, introducidas por Sankappanavar en [1] como una posible generalización de las álgebras de Heyting, forman una subvariedad propia, SH, de hIL. En esta charla mostraremos que SH se puede caracterizar, alternativamente, como la mayor subvariedad de hIL para la cual el retículo de filtros y el retículo de congruencias de cada elemento son isomorfos. Alcón, Liliana Graciela Gutiérrez, Marisa Hurlber, Glenn http://sedici.unlp.edu.ar:80/handle/10915/162725 2024-02-15T20:08:23Z 2014-01-01T00:00:00Z

Preprint SIAM Journal on Discrete Mathematics; vol. 28, no. 3 Graph pebbling is a network optimization model for transporting discrete re- sources that are consumed in transit: the movement of two pebbles across an edge consumes one of the pebbles. The pebbling number of a graph is the fewest number of pebbles t so that, from any initial configuration of t pebbles on its vertices, one can place a pebble on any given target vertex via such pebbling steps. It is known that deciding if a given configuration on a particular graph can reach a specified target is NP-complete, even for diameter two graphs, and that deciding if the pebbling number has a prescribed upper bound is Πᴾ₂ -complete. On the other hand, for many families of graphs there are formulas or polynomial algorithms for computing pebbling numbers; for example, complete graphs, products of paths (including cubes), trees, cycles, diameter two graphs, and more. Moreover, graphs having minimum pebbling number are called Class 0, and many authors have studied which graphs are Class 0 and what graph properties guaran- tee it, with no characterization in sight. In this paper we investigate an important family of diameter three chordal graphs called split graphs; graphs whose vertex set can be partitioned into a clique and an independent set. We provide a formula for the pebbling number of a split graph, along with an algorithm for calculating it that runs in O(nᵝ) time, where β = 2ω/(ω + 1) ≅ 1.41 and ω ≅ 2.376 is the exponent of matrix multiplication. Furthermore we determine that all split graphs with minimum degree at least 3 are Class 0.

2014-01-01T00:00:00Z Graph pebbling is a network optimization model for transporting discrete re- sources that are consumed in transit: the movement of two pebbles across an edge consumes one of the pebbles. The pebbling number of a graph is the fewest number of pebbles t so that, from any initial configuration of t pebbles on its vertices, one can place a pebble on any given target vertex via such pebbling steps. It is known that deciding if a given configuration on a particular graph can reach a specified target is NP-complete, even for diameter two graphs, and that deciding if the pebbling number has a prescribed upper bound is Πᴾ₂ -complete. On the other hand, for many families of graphs there are formulas or polynomial algorithms for computing pebbling numbers; for example, complete graphs, products of paths (including cubes), trees, cycles, diameter two graphs, and more. Moreover, graphs having minimum pebbling number are called Class 0, and many authors have studied which graphs are Class 0 and what graph properties guaran- tee it, with no characterization in sight. In this paper we investigate an important family of diameter three chordal graphs called split graphs; graphs whose vertex set can be partitioned into a clique and an independent set. We provide a formula for the pebbling number of a split graph, along with an algorithm for calculating it that runs in O(nᵝ) time, where β = 2ω/(ω + 1) ≅ 1.41 and ω ≅ 2.376 is the exponent of matrix multiplication. Furthermore we determine that all split graphs with minimum degree at least 3 are Class 0. Alcón, Liliana Graciela Mazzoleni, María Pía Dias Dos Santos, Tanilson http://sedici.unlp.edu.ar:80/handle/10915/162664 2024-02-15T04:07:10Z 2023-01-01T00:00:00Z

Articulo Discussiones Mathematicae Graph Theory; vol. 43, no. 3 This research contains as a main result the proof that every chordal B₁-EPG graph is simultaneously in the graph classes VPT and EPT. In addition, we describe structures that must be present in any B₁-EPG graph which does not admit a Helly-B1-EPG representation. In particular, this paper presents some features of non-trivial families of graphs properly contained in Helly-B₁-EPG, namely bipartite, block, cactus and line graphs of bipartite graphs.

2023-01-01T00:00:00Z This research contains as a main result the proof that every chordal B₁-EPG graph is simultaneously in the graph classes VPT and EPT. In addition, we describe structures that must be present in any B₁-EPG graph which does not admit a Helly-B1-EPG representation. In particular, this paper presents some features of non-trivial families of graphs properly contained in Helly-B₁-EPG, namely bipartite, block, cactus and line graphs of bipartite graphs. Alcón, Liliana Graciela Faria, Luerbio Miraglia Herrera De Figueiredo, Celina Gutiérrez, Marisa http://sedici.unlp.edu.ar:80/handle/10915/162604 2024-02-15T04:07:11Z 2010-01-01T00:00:00Z

Articulo Matemática Contemporânea; vol. 39 A complete set of a graph G is a subset of VG whose elements are pairwise adjacent. A clique is a maximal complete set. The clique graph of G, denoted by K(G), is the intersection graph of the family of cliques of G. The clique graph recognition problem asks whether a given graph is a clique graph. This problem was classified recently as NP-complete after being open for 30 years. The complexity of this decision problem is open for very structured and well studied classes of graphs such as planar graphs and chordal graphs. We propose the study of split clique graphs.

2010-01-01T00:00:00Z A complete set of a graph G is a subset of VG whose elements are pairwise adjacent. A clique is a maximal complete set. The clique graph of G, denoted by K(G), is the intersection graph of the family of cliques of G. The clique graph recognition problem asks whether a given graph is a clique graph. This problem was classified recently as NP-complete after being open for 30 years. The complexity of this decision problem is open for very structured and well studied classes of graphs such as planar graphs and chordal graphs. We propose the study of split clique graphs. Alcón, Liliana Graciela Gutiérrez, Marisa Hernando, Carmen Mora, Mercè Pelayo, Ignacio M. http://sedici.unlp.edu.ar:80/handle/10915/162603 2024-02-09T20:50:59Z 2023-01-01T00:00:00Z

Articulo Discussiones Mathematicae Graph Theory; vol. 43, no. 3 A k-coloring of a graph is neighbor-locating if any two vertices with the same color can be distinguished by the colors of their respective neighbors, that is, the sets of colors of their neighborhoods are different. The neighbor- locating chromatic number χNL(G) is the minimum k such that a neighbor- locating k-coloring of G exists. In this paper, we give upper and lower bounds on the neighbor-locating chromatic number in terms of the order and the degree of the vertices for unicyclic graphs and trees. We also obtain tight upper bounds on the order of trees and unicyclic graphs in terms of the neighbor-locating chromatic number. Further partial results for trees are also established.

2023-01-01T00:00:00Z A k-coloring of a graph is neighbor-locating if any two vertices with the same color can be distinguished by the colors of their respective neighbors, that is, the sets of colors of their neighborhoods are different. The neighbor- locating chromatic number χNL(G) is the minimum k such that a neighbor- locating k-coloring of G exists. In this paper, we give upper and lower bounds on the neighbor-locating chromatic number in terms of the order and the degree of the vertices for unicyclic graphs and trees. We also obtain tight upper bounds on the order of trees and unicyclic graphs in terms of the neighbor-locating chromatic number. Further partial results for trees are also established. Alcón, Liliana Graciela Gutiérrez, Marisa Hurlbert, Glenn http://sedici.unlp.edu.ar:80/handle/10915/162597 2024-02-09T20:51:00Z 2018-01-01T00:00:00Z

Articulo Matemática Contemporânea; vol. 46 The t-pebbling number is the smallest integer m so that any initially distributed supply of m pebbles can place t pebbles on any target vertex via pebbling moves. The 1-pebbling number of diameter 2 graphs is well-studied. Here we investigate the t-pebbling number of diameter 2 graphs under the lens of connectivity.

2018-01-01T00:00:00Z The t-pebbling number is the smallest integer m so that any initially distributed supply of m pebbles can place t pebbles on any target vertex via pebbling moves. The 1-pebbling number of diameter 2 graphs is well-studied. Here we investigate the t-pebbling number of diameter 2 graphs under the lens of connectivity. De Caria, Pablo Jesús Gutiérrez, Marisa http://sedici.unlp.edu.ar:80/handle/10915/162540 2024-02-09T04:07:21Z 2013-11-01T00:00:00Z

Articulo Electronic Notes in Discrete Mathematics; vol. 44 Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs. They were defined as those chordal graphs whose clique trees are exactly the compatible trees of its clique graph. In this work, we consider some subclasses of basic chordal graphs, like hereditary basic chordal graphs, basic DV and basic RDV graphs, we characterize them and we find some other properties they have, mostly involving clique graphs.

2013-11-01T00:00:00Z Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs. They were defined as those chordal graphs whose clique trees are exactly the compatible trees of its clique graph. In this work, we consider some subclasses of basic chordal graphs, like hereditary basic chordal graphs, basic DV and basic RDV graphs, we characterize them and we find some other properties they have, mostly involving clique graphs. De Caria, Pablo Jesús http://sedici.unlp.edu.ar:80/handle/10915/162534 2024-02-09T04:07:22Z 2011-08-01T00:00:00Z

Articulo Electronic Notes in Discrete Mathematics; vol. 37 Let G be the class of all graphs and K the clique operator. The validity of the equality K(G) = K²(G) has been an open question for several years. A graph in K(G) but not in K²(G) is exhibited here.

2011-08-01T00:00:00Z Let G be the class of all graphs and K the clique operator. The validity of the equality K(G) = K²(G) has been an open question for several years. A graph in K(G) but not in K²(G) is exhibited here. De Caria, Pablo Jesús Gutiérrez, Marisa http://sedici.unlp.edu.ar:80/handle/10915/162528 2024-02-09T04:07:25Z 2011-08-01T00:00:00Z

Articulo Electronic Notes in Discrete Mathematics; vol. 37 Chordal and dually chordal graphs possess characteristic tree representations, namely, clique trees and compatible trees, respectively. The following problem is studied: given a chordal graph G, it has to be determined if the clique trees of G are exactly the compatible trees of K(G). This does not always happen. A necessary and sufficient condition so that it is true, in terms of the minimal vertex separators of the graph, is found.

2011-08-01T00:00:00Z Chordal and dually chordal graphs possess characteristic tree representations, namely, clique trees and compatible trees, respectively. The following problem is studied: given a chordal graph G, it has to be determined if the clique trees of G are exactly the compatible trees of K(G). This does not always happen. A necessary and sufficient condition so that it is true, in terms of the minimal vertex separators of the graph, is found. De Caria, Pablo Jesús Gutiérrez, Marisa http://sedici.unlp.edu.ar:80/handle/10915/162385 2024-02-06T20:08:15Z 2009-12-01T00:00:00Z

Articulo Electronic Notes in Discrete Mathematics; vol. 35 Many works related to dually chordal graphs, their cliques and neighborhoods were published. We will undertake a similar study but by considering minimal separators and their properties. Moreover we find new characterizations of dually chordal graphs.

2009-12-01T00:00:00Z Many works related to dually chordal graphs, their cliques and neighborhoods were published. We will undertake a similar study but by considering minimal separators and their properties. Moreover we find new characterizations of dually chordal graphs. Alcón, Liliana Graciela Gutiérrez, Marisa Hurlbert, Glenn http://sedici.unlp.edu.ar:80/handle/10915/162382 2024-02-06T20:08:18Z 2017-07-01T00:00:00Z

Articulo Discrete Mathematics; vol. 340, no. 7 Graph pebbling is a network model for transporting discrete resources that are consumed in transit. Deciding whether a given configuration on a particular graph can reach a specified target is NP-complete, even for diameter two graphs, and deciding whether the pebbling number has a prescribed upper bound is Πᴾ₂-complete. Recently we proved that the pebbling number of a split graph can be computed in polynomial time. This paper advances the program of finding other polynomial classes, moving away from the large tree width, small diameter case (such as split graphs) to small tree width, large diameter, continuing an investigation on the important subfamily of chordal graphs called k-trees. In particular, we provide a formula, that can be calculated in polynomial time, for the pebbling number of any semi-2-tree, falling shy of the result for the full class of 2-trees.

2017-07-01T00:00:00Z Graph pebbling is a network model for transporting discrete resources that are consumed in transit. Deciding whether a given configuration on a particular graph can reach a specified target is NP-complete, even for diameter two graphs, and deciding whether the pebbling number has a prescribed upper bound is Πᴾ₂-complete. Recently we proved that the pebbling number of a split graph can be computed in polynomial time. This paper advances the program of finding other polynomial classes, moving away from the large tree width, small diameter case (such as split graphs) to small tree width, large diameter, continuing an investigation on the important subfamily of chordal graphs called k-trees. In particular, we provide a formula, that can be calculated in polynomial time, for the pebbling number of any semi-2-tree, falling shy of the result for the full class of 2-trees. De Caria, Pablo Jesús Mazzoleni, María Pía Payo Vidal, María Guadalupe http://sedici.unlp.edu.ar:80/handle/10915/160459 2023-11-23T20:43:19Z 2021-01-01T00:00:00Z

Articulo VIII MACI 2021 (La Plata, 3 al 7 de mayo de 2021); Matemática Aplicada, Computacional e Industrial (MACI); vol. 8 Un grafo de intersección por aristas de una familia de caminos en un árbol huesped es llamado grafo EPT. Cuando el grado máximo del árbol huesped es 4, decimos que el grafo es [4, 2, 2]. En este trabajo, consideramos el problema de clique coloración en grafos [4,2, 2]. Probamos que esta clase de grafos es 3-clique coloreable y damos ejemplos de grafos en esta clase que no son 2-clique coloreables. Además, estudiamos subclases de grafos en [4, 2,2] que tienen número clique cromático menor o igual a 2.

2021-01-01T00:00:00Z Un grafo de intersección por aristas de una familia de caminos en un árbol huesped es llamado grafo EPT. Cuando el grado máximo del árbol huesped es 4, decimos que el grafo es [4, 2, 2]. En este trabajo, consideramos el problema de clique coloración en grafos [4,2, 2]. Probamos que esta clase de grafos es 3-clique coloreable y damos ejemplos de grafos en esta clase que no son 2-clique coloreables. Además, estudiamos subclases de grafos en [4, 2,2] que tienen número clique cromático menor o igual a 2.