Related papers: Note on the bijectivity of the Pak-Stanley labelli…
We consider the monomial expansion of the $q$-Whittaker and modified Hall-Littlewood polynomialsarising from specialization of the modified Macdonald polynomial. The two combinatorial formulas for the latter due to Haglund, Haiman, and…
We give a Cayley type formula to count the number of spanning trees in the complete r-uniform hypergraph for all r >= 3. Similar to the bijection between spanning trees in complete graphs and Parking functions, we derive a bijection from…
We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…
We study the set of NBC sets (no broken circuit sets) of the Linial arrangement and deduce a constructive bijection to the set of local binary search trees. We then generalize this construction to two families of Linial type arrangements…
The diagram of a 132-avoiding permutation can easily be characterized: it is simply the diagram of a partition. Based on this fact, we present a new bijection between 132-avoiding and 321-avoiding permutations. We will show that this…
Motivated by a question on the graded rank of the stalks of the canonical sheaf on a Bruhat graph, we lift some equalities concerning (parabolic) Kazhdan-Lusztig polynomials to this moment graph setting. Our proofs hold also in positive…
We revisit the construction of stable envelopes in equivariant elliptic cohomology [arXiv:1604.00423] and give a direct inductive proof of their existence and uniqueness in a rather general situation. We also discuss the specialization of…
Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…
We present an algorithm for determining whether a bipartite graph $G$ is 2-chordal (formerly doubly chordal bipartite). At its core this algorithm is an extension of the existing efficient algorithm for determining whether a graph is…
Postnikov--Stanley polynomials $D_u^w$ are a generalization of skew dual Schubert polynomials to the setting of arbitrary Weyl groups. We prove that Postnikov--Stanley polynomials are Lorentzian by showing that they are degree polynomials…
This presentation is intended to give a flavour of the physics to be studied and discovered by exploiting the interface between string theory, M-theory and field theory provided by the dynamics of extended objects called `branes', and their…
We study a symmetry problem for the $h$-polynomials of edge rings of bipartite graphs. Let $G$ be a bipartite graph and write $h(\mathbb{k}[G];t)=h_0+h_1t+\cdots+h_st^s$. We prove that if $\Bbbk[G]$ is pseudo-Gorenstein and $h_1=h_{s-1}$,…
A bijection $\Phi$ is presented between plane bipolar orientations with prescribed numbers of vertices and faces, and non-intersecting triples of upright lattice paths with prescribed extremities. This yields a combinatorial proof of the…
In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard…
Let $A(\ell,n,k)$ denote the number of $\ell$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We provide a new proof of an explicit formula for $A(\ell,n,k)$…
We give a bijective proof of the MacMahon-type equidistribution over the group of signed even permutations C_2 \wr A_n that was stated in [Bernstein. Electron. J. Combin. 11 (2004) 83]. This is done by generalizing the bijection that was…
This note provides a self-contained exposition of the proof of the artinian conjecture, following closely Djament's Bourbaki lecture. The original proof is due to Putman, Sam, and Snowden.
In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…
The proof of the combinatorial Hard Lefschetz Theorem for the ``virtual'' intersection cohomology of a not necessarily rational polytopal fan that has been presented by K. Karu completely establishes Stanley's conjectures for the…
In is paper we present a labelled tableau proof system that serves a wide class of interpretability logics. The system is proved sound and complete for any interpretability logic characterised by a frame condition given by a set of…