Zobrazeno 1 - 10 of 10 pro vyhledávání: '"Ulam number"'
1
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
2
Nielsen-Borsuk-Ulam number for maps between tori
Autor: Melo, Givanildo Donizeti de
Publikováno v: Repositório Institucional da UFSCAR
Universidade Federal de São Carlos (UFSCAR)
instacron:UFSCAR
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) The Nielsen-Borsuk-Ulam number is a lower bound for the minimal number of pair of coincidences points such that f(x) = f(\tau(x)) in a given homotopy class of maps. In this text
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3056::b9326b19abe05d4e1a2cb7cefdbb873f
https://repositorio.ufscar.br/handle/ufscar/14270
Zobrazit plný text záznamu
3
The Nielsen Borsuk-Ulam number
Autor: Fabiana Santos Cotrim, Daniel Vendrúscolo
Publikováno v: Bull. Belg. Math. Soc. Simon Stevin 24, no. 4 (2017), 613-619
A Nielsen-Borsuk-Ulam number ($NBU(f,\tau)$) is defined for continuous maps $f:X\to Y$ where $X$ and $Y$ are closed orientable triangulable $n$-mani\-folds and $X$ has a free involution $\tau$. This number is a lower bound, in the homotopy class of $
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::575758f2493ab10b930eb42fe6365b2c
https://doi.org/10.36045/bbms/1515035010
Zobrazit plný text záznamu
4
Solution of the Ulam Stability Problem for Euler–Lagrange Quadratic Mappings
Autor: John Michael Rassias
Publikováno v: Journal of Mathematical Analysis and Applications. 220:613-639
In 1940 S. M. Ulam proposed at the University of Wisconsin theproblem: “Give conditions in order for a linear mapping near an approximately linear mapping to exist.”In 1968 S. U. Ulam proposed the moregeneral problem: “When is it true that by c
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::540b3c041329eb202a4d9ff837586b90
https://doi.org/10.1006/jmaa.1997.5856
Zobrazit plný text záznamu
5
Ulam's searching game with two lies
Autor: W. Guzicki
Publikováno v: Journal of Combinatorial Theory, Series A. 54:1-19
We determine the minimal number of yes-no queries sufficient to find an unknown integer between 1 and n if at most two of the answers may be erroneous. This solves completely the problem of Ulam on searching with two lies, partially solved by Czyzowi
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a7b7fb508689c81d3d30f95efcf1a50b
https://doi.org/10.1016/0097-3165(90)90002-e
Zobrazit plný text záznamu
9
On a theorem of Schreier and Ulam for countable permutations
Autor: Edward A. Bertram
Publikováno v: Journal of Algebra. 24:316-322
In 1933 J. Schreier and S. Ulam [3] gave the Jordan-Hiilder composition series for the group Sym(S) of all permutations of a countable set S. In particular, they showed that any normal subgroup containing a permutation P with infinite support must in
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e4b840ec2bd3aef7756ea4265f7edee
https://doi.org/10.1016/0021-8693(73)90141-5
Zobrazit plný text záznamu
10
The Problem of S. M. Ulam for Approximately Multiplicative Mappings
Autor: Themistocles M. Rassias
Publikováno v: Journal of Mathematical Analysis and Applications. (2):352-378
In the present paper we study the problem of S. M. Ulam for approximately multiplicative mappings and we consider new open problems.
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d32f08808b9df5b1cc2286a4996bb3c6
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje