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

推荐订阅源

Recent Announcements
Recent Announcements
J
Java Code Geeks
雷峰网
雷峰网
Microsoft Security Blog
Microsoft Security Blog
博客园 - 【当耐特】
腾讯CDC
博客园 - 司徒正美
B
Blog RSS Feed
博客园 - 三生石上(FineUI控件)
I
InfoQ
N
Netflix TechBlog - Medium
L
LangChain Blog
博客园_首页
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
T
Tailwind CSS Blog
MyScale Blog
MyScale Blog
美团技术团队
The Cloudflare Blog
爱范儿
爱范儿
Stack Overflow Blog
Stack Overflow Blog
博客园 - 聂微东
H
Help Net Security
Martin Fowler
Martin Fowler
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}}$
Lattice Models for Double Whittaker Polynomials and Motiv...
Ben Brubaker, Daniel Bump, Andrew Hardt, Hunter Spink · 2025-09-22 · via math.CO updates on arXiv.org

We will describe solvable lattice models whose partition functions depend on two sets of variables, $x_1,\cdots,x_n$ and $y_1, y_2, \cdots $ that have different connections with the representation theory of $\text{GL}(n,F)$ where $F$ is a nonarchimedean local field. If the boundary conditions are chosen in one way, they are essentially the Motivic Chern classes that were used very effectively by Aluffi, Mihalcea, Schürmann and Su (AMSS) to study such problems. In particular, using this specialization we can obtain deformations $r_{u,v}$ of the Kazhdan-Lusztig R-polynomials that were used by Bump, Nakasuji and Naruse to study matrix coefficients of intertwining operators (introduced by Casselman). Thus we are able see that the recursion formula for the $r_{u,v}$ is a reflection of the Yang-Baxter equation. On the other hand, with more general boundary conditions, specializing the parameters $y_i\to 0$ we recover colored lattice models that were previously used by Brubaker, Buciumas, Bump and Gustafsson to represent Iwahori Whittaker functions on $GL(n,F)$. Thus we term the resulting two-variable-set family of functions as ``double Whittaker polynomials.''