惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

GbyAI
GbyAI
Martin Fowler
Martin Fowler
I
InfoQ
腾讯CDC
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
爱范儿
爱范儿
Microsoft Security Blog
Microsoft Security Blog
Google DeepMind News
Google DeepMind News
D
DataBreaches.Net
云风的 BLOG
云风的 BLOG
F
Fortinet All Blogs
N
Netflix TechBlog - Medium
博客园 - 聂微东
Microsoft Azure Blog
Microsoft Azure Blog
D
Docker
博客园 - 三生石上(FineUI控件)
Y
Y Combinator Blog
博客园 - Franky
Engineering at Meta
Engineering at Meta
B
Blog
罗磊的独立博客
Apple Machine Learning Research
Apple Machine Learning Research
Jina AI
Jina AI
V
Visual Studio Blog

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Random Permutations from Bott-Samelson Varieties
Jingqi Li, Haorun Yin, Wenbin Yu, Shixuan Zeng · 2026-05-26 · via math.CO updates on arXiv.org

Motivated by a recent random pipe dream model, we study a family of probability distributions on \(S_n\) arising from Bott--Samelson varieties over finite fields. More precisely, for a word \(R\), we consider the Bott--Samelson map \(π_R:\mathrm{BS}^R\to \mathcal{F}\ell_n\) and define a distribution \(\mathbb{P}_{R,q}\) by counting the \(\mathbb{F}_q\)-points in the inverse images of Schubert cells. For a suitable choice of parameters \(p_1=q/(1+q)\) and \(p_2=1/q\), this construction recovers a special case of the random pipe dream distribution. The main problem considered in this note is to determine which combinatorial properties of a reduced word are detected by the distribution \(\mathbb{P}_{R,q}\). We prove the stronger statement that, for arbitrary reduced words \(R_1,R_2\), the equality \(\mathbb{P}_{R_1,q}=\mathbb{P}_{R_2,q}\) as functions of \(q\) holds if and only if \(R_1\) and \(R_2\) lie in the same commutation class. In particular, equality of distributions already forces the two words to represent the same permutation. The proof combines the Bott--Samelson interpretation with Demazure products, commutation-class invariants, and Hecke-algebraic arguments.