The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

On affinity of Peano type functions

Tomasz Słonka — 2012

Colloquium Mathematicae

We show that if n is a positive integer and 2 , then for every positive integer m and for every real constant c > 0 there are functions f , . . . , f n + m : such that ( f , . . . , f n + m ) ( ) = n + m and for every x ∈ ℝⁿ there exists a strictly increasing sequence (i₁,...,iₙ) of numbers from 1,...,n+m and a w ∈ ℤⁿ such that ( f i , . . . , f i ) ( y ) = y + w for y x + ( - c , c ) × n - 1 .

Page 1

Download Results (CSV)