3 citations · 6 across the 11 of their papers we have counts for
13 papers · 1 filter
Holonomic Sequences Arising from Laplace Transforms of Generalized Second Order Sequences
Rigoberto Flórez, Robinson Higuita-Diaz, José L. Ram\'ırez
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 an…
Projective Rectangles: Harmonic Conjugation
Rigoberto Florez, Thomas Zaslavsky
A projective rectangle is like a projective plane that has different lengths in two directions. We develop harmonic conjugation in projective rectangles. We construct projective re…
Projective Rectangles: A New Kind of Incidence Structure
Rigoberto Florez, Thomas Zaslavsky
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties,…
Minimal non-orientable matroids in a projective plane
Rigoberto Florez, David Forge
We construct a new family of minimal non-orientable matroids of rank three. Some of these matroids embed in Desarguesian projective planes. This answers a question of Ziegler: for…
Lindström's conjecture on a class of algebraically non-representable matroids
Rigoberto Florez
Gordon introduced a class of matroids , for prime , such that is algebraically representable, but only in characteristic . Lindström proved that for…
Harmonic Conjugation in Harmonic Matroids
Rigoberto Florez
We study a generalization of the concept of harmonic conjugation from projective geometry and full algebraic matroids to a larger class of matroids called \emph{harmonic matroids}.…
Infinite Families of Asymmetric Graphs
Alejandra Brewer, Adam Gregory, Quindel Jones +2
A graph is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963. They showed that the probability…
Uniform Edge Betweenness Centrality
Heather A. Newman, Hector Miranda, Rigoberto Florez +1
The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investiga…
Star of David and other patterns in the Hosoya-like polynomials triangles
Rigoberto Florez, Robinson A. Higuita, Antara Mukherjee
In this paper we first generalize the numerical recurrence relation given by Hosoya to polynomials. Using this generalization we construct a Hosoya-like triangle for polynomials, w…
Extrema Property of the -Ranking of Directed Paths and Cycles
Breeanne Baker Swart, Rigoberto Flórez, Darren A. Narayan +1
A -ranking of a directed graph is a labeling of the vertex set of with positive integers such that every directed path connecting two vertices with the same label in…
Maximizing the number of edges in optimal -rankings
Rigoberto Florez, Darren A. Narayan
A -ranking is a vertex -coloring such that if two vertices have the same color any path connecting them contains a vertex of larger color. The rank number of a graph is small…
A Graph Theoretic Analysis of Leverage Centrality
Roger Vargas, Abigail Waldron, Anika Sharma +2
In 2010, Joyce et. al defined the leverage centrality of vertices in a graph as a means to analyze functional connections within the human brain. In this metric a degree of a verte…
Biased Graphs. VI. Synthetic Geometry
Rigoberto Flórez, Thomas Zaslavsky
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called balanced, such that no theta subgraph contains exactly two balanced circles. A biased grap…