SearcharxivSearch

arXiv · 2609.24024

Uniform Hypergraphs with $α$-Spectral Radius at Most That of a Loose Cycle

Abstract

Let $k\geq 3$ and $α\in[0,1)$, and let $λ_k(α)$ denote the $α$-spectral radius of a $k$-uniform loose cycle. Lu and Man classified all connected $k$-uniform hypergraphs with adjacency spectral radius at most $λ_k(0)$. In this paper, we extend their classification to the $α$-spectral setting. In particular, for every $k\geq 3$ and $0<α<1$, we prove that $λ_k(α)$ is the smallest limit point of the $α$-spectral radii of connected $k$-uniform hypergraphs. Moreover, we give a complete comparison between the $α$-spectral radius of an arbitrary finite connected $k$-uniform hypergraph $H$ and that of a loose cycle by determining the sign of $ρ_α(H)-λ_k(α)$. As a consequence, for each fixed $0<α<1$, we classify all finite connected $k$-uniform hypergraphs with $α$-spectral radius at most $λ_k(α)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hangxi Cha, Xiaoqi Liu, Haiying Shan. 2026-09-21. Uniform Hypergraphs with $α$-Spectral Radius at Most That of a Loose Cycle. https://arxiv.org/abs/2609.24024

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO