相关论文: Resolutions by mapping cones

We develop a circle of ideas involving pairs of lines in the plane, intersections of hyperbolically rotated elliptical cones and the locus of the centers of rectangles inscribed in lines in the plane.

Some iterative techniques are defined to solve reversible inverse problems and a common formulation is explained. Numerical improvements are suggested and tests validate the methods.

We define generalized Collatz mappings on free abelian groups of finite rank and study their iteration trajectories. Using geometric arguments we describe cones of points having a divergent trajectory and we deduce lower bounds for the…

The paper is devoted to the methods of solving simultaneous recurrences. Specifically, we discuss transformation of matrix recurrences to regular recurrences and propose a way of solving special matrix recurrences of order three by their…

This note presents an approach to studying the iterates of a mapping whose restriction to the complement of a finite set is continuous and open. The main examples to which the approach can be applied are piecewise monotone mappings defined…

Let $(R,\mathfrak m, \mathsf k)$ be a complete intersection local ring, $K$ be the Koszul complex on a minimal set of generators of $\mathfrak m$, and $A=H(K)$ be its homology algebra. We establish exact sequences involving direct sums of…

We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack,…

Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…

The numerical performance of algorithms can be studied using test sets or procedures that generate such problems. This paper proposes various methods for generating linear, semidefinite, and second-order cone optimization problems.…

In the finite-dimensional case, we present a new approach to the theory of cones with a mapping cone symmetry, first introduced by St{\o}rmer. Our method is based on a definition of an inner product in the space of linear maps between two…

We discuss alternative iteration methods for differential equations. We provide a convergence proof for exactly solvable examples and show more convenient formulas for nontrivial problems.

Judgment aggregation problems form a class of collective decision-making problems represented in an abstract way, subsuming some well known problems such as voting. A collective decision can be reached in many ways, but a direct one-step…

A simple iteration methodology for the solution of a set of a linear algebraic equations is presented. The explanation of this method is based on a pure geometrical interpretation and pictorial representation. Convergence using this method…

The basic tool for solving problems in metric geometry and isotonic regression is the metric projection onto closed convex cones. Isotonicity of these projections with respect to a given order relation can facilitate finding the solutions…

In this paper we extend the well-known iterated mapping cone procedure to monomial ideals in strongly Koszul algebras. We study properties of ideals generated by monomials in commutative Koszul algebras and show that the linear strand of…

We construct special conics configurations from some points configurations which are the singularities of the dual of a quartic curve.

We introduce the notions of mixed resolutions and simplicial sections, and prove a theorem relating them. This result is used (in another paper) to study deformation quantization in algebraic geometry.

In this note we characterize isoperimetric regions inside almost-convex cones. More precisely, as in the case of convex cones, we show that isoperimetric sets are given by intersecting the cone with a ball centered at the origin.

A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…

Iterative equation is an equality with an unknown function and its iterates. There were not found a result on iterative equations with multiplication of iterates of the unknown function on $\mathbb{R}$. In this paper we use an exponential…