Related papers: A ladder ellipse problem
We compute the ladder operators for static tidal perturbations to higher-dimensional black holes. These operators map between solutions of the relevant equation of motion at different multipole orders. We focus on spin 0, 1 and 2…
This work concerns with the existence of solutions for the following class of nonlocal elliptic problems \begin{eqnarray}\label{eq:0.1} &&\left\{\begin{array}{l} (-\Delta)^{s} u+u=|u|^{p-2} u \text { in } \Omega_{r} \\ u \geq 0 \quad \text…
This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface,…
We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…
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…
Two-dimensional lattices provide the arena for many physics problems of essential importance, a non-trivial symmetry in such lattices will help to reveal the underlying physics. Whether there is a directional scaling for the 2D lattices is…
This paper is concerned with the convergence of the solution of general elliptic boundary value problems in cylindrical domain, when some directions of the domain go to infinity.
Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…
We establish several sufficient conditions for the strong ellipticity of any fourth-order elasticity tensor in this paper. The first presented sufficient condition is an extension of positive definite matrices, which states that the strong…
We consider Newton's problem of minimal resistance, in particular we address the problem arising in the limit if the height goes to infinity. We establish existence of solutions and lack radial symmetry of solutions. Moreover, we show that…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
In this paper, which corresponds to an updated version of the author's Habilitation lecture in Mathematics, we do an overview of several topics in elliptic problems. We review some old and new results regarding the Lane-Emden equation, both…
The paper provides an exact analytical solution for equilibrium configurations of cantilever rod subject to inclined force and torque acting on its free end. The solution is given in terms of Jacobi elliptical functions and illustrated by…
In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…
One important question in the theory of lattices is to detect a shortest vector: given a norm and a lattice, what is the smallest norm attained by a non-zero vector contained in the lattice? We focus on the infinity norm and work with…
For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…
This paper studies a problem of Erd\"{o}s concerning lattice cubes. Given an $N \times N \times N$ lattice cube, we want to find the maximum number of vertices one can select so that no eight corners of a rectangular box are chosen…
A general elliptic $N\times N$ matrix Lax scheme is presented, leading to two classes of elliptic lattice systems, one which we interpret as the higher-rank analogue of the Landau-Lifschitz equations, while the other class we characterize…
We present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and…
Algorithms for the computation of the forward and inverse geodesic problems for an ellipsoid of revolution are derived. These are accurate to better than 15 nm when applied to the terrestrial ellipsoids. The solutions of other problems…