Wyszukiwarka
Katedra Rachunku Prawdopodobieństwa i Biomatematyki
Publikacje
Filtry
wszystkich: 101
Katalog Publikacji
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.
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...
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...
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.
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.
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...
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 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.
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...
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...
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,...
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...
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.
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.