scholarly journals The combinatorial formula of gabrielov, gelfand and losik for the first pontrjagin class

1978 ◽  
pp. 105-124 ◽  
Author(s):  
Robert MacPherson
Keyword(s):  
Combinatorial Formula ◽  
Pontrjagin Class

scholarly journals Exact 1/N expansion of Wilson loop correlators in $$ \mathcal{N} $$ = 4 Super-Yang-Mills theory

2021 ◽  
Vol 2021 (7) ◽  
Author(s):  
Wolfgang Mück
Keyword(s):  
Matrix Model ◽  
Wilson Loop ◽  
Model Solution ◽  
Wilson Loops ◽  
Combinatorial Formula ◽  
Expectation Value ◽  
Yang Mills ◽  
Hooft Coupling ◽  
The Matrix ◽  
Super Yang Mills Theory

Abstract Supersymmetric circular Wilson loops in $$ \mathcal{N} $$ N = 4 Super-Yang-Mills theory are discussed starting from their Gaussian matrix model representations. Previous results on the generating functions of Wilson loops are reviewed and extended to the more general case of two different loop contours, which is needed to discuss coincident loops with opposite orientations. A combinatorial formula representing the connected correlators of multiply wound Wilson loops in terms of the matrix model solution is derived. Two new results are obtained on the expectation value of the circular Wilson loop, the expansion of which into a series in 1/N and to all orders in the ’t Hooft coupling λ was derived by Drukker and Gross about twenty years ago. The connected correlators of two multiply wound Wilson loops with arbitrary winding numbers are calculated as a series in 1/N. The coefficient functions are derived not only as power series in λ, but also to all orders in λ by expressing them in terms of the coefficients of the Drukker and Gross series. This provides an efficient way to calculate the 1/N series, which can probably be generalized to higher-point correlators.

scholarly journals A combinatorial formula for nonsymmetric Macdonald polynomials

2008 ◽  
Vol 130 (2) ◽  
pp. 359-383 ◽  
Author(s):  
James. Haglund ◽  
Mark D. Haiman ◽  
N. Loehr
Keyword(s):  
Macdonald Polynomials ◽  
Combinatorial Formula

scholarly journals A Positive Combinatorial Formula for the Complexity of the $q$-Analog of the $n$-Cube

10.37236/2389 ◽  
2012 ◽  
Vol 19 (2) ◽  
Author(s):  
Murali Krishna Srinivasan
Keyword(s):  
Graph Theory ◽  
Explicit Formula ◽  
Classical Result ◽  
Spanning Trees ◽  
Combinatorial Formula ◽  
Algebraic Graph Theory ◽  
The Matrix ◽  
Number Of Spanning Trees

The number of spanning trees of a graph $G$ is called the complexity of $G$. A classical result in algebraic graph theory explicitly diagonalizes the Laplacian of the $n$-cube $C(n)$  and yields, using the Matrix-Tree theorem, an explicit formula for $c(C(n))$. In this paper we explicitly block diagonalize the Laplacian of the $q$-analog $C_q(n)$ of $C(n)$ and use this, along with the Matrix-Tree theorem, to give a positive combinatorial formula for $c(C_q(n))$. We also explain how setting $q=1$ in the formula for $c(C_q(n))$ recovers the formula for $c(C(n))$.

scholarly journals A Combinatorial Approach to the $q,t$-Symmetry Relation in Macdonald Polynomials

10.37236/5350 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
Maria Monks Gillespie
Keyword(s):  
Macdonald Polynomials ◽  
Combinatorial Proof ◽  
Symmetry Relation ◽  
Combinatorial Approach ◽  
Combinatorial Formula ◽  
Recursive Structure ◽  
Littlewood Polynomials

Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, we investigate the combinatorics of the symmetry relation $\widetilde{H}_\mu(\mathbf{x};q,t)=\widetilde{H}_{\mu^\ast}(\mathbf{x};t,q)$. We provide a purely combinatorial proof of the relation in the case of Hall-Littlewood polynomials ($q=0$) when $\mu$ is a partition with at most three rows, and for the coefficients of the square-free monomials in $\mathbf{x}$ for all shapes $\mu$. We also provide a proof for the full relation in the case when $\mu$ is a hook shape, and for all shapes at the specialization $t=1$. Our work in the Hall-Littlewood case reveals a new recursive structure for the cocharge statistic on words.

scholarly journals New Combinatorial Formulas for Cluster Monomials of Type $A$ Quivers

10.37236/6464 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Kyungyong Lee ◽  
Li Li ◽  
Ba Nguyen
Keyword(s):  
Cluster Algebra ◽  
Theta Functions ◽  
Type A ◽  
Perfect Matchings ◽  
Cluster Algebras ◽  
Combinatorial Formula ◽  
Natural Basis ◽  
Combinatorial Formulas ◽  
New Formula

Lots of research focuses on the combinatorics behind various bases of cluster algebras. This paper studies the natural basis of a type $A$ cluster algebra, which consists of all cluster monomials. We introduce a new kind of combinatorial formula for the cluster monomials in terms of the so-called globally compatible collections. We give bijective proofs of these formulas by comparing with the well-known combinatorial models of the $T$-paths and of the perfect matchings in a snake diagram. For cluster variables of a type $A$ cluster algebra, we give a bijection that relates our new formula with the theta functions constructed by Gross, Hacking, Keel and Kontsevich.

scholarly journals A combinatorial formula for Earle's twisted 1-cocycle on the mapping class group

2009 ◽  
Vol 146 (1) ◽  
pp. 109-118 ◽  
Author(s):  
YUSUKE KUNO
Keyword(s):  
Mapping Class Group ◽  
Homology Group ◽  
Class Group ◽  
Base Point ◽  
Mapping Class ◽  
Combinatorial Formula ◽  
Hyperelliptic Involution ◽  
Fixed Base ◽  
Genus 2 ◽  
Closed Oriented Surface

AbstractWe present a formula expressing Earle's twisted 1-cocycle on the mapping class group of a closed oriented surface of genus ≥ 2 relative to a fixed base point, with coefficients in the first homology group of the surface. For this purpose we compare it with Morita's twisted 1-cocycle which is combinatorial. The key is the computation of these cocycles on a particular element of the mapping class group, which is topologically a hyperelliptic involution.

scholarly journals Combinatorics of Generalized Exponents

2018 ◽  
Vol 2020 (16) ◽  
pp. 4942-4992 ◽  
Author(s):  
Cédric Lecouvey ◽  
Cristian Lenart
Keyword(s):  
Root System ◽  
Lie Algebras ◽  
Finite Type ◽  
Irreducible Representations ◽  
Combinatorial Proof ◽  
Combinatorial Formula ◽  
Branching Rules ◽  
Crystal Graphs ◽  
Type C ◽  
Generalized Exponents

Abstract We give a purely combinatorial proof of the positivity of the stabilized forms of the generalized exponents associated to each classical root system. In finite type $A_{n-1}$, we rederive the description of the generalized exponents in terms of crystal graphs without using the combinatorics of semistandard tableaux or the charge statistic. In finite type $C_{n}$, we obtain a combinatorial description of the generalized exponents based on the so-called distinguished vertices in crystals of type $A_{2n-1}$, which we also connect to symplectic King tableaux. This gives a combinatorial proof of the positivity of Lusztig $t$-analogs associated to zero-weight spaces in the irreducible representations of symplectic Lie algebras. We also present three applications of our combinatorial formula and discuss some implications to relating two type $C$ branching rules. Our methods are expected to extend to the orthogonal types.

Sign in / Sign up

Export Citation Format

Share Document