English
Related papers

Related papers: Binomial Determinants for Tiling Problems Yield to…

200 papers

We prove combinatorially that the parity of the number of domino tilings of a region is equal to the parity of the number of domino tilings of a particular subregion. Using this result we can resolve the holey square conjecture. We…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

This paper introduces two tiles whose tilings form a one-parameter family of tilings which can all be seen as digitization of two-dimensional planes in the four-dimensional Euclidean space. This family contains the Ammann-Beenker tilings as…

Combinatorics · Mathematics 2012-08-20 Nicolas Bédaride , Thomas Fernique

In this paper, we suggest a construction of determinant lines of finitely generated Hilbertian modules over finite von Neumann algebras. Nonzero elements of the determinant lines can be viewed as volume forms on the Hilbertian modules.…

dg-ga · Mathematics 2013-09-02 A. Carey , M. Farber , V. Mathai

In the convergence analysis of numerical methods for solving partial differential equations (such as finite element methods) one arrives at certain generalized eigenvalue problems, whose maximal eigenvalues need to be estimated as…

Symbolic Computation · Computer Science 2016-06-21 Christoph Koutschan , Martin Neumüller , Cristian-Silviu Radu

We give an explicit recipe for determining iterated local cohomology groups with support in ideals of minors of a generic matrix in characteristic zero, expressing them as direct sums of indecomposable D-modules. For non-square matrices…

Commutative Algebra · Mathematics 2018-05-24 András C. Lőrincz , Claudiu Raicu

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$…

Combinatorics · Mathematics 2016-11-01 M. Connolly

Let $K \subset {\mathbb R}^n$ be a compact definable set in an o-minimal structure over $\mathbb R$, e.g., a semi-algebraic or a subanalytic set. A definable family $\{ S_\delta|\> 0< \delta \in {\mathbb R} \}$ of compact subsets of $K$, is…

Algebraic Geometry · Mathematics 2017-05-17 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

Ehrenborg noted that all tilings of a bipartite planar graph are encoded by its cubical matching complex and claimed that this complex is collapsible. We point out to an oversight in his proof and explain why these complexes can be the…

Combinatorics · Mathematics 2019-04-09 Duško Jojić

It is well-known that plane partitions, lozenge tilings of a hexagon, perfect matchings on a honeycomb graph, and families of non-intersecting lattice paths in a hexagon are all in bijection. In this work we consider regions that are more…

Combinatorics · Mathematics 2015-07-10 David Cook , Uwe Nagel

We review the connections between the octahedral recurrence, $\lambda$-determinants and tiling problems. This provides in particular a direct combinatorial interpretation of the $\lambda$-determinant (and generalizations thereof) of an…

Mathematical Physics · Physics 2023-12-21 Jean-François de Kemmeter , Nicolas Robert , Philippe Ruelle

We give an introduction to some of the recent ideas that go under the name "geometric complexity theory". We first sketch the proof of the known upper and lower bounds for the determinantal complexity of the permanent. We then introduce the…

Computational Complexity · Computer Science 2016-05-10 Peter Bürgisser

In this paper we present a new version of the second author's factorization theorem for perfect matchings of symmetric graphs. We then use our result to solve four open problems of Propp on the enumeration of trimer tilings on the hexagonal…

Combinatorics · Mathematics 2025-09-04 Seok Hyun Byun , Mihai Ciucu , Yi-Lin Lee

We study decision problems on geometric tilings. First, we study a variant of the Domino problem where square tiles are replaced by geometric tiles of arbitrary shape. We show that this variant is undecidable regardless of the shapes,…

Discrete Mathematics · Computer Science 2025-11-13 Benjamin Hellouin de Menibus , Victor Lutfalla , Pascal Vanier

The paper develops elementary linear algebra methods to compute the determinants of the tensor symmetrizations of quadratic and hermitian forms over fields of good characteristic. Explicit results are given for the partitions $(n)$,…

Combinatorics · Mathematics 2024-09-26 Gabriele Nebe

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

While there has been some progress on the decomposition of Kronecker products of characters of the symmetric groups in recent times, results on the symmetric and alternating part of Kronecker squares are still scarce. Here, new results (and…

Combinatorics · Mathematics 2023-01-20 Christine Bessenrodt , Chris Bowman

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

Classical Analysis and ODEs · Mathematics 2008-11-26 Satoru Odake , Ryu Sasaki

Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). In previous…

Representation Theory · Mathematics 2014-12-05 Laurent Manivel

Generalizing a result of \cite{Z1991, CPZ} about elliptic modular forms, we give a closed formula for the sum of all Hilbert Hecke eigenforms over a totally real number field with strict class number $1$, multiplied by their period…

Number Theory · Mathematics 2021-01-19 YoungJu Choie

We consider a particular type of matrices which belong at the same time to the class of Hessenberg and Toeplitz matrices, and whose determinants are equal to the number of a type of compositions of natural numbers. We prove a formula in…

Combinatorics · Mathematics 2010-07-06 Milan Janjic