Displaying similar documents to “On constructive versions of the Tychonoff and Schauder fixed point theorems.”

Large dimensional sets not containing a given angle

Viktor Harangi (2011)

Open Mathematics

Similarity:

We say that a set in a Euclidean space does not contain an angle α if the angle determined by any three points of the set is not equal to α. The goal of this paper is to construct compact sets of large Hausdorff dimension that do not contain a given angle α ∈ (0,π). We will construct such sets in ℝn of Hausdorff dimension c(α)n with a positive c(α) depending only on α provided that α is different from π/3, π/2 and 2π/3. This improves on an earlier construction (due to several authors)...

Uniformly convex functions II

Wancang Ma, David Minda (1993)

Annales Polonici Mathematici

Similarity:

Recently, A. W. Goodman introduced the class UCV of normalized uniformly convex functions. We present some sharp coefficient bounds for functions f(z) = z + a₂z² + a₃z³ + ... ∈ UCV and their inverses f - 1 ( w ) = w + d w ² + d w ³ + . . . . The series expansion for f - 1 ( w ) converges when | w | < ϱ f , where 0 < ϱ f depends on f. The sharp bounds on | a n | and all extremal functions were known for n = 2 and 3; the extremal functions consist of a certain function k ∈ UCV and its rotations. We obtain the sharp bounds on | a n | and all extremal functions for...

Star Coloring of Subcubic Graphs

T. Karthick, C.R. Subramanian (2013)

Discussiones Mathematicae Graph Theory

Similarity:

A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices receive the same color, and (ii) no path on 4 vertices is bi-colored. The star chromatic number of G, χs(G), is the minimum number of colors needed to star color G. In this paper, we show that if a graph G is either non-regular subcubic or cubic with girth at least 6, then χs(G) ≤ 6, and the bound can be realized in linear time.