English
Related papers

Related papers: Proof of Blum's conjecture on hexagonal dungeons

200 papers

The middle levels conjecture asserts that there is a Hamiltonian cycle in the middle two levels of $2k+1$-dimensional hypercube. The conjecture is known to be true for $k \leq 17$ [I.Shields, B.J.Shields and C.D.Savage, Disc. Math., 309,…

Discrete Mathematics · Computer Science 2011-09-30 Manabu Shimada , Kazuyuki Amano

In this paper we enumerate the centrally symmetric lozenge tilings of a hexagon with a fern removed from its center. The proof is based on a variant of Kuo's graphical condensation method. An unexpected connection with the total number of…

Combinatorics · Mathematics 2019-06-10 Mihai Ciucu

In their paper about a dual of MacMahon's classical theorem on plane partitions, Ciucu and Krattenthaler proved a closed form product formula for the tiling number of a hexagon with a "shamrock", a union of four adjacent triangles, removed…

Combinatorics · Mathematics 2018-08-02 Tri Lai , Ranjan Rohatgi

For X a compact Riemann surface of positive genus, the strange duality conjecture predicts that the space of sections of certain theta bundle on moduli of bundles of rank r and level k is naturally dual to a similar space of sections of…

Algebraic Geometry · Mathematics 2007-05-23 Prakash Belkale

We prove that in every $2$-edge-colouring of $K_n$ there is a collection of $n^2/12 + o(n^2)$ edge-disjoint monochromatic triangles, thus confirming a conjecture of Erd\H{o}s. We also prove a corresponding stability result, showing that…

Combinatorics · Mathematics 2020-08-17 Vytautas Gruslys , Shoham Letzter

We prove that every simply connected orthogonal polygon of $n$ vertices can be partitioned into $\left\lfloor\frac{3 n +4}{16}\right\rfloor$ (simply connected) orthogonal polygons of at most 8 vertices. It yields a new and shorter proof of…

Combinatorics · Mathematics 2017-06-27 Ervin Győri , Tamás Róbert Mezei

We consider the number of domino tilings of an odd-by-odd rectangle that leave one hole. This problem is equivalent to the number of near-perfect matchings of the odd-by-odd rectangular grid. For any particular position of the vacancy on…

Combinatorics · Mathematics 2025-06-05 Seok Hyun Byun , Wayne Goddard

We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In several cases these determinants can be evaluated in closed form. In particular, we obtain solutions to problems 1, 2, and 10 in James Propp's…

Combinatorics · Mathematics 2007-05-23 Harald Helfgott , Ira M. Gessel

Simion had a unimodality conjecture concerning the number of lattice paths in a rectangular grid with the Ferrers diagram of a partition removed. Hildebrand recently showed the stronger result that these numbers are log concave. Here we…

Combinatorics · Mathematics 2008-09-10 Yi Wang

We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, \cite{S-W}.…

Dynamical Systems · Mathematics 2012-12-07 Artur Siemaszko , Maciej P. Wojtkowski

It has been common knowledge since 1950 that seven colours can be assigned to tiles of an infinite honeycomb with cells of unit diameter such that no two tiles of the same colour are closer than $d(7)=\frac{\sqrt{7}}{2}$ apart. Various…

Combinatorics · Mathematics 2022-06-28 Aubrey D. N. J. de Grey , Jaan Parts

We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…

Metric Geometry · Mathematics 2017-11-27 Christian Richter , Melchior Wirth

A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…

Combinatorics · Mathematics 2014-05-13 Min Yan

Given a brane tiling, that is, a bipartite graph on a torus, we can associate with it a singular 3-Calabi-Yau variety. Using the brane tiling, we can also construct all crepant resolutions of the above variety. We give an explicit toric…

Algebraic Geometry · Mathematics 2009-09-11 Martin Bender , Sergey Mozgovoy

The author gave a proof of a generalization of the Aztec diamond theorem for a family of $4$-vertex regions on the square lattice with southwest-to-northeast diagonals drawn in (Electron. J. Combin., 2014) by using a bijection between…

Combinatorics · Mathematics 2015-11-02 Tri Lai

We compute the number of rhombus tilings of a hexagon with sides $N,M,N,N,M,N$, which contain a fixed rhombus on the symmetry axis that cuts through the sides of length $M$.

Combinatorics · Mathematics 2007-05-23 Markus Fulmek , Christian Krattenthaler

An irregular vertex in a tiling by polygons is a vertex of one tile and belongs to the interior of an edge of another tile. In this paper we show that for any integer $k\geq 3$, there exists a normal tiling of the Euclidean plane by convex…

Metric Geometry · Mathematics 2019-12-02 Dirk Frettlöh , Alexey Glazyrin , Zsolt Lángi

We continue the work of a previous paper \cite{LJL} to derive the dispersion relations of the periodic quantum graphs associated with the remaining 5 of the 11 Archimedean tilings, namely the truncated hexagonal tiling $(3,12^2)$,…

Spectral Theory · Mathematics 2019-07-30 Yu-Chen Luo , Eduardo O. Jatulan , Chun-Kong Law

We study the puzzle graphs of hexagonal sliding puzzles of various shapes and with various numbers of holes. The puzzle graph is a combinatorial model which captures the solvability and the complexity of sequential mechanical puzzles.…

Combinatorics · Mathematics 2022-01-05 Ray Karpman , Erika Roldan

We compute the number of rhombus tilings of a hexagon with sides n, n, N, n, n, N, where two triangles on the symmetry axis touching in one vertex are removed. The case of the common vertex being the center of the hexagon solves a problem…

Combinatorics · Mathematics 2007-05-23 Theresia Eisenkölbl