Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "strong" wg kryterium: Wszystkie pola

  Lista filtrów

Dostawca treści

Podbaza

Wyrównaj
Wyświetlanie 1-15 z 584
Tytuł:
The Vietoris system in strong shape and strong homology
Autorzy:
Günther, Bernd
Powiązania:
https://bibliotekanauki.pl/articles/1214990.pdf
Data publikacji:
1992
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
vietoris nerve
Steenrod homotopy category
strong shape theory
strong homology
compact supports
Opis:
We show that the Vietoris system of a space is isomorphic to a strong expansion of that space in the Steenrod homotopy category, and from this we derive a simple description of strong homology. It is proved that in ZFC strong homology does not have compact supports, and that enforcing compact supports by taking limits leads to a homology functor that does not factor over the strong shape category. For compact Hausdorff spaces strong homology is proved to be isomorphic to Massey's homology.
Źródło:
Fundamenta Mathematicae; 1992, 141, 2; 147-168
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Coherent and strong expansions of spaces coincide
Autorzy:
Mardešić, Sibe
Powiązania:
https://bibliotekanauki.pl/articles/1205303.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
coherent expansion
coherent homotopy
inverse system
strong expansion
strong shape
Opis:
In the existing literature there are several constructions of the strong shape category of topological spaces. In the one due to Yu. T. Lisitsa and S. Mardešić [LM1-3] an essential role is played by coherent polyhedral (ANR) expansions of spaces. Such expansions always exist, because every space admits a polyhedral resolution, resolutions are strong expansions and strong expansions are always coherent. The purpose of this paper is to prove that conversely, every coherent polyhedral (ANR) expansion is a strong expansion. This result is obtained by showing that a mapping of a space into a system, which is coherently dominated by a strong expansion, is itself a strong expansion.
Źródło:
Fundamenta Mathematicae; 1998, 158, 1; 69-80
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pointwise strong and very strong approximation by matrix means of Fourier series
Autorzy:
Łenski, Włodzimierz
Szal, Bogdan
Powiązania:
https://bibliotekanauki.pl/articles/745813.pdf
Data publikacji:
2008
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Strong and very strong approximation
Rate of pointwise summability
Matrix means
Opis:
We generalize and extend the some results of the paper [6]. Considering a wider class of function and more general means we obtain the results of the V. Totik type [8, 9].
Źródło:
Commentationes Mathematicae; 2008, 48, 2
0373-8299
Pojawia się w:
Commentationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Concepts Arising from Strong Efficient Domination Number. Part I
Autorzy:
Meena, N.
Gayathri, A.
Powiązania:
https://bibliotekanauki.pl/articles/1030980.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
domination
strong efficient bondage number
strong efficient domination
Opis:
Let G=(V,E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v∈V(G),|N_s [v]∩S|=1.(|N_w [v]∩S|=1) , where N_s [v]={u∈V(G) ∶uv ∈E(G),deg〖u ≥degv 〗 }. (N_w [v]={u∈V(G) ∶uv ∈E(G), degv ≥degu The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient dominating set of G and is denoted by γ_se (G) (γ_we (G)). A graph G is strong efficient if there exists a strong efficient dominating set of G. The strong efficient bondage number b_se (G) of a non empty graph G is the minimum cardinality among all sets of edges X⊆E such that γ_se (G-X)>γ_se (G). In this paper, the strong efficient bondage number of some path related graphs and some special graphs are studied.
Źródło:
World Scientific News; 2020, 145; 342-353
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Strong Efficient Co-Bondage Number of Some Graphs
Autorzy:
Meena, N.
Vignesh, M. Madhan
Powiązania:
https://bibliotekanauki.pl/articles/1030836.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
domination
strong efficient co-bondage number
strong efficient domination
Opis:
Let G = (V, E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v ∈ V(G), |N_s [v]∩ S|=1. (|N_w [v]∩ S|=1), where N_s (v) = {u ∈V(G) : uv∈ E(G), deg u ≥ deg v}. (N_w (v) = {u ∈V(G) : uv∈ E(G), deg v ≥ deg u}). The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and is denoted by γ_se(G) (γ_we(G)). A graph G is strong efficient if there exists a strong efficient dominating set of G. The strong efficient co-bondage number 〖bc〗_se(G) is the maximum cardinality of all sets of edges X ⊆ E such that γ_se (G+X) γ_se(G). In this paper, the strong efficient co-bondage number of some standard graphs and some special graphs are determined.
Źródło:
World Scientific News; 2020, 145; 234-244
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Concepts Arising from Strong Efficient Domination Number. Part II
Autorzy:
Meena, N.
Priyanka, G. Jeba
Powiązania:
https://bibliotekanauki.pl/articles/1031591.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Domination
strong efficient domination
strong efficient non bondage number
Opis:
Let G = (V,E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v∈V(G),|N_s [v]∩S|=1.( |N_w [v]∩S|=1), where〖 N〗_s (v)={u∈V(G):uv∈E(G),degu≥degv}(N_w (v){u∈V(G),uv∈E(G),degv≥degu}. The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and denoted by γ_se (G)(γ_we (G)). The strong efficient non bondage number b_sen (G) is the maximum cardinality of all sets of edge X⊆E such that γ_se (G-X) = γ_se (G). In this paper, the strong efficient non bondage number of some corona related graphs are studied.
Źródło:
World Scientific News; 2020, 146; 22-35
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Concepts Arising from Strong Efficient Domination Number. Part – III
Autorzy:
Vignesh, M. Madhan
Meena, N.
Powiązania:
https://bibliotekanauki.pl/articles/1031631.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
domination
strong efficient co-bondage number
strong efficient domination
Opis:
Let G = (V, E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v ∈ V(G), |N_s[] ∩ S|=1. (|N_w [] ∩ S|=1), where N_s () = {u ∈V(G) : uv ∈ E(G), deg u ≥ deg v}. (N_w () = {u ∈V(G) : uv ∈ E(G), deg v ≥ deg u}). The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and is denoted by γ_se(G) (γ_we(G)). A graph G is strong efficient if there exists a strong efficient dominating set of G. The strong efficient co-bondage number (G) is the maximum cardinality of all sets of edges X ⊆ E such that γ_se( + ) ≤ γ_se(G). In this paper, further results on strong efficient co-bondage number of some special graphs are determined.
Źródło:
World Scientific News; 2020, 146; 110-120
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Strong covering without squares
Autorzy:
Shelah, Saharon
Powiązania:
https://bibliotekanauki.pl/articles/1204997.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
set theory
covering
strong covering lemma
pcf theory
Opis:
Let W be an inner model of ZFC. Let κ be a cardinal in V. We say that κ-covering holds between V and W iff for all X ∈ V with X ⊆ ON and V ⊨ |X| < κ, there exists Y ∈ W such that X ⊆ Y ⊆ ON and V ⊨ |Y| < κ. Strong κ-covering holds between V and W iff for every structure M ∈ V for some countable first-order language whose underlying set is some ordinal λ, and every X ∈ V with X ⊆ λ and V ⊨ |X| < κ, there is Y ∈ W such that X ⊆ Y ≺ M and V ⊨ |Y| < κ.
  We prove that if κ is V-regular, $κ^+_V = κ^+_W$, and we have both κ-covering and $κ^+$-covering between W and V, then strong κ-covering holds. Next we show that we can drop the assumption of $κ^+$-covering at the expense of assuming some more absoluteness of cardinals and cofinalities between W and V, and that we can drop the assumption that $κ^+_W = κ^+_V$ and weaken the $κ^+$-covering assumption at the expense of assuming some structural facts about W (the existence of certain square sequences).
Źródło:
Fundamenta Mathematicae; 2000, 166, 1-2; 87-107
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Strong and weak solutions to stochastic inclusions
Autorzy:
Kisielewicz, Michał
Powiązania:
https://bibliotekanauki.pl/articles/1359674.pdf
Data publikacji:
1995
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
strong and weak solutions
stochastic inclusions
Opis:
Existence of strong and weak solutions to stochastic inclusions $x_{t} - x_{s} ∈ ∫^{t}_{s} F_{τ}(x_{τ})dτ + ∫^{t}_{s} G_{τ}(x_{τ})dw_{τ} + ∫^{t}_{s} ∫_{ℝ^{n}} H_{τ,z}(x_{τ})q(dτ,dz)$ and $x_{t} - x_{s} ∈ ∫^{t}_{s} F_{τ}(x_{τ})dτ + ∫^{t}_{s}G_{τ}(x_{τ})dw_{τ} + ∫^{t}_{s}∫_{|z|≤1} H_{τ,z}(x_{τ})q(dτ,dz) + ∫^{t}_{s}∫_{|z|>1} H_{τ,z}(x_{τ})p(dτ,dz)$, where p and q are certain random measures, is considered.
Źródło:
Banach Center Publications; 1995, 32, 1; 277-286
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Upper Bounds for the Strong Chromatic Index of Halin Graphs
Autorzy:
Hu, Ziyu
Lih, Ko-Wei
Liu, Daphne Der-Fen
Powiązania:
https://bibliotekanauki.pl/articles/16647759.pdf
Data publikacji:
2018-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
strong edge-coloring
strong chromatic index
Halin graphs
Opis:
The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2. We construct a Halin graph G by drawing T on the plane and then drawing a cycle C connecting all its leaves in such a way that C forms the boundary of the unbounded face. We call T the characteristic tree of G. Let G denote a Halin graph with maximum degree Δ and characteristic tree T. We prove that χ′s(G) ⩽ 2Δ + 1 when Δ ⩾ 4. In addition, we show that if Δ = 4 and G is not a wheel, then χ′s(G) ⩽ χ′s(T) + 2. A similar result for Δ = 3 was established by Lih and Liu [21].
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 1; 5-26
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wiener index of strong product of graphs
Autorzy:
Peterin, I.
Zigert-Pletersek, P.
Powiązania:
https://bibliotekanauki.pl/articles/255704.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Wiener index
graph product
strong product
Opis:
The Wiener index of a connected graph G is the sum of distances between all pairs of vertices of G. The strong product is one of the four most investigated graph products. In this paper the general formula for the Wiener index of the strong product of connected graphs is given. The formula can be simplified if both factors are graphs with the constant eccentricity. Consequently, closed formulas for the Wiener index of the strong product of a connected graph G of constant eccentricity with a cycle are derived.
Źródło:
Opuscula Mathematica; 2018, 38, 1; 81-94
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Strong sequences and partition relations
Autorzy:
Jureczko, Joanna
Powiązania:
https://bibliotekanauki.pl/articles/744632.pdf
Data publikacji:
2017-12-01
Wydawca:
Uniwersytet Pedagogiczny im. Komisji Edukacji Narodowej w Krakowie
Tematy:
Strong sequences
Erdös-Rado theorem
partition relations
inaccessible cardinals
singular cardinals
Opis:
The first result in partition relations topic belongs to Ramsey (1930). Since that this topic has been still explored. Probably the most famous partition theorem is Erdös-Rado theorem (1956). On the other hand in 60’s of the last century Efimov introduced strong sequences method, which was used for proving some famous theorems in dyadic spaces. The aim of this paper is to generalize theorem on strong sequences and to show that it is equivalent to generalized version of well-known Erdös-Rado theorem. It will be also shown that this equivalence holds for singulars. Some applications and conclusions will be presented too.
Źródło:
Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica; 2017, 16
2300-133X
Pojawia się w:
Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Review of the monograph entitled Strong Families – Strong Societies Elżbieta Osewska (Ed.) Kraków 2019, pp. 243
Autorzy:
Mąkosa, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/668555.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Papieski Jana Pawła II w Krakowie
Źródło:
The Person and the Challenges. The Journal of Theology, Education, Canon Law and Social Studies Inspired by Pope John Paul II; 2019, 9, 1
2391-6559
2083-8018
Pojawia się w:
The Person and the Challenges. The Journal of Theology, Education, Canon Law and Social Studies Inspired by Pope John Paul II
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Strong continuity of semigroup homomorphisms
Autorzy:
Basit, Bolis
Pryde, A.
Powiązania:
https://bibliotekanauki.pl/articles/1217352.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
representation
semigroup homomorphism
weak continuity
strong continuity
Lipschitz map
Opis:
Let J be an abelian topological semigroup and C a subset of a Banach space X. Let L(X) be the space of bounded linear operators on X and Lip(C) the space of Lipschitz functions ⨍: C → C. We exhibit a large class of semigroups J for which every weakly continuous semigroup homomorphism T: J → L(X) is necessarily strongly continuous. Similar results are obtained for weakly continuous homomorphisms T: J → Lip(C) and for strongly measurable homomorphisms T: J → L(X).
Źródło:
Studia Mathematica; 1999, 132, 1; 71-78
0039-3223
Pojawia się w:
Studia Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 584

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies