Search arXivSearch

arXiv · 2511.13913

Signed permutations and degree-one dot action representations for types B and C

Abstract

A spline is an assignment of polynomials to the vertices of a graph, where the difference of two polynomials along an edge must belong to the ideal labeling that edge. We consider a ring of splines $\mathcal{M}_{H}$ constructed on a graph whose vertices are the Weyl group $\mathfrak{W}_n$ of signed permutations, and whose edges and edge-ideals are defined using an order ideal $H$ of positive roots. These splines are a module over the polynomial ring in two ways, and a $\mathfrak{W}_n$-module by the dot action. These structures on $\mathcal{M}_{H}$ give rise to the graded left and right dot action representations of $\mathfrak{W}_n$. The left representation is the type B/C generalization of the type A dot action for regular semisimple Hessenberg varieties (and thus, chromatic quasisymmetric functions), and the right representation is the same for corresponding manifolds of isospectral matrices (and thus, unicellular LLT polynomials). This paper gives explicit module generators for the degree-one graded piece of $\mathcal{M}_{H}$ and computes the degree-one piece of the both dot action representations for all $H$ using the combinatorial data of $H$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nathan R. T. Lesnevich. 2025-11-17. Signed permutations and degree-one dot action representations for types B and C. https://arxiv.org/abs/2511.13913

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