相关论文: On Cobweb posets tiling problem

We present a geometrical description of new canonical $d$-dimensional codimension one quasiperiodic tilings based on generalized Fibonacci sequences. These tilings are made up of rhombi in 2d and rhombohedra in 3d as the usual Penrose and…

We study a class of normal affine surfaces with additive group actions which contains in particular the Danielewski surfaces in $\ba^{3}$ given by the equations $x^{n}z=P(y)$, where $P$ is a nonconstant polynomial with simple roots. We call…

We give a precise description of combed trees in terms of Kelly-Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly-Mac Lane graph of a certain shape. Conversely, we show that any such Kelly-Mac Lane…

A graph is said to be a Konig graph if the size of its maximum matching is equal to the size of its minimum vertex cover. The Konig Edge Deletion problem asks if in a given graph there exists a set of at most k edges whose deletion results…

The reductions of conformal field theories which lead to generalized abelian cosets are studied. Primary fields and correlation functions of arbitrary abelian coset conformal field theory are explicitly expressed in terms of those of the…

We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some…

We prove an absolute Chow-Kuenneth decomposition for the motive of universal families A of abelian varieties over some compact Shimura surface. We furthermore prove the Hodge conjecture for general fibres of A, extending results of Ribet.

We show that the following problem is undecidable: given two polygonal prototiles, determine whether the plane can be tiled with rotated and translated copies of them. This improves a result of Demaine and Langerman [SoCG 2025], who showed…

This article, written for undergraduate mathematics students, provides an accessible introduction to a few key problems in tiling theory: Heesch's problem, the isohedral number problem, and the existence of an aperiodic monotile. I…

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…

We study alternating strand diagrams on the disk with an orbifold point. These are quotients by rotation of Postnikov diagrams on the disk, and we call them orbifold diagrams. We associate a quiver with potential to each orbifold diagram,…

Given a graph $G$ and collection of subgraphs $T$ (called tiles), we consider covering $G$ with copies of tiles in $T$ so that each vertex $v\in G$ is covered with a predetermined multiplicity. The multinomial tiling model is a natural…

The concept of a tolerance relation, shortly called tolerance, was studied on various algebras since the seventieth of the twentieth century by B. Zelinka and the first author. Since tolerances need not be transitive, their blocks may…

We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains the standard example of dimension $k$ as a subposet. This applies in particular to posets whose cover graphs have bounded treewidth, as the…

For $p,q\ge2$ the $\{p,q\}$-tiling graph is the (finite or infinite) planar graph $T_{p,q}$ where all faces are cycles of length $p$ and all vertices have degree $q$. We give algorithms for the problem of recognizing (induced) subgraphs of…

This paper gives new solutions to the problem: 'Can we construct monohedral tilings of the disk such that a neighbourhood of the origin has trivial intersection with at least one tile?'

This paper (written in Russian) presents a survey of new and earlier results on fine zonotopal tilings (briefly, cubillages) of cyclic zonotopes. The combinatorial theory of these objects is of interest in its own right and also has a…

We show that posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension. This result was already proven by Walczak. However, our argument is entirely combinatorial and does not rely on…

We give a counterexample to a conjecture made by Cigler, Jerman and Wojciechowski stating that all posets are conclusive. We also provide combinatorial characterizations for conclusiveness of finite posets and the existence of outer…