Related papers: Area Problems Involving Kasner Polygons

The $k$-center problem is to choose a subset of size $k$ from a set of $n$ points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\ldots,Q_n\}$ be a set of polygons or segments in the…

We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…

One interesting question is how a graph develops from some constrained random graph process, which is a fundamental mechanism in the formation and evolution of dynamic networks. The problem here is referred to the random $K_k$-removal…

In 1916, MacMahon showed that permutations in $S_n$ with a fixed descent set $I$ are enumerated by a polynomial $d_I(n)$. Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in this descent polynomial, and suggested the…

The shape of a number field $K$ of degree $n$ is defined as the equivalence class of the lattice of integers under linear operations generated by rotations, reflections, and positive scalar dilations. It may be viewed as a point in the…

We consider an over-determined Falconer type problem on $(k+1)$-point configurations in the plane using the group action framework introduced in \cite{GroupAction}. We define the area type of a $(k+1)$-point configuration in the plane to be…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body $K$ in the Euclidean plane, the areas of the maximum (resp. minimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$…

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…

In this paper, we deal with a simple geometric problem: Is it possible to partition a rectangle into $k$ non-congruent rectangles of equal area? This problem is motivated by the so-called `Mondrian art problem' that asks a similar question…

A partition on [n] has an m-nesting if there exists i_1 < i_2 < ... < i_m < j_m < j_{m-1} < ... < j_1, where i_l and j_l are in the same block for all 1 <= l <= m. We use generating trees to construct the class of partitions with no…

Let $S$ be a set of $n$ points in general position in the plane, and let $X_{k,\ell}(S)$ be the number of convex $k$-gons with vertices in $S$ that have exactly $\ell$ points of $S$ in their interior. We prove several equalities for the…

We establish optimal convergence rates for a decomposition-based scalable approach to kernel ridge regression. The method is simple to describe: it randomly partitions a dataset of size N into m subsets of equal size, computes an…

Given a set $P$ of $n$ points in the plane, its unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ are connected by an edge if their (Euclidean) distance is at most $1$. We consider several classical…

Let S be a smooth cubic surface defined over a field K. As observed by Segre and Manin, there is a secant and tangent process on S that generates new K-rational points from old. It is natural to ask for the size of a minimal generating set…

Let $K$ be a convex body in ${\bf R}^n$ and $B$ be the Euclidean unit ball in ${\bf R}^n$. We show that $$\mbox{lim}_{t\rightarrow 0} \frac{|K| -|K_t|}{|B| - |B_t|}= \frac{as(K)}{as(B)},$$ where $as(K)$ respectively $as(B)$ is the affine…

We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…

We consider the problem of computing the data-cube marginals of a fixed order $k$ (i.e., all marginals that aggregate over $k$ dimensions), using a single round of MapReduce. The focus is on the relationship between the reducer size (number…

We give a geometric interpretation of all the $m$-th elliptic integrable systems associated to a $k'$-symmetric space $N=G/G_0$ (in the sense of C.L. Terng). It turns out that we have to introduce the integer $m_{k'}$ defined by m_{1}=0 and…

The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…