English
Related papers

Related papers: A ladder ellipse problem

200 papers

A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path (SDP) from s to t in a…

Computational Geometry · Computer Science 2007-05-23 Mustaq Ahmed , Anna Lubiw

For elliptic curves given by the equation $E_{a}: y^{2}=x^{3}+ax$, we establish the best-possible version of Lang's conjecture on the lower bound of the canonical height of non-torsion points along with best-possible upper and lower bounds…

Number Theory · Mathematics 2013-07-18 Paul Voutier , Minoru Yabuta

We prove the existence of infinitely many solutions to an elliptic problem by borrowing the techniques from algebraic topology. The solution(s) thus obtained will also be proved to be bounded.

Analysis of PDEs · Mathematics 2021-02-25 A. Panda , D. Choudhuri , A. Bahrouni

A four-parameter kinematic model for the position of a fluid parcel in a time-varying ellipse is introduced. For any ellipse advected by an arbitrary linear two-dimensional flow, the rates of change of the ellipse parameters are uniquely…

Atmospheric and Oceanic Physics · Physics 2018-02-13 J. M. Lilly

The ellipsoid method is an algorithm that solves the (weak) feasibility and linear optimization problems for convex sets by making oracle calls to their (weak) separation problem. We observe that the previously known method for showing that…

Logic in Computer Science · Computer Science 2023-10-24 Albert Atserias , Joanna Fijalkow

We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…

Numerical Analysis · Mathematics 2021-07-07 Thomas Mejstrik , Vladimir Yu. Protasov

The authors propose a new variation of random walks called ladder chains $L(r,s,p)$. We extend concepts such as ruin probability, hitting time, transience and recurrence of random walks to ladder chain. Take $L(2,2,p)$ for instance, we find…

Probability · Mathematics 2018-12-10 Chenhe Zhang , Xiang Fang

We obtain a tight, up to a logarithmic factor, upper bound on the number of solutions to the equation $$ \sum_{j=1}^n a_j \frac{s_j}{r_j} =a_0, \qquad $$ with variables $r_1,...,r_n$ in an arbitrary box at the origin and variables $s_1,...,…

Number Theory · Mathematics 2015-03-10 Igor E. Shparlinski

We reconsider the ellipsoid method for linear inequalities. Using the ellipsoid representation of Burrell and Todd, we show the method can be viewed as coordinate descent on the volume of an enclosing ellipsoid, or on a potential function,…

Optimization and Control · Mathematics 2023-09-27 Michael J. Todd

Consider the elliptic curves given by $ E_{n,\theta}:\quad y^2=x^3+2s n x^2-(r^2-s^2) n^2 x $ where $0 < \theta< \pi$, $\cos(\theta)=s/r$ is rational with $0\leq |s| <r$ and $\gcd (r,s)=1$. These elliptic curves are related to the…

Number Theory · Mathematics 2014-12-16 Ali S. Janfada , Sajad Salami , andrej Dujella , Juan C. Peral

Let $M$ be a 3-manifold. Every knotted (embedded) surface in $M \times \R$ can be moved via an ambient isotopy in such a way that its projection into $M$ is a generic surface. A surface is generic if every point on it is either a regular,…

Geometric Topology · Mathematics 2016-05-30 Doron Ben Hadar

We introduce a method for solving Calder\'on type inverse problems for semilinear equations with power type nonlinearities. The method is based on higher order linearizations, and it allows one to solve inverse problems for certain…

Analysis of PDEs · Mathematics 2019-04-01 Matti Lassas , Tony Liimatainen , Yi-Hsuan Lin , Mikko Salo

This paper studies equable parallelograms whose vertices lie on the integer lattice. Using Rosenberger's Theorem on generalised Markov equations, we show that the g.c.d. of the side lengths of such parallelograms can only be 3, 4 or 5, and…

Number Theory · Mathematics 2021-05-03 Christian Aebi , Grant Cairns

The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve. In the variant…

Computational Geometry · Computer Science 2024-10-22 Václav Blažej , Boris Klemz , Felix Klesen , Marie Diana Sieper , Alexander Wolff , Johannes Zink

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,…

Robotics · Computer Science 2017-11-21 Shuai D Han , Nicholas M Stiffler , Athanasios Krontiris , Kostas E Bekris , Jingjin Yu

We establish the existence of positive solutions for a nonlinear elliptic Dirichlet problem in dimension $N$ involving the $N$-Laplacian. The nonlinearity considered depends on the gradient of the unknown function and an exponential term.…

Analysis of PDEs · Mathematics 2018-08-28 Anderson Luis Albuquerque de Araujo , Luiz Fernando de Oliveira Faria

We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…

Metric Geometry · Mathematics 2013-02-21 Manuel Joseph C. Loquias , Peter Zeiner

We present a complete solution to the so-called tennis ball problem, which is equivalent to counting lattice paths in the plane that use North and East steps and lie between certain boundaries. The solution takes the form of explicit…

Combinatorics · Mathematics 2007-05-23 Anna de Mier , Marc Noy

The present paper concerns with the existence of blow-up solution for a class of elliptic system with convection term. Here, we prove a result involving sub and supersolution for a class of elliptic system whose nonlinearity can depend of…

Analysis of PDEs · Mathematics 2014-02-11 Claudianor O. Alves , Dragos-Patru Covei

If $E$ is an elliptic curve defined over a quadratic field $K$, and the $j$-invariant of $E$ is not 0 or 1728, then $E(\mathbf{Q}^{\ab})$ has infinite rank. If $E$ is an elliptic curve in Legendre form, $y^2 = x(x-1)(x-\lambda)$, where…

Number Theory · Mathematics 2012-02-08 Bo-Hae Im , Michael Larsen