SearcharxivSearch

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 $[\sigma, \rho]_L \preceq [\sigma', \rho']_L$ if and only if $\sigma \preceq_R \sigma'$. 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), \sigma]_L$ or $[\sigma, 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), \sigma]_L$, an injective hull of ${\sf B}([w_0(S), \sigma]_L)$ is given, and for the equivalence class containing $[\sigma, w_1(S)]_L$, a projective cover of ${\sf B}([\sigma, w_1(S)]_L)$ is given.

Explore related subjects

Keep this discovery

BibTeXRIS

Seung-Il Choi, Sun-Young Nam, Young-Tak Oh. 2024-12-11. 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

Balanced even cycles in signed graphs:Tur\'an bounds, double covers, and parity obstructions

We study Tur\'an problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the signed and ordinary Tur\'an numbers differ by at most a factor of two. Our main structural results concern the underlying graphs that admit a signing in which every $2k$-cycle is unbalanced. We characterize these graphs by the absence of an odd dependence among their $2k$-cycle incidence vectors, give a cohomological formulation, and construct subgraph-minimal obstructions of arbitrarily large order. In particular, there is no finite forbidden-subgraph characterization. We also give an exact closed-walk criterion for cycles in double covers and derive a direct signed breadth-first-search upper bound. As applications, we prove \[ \hex(n,C_{+4})=\left(\frac{\sqrt2}{2}+o(1)\right)n^{3/2} \] and study the signed hexagon number $R_6(n)=\hex(n,\{C_{-3},C_{+6}\})$. We characterize the underlying graphs counted by $R_6$ and express it as an extremal problem for ordinary $C_6$-free graphs with a prescribed involution. For every sufficiently large $n$, we construct examples with $\Omega(n^{4/3})$ edges, and we give an equivariant construction attaining the coefficient obtained from the F\"uredi--Naor--Verstra\"ete lower bound by double-cover transfer. Finally, we give $n$-vertex $C_{+10}$-free signed graphs with $\Omega(n^{6/5})$ edges and use octagon examples to illustrate the limitations of theta-freeness as a signing criterion.

math.CO

Fractional DP-colorings of $d$-degenerate locally sparse graphs

Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $\chi_f^{\mathrm{DP}} \le (1 + o(1))\frac{d}{\log d}$, and that this bound is optimal---a stark contrast to ordinary fractional coloring. In this paper, we extend this upper bound to all $d$-degenerate triangle-free graphs, proving that $\chi_f^{\mathrm{DP}} \le (4 + o(1))\frac{d}{\log d}$. This generalizes a recent result of Martinsson and Steiner (2025) for ordinary fractional coloring. We derive this result as a corollary of a more general upper bound concerning locally sparse graph orderings. Specifically, a $d$-degenerate graph $G$ is left $k$-locally-sparse if it admits a degeneracy ordering in which, for every vertex $v$, the subgraph induced by its back-neighbors contains at most $k$ edges. We show that if a $d$-degenerate graph $G$ is left $\frac{d^2}{f}$-locally-sparse, then \[ \chi_f^{\mathrm{DP}}(G) \le (8 + o(1))\frac{d}{\log f}. \] This immediately yields an identical upper bound on the ordinary fractional chromatic number $\chi_f(G)$, improving upon the leading constants of previously known bounds. Additionally, we establish the asymptotic sharpness of this result up to the leading constant. For any $1 \ll f \le d^2$, we construct $d$-degenerate graphs that are left $\frac{d^2}{f}$-locally-sparse and satisfy $\chi_f(G) \ge (1 - o(1))\frac{d}{\log f}$. Finally, as applications of our main theorem, we obtain improved upper bounds on the fractional DP-chromatic number of $d$-degenerate $K_{1,t,t}$-free graphs, as well as $K_{t,t,t}$-free graphs with maximum degree $\Delta$. Notably, these bounds improve upon existing results even in the setting of ordinary fractional coloring.

math.CO

Erd\H{o}s-S\'{o}s for digraphs

It is shown that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but opposite arcs are permitted. The bound is sharp for each fixed oriented tree, as witnessed by disjoint unions of complete bidirected graphs. Previously, such tight bounds were not known, even just for directed paths. This can be considered as a directed analog of the recently proved Erd\H{o}s-S\'os conjecture. The result was proved by GPT-6 Astra.

math.CO