Related papers: Rectangle Coincidences and Sweepouts
Given a collection of N rectangles such that the side ratio of each one is a quadratic irrationality, we find all rectangles which can be tiled by rectangles similar to one of the given ones. It means that each possible shape can be used…
Using methods of conformal field theory, we conjecture an exact form for the probability that n distinct clusters span a large rectangle or open cylinder of aspect ratio k, in the limit when k is large.
A sequence of rational points on an algebraic planar curve is said to form an $r$-geometric progression sequence if either the abscissae or the ordinates of these points form a geometric progression sequence with ratio $r$. In this work, we…
The correspondence between right triangles with rational sides, triplets of rational squares in arithmetic succession and integral solutions of certain quadratic forms is well known. We show how this correspondence can be extended to the…
In the projective plane over a finite field of characteristic not equal to 2, we compute the probability that a randomly selected pair of distinct conics $(\mathscr{A},\mathscr{B})$, with $\mathscr{A}$ smooth or singular and $\mathscr{B}$…
We use Ratner's theorem to compute the asymptotics of the number of (cylinders of) periodic trajectories in a rectangle with a barrier, assuming that the location p/q of the barrier is rational. We also show that as q tends to infinity, the…
We present a method of computing any one-loop integral in lattice perturbation theory by systematically expanding around its continuum limit. At any order in the expansion in the lattice spacing, the result can be written as a sum of…
If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…
The elementary resolution of singularities algorithm of the author's earlier paper (math.CA/0609217) is developed further, replacing the quasibump functions in the blown up coordinates with the characteristic function of a rectangle times a…
In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…
A symplectic rational cuspidal curve with positive self-intersection number admits a concave neighborhood, and thus a corresponding contact manifold on the boundary. In this article, we study symplectic fillings of such contact manifolds,…
We give a counting formula for the set of rectangular increasing tableaux in terms of generalized Narayana numbers. We define small $m$-Schr\"oder paths and give a bijection between the set of increasing rectangular tableaux and small…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
We apply set-valued numerical methods to compute an accurate enclosure of the rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points, which is used to check the rationality of the…
This study develops a ray technique for determining the resonance frequencies of triangular membranes. The technique is demonstrated for homogenous rectangular and triangular membranes with fixed boundaries. Where possible, the results are…
The paper reports a generalized expression for filling the congruent circles (of radius r) in a circle (of radius R). First, a generalized expression for the biggest circle (r) inscribed in the nth part of the bigger circle (R) was…
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…
A $d$-regular graph on $n$ nodes has at most $T_{\max} = \frac{n}{3} \tbinom{d}{2}$ triangles. We compute the leading asymptotics of the probability that a large random $d$-regular graph has at least $c \cdot T_{\max}$ triangles, and…
We estimate whether there is an embedding from one n-dimensional rectangle into another which expands every k-dimensional area. Our estimate is sharp up to a constant factor in each dimension.
The nonlinear equations describing all the nonsingular pencils of metrics of constant Riemannian curvature are derived and the integrability of these nonlinear equations by the method of inverse scattering problem is proved. It is proved…