Related papers: Functions tiling with several lattices
We introduce and study the number of tilings of unit height rectangles with irrational tiles. We prove that the class of sequences of these numbers coincides with the class of diagonals of N-rational generating functions and a class of…
We introduce a new general framework for constructing tilings of Euclidean space, which we call multiscale substitution tilings. These tilings are generated by substitution schemes on a finite set of prototiles, in which multiple distinct…
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…
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…
Coven and Meyerowitz formulated two conditions which have since been conjectured to characterize all finite sets that tile the integers by translation. By periodicity, this conjecture is reduced to sets which tile a finite cyclic group…
We study Appell functions associated to an arbitrary positive definite lattice $\Lambda$ and a choice of $M\leq {\rm dim}(\Lambda)$ linearly independent vectors $d_r\in \Lambda$, $r=1,\dots,M$. These functions are instances of…
We prove discrete-to-continuum convergence of interaction energies defined on lattices in the Euclidean space (with interactions beyond nearest neighbours) to a crystalline perimeter, and we discuss the possible Wulff shapes obtainable in…
We consider the space of convex functions defined in the Euclidean $n$-dimensional space, which are lower semi-continuous and tend to infinity at infinity. We study real-valued valuations defined on this space of functions, which are…
We determine when an arithmetic subgroup of a reductive group defined over a global function field is of type FP_\infty by comparing its large-scale geometry to the large-scale geometry of lattices in real semisimple Lie groups.
The $k$-tiling problem for a convex polytope $P$ is the problem of covering $\mathbb R^d$ with translates of $P$ using a discrete multiset $\Lambda$ of translation vectors, such that every point in $\mathbb R^d$ is covered exactly $k$…
The periodic tiling conjecture (PTC) asserts, for a finitely generated Abelian group $G$ and a finite subset $F$ of $G$, that if there is a set $A$ that solves the tiling equation $\mathbb{1}_F * \mathbb{1}_A = 1$, there is also a periodic…
We study a nonlinear elliptic problem defined in a bounded domain involving fractional powers of the Laplacian operator together with a concave-convex term. We characterize completely the range of parameters for which solutions of the…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
We consider substitution tilings in R^d that give rise to point sets that are not bounded displacement (BD) equivalent to a lattice and study the cardinality of BD(X), the set of distinct BD class representatives in the corresponding tiling…
Some boundedness properties of function spaces (considered as topological groups) are studied.
This expository essay discusses a finite dimensional approach to dilation theory. How much of dilation theory can be worked out within the realm of linear algebra? It turns out that some interesting and simple results can be obtained. These…
Here we briefly discuss lattices in Euclidean spaces and spaces of lattices, which are basic objects that can be described in terms of matrices and are important settings in classical analysis.
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…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
In this paper, we investigate the application of radial basis functions (RBFs) for the approximation with collocation of the Stokes problem. The approximate solution is constructed in a multi-level fashion, each level using compactly…