Related papers: Rectangle Coincidences and Sweepouts
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…
A parallelogram is conformally inscribed in four lines in the plane if it is inscribed in a scaled copy of the configuration of four lines. We describe the geometry of the three-dimensional Euclidean space whose points are the…
We study rectangles inscribed in lines in the plane by parametrizing these rectangles in two ways, one involving slope and the other aspect ratio. This produces two paths, one that finds rectangles with specified slope and the other…
We develop a circle of ideas involving pairs of lines in the plane, intersections of hyperbolically rotated elliptical cones and the locus of the centers of rectangles inscribed in lines in the plane.
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…
A recent preprint (arXiv:1402.2632) introduced a growth procedure for planar maps, whose almost sure limit is "the uniform infinite 3-connected planar map". A classical construction of Brooks, Smith, Stone and Tutte (1940) associates a…
We prove that a pair of continuous disjoint periodic curves in $\mathbb{C}$ inscribes an isosceles trapezoid with any similarity type. The case of smooth curves can be identified with a Lagrangian intersection problem for a pair of…
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…
We characterize asymptotic collective behaviour of rectangular random matrices, the sizes of which tend to infinity at different rates: when embedded in a space of larger square matrices, independent rectangular random matrices are…
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…
In this paper, we extend the rectangular side of the shuffle conjecture by stating a rectangular analogue of the square paths conjecture. In addition, we describe a set of combinatorial objects and one statistic that are a first step…
A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs,…
Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces and a certain class of symmetric chord diagrams. This…
A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…
We investigate paths in the hexagonal circle packing and enumerate them with respect to width, height, number of steps, area, and kissing number. Functional equations and the kernel method yield closed bivariate generating functions…
This article has been written for an educational magazine whose target audience consists of students and teachers of mathematics in universities, colleges and schools. It concerns a notion of duality between rectangles. A proof is given…
We apply the circle method to obtain an asymptotic formula for the number of integral points on a certain sliced cubic hypersurface related to the Segre cubic. Unusually, the major and minor arc integrals in this application are both…