Related papers: Rectangle Coincidences and Sweepouts
We prove that for every smooth Jordan curve $\gamma$, if $X$ is the set of all $r \in [0,1]$ so that there is an inscribed rectangle in $\gamma$ of aspect ratio $\tan(r\cdot \pi/4)$, then the Lebesgue measure of $X$ is at least $1/3$. To do…
Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of…
This short note is some obvious mathematical addendum to our papers on Wilson loops on polygon-like contours with circular edges \cite{Dorn:2020meb,Dorn:2020vzj}. Using the technique of osculating spheres and circles we identify the…
Improving upon previous work on the subject, we use Wright's Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer that are in any given arithmetic progression.
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…
A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…
For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…
We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a…
The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…
A famous result of D. Walkup is that an $m\times n$ rectangle may be tiled by T-tetrominos if and only if both $m$ and $n$ are multiples of 4. The "if" portion may be proved by tiling a $4\times 4$ block, and then copying that block to fill…
For a class of oscillatory resonant problems, involving Dirichlet problems for semilinear PDE's on balls and rectangles in $R^n$, we show the existence of infinitely many solutions, and study the global solution set. The first harmonic of…
In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…
In this paper we consider faultfree tromino tilings of rectangles and characterize rectangles that admit such tilings. We introduce the notion of {\it crossing numbers} for tilings and derive bounds on the crossing numbers of faultfree…
In the first section of this paper we prove a theorem for the number of columns of a rectangular area that are identical to the given one. In the next section we apply this theorem to derive several combinatorial identities by counting…
In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…
Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…