The dissection of rectangles into squares
From MaRDI portal
Publication:2646809
DOI10.1215/S0012-7094-40-00718-9zbMath0024.16501OpenAlexW2043790108WikidataQ55880628 ScholiaQ55880628MaRDI QIDQ2646809
William T. Tutte, Cedric A. B. Smith
Publication date: 1940
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1215/s0012-7094-40-00718-9
Related Items (92)
Linear relations in dissections into \(n\)-dimensional parallelepipeds ⋮ Boundary value problems on planar graphs and flat surfaces with integer cone singularities, I: The Dirichlet problem ⋮ Determinantal probability measures ⋮ From rubber bands to rational maps: a research report ⋮ Random infinite squarings of rectangles ⋮ Simple algorithms for partial and simultaneous rectangular duals with given contact orientations ⋮ Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity ⋮ Knot polynomials and generalized mutation ⋮ Rectangular dissections of a square ⋮ Principal subpermanents of the Laplacian matrix ⋮ Alternative configurations for cutting machines in a tube cutting mill ⋮ A deletion-contraction relation for the DP color function ⋮ Decompositions of a polygon into centrally symmetric pieces ⋮ Dissections into 1:2 rectangles ⋮ Connectivity of finite anisotropic random graphs and directed graphs ⋮ On the impossibility of packing space with different cubes ⋮ Orthogonal trades in complete sets of MOLS ⋮ Multivariable Lagrange inversion, Gessel-Viennot cancellation, and the matrix tree theorem ⋮ Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes ⋮ On step-2 transforms for simple perfect squared squares ⋮ Decomposition of a Cube into Nearly Equal Smaller Cubes ⋮ Self-Similar Polygonal Tiling ⋮ An application of simulated annealing to the cutting stock problem ⋮ An enumeration of equilateral triangle dissections ⋮ Lowest Order Squared Rectangles and Squares With the Largest Element Not on the Boundary ⋮ Torus square tilings ⋮ On the expansion of combinatorial polytopes ⋮ A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs ⋮ Dimer model and holomorphic functions on t‐embeddings of planar graphs ⋮ The full cycles in a Young coset ⋮ Counting almost minimum cutsets with reliability applications ⋮ On the equivalence of cylinder tilings and planar electric networks ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ User recursive functions in Maxima ⋮ Tiling by incongruent equilateral triangles without requiring local finiteness ⋮ Generalizing Kirchhoff laws for Signed Graphs ⋮ Tiling by rectangles and alternating current ⋮ The triple intersection property, three dimensional extremal length, and tiling of a topological cube ⋮ In the Quest for Invariant Structures Through Graph Theory, Groups and Mechanics: Methodological Aspects in the History of Applied Mathematics ⋮ `Bureaucratic' set systems, and their role in phylogenetics ⋮ On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs ⋮ Dissections of 𝑝:𝑞 rectangles ⋮ On limits of graphs sphere packed in Euclidean space and applications ⋮ Oded Schramm: from circle packing to SLE ⋮ Spanning forests and the vector bundle Laplacian ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ The number of polyhedral (3-connected planar) graphs ⋮ Graph-polynomials ⋮ Homogeneous multivariate polynomials with the half-plane property ⋮ A survey on the cutting and packing problems ⋮ Binary functions, degeneracy, and alternating dimaps ⋮ A paradigm for robust geometric algorithms ⋮ Immanants of combinatorial matrices ⋮ Packing problems ⋮ Determinants and current flows in electric networks ⋮ Dissecting a brick into bars ⋮ Boundary value problems on planar graphs and flat surfaces with integer cone singularities. II: The mixed Dirichlet-Neumann problem ⋮ Dissections of trapezoids into trapezoids homothetical to trapezoids in a given family ⋮ Dimers, tilings and trees ⋮ Codichromatic graphs ⋮ Dissections of \(p\colon q\) rectangles into 13 \(p\colon q\) rectangular elements ⋮ The rotor effect can alter the chromatic polynomial ⋮ Resistance distance in wheels and fans ⋮ Unnamed Item ⋮ Negative correlation and log-concavity ⋮ Pentagon contact representations ⋮ Tilings of convex sets by mutually incongruent equilateral triangles contain arbitrarily small tiles ⋮ A combinatorial proof of the Rayleigh formula for graphs ⋮ Tilings of convex polygons by equilateral triangles of many different sizes ⋮ Invariant coupling of determinantal measures on sofic groups ⋮ On a 2-dimensional equipartition problem ⋮ Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems ⋮ Tilings ⋮ Tilings ⋮ From Tessellations to Table Interpretation ⋮ Transportation networks: Old and new ⋮ Discrete Complex Analysis on Planar Quad-Graphs ⋮ A typology of cutting and packing problems ⋮ On existence of compound perfect squared squares of small order ⋮ Resistance bounds for first-passage percolation and maximum flow ⋮ Metric graphs, cross ratios, and Rayleigh's laws ⋮ Electrical networks and hyperplane arrangements ⋮ A Proof of Tuite’s Trinity Theorem and a New Determinant Formula ⋮ On filling space with different integer cubes ⋮ Spanning trees on hypercubic lattices and nonorientable surfaces ⋮ On the dissection of rectangles into right-angled isosceles triangles ⋮ Network flows and non-guillotine cutting patterns ⋮ Discrete extremal length and cube tilings in finite dimensions ⋮ A survey of the asymptotic behaviour of maps ⋮ Square tilings with prescribed combinatorics ⋮ Characterizing tileorders ⋮ The dissection of rectangles, cylinders, tori, and Möbius bands into squares
This page was built for publication: The dissection of rectangles into squares
