Search arXivSearch

arXiv · 2606.31044

Effective Resistance and Generalized Bejaia-Pisa Sequences on Complete Graphs with Circulant Distance Deletions

Abstract

In this paper, we investigate the effective resistance on the graph $G_N^{(r)}$, which is obtained by deleting all edges corresponding to circular distances $\{\pm1, \pm2, \dots, \pm r\}$ from the complete graph $K_N$. We utilize the cyclic symmetry of the graph to diagonalize the Laplacian matrix via the discrete Fourier basis and derive a finite trigonometric sum representation for the effective resistance between two vertices at distance $\ell$. Specifically, we treat the cases $r=1$ and $r=2$ in detail and provide explicit formulas. For the case of $r=1$, we use Fourier analysis to rederive the closed form in terms of Bejaia and Pisa numbers given by Chair. For the case of $r=2$, we show that the denominator reduces to a quadratic polynomial with complex roots and introduce a generalized Bejaia-Pisa-type complex sequence. Using this sequence, we provide some closed forms for the effective resistance and various related formulas.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shunya Tamura, Yuuho Tanaka. 2026-06-30. Effective Resistance and Generalized Bejaia-Pisa Sequences on Complete Graphs with Circulant Distance Deletions. https://arxiv.org/abs/2606.31044

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