Related papers: Local inversion of planar maps with nice nondiffer…

Let V, W be real algebraic varieties (that is, up to isomorphism, real algebraic sets), and let X be a subset of V. A map f from X into W is said to be regular if it can be extended to a regular map defined on some Zariski locally closed…

In this paper we introduce a technique to produce tighter cutting planes for mixed-integer non-linear programs. Usually, a cutting plane is generated to cut off a specific infeasible point. The underlying idea is to use the infeasible point…

We study periodic, piecewise linear maps on the plane starting with the Mort Brown's map. We show that if the number of pieces is two, there is only a short list of possible periods (this fact can be seen as the crystallographic restriction…

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

We prove that if a non-singular planar map $\Lambda \in C^2(R^2,R^2)$ has a convex component, then $\Lambda$ is injective. We do not assume strict convexity.

We provide a sufficient condition for an invertible (locally strongly) convex vector-valued function on $\mathbb{R}^N$ to have a (locally strongly) convex inverse. We show under suitable conditions that if the gradient of each component of…

It is proved that every convex body in the plane has a point such that the union of the body and its image under reflection in the point is convex. If the body is not centrally symmetric, then it has, in fact, three affinely independent…

We prove that for continuous maps on the interval, the existence of an n-cycle, implies the existence of n-1 points which interwind the original ones and are permuted by the map. We then use this combinatorial result to show that piecewise…

When a matrix has a banded inverse there is a remarkable formula that quickly computes that inverse, using only local information in the original matrix. This local inverse formula holds more generally, for matrices with sparsity patterns…

We partly extend the localisation technique from convex geometry to the multiple constraints setting. For a given $1$-Lipschitz map $u\colon\mathbb{R}^n\to\mathbb{R}^m$, $m\leq n$, we define and prove the existence of a partition of…

A graph $G$ is $k$-degenerate if it can be transformed into an empty graph by subsequent removals of vertices of degree $k$ or less. We prove that every connected planar graph with average degree $d \ge 2$ has a 4-degenerate induced…

A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\Phi:X\to exp(X)$ such that $[x,y]\subset\Phi(x)\cup \Phi(y)$ for all $x,y\in X$. We prove that each convex subset of…

For each nonnegative integer m we show that any closed, oriented topological four-manifold with fundamental group Z_{4m+2} and odd intersection form, with possibly seven exceptions, either admits no smooth structure or admits infinitely…

Let $G$ be a real reductive Lie group, $L$ a compact subgroup, and $\pi$ an irreducible admissible representation of $G$. In this article we prove a necessary and sufficient condition for the finiteness of the multiplicities of $L$-types…

We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…

Given a planar graph $G$, we consider drawings of $G$ in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding $\pi$ of the vertex set of $G$ into…

It is shown that a trace invariant projection map, i.e. a positive unital idempotent map, of a finite dimensional C*-algebra into itself is non-decomposable if and only if it is atomic, or equivalently not the sum of a 2-positive and a…

Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…

We consider Calderon's inverse problem with partial data in dimensions $n \geq 3$. If the inaccessible part of the boundary satisfies a (conformal) flatness condition in one direction, we show that this problem reduces to the invertibility…

It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…