Lyapunov exponent for quantum graphs coded as elements of a subshift of finite type

Abstract We consider the Schrödinger operator on the quantum graph whose edges connect the points of $${{\mathbb {Z}}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>Z</mml:mi> </mml:math> . The numbers of the edges connecting two consecutive points n and $$n+1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> are read along the orbits of a shift of finite type. We prove that the Lyapunov exponent is potitive for energies E that do not belong to a discrete subset of $$[0,\infty )$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>[</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mi>∞</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> . The number of points E of this subset in $$[(\pi (j-1))^2, (\pi j)^2]$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>[</mml:mo> <mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>π</mml:mi> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>j</mml:mi> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>)</mml:mo> </mml:mrow> <mml:mn>2</mml:mn> </mml:msup> <mml:mo>,</mml:mo> <mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>π</mml:mi> <mml:mi>j</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> <mml:mn>2</mml:mn> </mml:msup> <mml:mo>]</mml:mo> </mml:mrow> </mml:math> is the same for all $$j\in {{\mathbb {N}}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>j</mml:mi> <mml:mo>∈</mml:mo> <mml:mi>N</mml:mi> </mml:mrow> </mml:math> .

Authors

Institutions

Publication Details

Journal
Analysis and Mathematical Physics
Published
2025-08-29
DOI
https://doi.org/10.1007/s13324-025-01122-1
Primary Topic
Quantum chaos and dynamical systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Lyapunov exponent for quantum graphs coded as elements of a subshift of finite type

Oleg Safronov
Analysis and Mathematical Physics
Quantum chaos and dynamical systems
article

Lyapunov exponent for quantum graphs coded as elements of a subshift of finite type

Oleg Safronov
article en

Abstract

Abstract We consider the Schrödinger operator on the quantum graph whose edges connect the points of $${{\mathbb {Z}}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>Z</mml:mi> </mml:math> . The numbers of the edges connecting two consecutive points n and $$n+1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> are read along the orbits of a shift of finite type. We prove that the Lyapunov exponent is potitive for energies E that do not belong to a discrete subset of $$[0,\infty )$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>[</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mi>∞</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> . The number of points E of this subset in $$[(\pi (j-1))^2, (\pi j)^2]$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>[</mml:mo> <mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>π</mml:mi> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>j</mml:mi> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>)</mml:mo> </mml:mrow> <mml:mn>2</mml:mn> </mml:msup> <mml:mo>,</mml:mo> <mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>π</mml:mi> <mml:mi>j</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> <mml:mn>2</mml:mn> </mml:msup> <mml:mo>]</mml:mo> </mml:mrow> </mml:math> is the same for all $$j\in {{\mathbb {N}}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>j</mml:mi> <mml:mo>∈</mml:mo> <mml:mi>N</mml:mi> </mml:mrow> </mml:math> .

Analysis and Mathematical PhysicsVol. 15(5)
University of North Carolina at Charlotte (US)
University of North Carolina at Charlotte
Openalex Percentile: Top 82%
Quantum chaos and dynamical systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Lyapunov exponent for quantum graphs coded as elements of a subshift of finite type — Oleg Safronov · Analysis and Mathematical Physics (2025) | TGRS Research Map | TGRS