相关论文: Resolutions by mapping cones
In this paper, we introduce cone normed linear space, study the cone convergence with respect to cone norm. Finally, we prove the completeness of a finite dimensional cone normed linear space.
In this paper, we mainly study solution uniqueness of some convex optimization problems. Our characterizations of solution uniqueness are in terms of the radial cone. This approach allows us to know when a unique solution is a strong…
We propose a class of Pad\'e interpolation problems whose solutions are expressible in terms of determinants of hypergeometric series.
We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…
We propose to determine the bifurcation diagrams of fixed points using their coordinates as control parameters. This method can lead to exact solutions to otherwise intractable bifurcation problems.
In this paper we consider a partial overdetermined mixed boundary value problem in domains inside a cone as in [18]. We show that in cones having an isoperimetric property the only domains which admit a solution and which minimize a…
We examine a family of 3-point mappings that include mappings solvable through linearization. The different origins of mappings of this type are examined: projective equations and Gambier systems. The integrable cases are obtained through…
We study cubic rational maps that take lines to plane curves. A complete description of such cubic rational maps concludes the classification of all planarizations, i.e., maps taking lines to plane curves.
We characterize the movable cone of divisors using intersections against curves on birational models.
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there often exist iterative algorithms that impose very little…
We study mapping cones and their dual cones of positive maps of the n by n matrices into itself. For a natural class of cones there is a close relationship between maps in the cone, super-positive maps, and separable states. In particular…
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.
Extends previous work on a quintic-solving algorithm to equations of the eighth-degree.
Iterated loop algebras are by definition obtained by repeatedly applying the loop construction, familiar from the theory of affine Kac-Moody Lie algebras, to a given base algebra. Our interest in this iterated construction is motivated by…
The authors study in detail new types of varieties with degenerate Gauss maps: varieties with multiple foci and their particular case, the so-called twisted cones. They prove an existence theorem for twisted cones and describe their…
Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…
We present an introduction to the derived and relative resolutions of the moduli of stable maps. We discuss one application and mention a few problems.
An iterative method is derived for image reconstruction. Among other attributes, this method allows constraints unrelated to the radiation measurements to be incorporated into the reconstructed image. A comparison is made with the widely…
We give a procedure that can be used to automatically satisfy invariants of a certain shape. These invariants may be written with the operations intersection, composition and converse over binary relations, and equality over these…