The main goal of this note is to give a new elementary proof of the Fundamental Theorem of Algebra. This proof is based on the use of the well known Gelfand-Mazur Theorem.

We study the Borsuk-Ulam theorem for triple (M, τ, ℝ n ), where M is a compact, connected, 3-manifold equipped with fixed-point-free involution τ. The largest value of which Borsuk-Ulam...

in this paper, using the fixed point and direct methods, we prove the generalized hyers-ulam-rassias stability of the following cauchy-jensen additive functional equation: begin{equation}label{main} fleft(frac{x+y+z}{2}right)+fleft(frac{x-y+z}{2}right)=f(x)+f(z)end{equation} in various normed spaces. the concept of hyers-ulam-rassias stability originated from th. m. rassias’ stability theorem t...

We discuss a variant of the Banach-Mazur game which has applications to topological open mapping and closed graph theorems.

The aim of this paper is to introduce $n$-variables mappings which are cubic in each variable and to apply a fixed point theorem for the Hyers-Ulam stability of such mapping in non-Archimedean normed spaces. Moreover, a few corollaries corresponding to some known stability and hyperstability outcomes are presented.

In this article, we introduce the multi-$m$-Jensen mappings and characterize them as a single equation. Using a fixed point theorem, we study the generalized Hyers-Ulam stability for such mappings. As a consequence, we show that every multi-$m$-Jensen mappings (under some conditions) is hyperstable.

The Borsuk-Ulam theorem has many applications in algebraic topology, algebraic geomtry, and combinatorics. Here we study some combinatorial consequences, typically asserting the existence of a certain combinatorial object. An interesting aspect is the computational complexity of algorithms that search for the object. The study of these algorithms is facilitated by direct combinatorial existence...