Related papers: Building reverse plane partitions with rim-hook-sh…
In this paper we describe an approach to construct semiclassical partition functions in gravity which are complete in the sense that they contain a complete description of the differentiable structures of the underlying 4-manifold. In…
The hyperplane and proper time formalisms are discussed mainly for the spin-half particles in the quantum case. A connection between these covariant Hamiltonian formalisms is established. It is showed that choosing the space-like…
For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…
We define, for an arbitrary partially ordered set, a multi-variable polynomial generalizing the hook polynomial.
We study plane partitions satisfying condition $a_{n+1,m+1}=0$ (this condition is called "pit") and asymptotic conditions along three coordinate axes. We find the formulas for generating function of such plane partitions. Such plane…
We describe an explicit semi-algebraic partition for the complement of a real hyperplane arrangement such that each piece is contractible and so that the pieces form a basis of Borel-Moore homology. We also give an explicit correspondence…
Any two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases one can connect the pieces by flexible hinges while still allowing the connected set to form both polygons. However it is open…
In this paper, we generalize recent work of Mizuhara, Sellers, and Swisher that gives a method for establishing restricted plane partition congruences based on a bounded number of calculations. Using periodicity for partition functions, our…
A method is described for constructing, with computer assistance, planar substitution tilings that have n-fold rotational symmetry. This method uses as prototiles the set of rhombs with angles that are integer multiples of pi/n, and…
A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…
The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of…
We set up a combinatorial framework for inclusion-exclusion on the partitions into distinct parts to obtain an alternative generating function of partitions into distinct and non-consecutive parts. In connection with Rogers-Ramanujan…
For an abelian tensor category a stack is constructed. As an application we show that our construction can be used to recover a quasi-compact separated scheme from the category of its quasi-coherent sheaves. In another application, we show…
The inverse problem of special geometry (Seiberg-Witten geometry of 4d N=2 SCFT) asks for a recursive construction of all such geometries in rank $r$ by assembling together known lower-rank ``strata''. This leads to a program to…
In this letter we calculate the exact partition function for free bosons on the plane with lacunae. First the partition function for a plane with two spherical holes is calculated by matching exactly for the infinite set of Wilson…
Fefferman-Graham ambient construction can be formulated as $\mathfrak{sp}(2)$-algebra relations on three Hamiltonian constraint functions on ambient space. This formulation admits a simple extension that leads to higher-spin fields, both…
We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').
We report a small advance on a question raised by Robertson, Schweitzer, and Wagon in [RSW02]. They constructed a genus-13 polyhedron built from bricks without corners, and asked whether every genus-0 such polyhedron must have a corner. A…
We prove an extension of a ham sandwich theorem for families of lines in the plane by Dujmovi\'{c} and Langerman. Given two sets $A, B$ of $n$ lines each in the plane, we prove that it is possible to partition the plane into $r$ convex…
An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…