Related papers: Planar maps whose second iterate has a unique fixe…

Our main result states that every fixed-point free continuous self-map of ${\mathbb R}^{n}$ is colorable. This result can be re-formulated as follows: A continuous map $f: {\mathbb R}^{n}\to {\mathbb R}^{n}$ is fixed-point free iff…

A pair of biadjoint functors between two categories produces a collection of elements in the centers of these categories, one for each isotopy class of nested circles in the plane. If the centers are equipped with a trace map into the…

We exhibit planar, rational curves of large degree over ${\mathbb F}_2$ that have a unique singular point, which has multiplicity 2. In characteristic 0 such curves exist only for degrees up to $6$. v.2: references updated and examples of…

In this paper we generalize the results shown by Das and Peterson. Let $M$ be a ${\rm II}_1$-factor acting on $L^2(M)$. We consider certain unital normal completely positive maps on $B(L^2(M))$ which are identity on $M$. We investigate…

The critical behavior for intermittency is studied in two coupled one-dimensional (1D) maps. We find two fixed maps of an approximate renormalization operator in the space of coupled maps. Each fixed map has a common relavant eigenvaule…

We extend the renormalisation operator introduced in \cite{dCML} from period-doubling H\'enon-like maps to H\'enon-like maps with arbitrary stationary combinatorics. We show the renormalisation picture holds also holds in this case if the…

A graph is $(\mathcal{I}, \mathcal{F})$-colorable if its vertex set can be partitioned into two subsets, one of which is an independent set, and the other induces a forest. In this paper, we prove that every planar graph without…

A group of bijections G acting on a set X is said with fixed points (abbreviated as gaf from the french "groupe {\`a} points fixes") if any element of G has at least one fixed point in X. The G group is said with a common fixed point…

A graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar graph joins. We prove that the join $G+H$ is 1-planar if and only if the pair $[G,H]$ is…

Discrete differential equations appear most prominently in planar map and lattice path enumeration. In this work we consider discrete differential equations with an additional parameter $x$, where the order of the equation is $1$ for $x=0$…

For a map of the unit interval with an indifferent fixed point, we prove an upper bound for the variance of all observables of $n$ variables $K:[0,1]^n\to\R$ which are componentwise Lipschitz. The proof is based on coupling and decay of…

We study the existence of fixed points for continuous maps $f$ from an $n$-ball $X$ in $\mathbb R^n$ to $\mathbb R^n$ with $n\geq 1$. We show that $f$ has a fixed point if, for some absolute retract $Y\subset\partial X$, $f(Y)\subset X$ and…

Let $\Delta ^{n}$ be the ball $|x|<1$ in the complex vector space $\mathbb{C}% ^{n}$, let $f:\Delta ^{n}\to \mathbb{C}^{n}$ be a holomorphic mapping and let $M$ be a positive integer. Assume that the origin $% 0=(0,..., 0)$ is an isolated…

We show that any separated essentially finite-type map $f$ of noetherian schemes globally factors as $f = hi$ where $i$ is an injective localization map and $h$ a separated finite-type map. In particular, via Nagata's compactification…

We examine invariant nonrecurrent Fatou components of automorphisms of $\mathbb{C}^2$ in the case where all limit maps are constant. We show that except in special cases there cannot be more than one such limit map. We also briefly examine…

Let $G\subset\GL(V)$ be a complex reductive group. Let $G'$ denote $\{\phi\in\GL(V)\mid p\circ\phi=p\text{for all} p\in\C[V]^G\}$. We show that, in general, $G'=G$. In case $G$ is the adjoint group of a simple Lie algebra $\lieg$, we show…

For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…

We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a stable graph class C, and using a first-order formula {\phi}…

We prove that for every at most countable family $\{f_k(x)\}$ of real functions on $[0,1)$ there is a single-valued real function $F(x)$, $x\in[0,1)$, such that the Hausdorff dimension of the graph $\Gamma$ of $F(x)$ equals 2, and for every…

In this paper, we study the singularities of locally flat systems, motivated by the solution, if it exists, of the global motion planning problem for such systems, in the spirit of \cite{CE_14}. More precisely, flat outputs may be only…