Zobrazeno 1 - 10
of 204
pro vyhledávání: '"Trihexagonal tiling"'
Autor:
Mohammadreza Saadat, Benedek Nagy
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030766566
DGMM
DGMM
There are various tessellations of the plane. There are three regular ones, each of them using a sole regular tile. The square grid is self-dual, and the two others, the hexagonal and triangular grids are duals of each other. There are eight semi-reg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b1723366a07d6e12b5eca3403ba3c45
https://doi.org/10.1007/978-3-030-76657-3_20
https://doi.org/10.1007/978-3-030-76657-3_20
Publikováno v:
IEEE Electron Device Letters. 40:1973-1975
Kagome lattice materials are layered two-dimensional (2D) materials in which atoms are arranged in a trihexagonal tiling lattice pattern. It has been suggested that the Kagome lattice can possess topologically non-trivial band structures. By performi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72c5966ab84ab7b4a391b3bd37acc582
https://doi.org/10.1109/led.2019.2947285
https://doi.org/10.1109/led.2019.2947285
There are totally 11 kinds of Archimedean tiling for the plane. Applying the Floquet-Bloch theory, we derive the dispersion relations of the periodic quantum graphs associated with a number of Archimedean tiling, namely the triangular tiling {$(3^6)$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b345c2cf6c93357f32788b16a6f37e30
Autor:
Tero Harju, Vesa Halava
Publikováno v:
Theoretical Computer Science. 701:120-124
In 1966 J.R. Isbell proved his algebraic Zig-Zag Theorem using a simple property of paths in a tiling of a plane rectangle. We prove here Isbell's lemma for more general tilings of plane rectangles.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffe9596f04d60d13c3afb3983ad4ce68
https://doi.org/10.1016/j.tcs.2017.02.034
https://doi.org/10.1016/j.tcs.2017.02.034
Publikováno v:
Discrete Mathematics. 340:1669-1680
A tiling of the plane by polygons is unilateral if each edge of the tiling is a side of at most one polygon of the tiling. A tiling is equitransitive if for any two congruent tiles in the tiling, there exists a symmetry of the tiling mapping one to t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8fa2081abc69b0938818406f18ee6ec
https://doi.org/10.1016/j.disc.2016.10.022
https://doi.org/10.1016/j.disc.2016.10.022
Publikováno v:
Discrete and Computational Geometry. 58(3):686-704
We study the computational hardness of the tiling puzzle with polyominoes, where a polyomino is a right-angled polygon (i.e., a polygon made by connecting unit squares along their edges). In the tiling problem, we are given a right-angled polygon P a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26ba9c1f458879d6af4451aab890fe1d
http://hdl.handle.net/10119/15100
http://hdl.handle.net/10119/15100
Autor:
Michael F. Whittaker, Michael Mampusti
Publikováno v:
Journal of Geometry and Physics. 112:224-239
We introduce a new class of noncommutative spectral triples on Kellendonk’s C ∗ -algebra associated with a nonperiodic substitution tiling. These spectral triples are constructed from fractal trees on tilings, which define a geodesic distance bet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c077527ff3b86d3ae9a73d47d08d053d
https://doi.org/10.1016/j.geomphys.2016.11.010
https://doi.org/10.1016/j.geomphys.2016.11.010
Publikováno v:
Journal of Geometry. 108:703-717
The complete cartwheel tiling is a well known Penrose tiling without exact pentagonal symmetry, but with an approximate decagonal symmetry far away from the center. We show in this paper that this tiling is not obtained by the “cut and project” m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4900a7b1279365241a764769dabdf69
https://doi.org/10.1007/s00022-016-0368-5
https://doi.org/10.1007/s00022-016-0368-5
Autor:
Tao Wang, Longxiu Huang
Publikováno v:
SIAM Journal on Discrete Mathematics. 31:240-253
The paper is devoted to the normal tiling whose tiles are uniformly bounded and general connected closed sets instead of being restricted to polytopes or convex sets. We estimate the number of neighbors of a tile in the normal tiling and develop vari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e87eb9ce4189e36f715d8b8d457806ff
https://doi.org/10.1137/15m104712x
https://doi.org/10.1137/15m104712x
Autor:
Viorel Nitica, Premalatha Junius
Publikováno v:
Open Journal of Discrete Mathematics. :87-102
We show that the least number of cells (the gap number) one needs to take out from a rectangle with integer sides of length at least 2 in order to be tiled by ribbon right trominoes is less than or equal to 4. If the sides of the rectangle are of len
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9c4127cf72c2691d3e75fe4e5c0794a
https://doi.org/10.4236/ojdm.2017.72010
https://doi.org/10.4236/ojdm.2017.72010