Related papers: Generalized Integer Partitions, Tilings of Zonotop…

We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…

Zonotopes are a rich and fascinating family of polytopes, with connections to many areas of mathematics. In this article we provide a brief survey of classical and recent results related to lattice zonotopes. Our emphasis is on connections…

In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…

Penrose tilings form lattices, exhibiting 5-fold symmetry and isotropic elasticity, with inhomogeneous coordination much like that of the force networks in jammed systems. Under periodic boundary conditions, their average coordination is…

The local structure of a tiling is described in terms of a multiplicative structure on its pattern classes. The groupoid associated to the tiling is derived from this structure and its integer group of coinvariants is defined. This group…

We restate a process presented by Stanley as a technique to prove that there exists exactly one $d$-differential distributive lattice for any positive integer $d$. This process can be trivially extended to apply to distributive finitary…

Motivated by the problem of domino tilings of the Aztec diamond, a weighted particle system is defined on $N$ lines, with line $j$ containing $j$ particles. The particles are restricted to lattice points from 0 to $N$, and particles on…

This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…

An integer generalized spline is a set of vertex labels on an edge-labeled graph that satisfy the condition that if two vertices are joined by an edge, the vertex labels are congruent modulo the edge label. Foundational work on these…

We construct an involution on set partitions which keeps track of the numbers of crossings, nestings and alignments of two edges. We derive then the symmetric distribution of the numbers of crossings and nestings in partitions, which…

In this paper, we introduce a generalization of a class of tilings which appear in the literature: the tilings over which a height function can be defined (for example, the famous tilings of polyominoes with dominoes). We show that many…

We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…

A generalized twistor transform for spinning particles in 3+1 dimensions is constructed that beautifully unifies many types of spinning systems by mapping them to the same twistor, thus predicting an infinite set of duality relations among…

We study Brown's definition of the probabilistic zeta function of a finite lattice as a generalization of that of a finite group. We propose a natural alternative or extension that may be better suited for non-atomistic lattices. The…

This is a review (including some background material) of the author's work and related activity on certain exactly solvable statistical models in two dimensions, including the six-vertex model, loop models and lozenge tilings. Applications…

Lattices induced by coverings arise naturally in matroid theory and combinatorial optimization, providing a structured framework for analyzing relationships between independent sets and closures. In this paper, we explore the structural…

The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…

In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…

We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…

Let $A$ be an expanding matrix on ${\Bbb R}^s$ with integral entries. A fundamental question in the fractal tiling theory is to understand the structure of the digit set ${\mathcal D}\subset{\Bbb Z}^s$ so that the integral self-affine set…