Search arXivSearch

arXiv · 1808.05200

Unified characterizations of minuscule Kac--Moody representations built from colored posets

Abstract

R.M. Green described structural properties that ``doubly infinite'' colored posets should possess so that they can be used to construct representations of most affine Kac--Moody algebras. These representations are analogs of the minuscule representations of the semisimple Lie algebras, and his posets (``full heaps'') are analogs of the finite minuscule posets. Here only simply laced Kac--Moody algebras are considered. Working with their derived subalgebras, we provide a converse to Green's theorem. Smaller collections of colored structural properties are also shown to be necessary and sufficient for such poset-built representations to be produced for smaller subalgebras, especially the ``Borel derived'' subalgebra. These developments lead to the formulation of unified definitions of finite and infinite colored minuscule and $d$-complete posets. This paper launches a program that seeks to extend the notion of ``minuscule representation'' to Kac--Moody algebras, and to classify such representations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael C. Strayer. 2019-06-17. Unified characterizations of minuscule Kac--Moody representations built from colored posets. https://doi.org/10.37236/8821

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO