Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0502385

The poset of positive roots and its relatives

Dmitri I. Panyushev
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $Δ$ be a root system with a subset of positive roots, $Δ^+$. We consider edges of the Hasse diagrams of some posets associated with $Δ^+$. For each edge one naturally defines its type, and we study the partition of the set of edges into types. For $Δ^+$, the type is a simple root, and for the posets of ad-nilpotent and Abelian ideals the type is an affine simple roots. We give several descriptions of the set of edges of given type and uniform expressions for the number of edges. By a result of Peterson, the number of Abelian ideals is $2^n$, where $n$ is the rank of $Δ$. We prove that the number of edges of the corresponding Hasse diagram is $(n+1)2^{n-2}$. For $Δ^+$ and the Abelian ideals, we compute the number of edges of each type and prove that the number of edges of type $α$ depends only on the length of $α$.

Explore related subjects

math.COmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dmitri I. Panyushev. 2005-02-17. The poset of positive roots and its relatives. https://arxiv.org/abs/math/0502385

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗