Related papers: Hitting Matrix and Domino Tiling with Diagonal Imp…
Overlap coincidence in a self-affine tiling in $\R^d$ is equivalent to pure point dynamical spectrum of the tiling dynamical system. We interpret the overlap coincidence in the setting of substitution Delone set in $\R^d$ and find an…
We present determinant formulae for the number of tilings of various domains in relation with Alternating Sign Matrix and Fully Packed Loop enumeration.
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…
In this note, we give a closed formula for the partition function of the dimer model living on a (2 x n) strip of squares or hexagons on the torus for arbitrary even n. The result is derived in two ways, by using a Potts model like…
A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For…
Our goal is to prove new results in graph theory and combinatorics thanks to the speed of computers, used with smart algorithms. We tackle four problems. The four-colour theorem states that any map whose countries are connected can be…
We consider the problem of inferring the topology of a network using the measurements available at the end nodes, without cooperation from the internal nodes. To this end, we provide a simple method to obtain path interference which…
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or…
We study a crack lying along an imperfect interface in an anisotropic bimaterial. A method is devised where known weight functions for the perfect interface problem are used to obtain singular integral equations relating the tractions and…
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a…
We develop a systematic method for computing the angle combinations at all vertices in an edge-to-edge tiling of the sphere by pentagons with the same five angles. The method is a useful and necessary step in many tiling problems about…
We consider a magnetic impurity in the antiferromagnetic spin-1/2 chain which is equivalent to the two-channel Kondo problem in terms of the field theoretical description. Using a modification of the transfer-matrix density matrix…
In this paper we give a novel solution to a classical completion problem for square matrices. This problem was studied by many authors through time, and it is completely solved in [2, 3]. In this paper we relate this classical problem to a…
A tiling is a decomposition of a polygon into finitely many non-overlapping triangles. We prove that if a regular n-gon, $n \geq 5$, $n \neq 28$, can be tiled with similar right triangles, then one of the angles of these triangles is in…
In this paper, we complete the construction of paper arXiv:cs.CG/0701096v2. Together with the proof contained in arXiv:cs.CG/0701096v2, this paper definitely proves that the general problem of tiling the hyperbolic plane with {\it \`a la}…
The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix C_{nm} of simple digraph and an incidence matrix F of balanced bipartite…
We study systems of multiple interacting quantum impurities deposited on a metallic surface in a 3D host. For the real-space two-impurity problem, using numerical renormalization group calculations, a rich range of behavior is shown to…
We study edge-to-edge tilings of the sphere by edge congruent pentagons, under the assumption that there are tiles with all vertices having degree 3. We develop the technique of neighborhood tilings and apply the technique to completely…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
A perfect $K_r$-tiling in a graph $G$ is a collection of vertex-disjoint copies of the graph $K_r$ in $G$ that covers all vertices of $G$. In this paper, we prove that the threshold for the existence of a perfect $K_{r}$-tiling of a…