arXiv subjects

Manuel A. Espinosa-García

Publications and source records attributed to Manuel A. Espinosa-García.

5 recordsLinked to original sources

arXiv2026

Extinction thresholds in a graph-based model of HIV infection dynamics

We study a graph-based cellular automaton for HIV infection dynamics in lymph-node networks, originally introduced by Mukwembi. Each vertex represents a cell site that may be healthy, infected, or dead, and the evolution is controlled by a replacement parameter $R$, which determines whether a dead cell is replaced by an infected or a healthy cell according to the number of its infected neighbors. For a graph $G$, we introduce two extinction parameters. The parameter $\mathbf{hiv}(G)$ is the smallest value of $R$ for which extinction occurs for every admissible initial configuration, whereas $\mathbf{HIV}(G)$ is the smallest threshold such that extinction occurs for every replacement parameter greater than or equal to it. We prove the general bounds $2\leq \mathbf{hiv}(G)\leq \mathbf{HIV}(G)\leq Δ(G)+1$ and characterize the extremal case $\mathbf{HIV}(G)=Δ(G)+1$. We also show that the gap $\mathbf{HIV}(G)-\mathbf{hiv}(G)$ is unbounded and determine both parameters for some classical families of graphs. Finally, we study the dynamics of the model using the state-transition digraph of the system and the configurations whose trajectories converge to nontrivial periodic orbits. The results show that extinction depends not only on the replacement parameter but also on the structural properties of the underlying graph.

math.DS↗

arXiv2025

Equicovering masses in the Euclidean plane

Classic mass partition results are about dividing the plane into regions that are equal with respect to one or more measures (masses). We introduce a new concept in which the notion of partition is replaced by that of a cover. In this case we require (almost) every point in the plane to be covered the same number of times. If all elements of this cover are equal with respect to the given masses, we refer to them as equicoverings. To construct equicoverings, we study a natural generalization of $k$-fan partitions, which we call spiral equicoverings. Like $k$-fans, these consist of wedges centered at a common point, but arranged in a way that allows overlapping. Our main result nearly characterizes all reduced positive rational numbers $p/q$ for which there exists a covering by $q$ convex wedges such that every point is covered exactly $p$ times. The proofs use results about centerpoints and combine tools from classical mass partition results, and elementary number theory.

math.CO↗

arXiv2024

The manifold of polygons degenerated to segments

In this paper we study the space $\mathbb{L}(n)$ of $n$-gons in the plane degenerated to segments. We prove that this space is a smooth real submanifold of $\mathbb{C}^n$, and describe its topology in terms of the manifold $\mathbb{M}(n)$ of $n$-gons degenerated to segments and with the first vertex at 0. We show that $\mathbb{M}(n)$ and $\mathbb{L}(n)$ contain straight lines that form a basis of directions in each one of their tangent spaces, and we compute the geodesic equations in these manifolds. Finally, the quotient of $\mathbb{L}(n)$ by the diagonal action of the affine complex group and the re-enumeration of the vertices is described.

math.DG↗

arXiv2023

Update on Sidon-Ramsey numbers

We provide two new exact Sidon-Ramsey numbers to the list known so far. We also improve the upper bounds of the next two Sidon-Ramsey numbers. In doing so, we comment on the tendencies we found on the Sidon-Ramsey partitions that were studied to obtain these results.

math.CO↗

arXiv2023

Sidon-Ramsey and $B_{h}$-Ramsey numbers

For a given positive integer $k$, the Sidon-Ramsey number $\SR(k)$ is defined as the minimum value of $n$ such that, in every partition of the set $[1, n]$ into $k$ parts, there exists a part that contains two distinct pairs of numbers with the same sum. In other words, there is a part that is not a Sidon set. In this paper, we investigate the asymptotic behavior of this parameter and two generalizations of it. The first generalization involves replacing pairs of numbers with $h$-tuples, such that in every partition of $[1, n]$ into $k$ parts, there exists a part that contains two distinct $h$-tuples with the same sum. Alternatively, there is a part that is not a $B_h$ set. The second generalization considers the scenario where the interval $[1, n]$ is substituted with a non-necessarily symmetric $d$-dimensional box of the form $\prod_{i=1}^d[1,n_i]$. For the general case of $h\geq 3$ and non-symmetric boxes, before applying our method to obtain the Ramsey-type result, we needed to establish an upper bound for the corresponding density parameter.

math.CO↗