Related papers: On multivaled fixed-point free maps on R^n

We prove that if f is a self-map of an algebraic variety over a field K, then under certain conditions on X, f and K the set of possible periods of K-valued periodic points of f is finite.

Let $X$ be a set of cardinality $\kappa$ such that $\kappa^\omega=\kappa$. We prove that the linear algebra $\mathbb{R}^X$ (or $\mathbb{C}^X$) contains a free linear algebra with $2^\kappa$ generators. Using this, we prove several…

We prove that the graph of a continuous function $f$, defined on a domain of ${\mathbb C}^n$, is pluripolar if and only if $f$ is holomorphic.

In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while…

In a paper from 2011, Jiang, Wang and Zhang studied the fixed points and fixed subgroups of selfmaps on a connected finite graph or a connected compact hyperbolic surface $X$. In particular, for any selfmap $f: X\to X$, they proved that a…

The 2-colorable perfect matching problem asks whether a graph can be colored with two colors so that each node has exactly one neighbor with the same color as itself. We prove that this problem is NP-complete, even when restricted to…

A classical vertex Ramsey result due to Ne\v{s}et\v{r}il and R\"odl states that given a finite family of graphs $\mathcal{F}$, a graph $A$ and a positive integer $r$, if every graph $B\in\mathcal{F}$ has a $2$-vertex-connected subgraph…

We prove the existence of a fixed point for mappings which satisfy some asymptotic nonexpansive conditions in Banach spaces which are either nearly uniformly convex or they satisfy that asymptotic centers of bounded sequences are compact.…

We show that every continuous rotative mapping on a closed interval has a fixed point. This gives an answer to some open questions raised by Goebel and Koter.

Thomassen conjectured that triangle-free planar graphs have an exponential number of $3$-colorings. We show this conjecture to be equivalent to the following statement: there exists a positive real $\alpha$ such that whenever $G$ is a…

We prove a generalization of Kannan's fixed point theorem, based on a recent result of Vittorino Pata.

Given a planar point set and an integer $k$, we wish to color the points with $k$ colors so that any axis-aligned strip containing enough points contains all colors. The goal is to bound the necessary size of such a strip, as a function of…

We prove the existence of a function $f :\mathbb{N} \to \mathbb{N}$ such that the vertices of every planar graph with maximum degree $\Delta$ can be 3-colored in such a way that each monochromatic component has at most $f(\Delta)$ vertices.…

A squarefree word is a sequence $w$ of symbols such that there are no strings $x, y$, and $z$ for which $w=xyyz$. A nonrepetitive coloring of a graph is an edge coloring in which the sequence of colors along any open path is squarefree. We…

A graph drawn in the plane with n vertices is k-fan-crossing free for k > 1 if there are no k+1 edges $g,e_1,...e_k$, such that $e_1,e_2,...e_k$ have a common endpoint and $g$ crosses all $e_i$. We prove a tight bound of 4n-8 on the maximum…

In this paper, we obtain some sufficient conditions to guarantee the existence of multiple points of maps from $S^m$ to $\mathbb{R}^d$. Our main tool is the ideal-valued index of $G$-space defined by E. Fadell and S. Husseini. We obtain…

In this paper, we are interested in the number of fixed points of functions $f:A^n\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques from network coding to derive some lower bounds on the…

Let $\FF$ be a finite field of characteristics different from two. We show that no bijective map transforms permanent into determinant when the cardinality of $\FF$ is sufficiently large. We also give an example of non-bijective map when…

Let $X$ be a connected, locally finite graph with symmetric growth. We prove that there is a vertex coloring $\phi\colon X\to\{0,1\}$ and some $R\in\mathbb{N}$ such that every automorphism $f$ preserving $\phi$ is $R$-close to the identity…

It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…