Related papers: A ladder ellipse problem
We classify all the relative positions between an ellipsoid and an elliptic paraboloid when the ellipsoid is small in comparison with the paraboloid ({\it small} meaning that the ellipsoid cannot be tangent to the paraboloid at two points…
We propose a simple derivation of an upper bound for the perimeter of an ellipse. The procedure, which relies on the use of elliptic integrals, consists in introducing, via inequalities and convexity properties, specific integrals which can…
The two-dimensional surface of a bi-axial ellipsoid is characterized by the lengths of its major and minor axes. Longitude and latitude span an angular coordinate system across. We consider the egg-shaped surface of constant altitude above…
Gy\'arf\'as investigated a geometric Ramsey problem on convex, separated, balanced, geometric $K_{n,n}$. This led to appealing extremal problem on square $0$-$1$ matrices. Gy\'arf\'as conjectured that any $0$-$1$ matrix of size $n\times n$…
We establish new upper bounds for the height of the S-integral points of an elliptic curve. This bound is explicitly given in terms of the set S of places of the number field K involved, but also in terms of the degree of K, as well as the…
We consider the problem of finding a Hamiltonian path or a Hamiltonian cycle with precedence constraints in the form of a partial order on the vertex set. We show that the path problem is $\mathsf{NP}$-complete for graphs of pathwidth 4…
Solving elliptic PDEs in more than one dimension can be a computationally expensive task. For some applications characterised by a high degree of anisotropy in the coefficients of the elliptic operator, such that the term with the highest…
We compute the second and third levels of the Lasserre hierarchy for the spherical finite distance problem. A connection is used between invariants in representations of the orthogonal group and representations of the general linear group,…
In this paper we study the positive solutions of sub linear elliptic equations with a Hardy potential which is singular at the boundary. By means of ODE techniques a fairly complete picture of the class of radial solutions is given. Local…
We generalize the three two-particle Bethe-Salpeter equations to ten three-particle ladders. These equations are exact and yield the exact three-particle vertex, if we knew the three-particle vertex irreducible in one of the ten channels.…
The Neumann problem on an ellipsoid in R^n asks for a function harmonic inside the ellipsoid whose normal derivative is some specified function on the ellipsoid. We solve this problem when the specified function on the ellipsoid is a…
Starting from the well-known and elementary problem of inscribing the rectangle of the greatest area in an ellipse, we look at possible, gradually more and more complicated variants of this problem. Our goal is to demonstrate to an average…
We investigate the problem of packing identical hard objects on regular lattices in d dimensions. Restricting configuration space to parallel alignment of the objects, we study the densest packing at a given aspect ratio X. For rectangles…
In this work we analyze the existence of solutions to the nonlinear elliptic system: \begin{equation*} \left\{ \begin{array}{rcll} -\Delta u & = & v^q+\a g & \text{in }\Omega , \\ -\Delta v& = &|\nabla u|^{p}+\l f &\text{in }\Omega , \\…
The elliptic curve y^2= x^3-Nx where N=m^4+n^4 has rank at least 2 over Q(m,n). When N can be written in two different ways as sum of two fourth powers, then we prove that the rank is at least 4.
We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…
This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…
It is shown how to define difference equations on particular lattices $\{x_n\}$, $n\in\mathbb{Z}$, made of values of an elliptic function at a sequence of arguments in arithmetic progression (elliptic lattice). Solutions to special…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…