Search arXivSearch

arXiv · 2412.08413

Equivalence classes of lower and upper descent weak Bruhat intervals

Abstract

Let $\mathrm{Int}(n)$ denote the set of nonempty left weak Bruhat intervals in the symmetric group $\mathfrak{S}_n$. We investigate the equivalence relation $\overset{D}{\simeq}$ on $\mathrm{Int}(n)$, where $I \overset{D}{\simeq} J$ if and only if there exists a descent-preserving poset isomorphism between $I$ and $J$. For each equivalence class $C$ of $(\mathrm{Int}(n), \overset{D}{\simeq})$, a partial order $\preceq$ is defined by $[σ, ρ]_L \preceq [σ', ρ']_L$ if and only if $σ\preceq_R σ'$. Kim-Lee-Oh (2023) showed that the poset $(C, \preceq)$ is isomorphic to a right weak Bruhat interval. In this paper, we focus on lower and upper descent weak Bruhat intervals, specifically those of the form $[w_0(S), σ]_L$ or $[σ, w_1(S)]_L$, where $w_0(S)$ is the longest element in the parabolic subgroup $\mathfrak{S}_S$ of $\mathfrak{S}_n$, generated by $\{s_i \mid i \in S\}$ for a subset $S \subseteq [n-1]$, and $w_1(S)$ is the longest element among the minimal-length representatives of left $\mathfrak{S}_{[n-1] \setminus S}$-cosets in $\mathfrak{S}_n$. We begin by providing a poset-theoretic characterization of the equivalence relation $\overset{D}{\simeq}$. Using this characterization, the minimal and maximal elements within an equivalence class $C$ are identified when $C$ is a lower or upper descent interval. Under an additional condition, a detailed description of the structure of $(C, \preceq)$ is provided. Furthermore, for the equivalence class containing $[w_0(S), σ]_L$, an injective hull of ${\sf B}([w_0(S), σ]_L)$ is given, and for the equivalence class containing $[σ, w_1(S)]_L$, a projective cover of ${\sf B}([σ, w_1(S)]_L)$ is given.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Seung-Il Choi, Sun-Young Nam, Young-Tak Oh. 2025-07-08. Equivalence classes of lower and upper descent weak Bruhat intervals. https://doi.org/10.1016/j.aam.2025.102910

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