Search arXivSearch

arXiv · 2306.10154

Seaweed algebras and the unimodal spectrum property

Abstract

If $\mathfrak{g}$ is a Frobenius Lie algebra, then the spectrum of $\mathfrak{g}$ is an algebraic invariant equal to the multiset of eigenvalues corresponding to a particular operator acting on $\mathfrak{g}$. In the case of Frobenius seaweed subalgebras of $A_{n-1}=\mathfrak{sl}(n)$, or type-A seaweeds for short, it has been shown that the spectrum can be computed combinatorially using an attendant graph. With the aid of such graphs, it was further shown that the spectrum of a type-A seaweed consists of an unbroken sequence of integers centered at $\frac{1}{2}$. It has been conjectured that if the eigenvalues are arranged in increasing order, then the sequence of multiplicities forms a unimodal sequence about $\frac{1}{2}$. Here, we establish this conjecture for certain families of Frobenius type-A seaweeds by finding explicit formulas for their spectra; in fact, for some families we are able to show that the corresponding sequences of multiplicities form log-concave sequences. All arguments are combinatorial.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicholas Mayers, Nicholas Russoniello. 2023-06-16. Seaweed algebras and the unimodal spectrum property. https://arxiv.org/abs/2306.10154

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