Zobrazeno 1 - 10
of 216
pro vyhledávání: '"Noakes, Lyle"'
This paper introduces in detail a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained problems and problems with non-binary variables. The algorithm returns optimal and near-o
Externí odkaz:
http://arxiv.org/abs/2408.06368
We consider the problem of finding curves of minimum pointwise-maximum curvature, i.e., curves of minimax curvature, among planar curves of fixed length with prescribed endpoints and tangents at the endpoints. We reformulate the problem in terms of o
Externí odkaz:
http://arxiv.org/abs/2404.12574
This paper introduces a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained and non-binary problems. The algorithm leverages an engineered interference process achieved throug
Externí odkaz:
http://arxiv.org/abs/2404.03167
As is well-known, numerical experiments show that Napoleon's Theorem for planar triangles does not extend to a similar statement for triangles on the unit sphere $S^2$. Spherical triangles for which an extension of Napoleon's Theorem holds are called
Externí odkaz:
http://arxiv.org/abs/2403.02830
Let $K$ and $L$ be two disjoint unions of strictly convex obstacles contained within a Riemannian manifold with boundary $S$ of dimension $m\geq 2$. The sets of travelling times $\mathcal{T}_K$ and $\mathcal{T}_L$ of $K$ and $L$, respectively, are co
Externí odkaz:
http://arxiv.org/abs/2311.07813
Suppose that $K$ and $L$ are two disjoint unions of strictly convex obstacles with the same set of travelling times, contained in an $n$-dimensional Riemannian manifold $M$ (where $n\geq2$). Under some natural curvature conditions on $M$, and provide
Externí odkaz:
http://arxiv.org/abs/2309.11141
Publikováno v:
Chaos 1 December 2022; 32 (12): 123131
Noakes and Stoyanov (2021) introduced a method of recovering strictly convex planar obstacles from their set of travelling times. We provide an extension of this construction for obstacles on Riemannian surfaces under some general curvature condition
Externí odkaz:
http://arxiv.org/abs/2309.04150
Autor:
Noakes, Lyle, Stoyanov, Luchezar
A construction is given for the recovery of a disjoint union of strictly convex smooth planar obstacles from travelling-time information. The obstacles are required to be such that no Euclidean line meets more than two of them.
Comment: 14 pages
Comment: 14 pages
Externí odkaz:
http://arxiv.org/abs/2010.04334
We consider travelling times of billiard trajectories in the exterior of an obstacle K on a two-dimensional Riemannian manifold M. We prove that given two obstacles with almost the same travelling times, the generalised geodesic flows on the non-trap
Externí odkaz:
http://arxiv.org/abs/2003.12261
In ideal MHD, the magnetic flux is advected by the plasma motion, freezing flux-surfaces into the flow. An MHD equilibrium is reached when the flow relaxes and force balance is achieved. We ask what classes of MHD equilibria can be accessed from a gi
Externí odkaz:
http://arxiv.org/abs/1910.01767