Twisted Web Immanants in Grassmannians

• Twisted web immanants are twist-transformed analogues of ordinary web immanants, defined via a twisted higher boundary measurement map that replaces edge weights with face-weight Laurent monomials.
• They utilize r-dimer covers on reduced top-cell plabic graphs to compute twists of Grassmannian functions through the Fraser–Lam–Le pairing.
• The framework links Grassmannian cluster algebras with diagram algebras by establishing web duality and explicit twist formulas, notably for SL3 and SL4 webs.

Searching arXiv for the primary and related papers on twisted web immanants and immanant generalizations. {"query":"arXiv (Banaian et al., 21 Jul 2025) twisted web immanants Grassmannian cluster algebras", "max_results": 5} Searching arXiv for related work on immanants, web immanants, and diagram-algebra generalizations. Twisted web immanants are the twist-transformed analogues of ordinary web immanants in the Grassmannian web formalism. In the formulation of “Twists, Higher Dimer Covers, and Web Duality for Grassmannian Cluster Algebras,” they are not introduced as a separate abstract object via a new immanant isomorphism; instead, they arise from a twisted higher boundary measurement map that replaces the ordinary edge-weighted $r$-dimer sum by a face-weighted $r$-dimer sum, so that pairing against this web-valued object computes the twist $\tau(f)$ of a Grassmannian function $f$ (Banaian et al., 21 Jul 2025). The resulting theory sits at the intersection of $\mathbb C[\Gr(k,n)]$, $\mathrm{SL}_r$ web invariants, reduced top-cell plabic graphs, $r$-dimer covers, and Laurent expansions in Plücker coordinates.

1. Ambient Grassmannian and web-immanant framework

The ambient ring is the Grassmannian coordinate ring

$\mathbb C[\Gr(k,n)],$

where $\Gr(k,n)$ is the affine cone over the Plücker embedding of the Grassmannian of $k$-planes in $r$0. It is generated by Plücker coordinates $r$1, $r$2, and carries its natural $r$3-grading, with $r$4 of degree $r$5. A reduced top-cell plabic graph $r$6 of type $r$7 determines an initial seed for the cluster algebra structure: each face $r$8 is labeled by a $r$9-subset $\tau(f)$0, and the corresponding cluster variable is $\tau(f)$1 (Banaian et al., 21 Jul 2025).

For $\tau(f)$2 with $\tau(f)$3, the relevant invariant space is

$\tau(f)$4

spanned by invariants attached to planar $\tau(f)$5 webs. Fraser–Lam–Le’s immanant formalism identifies the graded piece $\tau(f)$6 with the dual web space through the isomorphism

$\tau(f)$7

equivalently through a perfect pairing

$\tau(f)$8

In this setting, an ordinary web immanant is the Grassmannian function corresponding to a functional on the web space.

The combinatorial engine is the set $\tau(f)$9 of $f$0-dimer covers of a reduced top-cell plabic graph $f$1. An $f$2-dimer cover $f$3 is a multiset of edges such that every internal vertex is incident to exactly $f$4 edges and boundary vertex $f$5 is used with multiplicity $f$6. Each such $f$7 determines an $f$8 web, written $f$9. For a network $\mathbb C[\Gr(k,n)]$0 on $\mathbb C[\Gr(k,n)]$1 with edge weights $\mathbb C[\Gr(k,n)]$2, the ordinary higher boundary measurement is

$\mathbb C[\Gr(k,n)]$3

and it satisfies

$\mathbb C[\Gr(k,n)]$4

Twisted web immanants are defined relative to this ordinary web-immanant story: the coefficient system $\mathbb C[\Gr(k,n)]$5 is unchanged, but the monomials are altered by replacing edge weights with face-weight Laurent monomials.

2. Twisted higher boundary measurement and the defining formula

The fundamental new ingredient is the face-weight of an $\mathbb C[\Gr(k,n)]$6-dimer cover. If $\mathbb C[\Gr(k,n)]$7 is a face of $\mathbb C[\Gr(k,n)]$8, let $\mathbb C[\Gr(k,n)]$9 be its $\mathrm{SL}_r$0-subset label, let $\mathrm{SL}_r$1 denote the number of white vertices bordering $\mathrm{SL}_r$2, and let $\mathrm{SL}_r$3 denote the number of non-boundary edges of $\mathrm{SL}_r$4 used in $\mathrm{SL}_r$5. Then the face weight is

$\mathrm{SL}_r$6

This is a Laurent monomial in the Plücker coordinates of the seed attached to $\mathrm{SL}_r$7 (Banaian et al., 21 Jul 2025).

The central theorem is the twist formula

$\mathrm{SL}_r$8

valid for $\mathrm{SL}_r$9 with $r$0. This formula is the paper’s operational definition of twisted web immanants: the coefficients are the usual Fraser–Lam–Le pairing coefficients, while the basis monomials are the face-weight Laurent monomials rather than the ordinary edge-weight monomials (Banaian et al., 21 Jul 2025).

Evaluating the Laurent monomial at a network point $r$1 gives

$r$2

and the twisted higher boundary measurement map is

$r$3

Its defining property is

$r$4

Thus $r$5 plays for $r$6 exactly the role that $r$7 plays for $r$8. In particular, the twisted web-immanant formalism is not a replacement of the Fraser–Lam–Le pairing, but a twist-compatible reweighting of the universal $r$9-dimer generating series.

The case $\mathbb C[\Gr(k,n)],$0 recovers the twisted Plücker formula

$\mathbb C[\Gr(k,n)],$1

so the higher-$\mathbb C[\Gr(k,n)],$2 theory is a direct extension of the Marsh–Scott and Elkin–Musiker–Wright dimer formulas from Plücker coordinates to arbitrary homogeneous Grassmannian functions.

3. Web duality and dual-basis extraction

A distinctive simplification occurs when the dual basis under the Fraser–Lam–Le pairing is again realized by web invariants. When $\mathbb C[\Gr(k,n)],$3 and $\mathbb C[\Gr(k,n)],$4, one has

$\mathbb C[\Gr(k,n)],$5

so the pairing yields a duality between $\mathbb C[\Gr(k,n)],$6 and $\mathbb C[\Gr(k,n)],$7. In this setting, “web duality” means that the basis dual under the pairing to a web basis on one side is again given by web invariants on the other side, often indexed by transpose tableaux (Banaian et al., 21 Jul 2025).

The paper proves this duality for a large family of $\mathbb C[\Gr(k,n)],$8 and $\mathbb C[\Gr(k,n)],$9 webs at $\Gr(k,n)$0. More precisely, for the bases $\Gr(k,n)$1 and $\Gr(k,n)$2 appearing in the $\Gr(k,n)$3 and $\Gr(k,n)$4 situations, the pairing satisfies

$\Gr(k,n)$5

and the corresponding tableaux satisfy $\Gr(k,n)$6. This gives a concrete dual-web description of twisted web immanants in those cases.

The resulting twisted formula is particularly transparent. If $\Gr(k,n)$7 is the invariant of an $\Gr(k,n)$8-basis web $\Gr(k,n)$9, and $k$0 denotes the dual basis web under the pairing, then

$k$1

where $k$2 is the coefficient of $k$3 when $k$4 is expanded in the chosen web basis. In these cases, computing the twisted web immanant reduces to extracting a single dual-web coefficient from each $k$5-weblike subgraph.

The theory is not uniform without qualifications. The paper identifies one exceptional $k$6 dual basis element in the $k$7/$k$8 story: the dual to $k$9 is not a single basis web in the chosen $r$00 basis but a difference of two webs, the “benzene case.” Even there, however, the twisted expansion formula still applies.

4. Cluster twists, Laurent expansions, and explicit computations

The principal application is to Grassmannian cluster algebra twists. By combining the twisted higher boundary measurement map with web duality, the paper recovers and extends formulas of Elkin–Musiker–Wright for twists of certain cluster variables. The mechanism is uniform: if $r$01 is a homogeneous Grassmannian function represented by a web invariant and its dual web is known, then $r$02 is obtained by summing the face weights of precisely those $r$03-dimer covers whose web expansions contain the dual web with nonzero coefficient (Banaian et al., 21 Jul 2025).

A model example is the $r$04 basis web invariant $r$05. The paper gives an explicit Plücker expansion for $r$06, an explicit formula for its twist, and then a Laurent expansion in the initial seed. It further explains that this Laurent polynomial matches the face weights of the only two quadruple dimer covers of the chosen reduced top-cell plabic graph whose associated $r$07-weblike subgraphs expand, under $r$08 skein relations, to include the dual web $r$09; in each case, $r$10 appears with coefficient $r$11. This example makes the coefficient-extraction principle completely explicit.

The cluster-theoretic significance is broader than isolated examples. The paper presents evidence supporting conjectures of Fomin–Pylyavskyy and one by Cheung–Dechant–He–Heyes–Hirst–Li, and proves an enumeration theorem for arborizable indecomposable $r$12 webs of Plücker degree $r$13,

$r$14

This is evidence that the web-theoretic picture underlying twisted web immanants aligns with conjectural classifications of low-degree cluster variables in $r$15.

At the same time, the scope remains specific. The paper proves general twist formulas for arbitrary homogeneous $r$16, but the most explicit dual-web coefficient formulas are obtained in the settings where web duality has been established, notably for many $r$17 and $r$18 webs at $r$19.

5. Relation to classical and diagram-algebra immanants

Twisted web immanants belong to a larger ecosystem of immanant-like constructions, but the relationship to more classical theories is indirect and comparative rather than definitional. The sharpest contrast is with ordinary character immanants of the symmetric group,

$r$20

For these classical immanants, vanishing on skew-symmetric complex matrices is completely classified: for even $r$21, vanishing occurs exactly for those $r$22 indexed by indestructible diagrams under recursive domino rim-hook removal, and this is equivalent to vanishing on all permutations with only even cycles, already equivalently on the fixed-point-free involution class $r$23 (Cheraghpour et al., 2024). This provides a precise benchmark for the “vanishing on alternating matrices” problem, but it does not itself address twisted web immanants.

A second comparison comes from the recombinant, an immanant-like function defined using partition algebra characters and a sum over all partition diagrams rather than over permutations: $r$24 Its relevance lies in the structural analogy: it shows how an immanant-type function can be built from a larger diagram algebra, and how a quotient or top-propagation sector recovers the classical immanant (Campbell, 2023). Twisted web immanants share the passage from permutation combinatorics to a richer diagrammatic setting, but their coefficients come from web expansions and the Fraser–Lam–Le pairing, not from partition algebra characters.

Temperley–Lieb immanants furnish a closer diagrammatic analogue on the rank-two side. They are defined from the Temperley–Lieb basis and admit complementary-minor expansions of the form

$r$25

with compatibility encoded by planar non-crossing matchings and colorings (Lu et al., 2023). This is not a theorem about twisted web immanants, but it is one of the clearest lower-rank prototypes for how a planar diagram basis can control an immanant family through minor expansions.

A further comparison comes from Kazhdan–Lusztig immanants and dual canonical basis elements of $r$26. For $r$27- and $r$28-avoiding permutations, certain Kazhdan–Lusztig immanants reduce to signed determinants of support-restricted matrices, and the corresponding dual canonical basis elements are $r$29-positive under an explicit square-size condition (Chepuri et al., 2021). This suggests a broader pattern: complicated immanants may become tractable on distinguished combinatorial classes. Twisted web immanants realize this pattern in a different way, through face-weighted $r$30-dimer sums and dual-web extraction rather than support-restricted determinants.

6. Scope, misconceptions, and interpretive boundaries

Twisted web immanants are not ordinary $r$31-character immanants. Their coefficients are not given by irreducible characters of the symmetric group, and the relevant indexing data are webs, $r$32-dimer covers, and dual web bases rather than partitions alone. For that reason, classical results on ordinary immanants provide comparison principles but not direct formulas.

They are also not introduced by a separate new immanant isomorphism. The defining mechanism is the twisted higher boundary measurement map together with the existing Fraser–Lam–Le pairing. The same coefficient $r$33 that controls ordinary web immanants controls the twisted version; what changes is the replacement of edge-weight monomials by face-weight Laurent monomials in the initial Plücker seed (Banaian et al., 21 Jul 2025).

A common overstatement is to identify web duality with a completely general theorem. The paper proves that web duality continues to hold for a large set of $r$34 and $r$35 webs, and it verifies tableau transposition in those cases, but it does not establish the phenomenon for all $r$36. The benzene exception likewise shows that even within the proved range, the dual basis need not always be realized by a single basis web.

The comparison with other immanant generalizations must also be qualified. The vanishing-immanant classification on alternating matrices (Cheraghpour et al., 2024), the recombinant construction from partition algebra characters (Campbell, 2023), the Temperley–Lieb theory (Lu et al., 2023), and the $r$37-positivity results for Kazhdan–Lusztig immanants (Chepuri et al., 2021) do not mention twisted web immanants directly. Their relevance is that they provide explicit models for three recurrent themes: diagram-algebra enlargement, basis-dependent coefficient systems, and reduction of immanants to tractable combinatorial or determinantal formulas.

A plausible implication is that future work on twisted web immanants may continue to proceed by identifying the correct dual basis, the correct diagrammatic coefficient-extraction rule, and the correct test families of dimer covers or support patterns. What is already established is narrower and more precise: twisted web immanants, in the current literature, are Grassmannian twist formulas expressed through face-weighted $r$38-dimer sums and the Fraser–Lam–Le pairing, with especially explicit forms when web duality is known.