Related papers: Plinths and Pedestals
We give a direct deduction and proof of two identities in the theory of plane partitions. The first one is known to enumerate the traces of plane partitions. The second one comes without any combinatorial interpretation.
Stack triangulations appear as natural objects when defining an increasing family of triangulations by successive additions of vertices. We consider two different probability distributions for such objects. We represent, or "draw" these…
A follow-up to my previous tutorial on metric indexing, this paper walks through the classic structures, placing them all in the context of the recently proposed "sprawl of ambits" framework. The indexes are presented as configurations of a…
We Define moments of partitions of integers, and show that they appear in higher order derivatives of certain combinations of functions.
Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…
Filaments of galaxies are the dominant feature of modern large scale redshift surveys. They can account for up to perhaps half of the baryonic mass budget of the Universe and their distribution and abundance can help constrain cosmological…
This is a brief introduction to the basic concepts of topology. It includes the basic constructions, discusses separation properties, metric and pseudometric spaces, and gives some applications arising from the use of topology in computing.
It is shown that the descending plane partitions of Andrews can be geometrically realized as cyclically symmetric rhombus tilings of a certain hexagon where an equilateral triangle of side length 2 has been removed from its centre. Thus,…
Many analyses at the collider utilize the hadronic jets that are the footprints of QCD partons. These are used both to study the QCD processes themselves and increasingly as tools to study other physics, for example top mass reconstruction.…
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…
For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.
We compute stationary gravitational descendants in symplectic ellipsoids of any dimension, and use these to derive a number of new recursive formula for punctured curve counts in symplectic manifolds with ellipsoidal ends. Along the way we…
We introduce a geometric construction which relates to the pentagram map much in the way that a logarithmic spiral relates to a circle. After introducing the construction, we establish some basic geometric facts about it, and speculate on…
Skyline and Ranking queries have gained great popularity in the recent years. These two techniques are crucial for multi-criteria decision support applications, which are now more popular than ever before. Skyline and Ranking queries are,…
A dilatation structure is a concept in between a group and a differential structure. In this article we study fundamental properties of dilatation structures on metric spaces. This is a part of a series of papers which show that such a…
Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ``maximal staircases''…
Plane arrangements are a useful tool for surface and volume modelling. However, their main drawback is poor scalability. We introduce two key novelties that enable the construction of plane arrangements for complex objects and entire…
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
Meanders form a set of combinatorial problems concerned with the enumeration of self-avoiding loops crossing a line through a given number of points, $n$. Meanders are considered distinct up to any smooth deformation leaving the line fixed.…
In this short survey, we describe our approach for constructing hierarchies of Poisson brackets for classical integrable systems using its' spectral curves.