Related papers: Dyck tilings of type $D$
We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…
We construct a family of n+1 dyadic filtrations in R^n, so that every Euclidean ball B is contained in some cube Q of our family satisfying diam(Q) \le c_n diam(B) for some dimensional constant c_n. Our dyadic covering is optimal on the…
This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…
We use the self-similar tilings constructed by the second author in "Canonical self-affine tilings by iterated function systems" to define a generating function for the geometry of a self-similar set in Euclidean space. This tubular zeta…
We define a notion of tiling of the full infinite $p$-ary tree, establishing a series of equivalent criteria for a subtree to be a tile, each of a different nature; namely, geometric, algebraic, graph-theoretic, order-theoretic, and…
In this paper, we study the problem of partitioning a graph into connected and colored components called blocks. Using bivariate generating functions and combinatorial techniques, we determine the expected number of blocks when the vertices…
We consider a class of lattice paths with certain restrictions on their ascents and down steps and use them as building blocks to construct various families of Dyck paths. We let every building block $P_j$ take on $c_j$ colors and count all…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
Given a graph $G$ and collection of subgraphs $T$ (called tiles), we consider covering $G$ with copies of tiles in $T$ so that each vertex $v\in G$ is covered with a predetermined multiplicity. The multinomial tiling model is a natural…
We construct via usual graph theory a class of associative dialgebras as well as a class of coassociative L-coalgebras. Tiling of the (n^2,1)-De bruijn graphs are also obtained and constructions of cubical trialgebras, (notion defined by…
We introduce a statistic on overpartitions called the $\overline{k}$-rank. When there are no overlined parts, this coincides with the $k$-rank of a partition introduced by Garvan. Moreover, it reduces to the D-rank of an overpartition when…
In this paper we study substitutions and some of their associated generating functions. This association takes aperiodicity to transcendence, and vice-versa. These generating functions have a recursive structure arising from the…
We write down the generalized Bessel function associated with the root system of type $D$ by means of multivariate hypergeometric series. Our hint comes from the particular case of the Brownian motion in the Weyl chamber of type $D$.
A Dyck path is a lattice path in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of steps (1,1) and (1,-1), which never passes below the x-axis. A peak at height k on a Dyck path is a point on the path with coordinate y=k…
In this research, Minkowski type functions which are constructed on certain probability distributions, are introduced. There are investigated differential, integral, and other properties of these functions.
We study generating functions of certain shapes of planar polygons arising from homological mirror symmetry of elliptic curves. We express these generating functions in terms of rational functions of the Jacobi theta function and Zwegers'…
We investigate the connection between lozenge tilings and domino tilings by introducing a new family of regions obtained by attaching two different Aztec rectangles. We prove a simple product formula for the generating functions of the…
We present a new method to obtain the generating functions for directed convex polyominoes according to several different statistics including: width, height, size of last column/row and number of corners. This method can be used to study…
We give a specific cylinder functor for semifree dg categories. This allows us to construct a homotopy colimit functor explicitly. These two functors are "computable", specifically, the constructed cylinder functor sends a dg category of…
This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…