Related papers: Two formulas for plane paritions

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

The aim of this article is twofold: give a short proof of the existence of real spectral shift function and the associated trace formula for a pair of contractions, the difference of which is trace-class and one of the two a strict…

We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…

Motivated by applications in databases, this paper considers various fragments of the calculus of binary relations. The fragments are obtained by leaving out, or keeping in, some of the standard operators, along with some derived operators…

Let P_1 and P_2 be two sets of points in the plane, so that P_1 is contained in a line L_1, P_2 is contained in a line L_2, and L_1 and L_2 are neither parallel nor orthogonal. Then the number of distinct distances determined by the pairs…

A very explicit analytic formula of the separability criterion of two-party Gaussian systems is given. This formula is compared to the past formulation of the separability criterion of continuous variables two-party Gaussian systems.

We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first principles related to properties of integer partitions, that…

We study perfect crystals for the standard modules of the affine Lie algebra $A_1^{(1)}$ at all levels using the theory of multi-grounded partitions. We prove a family of partition identities which are reminiscent of the Andrews-Gordon…

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…

We prove that if one colors each point of the Euclidean plane with one of five colors, then there exist two points of the same color that are either distance $1$ or distance $2$ apart.

Let $\{p_1, \ldots , p_n \} \subset {\Bbb{R}}^2$ be a separated point set, i.e., any two points have a distance at least $1$. Let $k \ge 1$ be an integer, and $1 \le t_1 < \ldots < t_k$ be real numbers. Let $\delta > 0$. Suppose for all $1…

Let $p_k(n)$ denote the number of $2$-color partitions of $n$ where one of the colors appears only in parts that are multiples of $k$. We will prove a conjecture of Ahmed, Baruah, and Dastidar on congruences modulo $5$ for $p_k(n)$.…

We present two new constructions in the usual euclidean plane. We only deal with 'Grecian Geometry', with this phrase we mean elementary geometry in the two-dimensional space R 2 . We describe and prove two propositions about 'projections'.…

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…

In this paper, we introduce plane permutations, i.e. pairs $\mathfrak{p}=(s,\pi)$ where $s$ is an $n$-cycle and $\pi$ is an arbitrary permutation, represented as a two-row array. Accordingly a plane permutation gives rise to three distinct…

To flatten a set partition (with apologies to Mathematica) means to form a permutation by erasing the dividers between its blocks. Of course, the result depends on how the blocks are listed. For the usual listing--increasing entries in each…

We present a dual of a family of partition identities of Andrews involving partitions with no repeated odd parts (among other conditions), along with an overpartition generalization that encapsulates both families. These were discovered…

The treatment of the number-theoretical problem of integer partitions within the approach of statistical mechanics is discussed. Historical overview is given and known asymptotic results for linear and plane partitions are reproduced. From…

A simple characterization of the causal automorphisms of 1+1 Minkowski spacetime is given.