English
Related papers

Related papers: Horadam cubes

200 papers

The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…

Quantum Physics · Physics 2007-05-23 Nitin Saxena , Simone Severini , Igor Shparlinski

Higher-rank graphs were introduced by Kumjian and Pask to provide models for higher-rank Cuntz-Krieger algebras. In a previous paper, we constructed 2-graphs whose path spaces are rank-two subshifts of finite type, and showed that this…

Operator Algebras · Mathematics 2009-11-05 David Pask , Iain Raeburn , Natasha Weaver

We present a general review of the bifurcation sequences of periodic orbits in general position of a family of resonant Hamiltonian normal forms with nearly equal unperturbed frequencies, invariant under $Z_2 \times Z_2$ symmetry. The rich…

Dynamical Systems · Mathematics 2016-06-28 Antonella Marchesiello , Giuseppe Pucacco

Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…

Combinatorics · Mathematics 2017-10-06 Taichi Kousaka

A graph $\Gamma$ of even order is a bicirculant if it admits an automorphism with two orbits of equal length. Symmetry properties of bicirculants, for which at least one of the induced subgraphs on the two orbits of the corresponding…

Combinatorics · Mathematics 2024-12-09 Robert Jajcay , Štefko Miklavič , Primož Šparl , Gorazd Vasiljević

We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.

Number Theory · Mathematics 2021-12-02 Kunle Adegoke

Except for Koshy who devotes seven pages to applications of Fibonacci Numbers to electric circuits, most books and the Fibonacci Quarterly have been relatively silent on applications of graphs and electric circuits to Fibonacci numbers.…

Combinatorics · Mathematics 2022-07-27 Emily J. Evans , Russell J. Hendel

Congruences, or $2$-parameter families of lines in $3$-space are of interest in many situations, in particular in geometric optics. In this paper we consider elements of their geometry which are invariant under affine changes of…

Differential Geometry · Mathematics 2023-07-06 J. W. Bruce , F. Tari

In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion…

History and Overview · Mathematics 2025-06-30 Inés García-Redondo , Claudia Landi , Sarah Percival , Anda Skeja , Bei Wang , Ling Zhou

Several recent works have identified patterns that must exist in dense subsets of either the vertices or the edges of a large hypercube. We introduce a framework, based on the concept of series-parallel graphs, that unifies and generalizes…

Combinatorics · Mathematics 2025-03-21 Daniel G. Zhu

We construct classes of two-dimensional aperiodic Lorentz systems that have infinite horizon and are 'chaotic', in the sense that they are (Poincar\'e) recurrent, uniformly hyperbolic, ergodic, and the first-return map to any scatterer is…

Dynamical Systems · Mathematics 2013-02-12 Marco Lenci , Serge Troubetzkoy

This paper has an expository nature. We compare the spectral properties (such as boundedness and compactness) of three families of semi-infinite matrices and point out similarities between them. The common feature of these families is that…

Functional Analysis · Mathematics 2024-02-16 Alexander Pushnitski

We introduce a one-parameter family of polymatrix replicators defined in a three-dimensional cube and study its bifurcations. For a given interval of parameters, this family exhibits suspended horseshoes and persistent strange attractors.…

Dynamical Systems · Mathematics 2022-06-15 Telmo Peixe , Alexandre A. Rodrigues

We study the inertia of distance matrices of weighted graphs. Our novel congruence-based proof of the inertia of weighted trees extends to a proof for the inertia of weighted unicyclic graphs whose cycle is a triangle. Partial results are…

Combinatorics · Mathematics 2023-04-26 Jeffrey Cheng , Ian Malcolm Johnson McInnis , Matthew Yee

For families of 4-regular directed circulant graphs with $n$ vertices, we count the number of primitive periodic orbits of length up to at least $n$. The relevant counting techniques are then extended to count the number of primitive pseudo…

Combinatorics · Mathematics 2021-09-29 Lauren Engelthaler , Isaac Hellerman , Tori Hudgins

The aim of this paper is to classify reduction types of algebraic curves. Reduction types capture the discrete invariants of fibres in one-dimensional families of curves, and they have been described in genus 1, 2 and 3. For fixed genus…

Algebraic Geometry · Mathematics 2025-12-11 Tim Dokchitser

We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…

Computational Complexity · Computer Science 2015-03-11 Fulvio Gesmundo , Jonathan Hauenstein , Christian Ikenmeyer , JM Landsberg

We study the loci of the Brocard points over two selected families of triangles: (i) 2 vertices fixed on a circumference and a third one which sweeps it, (ii) Poncelet 3-periodics in the homothetic ellipse pair. Loci obtained include…

Metric Geometry · Mathematics 2020-10-01 Ronaldo Garcia , Dan Reznik

The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…

General Mathematics · Mathematics 2024-06-03 Pablo José Vega Esparza

Forbidden characterizations may sometimes be the most natural way to describe families of graphs, and yet these characterizations are usually very hard to exploit for enumerative purposes. By building on the work of Gioan and Paul (2012)…

Combinatorics · Mathematics 2016-08-05 Maryam Bahrani , Jérémie Lumbroso