Mike Zabrocki
We present a formulas to add a row or a column to the power, monomial, forgotten, Schur, homogeneous and elementary symmetric functions. As an application of these operators we show that the operator that adds a column to the Schur functions can be used to calculate a formula for the number of pairs of standard tableaux the same shape and height less than or equal to a fixed $k$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
This paper has two main parts. First, we consider the Tutte symmetric function $XB$, a generalization of the chromatic symmetric function. We introduce a vertex-weighted version of $XB$ and show that this function admits a deletion-contraction relation. We also demonstrate that the vertex-weighted $XB$ admits spanning-tree and spanning-forest expansions generalizing those of the Tutte polynomial by connecting $XB$ to other graph functions. Second, we give several methods for constructing nonisomorphic graphs with equal chromatic and Tutte symmetric functions, and use them to provide specific e…
In this paper our main result states that there exist exactly three combinatorially distinct centrally-symmetric 12-vertex-triangulations of the product of two 2-spheres with a cyclic symmetry. We also compute the automorphism groups of the triangulations. These instances suggest that there is a triangulation of $S^2 \times S^2$ with 11 vertices -- the minimum number of vertices required.
We exhibit a vertex operator which implements multiplication by power-sums of Jucys-Murphy elements in the centers of the group algebras of all symmetric groups simultaneously. The coefficients of this operator generate a representation of ${\cal W}_{1+\infty}$, to which operators multiplying by normalized conjugacy classes are also shown to belong. A new derivation of such operators based on matrix integrals is proposed, and our vertex operator is used to give an alternative approach to the polynomial functions on Young diagrams introduced by Kerov and Olshanski.
Universal graph series and vertex-weighted version of chromatic symmetric function
本文统一了色对称函数的通用图与顶点加权推广，证明新不变量继承完全性，并为DAG和偏序集构造完全不变量，进而区分超平面排列。
A graph $Γ$ is said to be symmetric if its automorphism group $\rm Aut(Γ)$ acts transitively on the arc set of $Γ$. In this paper, we show that if $Γ$ is a finite connected heptavalent symmetric graph with solvable stabilizer admitting a vertex-transitive non-abelian simple group $G$ of automorphisms, then either $G$ is normal in $\rm Aut(Γ)$, or $\rm Aut(Γ)$ contains a non-abelian simple normal subgroup $T$ such that $G\leq T$ and $(G,T)$ is explicitly given as one of $11$ possible exception pairs of non-abelian simple groups. Furthermore, if $G$ is regular on the vertex set of $Γ$ then the e…
Let $c$ and $c'$ be edge or vertex colourings of a graph $G$. We say that $c'$ is less symmetric than $c$ if the stabiliser (in $\operatorname{Aut} G$) of $c'$ is contained in the stabiliser of $c$. We show that if $G$ is not a bicentred tree, then for every vertex colouring of $G$ there is a less symmetric edge colouring with the same number of colours. On the other hand, if $T$ is a tree, then for every edge colouring there is a less symmetric vertex colouring with the same number of edges. Our results can be used to characterise those graphs whose distinguishing index is larger than their d…
Bounding $s$ for vertex-primitive $s$-arc-transitive digraphs of alternating and symmetric groups
本文针对 Praeger 提出的有限顶点本原 s-弧传递有向图的上界问题，在群为交错群或对称群的情形下证明了 s ≤ 2。
We discuss transpose (sometimes called universal exchange or all-to-all) on vertex symmetric networks. We provide a method to compare the efficiency of transpose schemes on two different networks with a cost function based on the number processors and wires needed to complete a given algorithm in a given time.
Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$. Using the combinatorial definition of the entropy of a graph in terms of its vertex packing polytope and the relationship between the graph entropy and fractional chromatic number, we characterize all graphs which are symmetric with respect to graph entropy. We show that a graph is symmetric with respect to graph entropy if and only if its vertex set can be un…
The chromatic symmetric function of graphs glued at a single vertex
本文通过矩阵乘法表达两个图在单点粘合后的色对称函数，利用森林三元组与Hikita概率的联系，证明了单位区间图与圈序列粘合及其首尾粘合图的$e$-正性，推广了圈弦图结果并支持Ellzey猜想。
Chromatic MacMahon symmetric functions of graphs
本研究提出顶点加权图的色对称MacMahon函数，证明树的该函数可确定其顶点子集的生成函数，推广了无权情形下的相关结论。
A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the combinatorial definition of the entropy of a graph in terms of its vertex packing polytope and the relationship between the graph entropy and fractional chromatic number, we prove that vertex transitive graphs are symmetric with respect to graph entropy. As the main result of this paper, we prove that a perfect graph is symmetric with respect to graph entropy if and on…
A fascinating problem on digraphs is the existence problem of the finiteupper bound on s for all vertex-primitive s-arc-transitive digraphs except directed cycles (which is known to be reduced to the almost simple groups case). In this paper,we prove that s 2 for all G-vertex-primitive s-arc-transitive digraphs with G an (insoluble) alternating or symmetric group, which makes an important progress towards a solution of the problem. The proofs involves some methods that may be used to investigate other almost simple groups cases.
We consider a finite, connected and simple graph $Γ$ that admits a vertex-transitive group of automorphisms $G$. Under the assumption that, for all $x \in V(Γ)$, the local action $G_x^{Γ(x)}$ is the action of $\mathrm{Sym}(n)$ on ordered pairs, we show that the group $G_x^{[3]}$, the pointwise stabiliser of a ball of radius three around $x$, is trivial.
We prove that the chromatic symmetric function of any $n$-vertex tree containing a vertex of degree $d\geq \log _2n +1$ is not $e$-positive, that is, not a positive linear combination of elementary symmetric functions. Generalizing this, we also prove that the chromatic symmetric function of any $n$-vertex connected graph containing a cut vertex whose deletion disconnects the graph into $d\geq\log _2n +1$ connected components is not $e$-positive. Furthermore we prove that any $n$-vertex bipartite graph, including all trees, containing a vertex of degree greater than $\lceil \frac{n}{2}\rceil$ …
If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present a simple combinatorial statistic on decompositions of vertices of the hypercube graphs with respect to symmetric cycles and describe their basic metric properties.
Using vertex operator we study Macdonald symmetric functions of rectangular shapes and their connection with the q-Dyson Laurent polynomial. We find a vertex operator realization of Macdonald functions and thus give a generalized Frobenius formula for them. As byproducts of the realization, we find a q-Dyson constant term orthogonality relation which generalizes a conjecture due to Kadell in 2000, and we generalize Matsumoto's hyperdeterminant formula for rectangular Jack functions to Macdonald functions.
We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated symmetric function in noncommuting variables for which we give a deletion-contraction formula. In the case of graphs this symmetric function in noncommuting variables agrees with the chromatic symmetric function in noncommuting variables of Gebhard and Sagan. Our vertex coloring is a special case of the scheduling problems defined by Breuer and Klivans. We show ho…
On the vertex operator algebra associated with rank one lattice we derive a general formula for products of vertex operators in terms of generalized homogeneous symmetric functions. As an application we realize Jack symmetric functions of rectangular shapes as well as marked rectangular shapes.
In this text we introduce and analyze families of symmetric functions arising as partition functions for colored fermionic vertex models associated with the quantized affine Lie superalgebra $U_q \big( \widehat{\mathfrak{sl}} (1 | n) \big)$. We establish various combinatorial results for these vertex models and symmetric functions, which include the following. (1) We apply the fusion procedure to the fundamental $R$-matrix for $U_q \big( \widehat{\mathfrak{sl}} (1 | n) \big)$ to obtain an explicit family of vertex weights satisfying the Yang-Baxter equation. (2) We define families of symmetric…
Bispanning graphs are undirected graphs with an edge set that can be decomposed into two disjoint spanning trees. The operation of symmetrically swapping two edges between the trees, such that the result is a different pair of disjoint spanning trees, is called an edge exchange or a symmetric base exchange. The graph of symmetric base exchanges of a bispanning graph contains a vertex for every valid pair of disjoint spanning trees, and edges between them to represent all possible edge exchanges. We are interested in a restriction of these graphs to only unique symmetric base exchanges, which a…
We provide a formula for every Schur coefficient in the chromatic symmetric function of a graph in terms of special rim hook tabloids. This formula is useful in confirming the non-Schur positivity of the chromatic symmetric function of a graph, especially when Stanley's stable partition method does not work. As applications, we determine Schur positive fan graphs and Schur positive complete tripartite graphs. We show that any squid graph obtained by adding $n$ leaves to a common vertex on an $m$-vertex cycle is not Schur positive if $m\ne 2n-1$, and conjecture that neither are the squid graphs…
Maximum number of symmetric extensions in the random graph
该研究将二项随机图中最大度、k顶点集最大公共邻居数等依分布收敛于Gumbel变量的结论，推广到一类对称扩展场景，发现其极限分布未必属于Gumbel族。
The chromatic symmetric function of a graph centred at a vertex
本文定义了以顶点为中心的色对称函数，利用NCSym和NCQSym商代数发现新的e-正单位区间图族，证实了Stanley-Stembridge猜想新情形，并细化了无环定向定理。
The spined cube $SQ_n$ is a variant of the hypercube $Q_n$, introduced by Zhou et al. in [Information Processing Letters 111 (2011) 561-567] as an interconnection network for parallel computing. A graph $\G$ is an $m$-Cayley graph if its automorphism group $\Aut(\G)$ has a semiregular subgroup acting on the vertex set with $m$ orbits, and is a Caley graph if it is a 1-Cayley graph. It is well-known that $Q_n$ is a Cayley graph of an elementary abelian 2-group $\mz_2^n$ of order $2^n$. In this paper, we prove that $SQ_n$ is a 4-Cayley graph of $\mz_2^{n-2}$ when $n\geq6$, and is a $\lfloor n/2\…
Let $Γ=(V,E)$ be a point-symmetric reflexive relation and let $v\in V$ such that $|Γ(v)|$ is finite (and hence $|Γ(x)|$ is finite for all $x$, by the transitive action of the group of automorphisms). Let $j\in \N$ be an integer such that $Γ^j(v)\cap Γ^{-}(v)=\{v\}$. Our main result states that $$ |Γ^{j} (v)|\ge | Γ^{j-1} (v)| + |Γ(v)|-1.$$ As an application we have $ |Γ^{j} (v)| \ge 1+(|Γ(v)|-1)j.$ The last result confirms a recent conjecture of Seymour in the case of vertex-symmetric graphs. Also it gives a short proof for the validity of the Caccetta-Häggkvist conjecture for vertex-symmetric…
A family of vertex operators that generalizes those given by Jing for the Hall-Littlewood symmetric functions is presented. These operators produce symmetric functions related to the Poincare polynomials referred to as generalized Kostka polynomials in the same way that Jing's operator produces symmetric functions related to Kostka-Foulkes polynomials. These operators are then used to derive commutation relations and new relations involving the generalized Kostka coefficients. Such relations may be interpreted as identities in the (GL(n) x C^*)-equivariant K-theory of the nullcone.
We introduce and study several combinatorial properties of a class of symmetric polynomials from the point of view of integrable vertex models in finite lattice. We introduce the $L$-operator related with the $U_q(sl_2)$ $R$-matrix, and construct the wavefunctions and their duals. We prove the exact correspondence between the wavefunctions and symmetric polynomials which is a quantum group deformation of the Grothendieck polynomials. This is proved by combining the matrix product method and an analysis on the domain wall boundary partition functions. As applications of the correspondence betwe…
Given a directed graph, an equivalence relation on the graph vertex set is said to be balanced if, for every two vertices in the same equivalence class, the number of directed edges from vertices of each equivalence class directed to each of the two vertices is the same. In this paper we describe the quotient and lift graphs of symmetric directed graphs associated with balanced equivalence relations on the associated vertex sets. In particular, we characterize the quotients and lifts which are also symmetric. We end with an application of these results to gradient and Hamiltonian coupled cell …
We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups ${\mathbb Z}_n$, symmetric groups $S_n$ and quantum symmetric groups $\mathcal Q_n$, by using various product operations. The exceptional case is that of the Petersen graph, and we present some questions about it.
For a graph $G$ with vertex set $V_{G}$ and edge set $E_{G}$, the symmetric division deg index is defined as $SDD(G)=\sum\limits_{uv\in E_{G}}(\frac{d_{u}}{d_{v}}+\frac{d_{v}}{d_{u}})$, where $d_{u}$ denotes the degree of vertex $u$ in $G$. In 2018, Furtula et al. confirmed the quality of SDD index exceeds that of some more popular VDB indices, in particular that of the GA index. They shown a close connection between the SDD index and the earlier well-established GA index. Thus it is meaningful and important to consider the chemical and mathematical properties of the SDD index. In this paper, …
This paper is about a family of symmetric rational functions that form a one-parameter generalization of the classical Hall-Littlewood polynomials. We introduce two sets of (skew and non-skew) functions that are akin to P and Q Hall-Littlewood polynomials. We establish (a) a combinatorial formula that represents our functions as partition functions for certain path ensembles in the square grid; (b) symmetrization formulas for non-skew functions; (c) identities of Cauchy and Pieri type; (d) explicit formulas for principal specializations; (e) two types of orthogonality relations for non-skew fu…
Matrices with simple symmetric digraphs and their group inverses
本文定义了简单对称有向图类 $\mathcal{D}$，给出了其群逆元素的图论描述，并对实方阵 $A$ 及其群逆 $A^{\\#}$ 均属于该类的矩阵进行了分类。
We study the effect of linear transformations on quantum fields with applications to vertex operator presentations of symmetric functions. Properties of linearly transformed quantum fields and corresponding transformations of Hall-Littlewood polynomials are described, including preservation of commutation relations, stability, explicit combinatorial formulas and generating functions. We prove that specializations of linearly transformed Hall-Littlewood polynomials describe all polynomial tau functions of the KP and the BKP hierarchy. Examples of linear transformations are related to multiparam…
A centrally symmetric $2d$-vertex combinatorial triangulation of the product of spheres $§^i\times§^{d-2-i}$ is constructed for all pairs of non-negative integers $i$ and $d$ with $0\leq i \leq d-2$. For the case of $i=d-2-i$, the existence of such a triangulation was conjectured by Sparla. The constructed complex admits a vertex-transitive action by a group of order $4d$. The crux of this construction is a definition of a certain full-dimensional subcomplex, $\B(i,d)$, of the boundary complex of the $d$-dimensional cross-polytope. This complex $\B(i,d)$ is a combinatorial manifold with bounda…
We consider a fully inhomogeneous stochastic higher spin six vertex model in a quadrant. For this model we derive concise integral representations for multi-point q-moments of the height function and for the q-correlation functions. At least in the case of the step initial condition, our formulas degenerate in appropriate limits to many known formulas of such type for integrable probabilistic systems in the (1+1)d KPZ universality class, including the stochastic six vertex model, ASEP, various q-TASEPs, and associated zero range processes. Our arguments are largely based on properties of a fam…
Uncrowding the 5-Vertex Model: RSK and Crystal Structures
本文通过在Motegi-Sakai的5-顶点模型上直接定义Robinson-Schensted-Knuth对应和解拥挤操作，构建了该模型状态的晶体结构，从而综合了组合与晶格理论方法。
We prove that for any tree with a vertex of degree at least six, its chromatic symmetric function is not $e$-positive, that is, it cannot be written as a nonnegative linear combination of elementary symmetric functions. This makes significant progress towards a recent conjecture of Dahlberg, She, and van Willigenburg, who conjectured the result for all trees with a vertex of degree at least four. We also provide a series of conditions that can identify when the chromatic symmetric function of a spider, a tree consisting of multiple paths identified at an end, is not $e$-positive. These conditi…
Symmetric functions from the six-vertex model in half-space
本文研究半空间随机六顶点模型，定义两类有理对称函数，证明其斜柯西恒等式，推导半象限配分函数的Pfaffian公式，提出对偶函数正交性猜想，并将积分公式约化为半直线ASEP的转移概率。
A graph $Γ$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $Γ$ with $V(Γ)$ admitting a nontrivial $G$-invariant partition $\mathcal{B}$ such that there is exactly one edge of $Γ$ between any two distinct blocks of $\mathcal{B}$. This is achieved by giving a classification of $(G, 2)$-point-transitive and $G$-block-transitive designs $\mathcal{D}$ together with $G$-orbits $Ω$ on the flag set of $\mathcal{D}$ such that $G_{σ, L}$ is transitive on $L \setmin…
We consider a homogeneous stochastic higher spin six vertex model in a quadrant. For this model we derive concise integral representations for multi-point q-moments of the height function and for the q-correlation functions. At least in the case of the step initial condition, our formulas degenerate in appropriate limits to many known formulas of such type for integrable probabilistic systems in the (1+1)d KPZ universality class, including the stochastic six vertex model, ASEP, various q-TASEPs, and associated zero range processes. Our arguments are largely based on properties of a family of s…
On Automorphism Group of a Family of Symmetric Graphs
本文研究Fu-Tao Hu等人2010年引入的顶点传递图族$H(n,k)$的自同构群与测地线传递性，并解答了原论文中遗留的未解问题。
We extend the definition of the chromatic symmetric function $X_G$ to include graphs $G$ with a vertex-weight function $w : V(G) \rightarrow \mathbb{N}$. We show how this provides the chromatic symmetric function with a natural deletion-contraction relation analogous to that of the chromatic polynomial. Using this relation we derive new properties of the chromatic symmetric function, and we give alternate proofs of many fundamental properties of $X_G$.
The k-th power of a n-vertex graph X is the iterated cartesian product of X with itself. The k-th symmetric power of X is the quotient graph of certain subgraph of its k-th power by the natural action of the symmetric group. It is natural to ask if the spectrum of the k-th power --or the spectrum of the k-th symmetric power-- is a complete graph invariant for small values of k, for example, for k=O(1) or k=O(log n). In this paper, we answer this question in the negative: we prove that if the well known 2k-dimensional Weisfeiler-Lehman method fails to distinguish two given graphs, then their k-…
The Jacobi--Trudi identity associates a symmetric function to any integer sequence. Let $Γ_{(t|X)}$ be the vertex operator defined by $Γ_{(t|X)} s_α=\sum_{n \in \mathbb{Z}} s_{(n,α)} [X] t^n$. We provide a combinatorial proof for the identity $Γ_{(t|X)} s_α= σ[tX] s_α\big[x-1/t\big] $ due to Thibon et al. We include an overview of all the combinatorial ideas behind this beautiful identity, including a combinatorial description for the expansion of $s_{(n,α)} [X] $ in the Schur basis, for any integer value of $n$.
Our work deals with symmetric rational functions and probabilistic models based on the fully inhomogeneous six vertex (ice type) model satisfying the free fermion condition. Two families of symmetric rational functions $F_λ,G_λ$ are defined as certain partition functions of the six vertex model, with variables corresponding to row rapidities, and the labeling signatures $λ=(λ_1\ge \ldots\ge λ_N)\in \mathbb{Z}^N$ encoding boundary conditions. These symmetric functions generalize Schur symmetric polynomials, as well as some of their variations, such as factorial and supersymmetric Schur polynomi…
Two celebrated conjectures in chromatic symmetric function theory concern the positivity chromatics symmetric functions of claw-free graphs. Here we extend the claw-free idea to general graphs and consider the e-positivity question for H-free graphs where H = {claw, F} and H={claw, F, co-F}, where F is a four-vertex graph. We settle the question for all cases except H={claw, co-diamond}, and we provide some partial results in that case.
The entropy of a graph is a functional depending both on the graph itself and on a probability distribution on its vertex set. This graph functional originated from the problem of source coding in information theory and was introduced by J. Körner in 1973. Although the notion of graph entropy has its roots in information theory, it was proved to be closely related to some classical and frequently studied graph theoretic concepts. For example, it provides an equivalent definition for a graph to be perfect and it can also be applied to obtain lower bounds in graph covering problems. In this thes…
A retract of a graph $Γ$ is an induced subgraph $Ψ$ of $Γ$ such that there exists a homomorphism from $Γ$ to $Ψ$ whose restriction to $Ψ$ is the identity map. A graph is a core if it has no nontrivial retracts. In general, the minimal retracts of a graph are cores and are unique up to isomorphism; they are called the core of the graph. A graph $Γ$ is $G$-symmetric if $G$ is a subgroup of the automorphism group of $Γ$ that is transitive on the vertex set and also transitive on the set of ordered pairs of adjacent vertices. If in addition the vertex set of $Γ$ admits a nontrivial partition that …
Generalized chromatic functions
本文为边划分有向图定义了顶点着色，由此提出广义色函数，统一了P-分划与图的色对称函数等理论，并构建了非交换变量中r-拟对称函数的新Hopf代数。
On the connectivity and diameter of Token graphs from a vertex induced sub-graph perspective
本文从顶点诱导子图视角研究 token 图，证明其顶点连通度等于最小度，分析底层图直径为 2 时的直径，并给出 L 与其 token 图间 clique-Johnson 图联系的组合结果。
We give an interpretation of the boson-fermion correspondence as a direct consequence of Jacobi-Trudi identity. This viewpoint enables us to construct from a generalized version of the Jacobi-Trudi identity the action of Clifford algebra on polynomial algebras that arrives as analogues of the algebra of symmetric functions. A generalized Giambelli identity is also proved to follow from that identity. As applications, we obtain explicit formulas for vertex operators corresponding to characters of the classical Lie algebras, shifted Schur functions, and generalized Schur symmetric functions asso…
Rational symmetric functions from the Izergin-Korepin 19-vertex model
基于象限中的Izergin-Korepin 19-vertex模型引入两族有理多元函数并证明其对称性与Cauchy恒等式，在谱参数极限下得到稳定对称函数与简化恒等式，并通过对2-排列集合求和给出对称化公式及monodromy矩阵元的显式公式。
Let $X$ be a connected, locally finite graph with symmetric growth. We prove that there is a vertex coloring $ϕ\colon X\to\{0,1\}$ and some $R\in\mathbb{N}$ such that every automorphism $f$ preserving $ϕ$ is $R$-close to the identity map; this can be seen as a coarse geometric version of symmetry breaking. We also prove that the infinite motion conjecture is true for graphs where at least one vertex stabilizer $S_x$ satisfies the following condition: for every non-identity automorphism $f\in S_x$, there is a sequence $x_n$ such that $\lim d(x_n,f(x_n))=\infty$.
The symmetric group $S_3$ acts on $S^2 \times S^2 \times S^2$ by coordinate permutation, and the quotient space $(S^2 \times S^2 \times S^2)/S_3$ is homeomorphic to the complex projective space $\CC P^3$. In this paper, we construct an 124-vertex simplicial subdivision $(S^2 \times S^2 \times S^2)_{124}$ of the 64-vertex standard cellulation $S^2_4 \times S^2_4 \times S^2_4$ of $S^2 \times S^2 \times S^2$, such that the $S_3$-action on this cellulation naturally extends to an action on $(S^2 \times S^2 \times S^2)_{124}$. Further, the $S_3$-action on $(S^2 \times S^2 \times S^2)_{124}$ is "goo…
The $k$-th symmetric product of a graph $G$ with vertex set $V$ with edge set $E$ is a graph with vertices as $k$-sets of $V$, where two $k$-sets are connected by an edge if and only if their symmetric difference is an edge in $E$. Using the isoperimetric properties of the vertex-induced subgraphs of $G$ and Sobolev inequalities on graphs, we obtain various edge-isoperimetric inequalities pertaining to the symmetric product of certain families of finite and infinite graphs.
We describe generating functions for several important families of classical symmetric functions and shifted Schur functions. The approach is originated from vertex operator realization of symmetric functions and offers a unified method to treat various families of symmetric functions and their shifted analogues.
Fully inhomogeneous spin Hall-Littlewood symmetric rational functions $F_λ$ are multiparameter deformations of the classical Hall-Littlewood symmetric polynomials and can be viewed as partition functions in $\mathfrak{sl}(2)$ higher spin six vertex models. We obtain a refined Littlewood identity expressing a weighted sum of $F_λ$'s over all partitions $λ$ with even multiplicities as a certain Pfaffian. This Pfaffian can be derived as a partition function of the six vertex model in a triangle with suitably decorated domain wall boundary conditions. The proof is based on the Yang-Baxter equation…
Bijectivization refines the Yang-Baxter equation into a pair of local Markov moves which randomly update the configuration of the vertex model. Employing this approach, we introduce new Yang-Baxter random fields of Young diagrams based on spin $q$-Whittaker and spin Hall-Littlewood symmetric functions. We match certain scalar Markovian marginals of these fields with (1) the stochastic six vertex model; (2) the stochastic higher spin six vertex model; and (3) a new vertex model with pushing which generalizes the $q$-Hahn PushTASEP introduced recently by Corwin-Matveev-Petrov (arXiv:1811.06475).…
A deletion-contraction long exact sequence for chromatic symmetric homology
本文将色对称同调范畴化推广到顶点加权图，证明其存在删除-收缩长正合序列，并借此解决了同调非零指标范围的两个遗留问题。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。