Leila Sharifan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Leila Sharifan has a total of 12 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
4 shared publications - Juan Ángel Aledo
Departamento de Matemáticas Universidad de Castilla-La Mancha Albacete Spain
4 shared publications - Maria Evelina Rossi
Dipartimento di Matematica, Università di Genova, Genova, Italy
4 shared publications - Matteo Varbaro
Università di Genova
4 shared publications - Jose P. Llano
Department of Mathematics University of Castilla‐La Mancha Albacete Spain
3 shared publications - Jürgen Herzog
Fachbereich Mathematik, Universität Duisburg-Essen, Essen, Germany
3 shared publications
Latest Publications
- 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
- 17 December 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Dynamical attraction in disjunctive Boolean networks with strongly connected dependency graph
In this paper, we characterize the attractors of disjunctive Boolean networks with strongly connected dependency graphs and present a method for computing their basins of attraction. Additionally, we investigate the height of such networks — defined as the maximum number of iterations required to reach a periodic orbit.
- 17 December 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Dynamical attraction in disjunctive Boolean networks with strongly connected dependency graph
In this paper, we characterize the attractors of disjunctive Boolean networks with strongly connected dependency graphs and present a method for computing their basins of attraction. Additionally, we investigate the height of such networks — defined as the maximum number of iterations required to reach a periodic orbit.
- 7 November 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
On the t-th level cop number
In the police department, the police chief decides ending up the crimes before a deadline by not letting the robber commit damages. She follows a discipline to use the least number of officers. This is our motivation to define a new concept [ ]-th level cop number [ ] for the classical game Cops and Robber, which is played on the underlying graph [ ]. It has a close connection with [ ]-distance domination number of [ ]. A lower bound for [ ] is presented by [ ]-distance domination number of [ ]. For some special cases, we observe that [ ] and [ ]-distance domination number are equal.
- 7 November 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
On the t-th level cop number
In the police department, the police chief decides ending up the crimes before a deadline by not letting the robber commit damages. She follows a discipline to use the least number of officers. This is our motivation to define a new concept [ ]-th level cop number [ ] for the classical game Cops and Robber, which is played on the underlying graph [ ]. It has a close connection with [ ]-distance domination number of [ ]. A lower bound for [ ] is presented by [ ]-distance domination number of [ ]. For some special cases, we observe that [ ] and [ ]-distance domination number are equal.
- 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
- 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
- 14 September 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-9
Counting Periodic Points in Parallel Graph Dynamical Systems
Let be a parallel dynamical system over an undirected graph with a Boolean maxterm or minterm function as a global evolution operator. It is well known that every periodic point has at most two periods. Actually, periodic points of different periods cannot coexist, and a fixed point theorem is also known. In addition, an upper bound for the number of periodic points of has been given. In this paper, we complete the study, solving the minimum number of periodic points’ problem for this kind of dynamical systems which has been usually considered from the point of view of complexity. In order to do this, we use methods based on the notions of minimal dominating sets and maximal independent sets in graphs, respectively. More specifically, we find a lower bound for the number of fixed points and a lower bound for the number of 2-periodic points of . In addition, we provide a formula that allows us to calculate the exact number of fixed points. Furthermore, we provide some conditions under which these lower bounds are attained, thus generalizing the fixed-point theorem and the 2-period theorem for these systems.- 14 September 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-9
Open AccessCounting Periodic Points in Parallel Graph Dynamical Systems
Let be a parallel dynamical system over an undirected graph with a Boolean maxterm or minterm function as a global evolution operator. It is well known that every periodic point has at most two periods. Actually, periodic points of different periods cannot coexist, and a fixed point theorem is also known. In addition, an upper bound for the number of periodic points of has been given. In this paper, we complete the study, solving the minimum number of periodic points’ problem for this kind of dynamical systems which has been usually considered from the point of view of complexity. In order to do this, we use methods based on the notions of minimal dominating sets and maximal independent sets in graphs, respectively. More specifically, we find a lower bound for the number of fixed points and a lower bound for the number of 2-periodic points of . In addition, we provide a formula that allows us to calculate the exact number of fixed points. Furthermore, we provide some conditions under which these lower bounds are attained, thus generalizing the fixed-point theorem and the 2-period theorem for these systems. - Open Access
- 12 July 2018
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 25 (3) , P3.8
Primary Decomposition of Ideals of Lattice Homomorphisms
For two given finite lattices $L$ and $M$, we introduce the ideal of lattice homomorphism $J(L,M)$, whose minimal monomial generators correspond to lattice homomorphisms $\phi : L\to M$. We show that $L$ is a distributive lattice if and only if the equidimensinal part of $J(L,M)$ is the same as the equidimensional part of the ideal of poset homomorphisms $I(L,M)$. Next, we study the minimal primary decomposition of $J(L,M)$ when $L$ is a distributive lattice and $M=[2]$. We present some methods to check if a monomial prime ideal belongs to $\mathrm{ass}(J(L,[2]))$, and we give an upper bound in terms of combinatorial properties of $L$ for the height of the minimal primes. We also show that if each minimal prime ideal of $J(L,[2])$ has height at most three, then $L$ is a planar lattice and $\mathrm{width}(L)\leq 2$. Finally, we compute the minimal primary decomposition when $L=[m]\times [n]$ and $M=[2]$.- 12 July 2018
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 25 (3) , P3.8
Open AccessPrimary Decomposition of Ideals of Lattice Homomorphisms
For two given finite lattices $L$ and $M$, we introduce the ideal of lattice homomorphism $J(L,M)$, whose minimal monomial generators correspond to lattice homomorphisms $\phi : L\to M$. We show that $L$ is a distributive lattice if and only if the equidimensinal part of $J(L,M)$ is the same as the equidimensional part of the ideal of poset homomorphisms $I(L,M)$. Next, we study the minimal primary decomposition of $J(L,M)$ when $L$ is a distributive lattice and $M=[2]$. We present some methods to check if a monomial prime ideal belongs to $\mathrm{ass}(J(L,[2]))$, and we give an upper bound in terms of combinatorial properties of $L$ for the height of the minimal primes. We also show that if each minimal prime ideal of $J(L,[2])$ has height at most three, then $L$ is a planar lattice and $\mathrm{width}(L)\leq 2$. Finally, we compute the minimal primary decomposition when $L=[m]\times [n]$ and $M=[2]$. - 21 June 2018
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 44 (4) , 1007-1024
Minimal Free Resolution of Monomial Ideals by Iterated Mapping Cone
- 21 June 2018
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 44 (4) , 1007-1024
Minimal Free Resolution of Monomial Ideals by Iterated Mapping Cone
- Open Access
On $m$-Closed Graphs
A graph is closed when its vertices have a labeling by $[n]$ such that the binomial edge ideal $J_G$ has a quadratic Gr\"{o}bner basis with respect to the lexicographic order induced by $x_1 > \cdots > x_n > y_1> \cdots > y_n$. In this paper, we generalize this notion and study the so called $m-$closed graphs. We find equivalent condition to $3-$closed property of an arbitrary tree $T$. Using it, we classify a class of $3-$closed trees. The primary decomposition of this class of graphs is also studied.Open AccessOn $m$-Closed Graphs
A graph is closed when its vertices have a labeling by $[n]$ such that the binomial edge ideal $J_G$ has a quadratic Gr\"{o}bner basis with respect to the lexicographic order induced by $x_1 > \cdots > x_n > y_1> \cdots > y_n$. In this paper, we generalize this notion and study the so called $m-$closed graphs. We find equivalent condition to $3-$closed property of an arbitrary tree $T$. Using it, we classify a class of $3-$closed trees. The primary decomposition of this class of graphs is also studied. - Open Access
Minimal free resolution of monoimal ideals by iterated mapping cone
In this paper we study minimal free resolutions of some classes of monomial ideals. we first give a sufficient condition to check the minimality of the resolution obtained by the mapping cone. Using it, we obtain the Betti numbers of max-path ideals of rooted trees and ideals containing powers of variables. In particular, we discuss about resolutions of ideals of the form $J_{\mathcal{H}}+(x_{i_1}^2,\ldots, x_{i_m}^2)$ where $J_{\mathcal{H}}$ is the edge ideal of a hypergraph $\mathcal{H}$.Open AccessMinimal free resolution of monoimal ideals by iterated mapping cone
In this paper we study minimal free resolutions of some classes of monomial ideals. we first give a sufficient condition to check the minimality of the resolution obtained by the mapping cone. Using it, we obtain the Betti numbers of max-path ideals of rooted trees and ideals containing powers of variables. In particular, we discuss about resolutions of ideals of the form $J_{\mathcal{H}}+(x_{i_1}^2,\ldots, x_{i_m}^2)$ where $J_{\mathcal{H}}$ is the edge ideal of a hypergraph $\mathcal{H}$.