Related papers: Convex domino towers

Can one build an arbitrary polytope from any polytope inside by iteratively stacking pyramids onto facets, without losing the convexity throughout the process? We prove that this is indeed possible for (i) 3-polytopes, (ii) 4-polytopes…

In this thesis, we consider domino tilings of three-dimensional regions, especially those of the form $\mathcal{D} \times [0,N]$. In particular, we investigate the connected components of the space of tilings of such regions by flips, the…

One of the most fundamental problems in tiling theory is the domino problem: given a set of tiles and tiling rules, decide if there exists a way to tile the plane using copies of tiles and following their rules. The problem is known to be…

Deep learning can be used to extract meaningful results from images. In this paper, we used convolutional neural networks combined with recurrent neural networks on images of plasmonic structures and extract absorption data form them. To…

We present PolyBuilding, a fully end-to-end polygon Transformer for building extraction. PolyBuilding direct predicts vector representation of buildings from remote sensing images. It builds upon an encoder-decoder transformer architecture…

We give a complete description of all convex polyhedra whose surface can be constructed from several congruent regular pentagons by folding and gluing them edge to edge. Our method of determining the graph structure of the polyhedra from a…

Rectangular standard Young tableaux with 2 or 3 rows are in bijection with $U_q(\mathfrak{sl}_2)$-webs and $U_q(\mathfrak{sl}_3)$-webs respectively. When $W$ is a web with a reflection symmetry, the corresponding tableau $T_W$ has a…

Tomography is the area of reconstructing objects from projections. Here we wish to reconstruct a set of cells in a two dimensional grid, given the number of cells in every row and column. The set is required to be an hv-convex polyomino,…

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

We study inverse problems of reconstructing static and dynamic discrete structures from tomographic data (with a special focus on the `classical' task of reconstructing finite point sets in $\mathbb{R}^d$). The main emphasis is on recent…

We define a convolution operation on the set of polyominoes and use it to obtain a criterion for a given polyomino not to tile the plane (rotations and translations allowed). We apply the criterion to several families of polyominoes, and…

In this paper we investigate examples of good and optimal Drinfeld modular towers of function fields. Surprisingly, the optimality of these towers has not been investigated in full detail in the literature. We also give an algorithmic…

We use canonical Markov extensions (Hofbauer towers) to give an explicit construction of the natural extensions of various measure preserving endomorphisms, and present some applications to particular examples.

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…

We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases.

We study random domino tilings of a multiply-connected domain with a height function defined on the universal covering space of the domain. We prove a large deviation principle for the height function in two asymptotic regimes. The first…

This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections…

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…

Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decomposition using a…

We give an effective characterisation of the walls in the variation of geometric invariant theory problem associated to a quiver and a dimension vector.