Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.21116

Smooth Points on Positroid Varieties

Joseph Fluegemann
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the Grassmannian $Gr_{\mathbb{C}}(k,n)$ we have positroid varieties $Π_f$, each indexed by a bounded affine permutation $f$ and containing torus-fixed points $λ\in Π_f$. In this paper we consider the partially ordered set consisting of quadruples $(k,n,Π_f,λ)$ (or \textit{(positroid) pairs} $(Π_f,λ)$ for short). The partial order is the ordering given by the covering relation $\lessdot$ where $(Π_f',λ') \lessdot (Π_f,λ)$ if $Π_f'$ is obtained by $Π_f$ by \textit{deletion} or \textit{contraction.} Using the results of Snider [2010], we know that positroid varieties can be studied in a neighborhood of each of these points by \textit{affine pipe dreams.} Our main theorem provides a quick test of when a positroid variety is smooth at one of these given points. It is sufficient to test smoothness of a positroid variety by using the main result to test smoothness at each of these points. These results can also be applied to the question of whether Schubert varieties in flag manifolds are smooth at points given by 321-avoiding permutations, as studied in Graham/Kreimer [2020]. We have a secondary result, which describes the minimal singular positroid pairs in our ordering - these are the positroid pairs where any deletion or contraction causes it to become smooth.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph Fluegemann. 2024-07-30. Smooth Points on Positroid Varieties. https://arxiv.org/abs/2407.21116

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗