Related papers: Rectangle Coincidences and Sweepouts
We build, for real quadratic fields, infinitely many periodic continuous fractions uniformly bounded, with a seemingly better bound than the known ones. We do that using continuous fraction expansions with the same shape as those of real…
Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest ordinate it ever reaches. These paths were first…
We establish combinatorial versions of various classical systolic inequalities. For a smooth triangulation of a closed smooth manifold, the minimal number of edges in a homotopically non-trivial loop contained in the $1$-skeleton gives an…
By rectangle packing we mean putting a set of rectangles into an enclosing rectangle, without any overlapping. We begin with perfect rectangle packing problems, then prove two continuity properties for parallel rectangle packing problems,…
We demonstrate a new approach to the computation of ratios of elliptic integrals. It turns out that almost closed polygons interscribed between two conics retain some of the properties of such closed polygons. We apply these retained…
We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the complement of a given regular expression, a double exponential size…
We consider the number of domino tilings of an odd-by-odd rectangle that leave one hole. This problem is equivalent to the number of near-perfect matchings of the odd-by-odd rectangular grid. For any particular position of the vacancy on…
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…
We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…
Two discrete dynamical systems are discussed and analyzed whose trajectories encode significant explicit information about a number of problems in combinatorial probability, including graphical enumeration on Riemann surfaces and random…
Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
A notion of random walks for circle packings is introduced. The geometry behind this notion is discussed, together with some applications. In particular, we obtain a short proof of a result regarding the type problem for circle packings,…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
In this paper we provide extensions of the $\lambda$-Lemma (also known as Inclination Lemma) for piecewise smooth vector fields and maps. In order to achieve our main result, we investigate the regularity of time-T-maps of piecewise smooth…
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…
Using the circle method, we count integer points on complete intersections in biprojective space in boxes of different side length, provided the number of variables is large enough depending on the degree of the defining equations and…
We present a prescription to calculate the quadratic and logarithmic divergent parts of several integrals employing a cutoff in a coherent way, i.e. in total agreement with symmetry requirements. As examples we consider one-loop Ward…
We show how inscription problems in the plane can be generalized to Riemannian surfaces of constant curvature. We then use ideas from symplectic and Riemannian geometry to prove these generalized versions for smooth Jordan curves in the…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…