Related papers: On the Conformal Lens Map
In this article we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set out to define a proper distance measure…
Finite element codes typically use data structures that represent unstructured meshes as collections of cells, faces, and edges, each of which require associated coordinate systems. One then needs to store how the coordinate system of each…
We investigate the use of conformal maps for the acceleration of convergence of the trapezoidal rule and Sinc numerical methods. The conformal map is a polynomial adjustment to the $\sinh$ map, and allows the treatment of a finite number of…
Optics and lenses are abstract categorical gadgets that model systems with bidirectional data flow. In this paper we observe that the denotational definition of optics - identifying two optics as equivalent by observing their behaviour from…
Redshift maps of galaxies in the Universe are distorted by the peculiar velocities of galaxies along the line of sight. The amplitude of the distortions on large, linear scales yields a measurement of the linear redshift distortion…
The space of topological decompositions into triangulations of a surface has a natural graph structure where two triangulations share an edge if they are related by a so-called flip. This space is a sort of combinatorial Teichm\"uller space…
In this article we describe a program -- called planar_draw -- to draw maps on oriented surfaces in the plane. The drawings are coded as tikz files that can easily be manipulated and used in latex documents. Next to plane maps -- a case for…
This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…
The Laplacian functional determinants for conformal scalars and coexact one-forms are evaluated in closed form on inhomogeneous lens spaces of certain orders, including all odd primes when the essential part of the expression is given,…
The existing object classification techniques based on descriptive features rely on object alignment to compute the similarity of objects for classification. This paper replaces the necessity of object alignment through sorting of feature.…
Stochastic microlensing is a central tool in probing dark matter on galactic scales. From first principles, we initiate the development of a mathematical theory of stochastic microlensing. Beginning with the random time delay function and…
We show existence of centrally symmetric maps on surfaces all of whose faces are quadrangles and pentagons for each orientable genus $g \geq 0$. We also show existence of centrally symmetric maps on surfaces all of whose faces are hexagons…
We characterize all translation invariant half planar maps satisfying a certain natural domain Markov property. For p-angulations with p \ge 3 where all faces are simple, we show that these form a one-parameter family of measures…
We study learning of indexed families from positive data where a learner can freely choose a hypothesis space (with uniformly decidable membership) comprising at least the languages to be learned. This abstracts a very universal learning…
Context: Weak gravitational lensing is a key cosmological probe for current and future large-scale surveys. While power spectra are commonly used for analyses, they fail to capture non-Gaussian information from nonlinear structure…
The numerical aperture (NA) of a lens determines its ability to focus light and its resolving capability. Having a large NA is a very desirable quality for applications requiring small light-matter interaction volumes or large angular…
Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
We present a formal derivation of the key equations governing gravitational lensing in arbitrary space-times, starting from the basic properties of Jacobi fields and their expressions in terms of the exponential map. A careful analysis of…
F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…