相关论文: Word-representability of triangulations of rectang…

A graph $G = (V,E)$ is word-representable if there is a word $w$ over the alphabet $V$ such that $x$ and $y$ alternate in $w$ if and only if the edge $(x, y)$ is in $G$. It is known [6] that all $3$-colourable graphs are word-representable,…

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)$ is an edge in $E$. Some graphs are word-representable, others are not. It is…

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$, $x\neq y$, alternate in $w$ if and only if $(x,y)\in E$. Halld\'{o}rsson et al.\ have shown that a graph is…

A graph $G=(V,E)$ is said to be word-representable if there exists a word $w$ over the alphabet $V$ such that two distinct letters $x,y\in V$ alternate in $w$ if and only if $xy \in E$. Word-representable graphs form a well-studied graph…

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)\in E$. A triangular grid graph is a subgraph of a tiling of the plane with…

We prove that the following problem is co-RE-complete and thus undecidable: given three simple polygons, is there a tiling of the plane where every tile is an isometry of one of the three polygons (either allowing or forbidding…

This paper proves the following statement: If a convex body can form a three or fourfold translative tiling in the three-dimensional space, it must be a parallelohedron. In other words, it must be a parallelotope, a hexagonal prism, a…

The number of domino tilings of a region with reflective symmetry across a line is combinatorially shown to depend on the number of domino tilings of particular subregions, modulo 4. This expands upon previous congruency results for domino…

Given a periodic placement of copies of a tromino (either L or I), we prove co-RE-completeness (and hence undecidability) of deciding whether it can be completed to a plane tiling. By contrast, the problem becomes decidable if the initial…

We introduce the concept of a triangular representation of a Lie algebra, give a counterpart of Ado's theorem, and discuss $2$-irreducible triangular modules over a nonreductive Lie algebra.

We extend Heawood's theorem on the colourability of plane triangulations to triangulations of 3-space. We prove that a triangulation of 3-space can be edge coloured with three colours if and only if all edges have even degree.

We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…

Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…

We consider tilings of quadriculated regions by dominoes and of triangulated regions by lozenges. We present an overview of results concerning tileability, enumeration and the structure of the space of tilings.

This paper proves the following statement: If a convex body can form a fivefold translative tiling in $\mathbb{E}^3$, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron, an elongated dodecahedron, a truncated octahedron,…

This paper proves the following statement: {\it If a convex body can form a twofold translative tiling in $\mathbb{E}^3$, it must be a parallelohedron.} In other words, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron,…

Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three…

It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…

The first undecidability result on the tiling is the undecidability of translational tiling of the plane with Wang tiles, where there is an additional color matching requirement. Later, researchers obtained several undecidability results on…

In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…