Related papers: Rational Polygons: Odd Compression Ratio and Odd P…

This paper explores and proves the one-seventh area triangle using a purely algebraic approach as opposed to a geometric one. A triangle set purely in the complex plane is used so that we can utilise features of the complex number system to…

Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1,2,...,c. Motivated by conjectures of Propp, we are led to consider partitions of P into k-gons which are proper in the sense that each k-gon…

A normal odd partition T of the edges of a cubic graph is a partition into trails of odd length (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition and internal in some trail. For each vertex v,…

Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap.…

We investigate a class of odd (ramification) coverings $C \to \mathbb{P}^1$ where $C$ is hyperelliptic, its Weierstrass points maps to one fixed point of $\mathbb{P}^1$ and the covering map makes the hyperelliptic involution of $C$ commute…

We prove that, provided $d > k$, every sufficiently large subset of $\mathbf{F}_q^d$ contains an isometric copy of every $k$-simplex that avoids spanning a nontrivial self-orthogonal subspace. We obtain comparable results for simplices…

Given a polygon $P$ in the plane, a {\em pop} operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be…

We establish coupled fixed point theorems for contraction involving rational expressions in partially ordered metric spaces.

For a set of n points in the plane, we consider the axis--aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain n-k points. In this paper, we consider the boxes to be either squares or…

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd distance from each other.

A rationality condition is derived for the existence of odd perfect numbers involving the square root of a product, which consists of a sequence of repunits, multiplied by twice the base of one of the repunits. This constraint also provides…

The goal of this paper is to determine the number of perpendicularly inscribed polygons that intersect a given side of a regular polygon with an odd number of sides. This is done using circular permutations with repetition, and some special…

A packing of translates of a convex domain in the Euclidean plane is said to be totally separable if any two packing elements can be separated by a line disjoint from the interior of every packing element. This notion was introduced by G.…

In this paper, we investigate the existence of a point in the plane of a unit polygon, that is at rational distance from each vertex of the polygon. A negative answer is obtained in almost all cases.

We study irreducible odd mod $p$ Galois representations $\bar{\rho} \colon \mathrm{Gal}(\overline{F}/F) \to G(\overline{\mathbb{F}}_p)$, for $F$ a totally real number field and $G$ a general reductive group. For $p \gg_{G, F} 0$, we show…

Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…

We revisit a standard polygon containment problem: given a convex $k$-gon $P$ and a convex $n$-gon $Q$ in the plane, find a placement of $P$ inside $Q$ under translation and rotation (if it exists), or more generally, find the largest copy…

Let $S$ be a set of $n$ points in the unit square $[0,1]^2$, one of which is the origin. We construct $n$ pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in $S$, and the…

Let $P$ be a set of $n$ points in $\mathbb{R}^d$ and $\mathcal{F}$ be a family of geometric objects. We call a point $x \in P$ a strong centerpoint of $P$ w.r.t $\mathcal{F}$ if $x$ is contained in all $F \in \mathcal{F}$ that contains more…