We study a class of systems of functional equations closely related to various kinds of integrable statistical and quantum mechanical models. We call them the finite and infinite @math -systems according to the number of functions and equations. The finite Q-systems appear as the thermal equilibrium conditions (the Sutherland–Wu equation) for certain statistical mechanical systems. Some infinite Q-systems appear as the relations of the normalized characters of the KR modules of the Yangians and the quantum affine algebras. We give two types of power series formulae for the unique solution (resp. the unique canonical solution) for a finite (resp. infinite) Q-system. As an application, we reformulate the Kirillov–Reshetikhin conjecture on the multiplicities formula of the KR modules in terms of the canonical solutions of Q-systems.
2 @cite_24 . Kerov . proposed and proved the type II formula for @math by the combinatorial method, where the bijection between the Littlewood-Richardson tableaux and the rigged configurations was constructed.
@cite_24
2010163765 2010193278 2748981990 1554718120
We establish a lower bound for the formula size of quolynomials over arbitrary fields. Our basic formula operations are addition, subtraction, multiplication and division. The proof is based on Neciporuk’s [Soviet Math. Doklady, 7 (1966), pp. 999–1000] lower bound for Boolean functions and uses formal power series. This result immediately yields a lower bound for the formula size of rational functions over infinite fields. We also show how to adapt Neciporuk’s method to rational functions over finite fields. These results are then used to show that, over any field, the @math determinant function has formula size at least @math . We thus have an algebraic analogue to the @math lower bound for the Boolean determinant due to Kloss [Soviet Math. Doklady, 7 (1966), pp. 1537–1540]. Let Fk(n,m) be a random k-SAT formula on n variables formed by selecting uniformly and independently m out of all possible k-clauses. It is well-known that for r ≥ 2k ln 2, Fk(n,rn) is unsatisfiable with probability 1-o(1). We prove that there exists a sequence tk = O(k) such that for r ≥ 2k ln 2 - tk, Fk(n,rn) is satisfiable with probability 1-o(1).Our technique yields an explicit lower bound for every k which for k > 3 improves upon all previously known bounds. For example, when k=10 our lower bound is 704.94 while the upper bound is 708.94. We formalise the axiomatic set theory second-order ZF in the constructive type theory of Coq assuming excluded middle. In this setting we prove Zermelo’s embedding theorem for models, categoricity in all cardinalities, and the correspondence of inner models and Grothendieck universes. Our results are based on an inductive definition of the cumulative hierarchy eliminating the need for ordinals and transfinite recursion. We give an algebro-combinatorial proof of a general ver­ sion of Pieri's formula following the approach developed by Fomin and Kirillov in the paper "Quadratic algebras, Dunkl elements, and Schu­ bert calculus." We prove several conjectures posed in their paper. As a consequence, a new proof of classical Pieri's formula for cohomol­ ogy of complex flag manifolds, and that of its analogue for quantum cohomology is obtained in this paper.