Jose P. Llano
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jose P. Llano has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Jose Carlos Valverde Fajardo
Department of Mathematics University of Castilla‐La Mancha Albacete Spain
6 shared publications - Juan Ángel Aledo
Departamento de Matemáticas Universidad de Castilla-La Mancha Albacete Spain
6 shared publications - Leila Sharifan
Department of Mathematics and Computer Sciences, Hakim Sabzevari University, P. O. Box 397, Sabzevar, Iran
3 shared publications Juan A. Aledo
1 shared publicationJuan C. Cortés
1 shared publicationM. Elena Flores
1 shared publication
Latest Publications
- Open Access
- 31 July 2026
- Published by Universitat Politecnica de Valencia in Modelling in Science Education and Learning
- Vol. 19, 5-32
Introduciendo el razonamiento recurrente en probabilidad: Una propuesta didáctica a través del problema de la ruina del jugador
En este trabajo presentamos una propuesta didáctica centrada en la introducción del razonamiento recurrente en el ámbito de la probabilidad a través del estudio del problema clásico de la ruina del jugador. El objetivo principal es mostrar cómo un mismo problema probabilístico permite articular distintos enfoques matemáticos (sumas infinitas, combinatoria, caminos aleatorios, ecuaciones en diferencias o cadenas de Markov) que convergen en una misma solución y que pueden ser explotados didácticamente en diferentes niveles educativos. A partir de un caso base con moneda sesgada y capital finito, se desarrollan progresivamente distintas estrategias de resolución que ponen de relieve el papel estructurador de las relaciones de recurrencia. Posteriormente, se amplía el modelo incorporando la posibilidad de empates y se muestra cómo se relaciona con el caso base.
- 31 July 2026
- Published by Universitat Politecnica de Valencia in Modelling in Science Education and Learning
- Vol. 19, 5-32
Open AccessIntroduciendo el razonamiento recurrente en probabilidad: Una propuesta didáctica a través del problema de la ruina del jugador
En este trabajo presentamos una propuesta didáctica centrada en la introducción del razonamiento recurrente en el ámbito de la probabilidad a través del estudio del problema clásico de la ruina del jugador. El objetivo principal es mostrar cómo un mismo problema probabilístico permite articular distintos enfoques matemáticos (sumas infinitas, combinatoria, caminos aleatorios, ecuaciones en diferencias o cadenas de Markov) que convergen en una misma solución y que pueden ser explotados didácticamente en diferentes niveles educativos. A partir de un caso base con moneda sesgada y capital finito, se desarrollan progresivamente distintas estrategias de resolución que ponen de relieve el papel estructurador de las relaciones de recurrencia. Posteriormente, se amplía el modelo incorporando la posibilidad de empates y se muestra cómo se relaciona con el caso base.
- Open Access
- 30 May 2026
- Published by Elsevier in Information Sciences
- Vol. 754
Determination of steady states in generalized MAX and MIN multivalued networks
- 30 May 2026
- Published by Elsevier in Information Sciences
- Vol. 754
Open AccessDetermination of steady states in generalized MAX and MIN multivalued networks
- Open Access
- 10 June 2025
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 48 (12) , 11620-11629
Periodic Orbits of MAX and MIN Multistate Networks
This work presents a generalization of Boolean networks to multistate networks over a complement‐closed set , which can be finite or infinite. Specifically, we focus on MAX (and MIN) multistate networks, whose dynamics are governed by global arbitrary ‐maxterm (or ‐minterm) functions, which extend the well‐known maxterm (or minterm) Boolean functions. More specifically, we tackle the problem of analyzing the combinatorial dynamics of these networks. As a result, we determine the types of periodic orbits that can exist and coexist jointly, when all vertices are self‐loop and the graph is undirected. In particular, we show that only fixed points and 2‐periodic orbits can appear in these systems by employing tools coming from algebra and graph theory. That is, regardless of the (finite or infinite) number of elements, the types of periodic orbits remain the same as those of MAX and MIN Boolean networks. However, we demonstrate that the coexistence of fixed points and 2‐periodic orbits is possible in these networks, which contrasts with the known results for the Boolean case. Moreover, we provide sufficient and necessary conditions to characterize the existence of fixed points and 2‐periodic orbits, as well as their coexistence.
- 10 June 2025
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 48 (12) , 11620-11629
Open AccessPeriodic Orbits of MAX and MIN Multistate Networks
This work presents a generalization of Boolean networks to multistate networks over a complement‐closed set , which can be finite or infinite. Specifically, we focus on MAX (and MIN) multistate networks, whose dynamics are governed by global arbitrary ‐maxterm (or ‐minterm) functions, which extend the well‐known maxterm (or minterm) Boolean functions. More specifically, we tackle the problem of analyzing the combinatorial dynamics of these networks. As a result, we determine the types of periodic orbits that can exist and coexist jointly, when all vertices are self‐loop and the graph is undirected. In particular, we show that only fixed points and 2‐periodic orbits can appear in these systems by employing tools coming from algebra and graph theory. That is, regardless of the (finite or infinite) number of elements, the types of periodic orbits remain the same as those of MAX and MIN Boolean networks. However, we demonstrate that the coexistence of fixed points and 2‐periodic orbits is possible in these networks, which contrasts with the known results for the Boolean case. Moreover, we provide sufficient and necessary conditions to characterize the existence of fixed points and 2‐periodic orbits, as well as their coexistence.
- Open Access
- 13 March 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 195
Exact enumeration of fixed points of AND-OR-NAND-NOR Boolean networks
- 13 March 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 195
Open AccessExact enumeration of fixed points of AND-OR-NAND-NOR Boolean networks
- Open Access
- 14 February 2025
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 145
Computation of fixed points in MAX and MIN multi-state networks
- 14 February 2025
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 145
Open AccessComputation of fixed points in MAX and MIN multi-state networks
- Open Access
- 8 November 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 489
Multi-state sequential Boolean networks: An analysis of its combinatorial dynamics
- 8 November 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 489
Open AccessMulti-state sequential Boolean networks: An analysis of its combinatorial dynamics
- Open Access
- 1 July 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (7)
Dynamics of synchronous Boolean networks with non-binary states
In this paper, we study the dynamics of synchronous Boolean networks and extend previously obtained results for binary Boolean networks to networks with state variables in a general Boolean algebra of 2p elements, with p>1. The method to do this is based on the Stone representation theorem and the relation of such systems on general Boolean algebras with those with binary-state values. Specifically, we deal with the main periodic orbit problems and predecessor problems (existence, coexistence, uniqueness, and number of them), which allows us to determine the periodic structure and the attractor cycles of the system. These results open opportunities to explore novel applications by means of such general systems.
- 1 July 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (7)
Open AccessDynamics of synchronous Boolean networks with non-binary states
In this paper, we study the dynamics of synchronous Boolean networks and extend previously obtained results for binary Boolean networks to networks with state variables in a general Boolean algebra of 2p elements, with p>1. The method to do this is based on the Stone representation theorem and the relation of such systems on general Boolean algebras with those with binary-state values. Specifically, we deal with the main periodic orbit problems and predecessor problems (existence, coexistence, uniqueness, and number of them), which allows us to determine the periodic structure and the attractor cycles of the system. These results open opportunities to explore novel applications by means of such general systems.