Related papers: Some remarks on combinatorial wall-crossing

We propose and prove a mirror theorem for the elliptic quasimap invariants for smooth Calabi-Yau complete intersections in projective spaces. The theorem combined with the wall-crossing formula appeared in paper (arXiv:1308.6377) implies…

In a recent paper, Caracciolo, Sokal and Sportiello presented, inter alia, an algebraic/combinatorial proof for Cayley's identity. The purpose of the present paper is to give a "purely combinatorial" proof for this identity; i.e., a proof…

A combinatorial description of the crystal $\mathcal{B}(\infty)$ for finite-dimensional simple Lie algebras in terms of Young tableaux was developed by J. Hong and H. Lee. Using this description, we obtain a combinatorial rule for…

This work applies the ideas of Alekseev and Meinrenken's Non-commutative Chern-Weil Theory to describe a completely combinatorial and constructive proof of the Wheeling Theorem. In this theory, the crux of the proof is, essentially, the…

We introduce the concepts of an amazing hypercube decomposition and a double shortcut for it, and use these new ideas to formulate a conjecture implying the Combinatorial Invariance Conjecture of the Kazhdan--Lusztig polynomials for the…

We present another proof for the well-known {\em small model property} of two-variable logic. As far as we know, existing proofs of this property rely heavily on model theoretic concepts. In contrast, ours is purely combinatorial and uses…

We present a few combinatorial identities which were encountered in our work on the spectral theory of quantum graphs. They establish a new connection between the theory of random matrix ensembles and combinatorics.

We derive explicit formulae for the generating series of mixed Grothendieck dessins d'enfant/monotone/simple Hurwitz numbers, via the semi-infinite wedge formalism. This reveals the strong piecewise polynomiality in the sense of…

We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function…

A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an…

This work develops new ideas and tools to establish wall-crossing in Calabi-Yau four categories as originally conjectured by Gross-Joyce-Tanaka. In the process, I set up some necessary new language, including a natural refinement of Joyce's…

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a "Z_k-combinatorial Stokes theorem", which in turn…

We study motivic Donaldson-Thomas invariants in the sense of Behrend-Bryan-Szendroi. A wall-crossing formula under a mutation is proved for a certain class of quivers with potentials.

A conjectural recursive relation for the Poincar\'e polynomial of the Hitchin moduli space is derived from wallcrossing in the refined local Donaldson-Thomas theory of a curve. A doubly refined generalization of this theory is also…

For any polynomial representation of the special linear group, the nodes of the corresponding crystal may be indexed by semi-standard Young tableaux. Under certain conditions, the standard Young tableaux occur, and do so with weight 0.…

We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…

We compare crystal combinatorics of the level $2$ Fock space with the classification of unitary representations of type $B$ rational Cherednik algebras to show that any finite-dimensional unitary irreducible representation of such an…

Recently, Andrews and EI Bachraoui obtained several iden tities on two-colored partitions. While solving open problems they posed, Chen and Zhou derived a number of identities using analytic methods and asked for combinatorial proofs. In…

In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…