Related papers: Ellipses Inscribed in Parallelograms

An elliptic divisibility sequence (EDS) is a sequence of integers W_0,W_1,W_2,... generated by the nonlinear recursion satisfied by the division polyomials of an elliptic curve. We give a formula for the sign of W_n for unbounded…

A parallelohedron is called reducible, if it can be represented as a direct product of two parallelohedra of lower dimension. In his Ph.D. thesis (2005) the first author proved a criterion of reducibility of a parallelohedron in terms of…

We present two results related to an edge-isoperimetric question for Cayley graphs on the integer lattice asked by Ben Barber and Joshua Erde [Isoperimetry of Integer Lattices, Discrete Analysis 7 (2018)]. For any (undirected) graph $G$,…

We consider compact connected minimal surfaces, with a pair of boundary curves (not necessarily convex) in distinct planes, that have least-area amongst all orientable surfaces with the same boundary. When the planes containing these two…

We consider an almost complex structure J on CP2, or more generally an elliptic structure E which is tamed by the standard symplectic structure. An E-curve is a surface tangent to E (this generalizes the notion of J(holomorphic)-curve), and…

We show that directed minimal cones in (n+1)-dimensional Euclidean space which have at most one singularity are - besides the trivial cases: empty set, whole space - half spaces. Using blow-up techniques, this result can be used to get…

A metric graph is a pair $(G,d)$, where $G$ is a graph and $d:E(G) \to\mathbb{R}_{\geq0}$ is a distance function. Let $p \in [1,\infty]$ be fixed. An isometric embedding of the metric graph $(G,d)$ in $\ell_p^k = (\mathbb{R}^k, d_p)$ is a…

We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…

We prove that any manifold diffeomorphic to $S^3$ and endowed with a generic metric contains at least two embedded minimal two-spheres. The existence of at least one minimal two-sphere was obtained by Simon-Smith in 1983. Our approach…

A submanifold $M$ of a Euclidean $m$-space is said to be biharmonic if $\Delta \overrightarrow H=0$ holds identically, where $\overrightarrow H$ is the mean curvature vector field and $\Delta$ is the Laplacian on $M$. In 1991, the author…

We obtain new sharp obstructions to symplectic embeddings of four-dimensional polydisks $P(a,1)$ into four-dimensional ellipsoids $E(bc,c)$ when $1\le a< 2$ and $b$ is a half-integer. When $1 \leq a < 2-O(b^{-1})$ we demonstrate that…

In this paper we continue the investigation of finding the max/min polygons which can be inscribed in a given triangle. Here we are concerned with equilateral triangles. This may seem uninteresting or benign at first, but there are some…

We present three results which support the conjecture that a graph is minimally rigid in $d$-dimensional $\ell_p$-space, where $p\in (1,\infty)$ and $p\not=2$, if and only if it is $(d,d)$-tight. Firstly, we introduce a graph bracing…

We prove that over a Poncelet triangle family interscribed between two nested ellipses $\mathcal{E},\mathcal{E}_c$, (i) the locus of the orthocenter is not only a conic, but it is axis-aligned and homothetic to a $90^o$-rotated copy of…

The characterization of bipartite distance-regularized graphs, where some vertices have eccentricity less than four, in terms of the incidence structures of which they are incidence graphs, is known. In this paper we prove that there is a…

We construct symplectic embeddings of ellipsoids of dimension $2n \ge 6$ into the product of a 4-ball or 4-dimensional cube with Euclidean space. A sequence of these embeddings can be shown to be optimal.

The absolute upper bound on the number of equiangular lines that can be found in $\mathbf{R}^d$ is $d(d+1)/2$. Examples of sets of lines that saturate this bound are only known to exist in dimensions $d=2,3,7$ or $23$. By considering the…

Let $D$ be a strongly connected directed graph of order $n\geq 4$ which satisfies the following condition (*): for every pair of non-adjacent vertices $x, y$ with a common in-neighbour $d(x)+d(y)\geq 2n-1$ and $min \{ d(x), d(y)\}\geq n-1$.…

A line digraph $L(G) = (A, E)$ is the digraph constructed from the digraph $G = (V, A)$ such that there is an arc $(a,b)$ in $L(G)$ if the terminal node of $a$ in $G$ is the initial node of $b$. The maximum number of arcs in a line digraph…

We study the rigidity and flexibility of symplectic embeddings of simple shapes. It is first proved that under the condition $r_n^2 \le 2 r_1^2$ the symplectic ellipsoid $E(r_1, ..., r_n)$ with radii $r_1 \le ... \le r_n$ does not embed in…