Related papers: An algorithm to generate exactly once every tiling…
Inspired by Propp's intruded Aztec diamond regions, we consider halved hexagons in which two aligned arrays of triangular holes have been removed from their boundaries. Unlike the intruded Aztec diamonds (whose numbers of domino tilings…
We propose a fast fourth-order cut cell method for solving constant-coefficient elliptic equations in two-dimensional irregular domains. In our methodology, the key to dealing with irregular domains is the poised lattice generation (PLG)…
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z^d}$ which tiles that lattice by translations, in fact tiles periodically. We announce here a disproof of this conjecture for sufficiently large $d$, which…
In this paper we show how to compute algorithmically the full set of algebraically independent constraints for singular mechanical and field-theoretical models with polynomial Lagrangians. If a model under consideration is not singular as a…
Let a polygon be composed of equal rectangles. We find all quadratic irrationals r for which the polygon can be tiled by similar rectangles with given side ratio r.
We prove a result about producing new frames for general spline-type spaces by piecing together portions of known frames. Using spline-type spaces as models for the range of certain integral transforms, we obtain results for time-frequency…
A recursive scheme relying on decagons is used to generate Penrose-like sublattices or tilings. Its relevance for understanding structures with non-crystallographic symmetry is discussed.
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
Cao & Yuan obtained a Blichfeldt-type result for the vertex set of the edge-to-edge tiling of the plane by regular hexagons. Observing that every Archimedean tiling is the union of translates of a fixed lattice, we take a more general…
We present and analyze a simple numerical method that diagonalizes a complex normal matrix A by diagonalizing the Hermitian matrix obtained from a random linear combination of the Hermitian and skew-Hermitian parts of A.
We consider a simply supported plate with constant thickness, defined on an unknown multiply connected domain. We optimize its shape according to some given performance functional. Our method is of fixed domain type, easy to be implemented,…
We count tilings of a rectangle of integer sides m-1 and n-1 by a special set of tiles. The result is obtained fron the study of the kernel of the adjacency matrix of an n x n rectangular graph of Z x Z.
We construct a class of lattices in three and higher dimensions for which the number of dimer coverings can be determined exactly using elementary arguments. These lattices are a generalization of the two-dimensional kagome lattice, and the…
Defant, Li, Propp, and Young recently resolved two enumerative conjectures of Propp concerning the tilings of regions in the hexagonal grid called benzels using two types of prototiles called stones and bones (with varying constraints on…
In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
Partitioning large matrices is an important problem in distributed linear algebra computing (used in ML among others). Briefly, our goal is to perform a sequence of matrix algebra operations in a distributed manner (whenever possible) on…
A domain decomposition method for the solution of general variable-coefficient elliptic partial differential equations on regular domains is introduced. The method is based on tessellating the domain into overlapping thin slabs or shells,…