相关论文: Determinant Formulae for some Tiling Problems and …
We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resultants of the implicit equation of a system of $n$ linear…
We describe a computer algorithm that searches for substitution rules on a set of triangles, the angles of which are all integer multiples of {\pi}/n. We find new substitution rules admitting 7-fold rotational symmetry at many different…
As a continuation to our previous work [9, 10], we consider the domino tiling problem with impurities. (1) if we have more than two impurities on the boundary, we can compute the number of corresponding perfect matchings by using the…
In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…
This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, the…
We study the distribution of singular and unimodular matrices in sumsets in matrix rings over finite fields. We apply these results to estimate the largest prime divisor of the determinants in sumsets in matrix rings over the integers.
We consider two number-theoretic problems arising from Fuglede's spectral set conjecture: characterizing finite sets that tile integers, and finding polynomials with (0,1) coefficients whose roots have a certain multiplicative structure. We…
We give a formula that expresses the Hilbert series of one-sided ladder determinantal rings, up to a trivial factor, in form of a determinant. This allows the convenient computation of these Hilbert series. The formula follows from a…
In this paper a closed form expression for the number of tilings of an $n\times n$ square border with $1\times 1$ and $2\times1$ cuisenaire rods is proved using a transition matrix approach. This problem is then generalised to $m\times n$…
Two results about equidistribution of tile orientations in primitive substitution tilings are stated, one for finitely many, one for infinitely many orientations. Furthermore, consequences for the associated diffraction spectra and the…
We prove linearly repetitive Delone systems have finitely many Delone system factors up to conjugacy. This result is also applicable to linearly repetitive tiling systems.
We study enumerations of Dyck and ballot tilings, which are tilings of a region determined by two Dyck or ballot paths. We give bijective proofs to two formulae of enumerations of Dyck tilings through Hermite histories. We show that one of…
We present the stellar resolution, a "flexible" tile system based on Robinson's first-order resolution. After establishing formal definitions and basic properties of the stellar resolution, we show its Turing-completeness and to illustrate…
Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets. We prove however that the…
Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
I give a survey of different combinatorial forms of alternating-sign matrices, starting with the original form introduced by Mills, Robbins and Rumsey as well as corner-sum matrices, height-function matrices, three-colorings, monotone…
In this paper, we present a new formula for the determinant of a $4 \times 4$ matrix. We approach via the sparse optimization problem and derive the formula through the Least Absolute Shrinkage and Selection Operator (LASSO). Our formula…
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…