Wyszukiwarka
Katedra Rachunku Prawdopodobieństwa i Biomatematyki
Publikacje
Filtry
wszystkich: 101
Katalog Publikacji
Rok 2021
-
On asymptotic periodicity of kernel double Markovian operators
PublikacjaIt is proved that a kernel, doubly Markovian operator T is asymptotically periodic if and only if its deterministic σ-field Σd(T)(equivalently Σd(T∗)) is finite. It follows that kernel doubly Markovian operator T is asymptotically periodic if and only if T∗ is asymptotically periodic.
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
Rok 2020
-
A Measurable Selector in Kadison’s Carpenter’s Theorem
PublikacjaWe show the existence of a measurable selector in Carpenter’s Theorem due to Kadison. This solves a problem posed by Jasper and the first author in an earlier work. As an application we obtain a characterization of all possible spectral functions of shift-invariant subspaces of L 2 (R d ) and Carpenter’s Theorem for type I ∞ von Neumann algebras.
-
Association of Genes Related to Oxidative Stress with the Extent of Coronary Atherosclerosis
PublikacjaOxidative stress is believed to play a critical role in atherosclerosis initiation and progression. In line with this, in a group of 1099 subjects, we determined eight single nucleotide polymorphisms (SNPs) related to oxidative stress (PON1 c.575A>G, MPO c.463G>A, SOD2 c.47T>C, GCLM c.590C>T, NOS3 c.894G>T, NOS3 c.786T>C, CYBA c.214C>T, and CYBA c.932A>G) and assessed the extent of atherosclerosis in coronary arteries based on...
-
Certified domination
PublikacjaImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Homoclinics for singular strong force Lagrangian systems
PublikacjaWe study the existence of homoclinic solutions for a class of generalized Lagrangian systems in the plane, with a C1-smooth potential with a single well of infinite depth at a point ξ and a unique strict global maximum 0 at the origin.Under a strong force condition around the singular point ξ, via minimization of an action integral, we will prove the existence of at least two geometrically distinct homoclinic solutions.
-
On the Existence of Homoclinic Type Solutions of a Class of Inhomogenous Second Order Hamiltonian Systems
PublikacjaWe show the existence of homoclinic type solutions of a class of inhomogenous second order Hamiltonian systems, where a C1-smooth potential satisfies a relaxed superquadratic growth condition, its gradient is bounded in the time variable, and a forcing term is sufficiently small in the space of square integrable functions. The idea of our proof is to approximate the original system by time-periodic ones, with larger and larger...
-
Reconfiguring Minimum Dominating Sets in Trees
PublikacjaWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
Rok 2019
-
Domination subdivision and domination multisubdivision numbers of graphs
PublikacjaThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Folate/homocysteine metabolism and lung cancer risk among smokers
PublikacjaBackground: Folate and homocysteine are involved in DNA synthesis and methylation processes, which are deregulated during carcinogenesis. Objectives: The aim of this study was to assess the relationship between folate/homocysteine concentrations, the functional polymorphisms of folate/homocysteine genes and lung cancer risk among cigarette smokers. Study design: The study included 132 lung cancer patients and 396 controls from...
-
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...
-
On the super domination number of lexicographic product graphs
PublikacjaThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Result of the 6-min walk test is an independent prognostic factor of surgically treated non-small-cell lung cancer
PublikacjaPathological tumour, node and metastasis (TNM) stage remains the most significant prognostic factor of non-small-cell lung cancer (NSCLC). Meanwhile, age, gender, pulmonary function tests, the extent of surgical resection and the presence of concomitant diseases are commonly used to complete the prognostic profile of the patient with early stage of NSCLC. The aim of this study is to assess how the result of a 6-min walk test (6MWT)...
-
Subharmonic solutions for a class of Lagrangian systems
PublikacjaWe prove that second order Hamiltonian systems with a potential of class C1, periodic in time and superquadratic at infinity with respect to the space variable have subharmonic solutions. Our intention is to generalise a result on subharmonics for Hamiltonian systems with a potential satisfying the global Ambrosetti-Rabinowitz condition from [P. H. Rabinowitz, Proc. Roy. Soc. Edinburgh Sect. A, 114 (1990), 33-38]. Indeed, we weaken...
-
The Maslov index and the spectral flow—revisited
PublikacjaWe give an elementary proof of a celebrated theorem of Cappell, Lee and Miller which relates the Maslov index of a pair of paths of Lagrangian subspaces to the spectral flow of an associated path of self-adjoint first-order operators. We particularly pay attention to the continuity of the latter path of operators, where we consider the gap-metric on the set of all closed operators on a Hilbert space. Finally, we obtain from Cappell,...
-
Weak Stability of Centred Quadratic Stochastic Operators
PublikacjaWe consider the weak convergence of iterates of so-called centred quadratic stochastic operators. These iterations allow us to study the discrete time evolution of probability distributions of vector-valued traits in populations of inbreeding or hermaphroditic species, whenever the offspring’s trait is equal to an additively perturbed arithmetic mean of the parents’ traits. It is shown that for the existence of a weak limit, it...
-
Weakly connected Roman domination in graphs
PublikacjaA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
Rok 2018
-
Bifurcation of equilibrium forms of an elastic rod on a two-parameter Winkler foundation
PublikacjaWe consider two-parameter bifurcation of equilibrium states of an elastic rod on a deformable foundation. Our main theorem shows that bifurcation occurs if and only if the linearization of our problem has nontrivial solutions. In fact our proof, based on the concept of the Brouwer degree, gives more, namely that from each bifurcation point there branches off a continuum of solutions.
-
Comprehensive stabilization of all streams of solid residues formed during sewage sludge thermal treatment – Case study
PublikacjaModern wastewater treatment plants are currently struggling with the problem of processing and ecological management of sewage sludge. Thermal utilization is a frequently used practice of excess sludge utilization especially in large wastewater treatment plants, which seems to be a quite promising concept. However, during thermal treatment, fractions of ashes and dusts are generated. Such wastes, especially the dust fraction, can...
-
Coronas and Domination Subdivision Number of a Graph
PublikacjaIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.
-
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...
-
Prevalence Problem in the Set of Quadratic Stochastic Operators Acting on L1
PublikacjaThis paper is devoted to the study of the problem of prevalence in the class of quadratic stochastic operators acting on the L1 space for the uniform topology. We obtain that the set of norm quasi-mixing quadratic stochastic operators is a dense and open set in the topology induced by a very natural metric. This shows the typical long-term behaviour of iterates of quadratic stochastic operators.
-
Quadratic stochastic operators on Banach lattices
PublikacjaWe study the convergence of iterates of quadratic stochastic operators that are mean monotonic. They are defined on the convex set of probability measures concentrated on a weakly compact order interval S = [0, f] of a fixed Banach lattice F. We study their regularity and identify the limits of trajectories either as the “infimum” or “supremum” of the support of initial distributions.
-
Total domination in versus paired-domination in regular graphs
PublikacjaA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
Rok 2017
-
A Noether theorem for stochastic operators on Schatten classes
PublikacjaWe prove that a stochastic (Markov) operator S acting on a Schatten class C_1 satisfies the Noether condition S'(A) = A and S'(A^2) = A^2, where A is a Hermitian bounded linear operator on a complex Hilbert space H, if and only if, S(E(G)XE(G)) = E(G)S(X)E(G) holds true for every Borel subset G of the real line R, where E(G) denotes the orthogonal projection coming from the spectral resolution of A. Similar results are obtained...
-
A note on a Wiener-Wintner theorem for mean ergodic Markov amenable semigroups
PublikacjaWe prove a Wiener-Wintner ergodic type theorem for a Markov representation of a right amenable semitopological semigroup.
-
Interval incidence coloring of subcubic graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
Inżynier: wiedza, technika, technologia
PublikacjaNa prestiż zawodu inżyniera pracowali wybitni inżynierowie współpracujący z biznesmenami obdarzonymi wy¬obraźnią. Kształcąc przyszłych inżynierów z zastosowaniem e tech¬nologii warto wiedzieć na czym polega unikalność kształcenia inżynierów i czy stosowanie e-technologii może nam w tym pomóc. Pomóc utrzymać prestiż tego zawodu. W pracy przed¬stawiono najważniejsze zadania inżyniera i zestawiono je z ocze¬kiwaniami wyrażonymi w...
-
On the existence of homoclinic type solutions of inhomogenous Lagrangian systems
PublikacjaWe study the existence of homoclinic type solutions for a class of inhomogenous Lagrangian systems with a potential satisfying the Ambrosetti-Rabinowitz superquadratic growth condition and a square integrable forcing term. A homoclinic type solution is obtained as a limit of periodic solutions of an approximative sequence of second order differential equations.
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Stabilization of Solid Residues Obtained During Sewage Sludge Thermal Treatment
PublikacjaCurrently wastewater treatment plants are still dealing with the problem of ecological management of sewage sludge. Nowadays, thermal utilization is considered the most eco-friendly way of processing excess sludge. However, during mentioned process, fractions of ashes and dusts are generated. Such wastes, especially dusts fraction, can be potentially harmful for the environment and wastes should be stabilized before further management....
-
Szeregowanie zadań dwuprocesorowych w systemach otwartych
PublikacjaW pracy rozważany jest problem szeregowania zadań dwuoperacyjnych w systemie otwartym (open-shop), z kryterium minimalizacji długości harmonogramu oraz sumy czasów zakończenia wszystkich zadań. Zakładając jednostkowe czasy wykonywania operacji można stosować efektywne metody chromatyczne rozwiązywania problemu, poprzez sprowadzenie go do modelu grafowego oraz zastosowanie w nim wybranego modelu kolorowania, które pozwala uzyskać...
Rok 2016
-
Changes in gene methylation patterns in neonatal murine hearts: Implications for the regenerative potential
PublikacjaBackground The neonatal murine heart is able to regenerate after severe injury; this capacity however, quickly diminishes and it is lost within the first week of life. DNA methylation is an epigenetic mechanism which plays a crucial role in development and gene expression regulation. Under investigation here are the changes in DNA methylation and gene expression patterns which accompany the loss of regenerative potential. Results The...
-
Crystallization of space: Space-time fractals from fractal arithmetic
PublikacjaFractals such as the Cantor set can be equipped with intrinsic arithmetic operations (addition, subtraction, multiplication, division) that map the fractal into itself. The arithmetics allows one to define calculus and algebra intrinsic to the fractal in question, and one can formulate classical and quantum physics within the fractal set. In particular, fractals in space-time can be generated by means of homogeneous spaces associated...
-
Domination-Related Parameters in Rooted Product Graphs
PublikacjaAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.
-
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...
-
Fourier transforms on Cantor sets: A study in non-Diophantine arithmetic and calculus
PublikacjaFractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration, and complex structure. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has all the required basic properties. As an example we discuss a sawtooth signal on the ternary middle-third Cantor set. The formalism works also for fractals that are not self-similar.
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Markov Model of Disease Development and Recovery
PublikacjaMarkov models are commonly used to simulate diseases and allow modeling of multiple health states and outcomes. Starting with the well known Le Bras multistate model (cascading failure model) with time-independent transitions we will see how simple Markov mortality models may be pressed into the service of survival and event history analysis. We will focus on more complex models which will be able to take into account remission,...
-
Some variations of perfect graphs
PublikacjaWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
The convex domination subdivision number of a graph
PublikacjaLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
Weakly convex and convex domination numbers of some products of graphs
PublikacjaIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Weakly convex domination subdivision number of a graph
PublikacjaA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
Rok 2015
-
Asymptotic properties of quadratic stochastic operators acting on the L1 space
PublikacjaQuadratic stochastic operators can exhibit a wide variety of asymptotic behaviours and these have been introduced and studied recently in the ℓ1 space. It turns out that in principle most of the results can be carried over to the L1 space. However, due to topological properties of this space one has to restrict in some situations to kernel quadratic stochastic operators. In this article we study the uniform and strong asymptotic...
-
Homoclinic and Heteroclinic Orbits for a Class of Singular Planar Newtonian Systems
PublikacjaThe study of existence and multiplicity of solutions of differential equations possessing a variational nature is a problem of great meaning since most of them derives from mechanics and physics. In particular, this relates to Hamiltonian systems including Newtonian ones. During the past thirty years there has been a great deal of progress in the use of variational methods to find periodic, homoclinic and heteroclinic solutions...
-
INFLUENCE OF A VERTEX REMOVING ON THE CONNECTED DOMINATION NUMBER – APPLICATION TO AD-HOC WIRELESS NETWORKS
PublikacjaA minimum connected dominating set (MCDS) can be used as virtual backbone in ad-hoc wireless networks for efficient routing and broadcasting tasks. To find the MCDS is an NP- complete problem even in unit disk graphs. Many suboptimal algorithms are reported in the literature to find the MCDS using local information instead to use global network knowledge, achieving an important reduction in complexity. Since a wireless network...
-
On Von Karman Equations and the Buckling of a Thin Circular Elastic Plate
PublikacjaWe shall be concerned with the buckling of a thin circular elastic plate simply supported along a boundary, subjected to a radial compressive load uniformly distributed along its boundary. One of the main engineering concerns is to reduce deformations of plate structures. It is well known that von Karman equations provide an established model that describes nonlinear deformations of elastic plates. Our approach to study plate deformations...
-
On-line Ramsey Numbers of Paths and Cycles
PublikacjaConsider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some fixed graphs $G$ and $H$. The minimum number of rounds within which Builder can win, assuming both players play perfectly, is the \emph{on-line Ramsey number} $\tilde{r}(G,H)$. In...
-
Subcritical bifurcation of free elastic shell of biological cluster
PublikacjaIn this paper we will investigate symmetry-breaking bifurcation of equilibrium forms of biological cluster. A biological cluster is a two-dimensional analogue of a gas balloon. The cluster boundary is connected with its kernel by elastic links. The inside part is filled with compressed gas or fluid. Equilibrium forms of biological cluster can be found as solutions of a certain second order ordinary functional-differential equation...
-
Super Dominating Sets in Graphs
PublikacjaIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
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.
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublikacjaThe domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...
Rok 2014
-
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...
-
Approximative sequences and almost homoclinic solutions for a class of second order perturbed Hamiltonian systems
PublikacjaIn this work we will consider a class of second order perturbed Hamiltonian systems with a superquadratic growth condition on a time periodic potential and a small aperiodic forcing term. To get an almost homoclinic solution we approximate the original system by time periodic ones with larger and larger time periods. These approximative systems admit periodic solutions, and an almost homoclinic solution for the original system...
-
Bondage number of grid graphs
PublikacjaThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
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...
-
Geometrical versus analytical approach in problem solving- an exploatory study
PublikacjaAbstract. In this study we analyse the geometrical visualization as a part of the process of solution. In total 263 students in the first year of study at three different universities in three different countries (Poland, Slovakia and Spain) were asked to solve four mathematical problems. The analysis of the results of all students showed that geometrical visualization for problems where there is a possibility to choose different ways...
-
LICZBA PODZIAŁOWA DLA DOMINOWANIA W GRAFACH
PublikacjaW PRACY ROZWAŻAMY 6 RODZAJÓW ZBIORÓW DOMINUJĄCYCH ORAZ LICZB ZWIĄZANYCH Z TYMI ZBIORAMI: KLASYCZNĄ LICZBĘ DOMINOWANIA, LICZBĘ DOMINOWANIA TOTALNEGO, PARAMI, SŁABO-SPÓJNEGO, 2-DOMINOWANIA I DOMINOWANIA WYPUKŁEGO. W PRACY ROZWAŻAMY WPŁYW TRZECH OPERACJI NA KRAWĘDZIE GRAFU: USUWANIE KRAWĘDZI Z GRAFU, JEDNOKROTNY PODZIAŁ PEWNEJ LICZBY KRAWĘDZI I PODZIAŁ WIELOKROTNY JEDNEJ KRAWĘDZI. BADAMY ZWIĄZKI TYCH OPERACJI Z ROZWAŻANYMI LICZBAMI...
-
Mieszanie w klasie niejednorodnych łańcuchów Markowa i kwadratowych operatorów stochastycznych
PublikacjaRozprawa doktorska poświęcona jest zagadnieniu asymptotycznych własności w klasie nieskończenie wymiarowych niejednorodnych łańcuchów Markowa z czasem dyskretnym oraz w klasie kwadratowych operatorów stochastycznych. W pierwszej kolejności definiowane są różne rodzaje asymptotycznego zachowania (mieszania) niejednorodnych łańcuchów Markowa odpowiadające zbieżności w normowej i mocnej topologii operatorowej oraz omówione są relacje...
-
On the partition dimension of trees
PublikacjaGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
Quantum structure in competing lizard communities
PublikacjaAlmost two decades of research on applications of the mathematical formalism of quantum theory as a modeling tool in domains different from the micro-world has given rise to many successful applications in situations related to human behavior and thought, more specifically in cognitive processes of decision-making and the ways concepts are combined into sentences. In this article, we extend this approach to animal behavior, showing...
-
Some Progress on Total Bondage in Graphs
PublikacjaThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
Symmetry-Breaking Bifurcation for Free Elastic Shell of Biological Cluster, Part 2
PublikacjaWe will be concerned with a two-dimensional mathematical model for a free elastic shell of biological cluster. The cluster boundary is connected with its kernel by elastic links. The inside part is filled with compressed gas or fluid. Equilibrium forms of the shell of biological cluster may be found as solutions of a certain nonlinear functional-differential equation with several physical parameters. For each multiparameter this...
-
Two families of infinitely many homoclinics for singular strong force Hamiltonian systems
PublikacjaWe are concerned with a planar autonomous Hamiltonian system with a potential possessing a single well of infinite depth at a point X and a unique strict global maximum 0 at a point A. Under a strong force condition around the singularity X, via minimization of an action integral and using a shadowing chain lemma together with simple geometrical arguments, we prove the existence of infinitely many geometrically distinct homoclinic...
Rok 2013
-
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...
-
On mixing in the class of quadratic stochastic operators
PublikacjaWe study different types of limit behavior of quadratic stochastic operators acting on ℓ^1 (or ℓ^1_d) spaces in both strong and uniform topologies. The main motif of the paper is to express the uniform and strong asymptotic stability of the quadratic stochastic operator in terms of convergence of the associated (linear) nonhomogeneous Markov chain. We also examine which type of uniform convergence of iterates of the quadratic...
-
Quadratic stochastic operators as a tool in modelling the dynamics of a distribution of a population trait
PublikacjaQuadratic stochastic operators can exhibit a wide variety of asymptotic behaviours and these have been introduced and studied recently. In the present work we discuss biological interpretations that can be attributed to them. We also propose a computer simulation method to illustrate the behaviour of iterates of quadratic stochastic operators.
-
Systems, environments, and soliton rate equations: A non-Kolmogorovian framework for population dynamics
PublikacjaSoliton rate equations are based on non-Kolmogorovian models of probability and naturally include autocatalytic processes. The formalism is not widely known but has great unexplored potential for applications to systems interacting with environments. Beginning with links of contextuality to non- Kolmogorovity we introduce the general formalism of soliton rate equations and work out explicit examples of subsystems interacting with...
-
Total restrained bondage in graphs
PublikacjaPodzbiór D zbioru wierzchołków grafu nazywamy zewnętrznie totalnym dominującym w grafie, jeśli każdy wierzchołek spoza D ma sąsiada zarówno w D jak i poza D. Moc najmniejszego zbioru o tej własności nazywamy liczbą dominowania zewnętrznie totalnego. W artykule badamy wpływ usuwania krawędzi na liczbę dominowania zewnętrznie totalnego, czyli liczbę zewnętrznego totalnego zniewolenie w grafach.
Rok 2012
-
Asymptotic behaviour in the set of nonhomogeneous chains of stochastic operators
PublikacjaWe study different types of asymptotic behaviour in the set of (infinite dimensional) nonhomogeneous chains of stochastic operators acting on L1(μ) spaces. In order to examine its structure we consider different norm and strong operator topologies. To describe the nature of the set of nonhomogeneous chains of Markov operators with a particular limit behaviour we use the category theorem of Baire. We show that the geometric structure...
-
Connecting orbits for a periodically forced singular planar Newtonian system
PublikacjaW niniejszym artykule badamy problem istnienia i krotności rozwiązań homoklinicznych i heteroklinicznych dla nieautonomicznych układów Newtonowskich na płaszczyźnie z potencjałem okresowym ze względu na zmienną czasową, mającym maksimum globalne właściwe przyjmowane w dwóch punktach płaszczyzny i punkt osobliwy (studnię nieskończonej głębokości), w otoczeniu którego potencjał spełnia warunek Gordona (gradient potencjału ze względu...
-
Homoclinic orbits for a class of singular second order Hamiltonian systems in R3
PublikacjaW niniejszym artykule rozważamy autonomiczny układ Hamiltonowski w 3-wymiarowej przestrzeni euklidesowej, z potencjałem osiągającym maksimum globalne właściwe równe zero w początku układu współrzędnych i mającym za zbiór punktów osobliwych prostą, która nie przechodzi przez początek układu. Przy założeniu, że potencjał spełnia pewien warunek zwartości w nieskończoności i warunek Gordona w otoczeniu prostej punktów osobliwych, stosując...
-
Homoclinic orbits for a class of singular second order Hamiltonian systems in ℝ3
PublikacjaWe consider a conservative second order Hamiltonian system \ddot{q}+ ∇V(q)=0 in R3 with a potential V having a global maximum at the origin and a line l ∩ {0} = ∅ as a set of singular points. Under a certain compactness condition on V at infinity and a strong force condition at singular points we study, by the use of variational methods and geometrical arguments, the existence of homoclinic solutions of the system.
-
Influence of edge subdivision on the convex domination number
PublikacjaWe study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.
-
Nordhaus-Gaddum results for the convex domination number of a graph
PublikacjaPraca dotyczy nierówności typu Nordhausa-Gadduma dla dominowania wypukłego.
-
The limit case of a domination property
PublikacjaPraca dotyczy dolnego ograniczenia liczby dominowania w grafach, ze względu na ilość wierzchołków oraz największą liczbę liści w drzewie spinającym.
-
The shadowing chain lemma for singular Hamiltonian systems involving strong forces
PublikacjaW niniejszym artykule rozważamy autonomiczny układ Hamiltonowski na płaszczyźnie z potencjałem, który ma punkt osobliwy (studnię nieskończonej głębokości) i maksimum globalne właściwe równe zero przyjmowane w dwóch różnych punktach płaszczyzny. Przy założeniu, że w otoczeniu punktu osobliwego potencjał spełnia warunek Gordona(gradient tego potencjału w otoczeniu punktu osobliwego jest tzw. silną siłą, ang. a strong force) dowodzimy...
-
Two almost homoclinic solutions for second-order perturbed Hamiltonian systems
PublikacjaW niniejszym artykule badamy problem istnienia rozwiązań prawie homoklinicznych (rozwiązań znikających w nieskończonościach) dla układów Hamiltonowskich drugiego rzędu (układów Newtonowskich) z zaburzeniem. Nasz wynik jest uogólnieniem twierdzenia Rabinowitza-Tanaki o istnieniu rozwiązania homoklinicznego dla układów bez zaburzenia [Math. Z. 206 (1991) 473-499]. O zaburzeniu zakładamy, że jest dostatecznie małe w przestrzeni funkcji...
Rok 2011
-
A note on total reinforcement in graphs
PublikacjaIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Convex universal fixers
PublikacjaPraca dotyczy dominowania wypukłego w grafach pryzmowych.
-
On quasi-compact Markov nets
PublikacjaAnalizuje się strukturę ergodyczną netów Markowa. W szczególności podano charakteryzację ściśle ergodycznych minimalnych (L-R) netów markowskich na zwartej przestrzeni fazowej. Uzyskano warunki równoważne quasi-zwartości (L-R) netów Markowa, rozszerzając tzw. ergodyczne twierdzenie Lotz'a.
-
On the metric dimension of corona product graphs
PublikacjaWe give several results on the metric dimension of corona product graphs.
-
On the mixing property and the ergodic principle for nonhomogeneous Markov chains
PublikacjaW pracy rozważane są różne typy zachowania granicznego nieskończenie wymiarowych niejednorodnych łańcuchów Markowa z czasem dyskretnym. Badana jest struktura geometryczna zbioru łańcuchów Markowa w normowej i mocnej topologii operatorowej.
-
Two examples of Quantum Dynamical Semigroups
PublikacjaThe Hamiltonians of the considered bi-partite systems are of the form $$ H_{S,R} = H_S /times 1_R + Q_{S} /times M_R + 1_S /times H_R $$ Subindex $S$ corresponds to the observed system and $R$ to the reservoir (the enviroment of $S$). Two classes of systems are distinguished: the discrete-continuous...
Rok 2010
-
A note on the weakly convex and convex domination numbers of a torus
PublikacjaW pracy określone są liczby liczby dominowania i dominowania wypukłego torusów, czyli iloczynów kartezjańskich dwóch cykli.
-
All graphs with restrained domination number three less than their order
PublikacjaW pracy opisana jest rodzina wszystkich grafów, dla których liczbadominowania zewnętrznego jest o trzy mniejsza od ich rzędu.
-
General solution of quantum mechanical equations of motion with time-dependent Hamiltonians: A Lie algebraic approach
PublikacjaThe unitary operators U(t), describing the quantum time evolution of systems with a time-dependent Hamiltonian, can be constructed in an explicit manner using the method of time-dependent invariants. We clarify the role of Lie-algebraic techniques in this context and elaborate the theory for SU(2) and SU(1,1). In these cases we give explicit formulae for obtaining general solutions from special ones. We show that the constructions...
-
Interpolation properties of domination parameters of a graph
PublikacjaAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
Nordhaus-Gaddum results for the weakly convex domination number of a graph
PublikacjaArtykuł dotyczy ograniczenia z góry i z dołu (ze względu na ilość wierzchołków) sumy i iloczynu liczb dominowania wypukłego grafu i jego dopełnienia.
-
Strong weakly connected domination subdivisible graphs
PublikacjaArtykuł dotyczy wpływu podziału krawędzi na liczbę dominowania słabo spójnego. Charakteryzujemy grafy dla których podział dowolnej krawędzi zmienia liczbę dominowania słabo spójnego oraz grafy dla których podział dowolnych dwóch krawędzi powoduje zmianę liczby dominowania słabo spójnego.
-
Survival time prognosis under a Markov model of cancer development
PublikacjaIn this study we look at a breast cancer data set of women from Pomerania region collected in year 1987-1992 in the Medical University of Gdańsk. We analyze the clinical risk factors in conjunction with Markov model of cancer development. We evaluate Artificial Neural Network (ANN) survival time prediction via a simulation study.
-
Total outer-connected domination in trees
PublikacjaW pracy przedstawiono dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego w grafach oraz scharakteryzowano wszystkie drzewa osiągające to ograniczenie.
Rok 2009
-
Planarność i zewnętrzna planarność grafów
PublikacjaNiech G będzie niepustym grafem prostym. Graf, który można przedstawić na płaszczyźnie w taki sposób, że żadne dwie krawędzie nie przecinają się nazywamy grafem płaskim, natomiast graf nazywamy planarnym, gdy jest on izomorficzny do grafu płaskiego. Jeśli dodatkowo wszystkie jego wierzchołki leżą na obszarze zewnętrznym, graf nazywamy zewnętrznie planarnym. Indeksem krawędziowym grafu G nazywamy najmniejsze k takie, że k-ty iterowany...
-
Relations between the domination parameters and the chromatic index of a graph
PublikacjaIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.
Rok 2007
-
Trees with equal restrained domination and total restrained domination numbers
PublikacjaW publikacji scharakteryzowano wszystkie drzewa, w których liczby dominowania powściągniętego oraz podwójnie totalnego są sobie równe.
Rok 2003
-
Analiza rozkładu prądu w celce do pomiaru parametrów elektrycznych - mode lMES.
PublikacjaPrzedstawiono analizę rozkładu prądu w celce do pomiarów elektrycznych parametrów próbki zęba. Próbka taka charakteryzuje się małymi rozmiarami i skrajnymi wartościami parametrów elektrycznych. Czyni to pomiar jej parametrów szczególnie trudnym. Analiza została przeprowadzona za pomocą metody elementów skończonych (MES). Wykazano, że nawet połowa prądu może przepływać poza próbką. Uzyskane wyniki silnie zależą od relacji...
-
Electrode arrays applicable to EIT based mine detection: a comparison ofspatial sensitivity distribution.
PublikacjaPrzebadano trzy konfiguracje matryc elektrodowych. Określono optymalne wzorce pobudzeń oraz odpowiadające im rozkłady czułości.
Rok 2002
-
Inner derivations of special subrings of matrix rings and outerplanar digraphs.
PublikacjaTematem artykułu jest specjalny podpierścień pierścienia macierzy wyznaczony przez relację oraz digraf reprezentujący tę relację. Rozważane są takie relacje, dla których reprezentujące je digrafy są zewnętrznie planarne. W tym przypadku zostały udowodnione warunki konieczne i wystarczające na to, aby różniczkowanie pierścienia było wewnętrzne.