Searcharxiv⌕ Search

arXiv subjects

Robinson Higuita-Diaz

Publications and source records attributed to Robinson Higuita-Diaz.

3 recordsLinked to original sources

Stochastic Dominance in Discrete Parking Processes on Graphs

In a recent study on the one-dimensional discrete parking process, it was conjectured that the number of occupied sites in the sequential model first-order stochastically dominates its static counterpart on any path graph. In this paper, we first prove this conjecture for all path graphs and then explore whether stochastic dominance holds for general graph topologies. We show that the property extends naturally to all cycle graphs, and an exhaustive computational analysis confirms that it holds for all 31 connected simple graphs with fewer than 6 vertices. For graphs with 6 or more vertices, we demonstrate that this dominance does not hold universally by constructing explicit counterexamples in which the static model dominates the sequential one; moreover, while one model always dominates the other for all connected graphs with up to 7 vertices, we show that stochastic comparability fails starting at 8 vertices. We also prove that stochastic dominance is inherited by disjoint unions when all connected components share the same dominance direction, and we exhibit mixed unions in which stochastic comparability is either preserved or lost. Finally, supported by algorithmic computations, we formulate a conjecture proposing that the dominance of the sequential model over the static one holds for all graphs with maximum degree at most 3.

math.PR↗

On $p$-Adic Valuation Trees Arising from Laplace Transform of Fibonacci Polynomials

We study the $p$-adic valuation trees associated with the sequence \[ e_n=\int_0^\infty e^{-t}F_n(t)\,dt, \] obtained by evaluating the Laplace transforms of the Fibonacci polynomials at $1$. We answer an open question of Givens and Moll in the negative by constructing an explicit counterexample showing that even internal branches need not be simple. We then reformulate the Givens--Moll lifting criteria for the even and odd subsequences in terms of the roots and derivatives of two associated polynomials. In particular, simple roots modulo $p$ give rise to simple internal branches. Finally, we develop a recursive lifting procedure that determines the unique surviving residue class at each level of a branch associated with a simple root and computes the $p$-adic valuations of the corresponding terms.

math.NT↗

Holonomic Sequences Arising from Laplace Transforms of Generalized Second Order Sequences

We study the FiboLaplace and LucasLaplace sequences obtained by applying the Laplace transform to generalized Fibonacci-type and Lucas-type polynomials. We relate these families and show that, for each fixed transform parameter, the FiboLaplace sequence is holonomic. We give a combinatorial interpretation in terms of weighted colored tilings, leading to recurrence relations, identities, and a triangular refinement by the number of dominoes. We also derive two continued-fraction expansions and obtain a second combinatorial interpretation in terms of generalized Motzkin paths. These results extend earlier work of Givens and Moll.

math.CO↗