Filtry
wszystkich: 643
-
Katalog
Wyniki wyszukiwania dla: mathematica
-
The work of Professor Andrzej Lasota on asymptotic stability and recent progress
PublikacjaPraca poświęcona jest wkładowi Profesora Andrzeja Lasoty w teorię asymptotycznej stabilności iteracji operatorów stochastycznych na przestrzeni ostatnich 36 lat. Podkreślono aplikacyjny charakter wyników, pokazując stosowne przykłady z modelowania rozwoju komórki, optymalizacji wierceń geologicznych i ewolucji modeli kwantowych.
-
Lower bound on the distance k-domination number of a tree
PublikacjaW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
Path components of the space of gradient vector fields on the two-dimensional disc
Publikacja -
Quadrtic convergence of monotone iterations of differential-algebraic equations
PublikacjaZastosowano tu metodę quazilinearyzacji do równań różniczkowo-algebraicznych z warunkiem początkowym. Pokazano, że odpowiednie iteracje monotoniczne są zbieżne do jedynego rozwiązania.
-
On domination multisubdivision number of unicyclic graphs
PublikacjaThe paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...
-
Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
PublikacjaA team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...
-
Graphs with equal domination and certified domination numbers
PublikacjaA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
All graphs with paired-domination number two less than their order
PublikacjaLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Path components of the space of gradient vector fields on the two dimensional disc
PublikacjaWe present a short proof that if two gradient maps on the twodimensional disc have the same degree, then they are gradient homotopic.
-
Difference functional inequalities and applications.
PublikacjaThe paper deals with the difference inequalities generated by initial boundary value problems for hyperbolic nonlinear differential functional systems. We apply this result to investigate the stability of constructed difference schemes. The proof of the convergence of the difference method is based on the comparison technique, and the result for difference functional inequalities is used. Numerical examples are presented.
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublikacjaGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
SOME CONVERGENCE PROPERTIES OF THE SUM OF GAUSSIAN FUNCTIONALS
PublikacjaIn the paper, some aspects of the convergence of series of dependent Gaussian sequences problem are solved. The necessary and sufficient conditions for the convergence of series of centered dependent indicators are obtained. Some strong convergence results for weighted sums of Gaussian functionals are discussed.
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublikacjaWe consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...
-
Hat problem on a graph
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
On the hat problem on a graph
PublikacjaThe topic of this paper is the hat problem in which each of n players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning....
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
Double bondage in graphs
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
Rothe’s method for physiologically structured models with diffusion
PublikacjaWe consider structured population models with diffusion and dynamic boundary conditions. The respective approximation, called Rothe’s method, produces positive and exponentially bounded solutions. Its solutions converge to the exact solution of the original PDE.
-
The paired-domination and the upper paired-domination numbers of graphs
PublikacjaIn this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.
-
Critical Case Stochastic Phylogenetic Tree Model via the Laplace Transform
PublikacjaBirth–and–death models are now a common mathematical tool to describe branching patterns observed in real–world phylogenetic trees. Liggett and Schinazi (2009) is one such example. The authors propose a simple birth–and–death model that is compatible with phylogenetic trees of both influenza and HIV, depending on the birth rate parameter. An interesting special case of this model is the critical case where the birth rate equals the...
-
NP-completeness of convex and weakly convex domiating set decision problems.
PublikacjaLiczby dominowania wypukłego i słabo wypukłego są nowymi rodzajami liczb dominowania. W tym artykule pokazujemy, że problemy decyzyjne dominowania wypukłegi i słabo wypukłego są NP-zupełne w przypadku grafów dwudzielnych oraz split grafów. Posługując się zmodyfikowanym algorytmem Washalla możemy w czasie wielomianowym określić, czy dany podzbiór wierzchołków grafu jest spójny bądź słabo spójny.
-
Applicationes Mathematicae
Czasopisma -
Mathematical Statistics (2022/23)
Kursy OnlineMathematical Statistics - Data Engineering - Karol Flisikowski - winter semester 2022/23
-
Mathematical Statistics (2023/24)
Kursy OnlineMathematical Statistics - Data Engineering - prof. Karol Flisikowski - winter semester 2023/24
-
Mathematical Statistics 2024/25
Kursy OnlineMathematical Statistics - Data Engineering - prof. Karol Flisikowski - winter semester 2024/25
-
Pantographic metamaterials: an example of mathematically driven design and of its technological challenges
PublikacjaIn this paper, we account for the research efforts that have been started, for some among us, already since 2003, and aimed to the design of a class of exotic architectured, optimized (meta) materials. At the first stage of these efforts, as it often happens, the research was based on the results of mathematical investigations. The problem to be solved was stated as follows: determine the material (micro)structure governed by those...
-
Descriptive & mathematical statistics 2019
Kursy OnlineDescriptive Statistics for Data Engineering 2019
-
[ILiT, IŚGiE] Mathematical methods in engineering
Kursy Online{mlang pl} Dyscyplina: ILiT, IŚGiE Zajęcia obowiązkowe dla doktorantów I roku Prowadzący: P. Kłosowski Liczba godzin: 15 Forma zajęć: wykład {mlang} {mlang en} Discipline: ILiT, IŚGiE Obligatory course for 1st-year PhD students Academic teacher: P. Kłosowski Total hours of training: 15 teaching hours Course type: lecture {mlang}
-
[ILiT, IŚGiE] Mathematical methods in engineering
Kursy Online{mlang pl} Dyscyplina: inżynieria lądowa i transport; inżynieria środowiska, górnictwo i energetyka Zajęcia obowiązkowe dla doktorantów I i II roku Prowadzący: dr inż. Roger Sauer, prof. PG Liczba godzin: 15 Forma zajęć: wykład {mlang} {mlang en} Discipline: civil engineering and transport; environmental engineering, mining and power engineering Obligatory course for 1st and 2nd-year PhD students Academic teacher: dr...
-
Mathematical Methods in Engineering 2023/2024
Kursy OnlineJest to pomocnicza formatka do tworzenia kursów wspomagających nauczanie stacjonarne na WILiŚ. Formatka została utworzona i udostępniona przez CNE. Uwaga: W celu wykorzystania i modyfikacji należy: 1) skopiować kurs wzorcowy 2) dopiero w kopii nanosić zmiany.
-
Numerical-analytic methods for differential-algebraic systems
PublikacjaMetodę numeryczno-analityczną połączoną z metodą porównawczą zastosowano do układów równań różniczkowo-algebraicznych z linowymi warunkami brzegowymi otrzymując warunki dostateczne na istnienie rozwiązania. O prawych stronach zagadnienia zakładano warunek Lipschitza. Otrzymano oszacowania błędów. Problem z odchylonymi argumentami był również przedmiotem rozważań tej pracy.
-
A comparison method for ordinary differential systems
PublikacjaPraca dotyczy problemów istnienia i jednoznaczności rozwiązań oraz ciągłej zależności dla układów równań różniczkowych w tym i z opóźnionymi argumentami z warunkami początkowymi oraz brzegowymi typu okresowego. Przy odpowiednich założeniach, stosując teorię nierówności różniczkowych, pokazano, że odpowiednia funkcja porównawcza może być ujemna, co ma istotne znaczenie w dalszych badaniach. Pokazano, że konstruowany ciąg iteracji...
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublikacjaA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...
-
Nordhaus-Gaddum results for the convex domination number of a graph
PublikacjaPraca dotyczy nierówności typu Nordhausa-Gadduma dla dominowania wypukłego.
-
FUNDAMENTA MATHEMATICAE
Czasopisma -
ACTA SCIENTIARUM MATHEMATICARUM
Czasopisma -
Commentationes Mathematicae
Czasopisma -
Dynamics of a simplified HPT model in relation to 24h TSH profiles
PublikacjaWe propose a simplified mathematical model of the hypothalamus-pituitary-thyroid (HPT) axis in an endocrine system. The considered model is a modification of the model proposed by Mukhopadhyay and Bhattacharyya in [10]. Our system of delay differential equations reconstructs the HPT axis in relation to 24h profiles of human in physiological conditions. Homeostatic control of the thyroid-pituitary axis is considered by using...
-
O Centrum Zastosowań Matematyki
PublikacjaCentrum Zastosowań Matematyki to projekt realizowany w ramach Programu Operacyjnego Kapitał Ludzki wyłoniony w drodze konkursu zorganizowanego przez Narodowe Centrum Badań i Rozwoju.
-
Efficient quadrature for fast oscillating integralof paraxial optics
PublikacjaThe study concerns the determination of quadrature for the integral solutionof the paraxial wave equation. The difficulty in computation of the integral isassociated with the rapid change of the integrand phase. The developed quadraturetakes into account the fast oscillating character of the integrand. The presentedmethod is an alternative to the commonly used methods based on the use of theFourier transform. The determination...
-
Weighted difference schemes for systems of quasilinear first order partial functional differential equations
PublikacjaThe paper deals with initial boundary value problems of the Dirichlet type for system of quasilinear functional differential equations. We investigate weighted difference methods for these problems. A complete convergence analysis of the considered difference methods is given. Nonlinear estimates of the Perron type with respect to functional variables for given functions are assumed. The proof of the stability of difference problems...
-
Finite difference approximations for nonlinear first order partial differential equations
PublikacjaKlasyczne rozwiązania nieliniowych równań różniczkowych o pochodnych cząst-kowych pierwszego rzędu są aproksymowane za pomocą równań quasiliniowych uk-ładów równań różniczkowych. Dowód zbieżności wykorzystuje metody porównawcze
-
Dissertationes Mathematicae
Czasopisma -
Didactica Mathematicae
Czasopisma -
EXPOSITIONES MATHEMATICAE
Czasopisma -
Aequationes Mathematicae
Czasopisma -
Extracta Mathematicae
Czasopisma -
Quaestiones Mathematicae
Czasopisma