Related papers: Plane partitions I: a generalization of MacMahon's…

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…

In this report, we summarize the set partition enumeration problems and thoroughly explain the algorithms used to solve them. These algorithms iterate through the partitions in lexicographic order and are easy to understand and implement in…

We propose a definition of partition quantum spaces. They are given by universal $C^*$-algebras whose relations come from partitions of sets. We ask for the maximal compact matrix quantum group acting on them. We show how those fit into the…

The goal of this text is to present the computation by Salmon, in the second half of the XIXth century, of various numbers enumerating planes with a prescribed tangency pattern with a sufficiently general surface $S$ in $\mathbf{P}^3$ (or,…

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

The challenges of examining random partitions of space are a significant class of problems in the theory of geometric transformations. Richard Miles calculated moments of areas and perimeters of any order (including expectation) of the…

We obtain an explicit formula to enumerate closed random walks on a cubic lattice with a specified length and 3D algebraic area. The 3D algebraic area is defined as the sum of algebraic areas obtained from the walk's projection onto the…

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…

We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…

We define, for an arbitrary partially ordered set, a multi-variable polynomial generalizing the hook polynomial.

We derive a simple bijection between geometric plane perfect matchings on $2n$ points in convex position and triangulations on $n+2$ points in convex position. We then extend this bijection to monochromatic plane perfect matchings on…

We show that every two nice measures in the plane can be partitioned into equal halves by translation of an angle from arbitrary k-fan when k is odd and in some cases when k is even. We also give some counterexamples for certain fans and…

Recently M. Vuletic found a two-parameter generalization of the MacMahon's formula. In this note we show that certain ingredients of her formula have a clear interpretation in terms of the geometry of the moduli space of sheaves on the…

The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo…

This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

We establish an exact formula for the average number of edges appearing on the boundary of the global convex hull of n independent Brownian paths in the plane. This requires the introduction of a counting criterion which amounts to "cutting…

The number of standard Young tableaux of shape a partition $\lambda$ is called the dimension of the partition and is denoted by $f^{\lambda}$. Partitions with odd dimensions were enumerated by McKay and were further characterized by…