Search arXivSearch

arXiv · 2605.23011

Star-Shaped Integral Cartan-Type Matrices and an Egyptian-Fraction Classification of Affine Weighted Trees

Abstract

We study a concrete family of symmetric integral $Z$-matrices attached to weighted star trees. The arms are ordinary type-$A$ chains and the central diagonal entry is an arbitrary positive integer $k$ rather than being fixed to the Cartan value $2$. This gives a matrix-theoretic and graph-theoretic version of the so called Berger construction: it extends the simply laced affine Dynkin stars while remaining accessible through elementary linear algebra. For a star with arm lengths $r_1,\ldots,r_m$ we compute the determinant, the inertia, the positive-definite and affine regimes, and the primitive positive null vector in the affine case. The affine condition is exactly the unit-fraction equation \[ \sum_{i=1}^m \frac{1}{r_i+1}=m-k, \] so the classification of these affine weighted trees reduces to a finite Egyptian-fraction enumeration for each fixed pair $(m,k)$. The classical affine diagrams $D_4^{(1)}$, $E_6^{(1)}$, $E_7^{(1)}$ and $E_8^{(1)}$ appear as small subfamilies, while higher-arm cases give new integral positive-semidefinite star matrices with explicit Coxeter labels.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emilio Torrente-Lujan. 2026-05-21. Star-Shaped Integral Cartan-Type Matrices and an Egyptian-Fraction Classification of Affine Weighted Trees. https://arxiv.org/abs/2605.23011

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