Related papers: Area Problems Involving Kasner Polygons

We examine numerically the distribution function $f_K(r)$ of distance $r$ between opposite polygonal nodes for random polygons of $N$ nodes with a fixed knot type $K$. Here we consider three knots such as $\emptyset$, $3_1$ and $3_1 \sharp…

Using T(m,n;k) to denote the number of ways to make a selection of k squares from an (m x n) rectangular grid with no two squares in the selection adjacent, we give a formula for T(2,n;k), prove some identities satisfied by these numbers,…

Any two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases one can connect the pieces by flexible hinges while still allowing the connected set to form both polygons. However it is open…

Let $\mathbb{P}_K(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $K$, a non-flat compact convex polygon in $\mathbb{R}^2$, are in convex position, that is, form the vertex set of a convex…

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees,…

A subset $S$ of nodes in a graph $G$ is a $k$-connected $m$-dominating set ($(k,m)$-cds) if the subgraph $G[S]$ induced by $S$ is $k$-connected and every $v \in V \setminus S$ has at least $m$ neighbors in $S$. In the $k$-Connected…

We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…

Hypergeometric sequences obey first-order linear recurrence relations with polynomial coefficients and are commonplace throughout the mathematical and computational sciences. For certain classes of hypergeometric sequences, we prove linear…

For any field k and any integers m,n with 0 <= 2m <= n+1, let W_n be the k-vector space of sequences (x_0,...,x_n), and let H_m be the subset of W_n consisting of the sequences that satisfy a degree-m linear recursion, that is, for which…

Invex programs are a special kind of non-convex problems which attain global minima at every stationary point. While classical first-order gradient descent methods can solve them, they converge very slowly. In this paper, we propose new…

This research is concerned with the nonhomogeneous linear complex differential equation $$ f^{(k)}+A_{k-1}f^{(k-1)}+\cdots+A_{1}f'+A_{0}f=A_{k} $$ in the complex plane. In the higher order case, the mutual relations between coefficients and…

The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser Graph $K_{s-stab}(n, k)$ is obtained from the Kneser graph by deleting vertices with…

Let $F$ be an $n$-point set in $\mathbb{K}^d$ with $\mathbb{K}\in\{\mathbb{R},\mathbb{Z}\}$ and $d\geq 2$. A (discrete) X-ray of $F$ in direction $s$ gives the number of points of $F$ on each line parallel to $s$. We define…

We consider an isoperimetric inequality for $(m+1)$-dimensional area minimizing submanifolds of arbitrary codimension which lie outside a convex set $\mathcal{K} \subset \mathbb{R}^{n+1}$ and are bounded by a submanifold of…

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

Given is a 1.5D terrain $\mathcal{T}$, i.e., an $x$-monotone polygonal chain in $\mathbb{R}^2$. For a given $2\le k\le n$, our objective is to approximate the largest area or perimeter convex polygon of exactly or at most $k$ vertices…

Motivated by the $k$-center problem in location analysis, we consider the \emph{polygon burning} (PB) problem: Given a polygonal domain $P$ with $h$ holes and $n$ vertices, find a set $S$ of $k$ vertices of $P$ that minimizes the maximum…

The shape of a number field $K$ of degree $n$ is defined as the equivalence class of the lattice of integers with respect to linear operations that are composites of rotations, reflections, and positive scalar dilations. The shape is a…

Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…

Any collection of $n$ compact convex planar sets $K_1,\dots, K_n$ defines a vector of ${n\choose 2}$ mixed areas $V(K_i,K_j)$ for $1\leq i<j\leq n$. We show that for $n\geq 4$ these numbers satisfy certain Pl\"ucker-type inequalities.…