arXiv math/06042892006-04math.CO

A Periodicity Theorem for the Octahedron Recurrence

Andre Henriques

备注：: 22 pages, (a few pictures added, section 3 has been reorganized)

英文摘要：

We investigate a variant of the octahedron recurrence which lives in a 3-dimensional lattice contained in [0,n] x [0,m] x R. Generalizing results of David Speyer math.CO/0402452, we give an explicit non-recursive formula for the values of this recurrence in terms of perfect matchings. We then use it to prove that the octahedron recurrence is periodic of period n+m. This result is reminiscent of Fomin and Zelevinsky's theorem about the periodicity of Y-systems.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Birational Rowmotion and the Octahedron Recurrence

We use the octahedron recurrence to give a simplified statement and proof of a formula for iterated birational rowmotion on a product of two chains, first described by Musiker and Roby. Using this, we show that weights of certain chains in rectangles shift in a predictable way under the action of rowmotion. We then define generalized Stanley-Thomas words whose cyclic rotation uniquely determines birational rowmotion on the product of two chains. We also discuss the relationship between rowmotion and birational RSK and give a birational analogue of Greene's theorem in this setting.

2022-04-08math.CO

Arrays and the octahedron recurrence

Recently, in papers by Knutson, Tao and Woodward, Henriques and Kamnitzer, Pak and Vallejo have been constructed several interesting bijections of associativity and commutativity. In the first two papers bijections relate special sets of discretely concave functions (hives) on triangular grids and the octahedron recurrence plays the key role for these bijections. Pak and Vallejo related special sets of Young tableaux and constructions of these bijections based on standard algorithms in this theory, jeu de taquen, Schutzenberger involution, tableaux switching, etc. In this paper we investigate …

2005-04-14math.CO

Interlacing networks: birational RSK, the octahedron recurrence, and Schur function identities

Motivated by the problem of giving a bijective proof of the fact that the birational RSK correspondence satisfies the octahedron recurrence, we define interlacing networks, which are certain planar directed networks with a rigid structure of sources and sinks. We describe an involution that swaps paths in these networks and leads to Plücker-like three-term relations among path weights. We show that indeed these relations follow from the Plücker relations in the Grassmannian together with some simple rank properties of the matrices corresponding to our interlacing networks. The space of matrice…

2015-06-11math.CO

Perfect Matchings and the Octahedron Recurrence

We study a recurrence defined on a three dimensional lattice and prove that its values are Laurent polynomials in the initial conditions with all coefficients equal to one. This recurrence was studied by Propp and by Fomin and Zelivinsky. Fomin and Zelivinsky were able to prove Laurentness and conjectured that the coefficients were 1. Our proof establishes a bijection between the terms of the Laurent polynomial and the perfect matchings of certain graphs, generalizing the theory of Aztec diamonds. In particular, this shows that the coefficients of this polynomial, and polynomials obtained by s…

2004-03-02math.CO

The octahedron recurrence and RSK-correspondence

We start with an ``algebraic'' RSK-correspondence due to Noumi and Yamada. Given a matrix $X$, we consider a pyramidal array of solid minors of $X$. It turns out that this array satisfies an algebraic variant of octahedron recurrence. The main observation is that this array can also be constructed with the help of some square `genetic' array. Next we tropicalize this algebraic construction and consider $T$-{\em polarized} pyramidal arrays (that is arrays satisfying octahedral relations). As a result we get several bijections, viz: a) a linear bijection between non-negative arrays and supermodu…

2007-03-14math.CO

The octahedron recurrence and gl(n) crystals

We study the hive model of gl(n) tensor products, following Knutson, Tao, and Woodward. We define a coboundary category where the tensor product is given by hives and where the associator and commutor are defined using a modified octahedron recurrence. We then prove that this category is equivalent to the category of crystals for the Lie algebra gl(n). The proof of this equivalence uses a new connection between the octahedron recurrence and the Jeu de Taquin and Schutzenberger involution procedures on Young tableaux.

2005-06-13math.COmath.QA

更多相关论文收起更多论文

Bessenrodt-Stanley polynomials and the octahedron recurrence

We show that a family of multivariate polynomials recently introduced by Bessenrodt and Stanley can be expressed as solution of the octahedron recurrence with suitable initial data. This leads to generalizations and explicit expressions as path or dimer partition functions.

2014-06-04math-phmath.COmath.MP

A positive proof of the Littlewood-Richardson rule using the octahedron recurrence

We define the_hive ring_, which has a basis indexed by dominant weights for GL(n), and structure constants given by counting hives [KT1] (or equivalently honeycombs, or Berenstein-Zelevinsky patterns [BZ1]). We use the octahedron rule from [Robbins-Rumsey,Fomin-Zelevinsky,Propp,Speyer] to prove bijectively that this "ring" is indeed associative. This, and the Pieri rule, give a self-contained proof that the hive ring is isomorphic as a ring-with-basis to the representation ring of GL(n). In the honeycomb interpretation, the octahedron rule becomes "scattering" of the honeycombs. This recovers …

2003-06-18math.COmath.RT

施瓦茨八面体递推（dSKP方程）I：显式解

The Schwarzian octahedron recurrence (dSKP equation) I: explicit solutions

本文给出了离散施瓦茨KP方程（dSKP）的显式解，将其表示为二部图加权二聚体配分函数之比，证明了零代数熵、无抵消表达式及Devron性质，并讨论了相关极限形状与八面体方程分类的组合学。

2024-06-07math.COnlin.SI

Prime Power Divisibility,Periodicity and Other Properties of Some Second Order Recurrences

Wall published a paper in 1960 on the Fibonacci sequence where he derived many results concerning the period and prime power divisibility modulo m. His periodicity results have been generalized to second order linear recurrences. Here we study the sequences generated by such recurrences, with starting values of {0,1}: among other things, we derive new prime power divisibility results, derive the period by new methods, establish new identities, show derivations involving powers of matrices generated by these general recurrences, etc.

2015-09-30math.CO

The Multidimensional Cube Recurrence

We introduce a recurrence which we term the multidimensional cube recurrence, generalizing the octahedron recurrence studied by Propp, Fomin and Zelevinsky, Speyer, and Fock and Goncharov and the three-dimensional cube recurrence studied by Fomin and Zelevinsky, and Carroll and Speyer. The states of this recurrence are indexed by tilings of a polygon with rhombi, and the variables in the recurrence are indexed by vertices of these tilings. We travel from one state of the recurrence to another by performing elementary flips. We show that the values of the recurrence are independent of the order…

2009-09-23math.AGmath.CO

八面体递推的极限（带GUE边界数据）

Limit of the octahedron recurrence with GUE boundary data

School of Technology and Computer Science（技术与计算机科学学院）；Tata Institute of Fundamental Research（塔塔基础研究院）

研究带GUE边界数据的八面体递推，证明其缩放后随机场收敛于确定性Lipschitz函数，并通过完美匹配公式给出表面张力变分刻画。

2026-10-08math.COmath.PR

Periodicity and integrability for the cube recurrence

Zamolodchikov periodicity is a property of $T$- and $Y$-systems, arising in the thermodynamic Bethe ansatz. Zamolodchikov integrability was recently considered as its affine analog in our joint work with P. Pylyavskyy. Here we prove periodicity and integrability for similar discrete dynamical systems based on the cube recurrence, also known as the discrete BKP equation. The periodicity part was conjectured by Henriques in 2007.

2017-04-19math-phmath.COmath.MP

带主系数的T系统的解

Solutions to the T-systems with Principal Coefficients

该研究从聚类代数角度定义带主系数的T系统，借助完美匹配、不相交路径和网络的配分函数给出其组合解，同时为多种带不同系数的相关T系统提供了解决方案。

2015-11-17math.COmath.DS

随机初始化递推的模周期性

Modular Periodicity of Random Initialized Recurrences

研究所有可能初始值下随机初始化递推的周期结构，发现斐波那契递推与其奇偶变换的镜像对称性，揭示素数到素数幂模的分形自相似性，并定义由卢卡斯比值支配的极小分布。

2026-04-09math.COmath.NT

Linear Recurrences over a Finite Field with Exactly Two Periods

In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~$f$ to have exactly two periods in the sense that the period of any sequence generated by~$f$ is either one or a unique integer greater than one.

2021-03-01cs.ITmath.COmath.IT

Cluster mutation-periodic quivers and associated Laurent sequences

We consider quivers/skew-symmetric matrices under the action of mutation (in the cluster algebra sense). We classify those which are isomorphic to their own mutation via a cycle permuting all the vertices, and give families of quivers which have higher periodicity. The periodicity means that sequences given by recurrence relations arise in a natural way from the associated cluster algebras. We present a number of interesting new families of non-linear recurrences, necessarily with the Laurent property, of both the real line and the plane, containing integrable maps as special cases. In particu…

2011-08-13hep-thmath.COmath.RT