Related papers: Eliminating Human Insight: An Algorithmic Proof of…

The conjecture that the orbit-counting generating function for totally symmetric plane partitions can be written as an explicit product formula, has been stated independently by George Andrews and David Robbins around 1983. We present a…

In the historic conference Combinatoire Enumerative[LL] wonderfully organized by Gilbert Labelle and Pierre Leroux there were many stimulating lectures, including a very interesting one by Pierre Leroux himself, who talked about his joint…

We give a new proof of a determinant evaluation due to Andrews, which has been used to enumerate cyclically symmetric and descending plane partitions. We also prove some related results, including a q-analogue of Andrews's determinant.

In this paper we give Pfaffian expressions and constant term identities for the enumeration problems presented by Mills, Robbins and Rumsey (``Self-complementary totally symmetric plane partitions'' J. Combin. Theory Ser. A, 42, 277--292),…

In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the number of plane partitions in each of ten symmetry classes. This paper together with results by Andrews [J. Combin. Theory Ser. A 66 (1994), 28-39]…

This paper studies Zeilberger's two prized constant term identities. For one of the identities, Zeilberger asked for a simple proof that may give rise to a simple proof of Andrews theorem for the number of totally symmetric self…

Totally symmetric self-complementary plane partitions (TSSCPPs) are boxed plane partitions with the maximum possible symmetry. We use the well-known representation of TSSCPPs as a dimer model on a honeycomb graph enclosed in one-twelfth of…

By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…

Let $s(n)$ be the number of 1-shell totally symmetric plane partitions (TSPPs) of $n$. In this paper, an infinite family of congruences modulo powers of $5$ for $s(n)$ will be deduced through an elementary approach. Namely, $$s\left(2\cdot…

We give "hybrid" proofs of the $q$-binomial theorem and other identities. The proofs are "hybrid" in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the…

Symmetry is the essential element of lifted inference that has recently demon- strated the possibility to perform very efficient inference in highly-connected, but symmetric probabilistic models models. This raises the question, whether…

We resolve the explicit bijection problem between symmetric plane partitions (SPPs) and quasi transpose complementary plane partitions (QTCPPs), introduced by Schreier-Aigner, who proved their equinumerosity. First, we relate this problem…

We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of $\mathcal…

The Topological Tverberg Theorem claims that any continuous map of a (q-1)(d+1)-simplex to \R^d identifies points from q disjoint faces. (This has been proved for affine maps, for d=1, and if q is a prime power, but not yet in general.) The…

The ring of symmetric functions carries the structure of a Hopf algebra. When computing the coproduct of complete symmetric functions $h_\lambda$ one arrives at weighted sums over reverse plane partitions (RPP) involving binomial…

Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…

We prove the equality of doubly refined enumerations of Alternating Sign Matrices and of Totally Symmetric Self-Complementary Plane Partitions using integral formulae originating from certain solutions of the quantum Knizhnik--Zamolodchikov…

Conjectures involving infinite families of restricted partition congruences can be difficult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modified and employed…

In this paper we give a computer proof of a new polynomial identity, which extends a recent result of Alladi and the first author. In addition, we provide computer proofs for new finite analogs of Jacobi and Euler formulas. All computer…

$\newcommand{\floor}[1]{\left\lfloor {#1} \right\rfloor} \renewcommand{\Re}{\mathbb{R}}$ Tverberg's theorem states that a set of $n$ points in $\Re^d$ can be partitioned into $\floor{n/(d+1)}$ sets with a common intersection. A point in…