Related papers: Grid dissections of tangential quadrilaterals
An internal partition of a graph is a partitioning of the vertex set into two parts such that for every vertex, at least half of its neighbors are on its side. We prove that for every positive integer $r$, asymptotically almost every…
In this paper, we present an effective method to characterize completely when a disconnected fractal square has only finitely many connected components. Our method is to establish some graph structures on fractal squares to reveal the…
We consider the subgroup of the abelian sandpile group of the grid graph consisting of configurations of sand that are symmetric with respect to central vertical and horizontal axes. We show that the size of this group is (i) the number of…
In the present paper, we will show that for any integer n>0 there are infinitely many twisted torus knots with n-string essential tangle decompositions.
Conway and Lagarias showed that certain roughly triangular regions in the hexagonal grid cannot be tiled by shapes Thurston later dubbed tribones. Here we study a two-parameter family of roughly hexagonal regions in the hexagonal grid and…
The divisibility of truncated binomial series by their exponent n is analyzed. Divisibility is shown to depends on the divisibility characteristics of the integers constituting the binomials. Series division by the highest possible powers…
If $n$ is even, the $n$-dimensional hypercube can be decomposed into edge-disjoint cycles of length $2^i$ for every value of $i$ from $2$ to $n$.
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…
The partial Stirling numbers T_n(k) used here are defined as the sum over odd values of i of (n choose i) i^k. Their 2-exponents nu(T_n(k)) are important in algebraic topology. We provide many specific results, applying to all values of n,…
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the graph. In our proofs, we present an embedding algorithm for…
A common problem in graph colouring seeks to decompose the edge set of a given graph into few similar and simple subgraphs, under certain divisibility conditions. In 1987 Wormald conjectured that the edges of every cubic graph on $4n$…
Two labeled point configurations $\{p_1,\ldots,p_n\}$ and $\{q_1,\ldots,q_n\}$ are of the same order type if, for every $i,j,k$, the triples $(p_i,p_j,p_k)$ and $(q_i,q_j,q_k)$ have the same orientation. In the 1980's, Goodman, Pollack and…
In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain normalizer chain is linked to the sequence of partitions of…
An (edge) decomposition of a graph $G$ is a set of subgraphs of $G$ whose edge sets partition the edge set of $G$. Here we show, for each odd $\ell \geq 5$, that any graph $G$ of sufficiently large order $n$ with minimum degree at least…
Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.
Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this atricle, we will investigate six types of partitions from the view of the point of separable integer partition classes.
The square of a graph $G$, denoted by $G^2$, is obtained from $G$ by putting an edge between two distinct vertices whenever their distance is two. Then $G$ is called a square root of $G^2$. Deciding whether a given graph has a square root…
We study the covering path problem on a grid of R^{2}. We generalize earlier results on a rectangular grid and prove that the covering path cost can be bounded by the area and perimeter of the grid. We provide (2+\epsilon) and…
In this paper, we introduce a novel non-linear uniform subdivision scheme for the generation of curves in $\mathbb{R}^n$, $n\geq2$. This scheme is distinguished by its capacity to reproduce second-degree polynomial data on non-uniform grids…
We classify multipartite entangled states in the 2 x 2 x n (n >= 4) quantum system, for example the 4-qubit system distributed over 3 parties, under local filtering operations. We show that there exist nine essentially different classes of…