Search
Filters
total: 936
filtered: 305
-
Catalog
Chosen catalog filters
Search results for: MATHEMATICS
-
Positive solutions of three-point boundary value problems for second order impulsive differential equations with advanced arguments
PublicationW pracy dyskutowano problem istnienia dodatnich rozwiązań dla równań różniczkowych z impulsami rzędu drugiego i z argumentami typu wyprzedzonego. Podano warunki dostateczne na istnienie jednego lub dwóch rozwiązań dodatnich takich zagadnień.
-
Positive solutions to second order four-point boundary value problems for impulsive differential equations
PublicationPraca dotyczy problemów brzegowych dla równań różniczkowych drugiego rzędu z impulsami. Podane zostały warunki dostateczne na istnienie trzech dodatnich rozwiązań takich problemów z czteropunktowymi warunkami brzegowymi. W badaniach korzystano z twierdzenia Leggetta-Williamsa.
-
Edge ranking and searching in partial orders
PublicationArtykuł jest poświęcony problemowi konstrukcji optymalnej (wymagającej minimalnej ilości porównań/zapytań) strategii wyszukiwania elementu w częściowym porządku. W pracy wskazano związki pomiędzy tym problemem oraz uporządkowanym kolorowaniem krawędzi grafów, co implikuje liniowy algorytm dla częściowych porządków o strukturze drzewa. Pokazano również, że znalezienie optymalnej strategii jest problemem obliczeniowo trudnym dla...
-
Forwarding and optical indices of a graph
PublicationW pracy rozstrzygnięto dwa problemy dotyczące komunikacji wszyscy-do-wszystkich w grafach. Stwierdzono, że dla wersji skierowanej problemu parametry ''pi'' (maksymalne obciążenie krawędzi) i ''w'' (parametr chromatyczny) nie muszą być w ogólności sobie równe. Dla wersji nieskierowanej problemu pokazano, że wyznaczenie wartości zarówno ''pi'', jak i ''w'', jest w ogólności problemem NP-trudnym.
-
Easy and hard instances of arc ranking in directed graphs
PublicationArtykuł dotyczy uporządkowanego kolorowania łuków grafów skierowanych. Problem polega na takim przyporządkowaniu liczb łukom digrafu, aby każda skierowana ścieżka łącząca dwa łuki o tej samej liczbie (kolorze) zawierała łuk o kolorze wyższym. Praca podaje liniowy optymalny algorytm dla pewnego szczególnego przypadku, oraz zawiera dowód, iż problem ten jest obliczeniowo trudny dla 3-dzielnych acyklicznych digrafów i stałej liczby...
-
Existence of solutions of boundary value problems for differential equations in which deviated arguments depend on the unknown solution
PublicationPrzy pewnych warunkach, gdy m.in. funkcja f występująca po prawej stronie zagadnienia jest monotoniczna, pokazano że istnieje jedyne rozwiązanie problemu brzegowego dla równań różniczkowych z odchylonymi argumentami gdy ten argument odchylony zależy od nieznanego rozwiązania. Rozważano też zagadnienia gdy występuje więcej takich argumentów odchylonych. Otrzymane wyniki poparto przykładem.
-
On convergence and stability of a numerical scheme of Coupled Nonlinear Schrödinger Equations
PublicationRozważamy rozwiązania numeryczne układu sprężynowych równań nieliniowych Schrödingera. Udowodniliśmy stabilność i zbieżność. Testujemy za pomocą rozwiązań solitonowych.
-
First-order advanced difference equations
PublicationBadano istnienie rozwiązań równań różnicowych rzędu pierwszego z wyprzedzonymi argumentami. Podano warunki na istnienie jedynego rozwiązania. Przedmiotem badań były też nierówności różnicowe związane z w/w równaniami różnicowymi. Otrzymane wyniki zilustrowano na przykładzie.
-
First-order functional difference equations with nonlinear boundary value problems
PublicationDyskutowano problem brzegowy dla równań różnicowych z opóźnionym argumentem. Nierówności różnicowe związane z w/w problem też były przedmiotem badań. Stosując metodę iteracji monotonicznych, sformułowano warunki dostateczne na istnienie ekstremalnych rozwiązań problemów brzegowych z opóźnionymi argumentami. Podano dwa przykłady ilustrujące otrzymane wyniki.
-
A note on the weakly convex and convex domination numbers of a torus
PublicationW pracy określone są liczby liczby dominowania i dominowania wypukłego torusów, czyli iloczynów kartezjańskich dwóch cykli.
-
Asymptotic numerical solver for the linear Klein–Gordon equation with space- and time-dependent mass
Publication -
Dynamics near nonhyperbolic fixed points or nontransverse homoclinic points
Publication -
Bistability in a One-Dimensional Model of a TwoPredators-One-Prey Population Dynamics System
Publication -
Simplifying biochemical tumorous bone remodeling models through variable order derivatives
Publication -
Diffusion process modeling by using fractional-order models
Publication -
Three-fast-searchable graphs
PublicationIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
Initial value problems for neutral fractional differential equations involving a Riemann-Liouville derivative
PublicationBadano równania neutralne typu ułamkowego z odchylonym argumentem. Podano warunki dostateczne na istnienie jednego rozwiązania.
-
Existence of solutions for a coupled system of difference equations with cousal operators
PublicationPraca dotyczy układów równań różnicowych. Podano warunki dostateczne na istnienie rozwiązań takich problemów. Badano również nierówności różnicowe.
-
Fractional equations of Volterra type involving a Riemann Liouville derivative
PublicationIn this paper, we discuss the existence of solutions of fractional equations of Volterra type with the Riemann Liouville derivative. Existence results are obtained by using a Banach fixed point theorem with weighted norms and by a monotone iterative method too. An example illustrates the results.
-
A new approach to numerical solution of fixed-point problems and its application to delay differential equations
PublicationW pracy rozpatruje się pewne aproksymacje punktu stałego ciągłego operatora A odwzorowującego przestrzeń metryczną w siebie. Wspomniany punkt stały przybliża się tzw. epsilon przybliżonym punktem stałym z przestrzeni skończenie wymiarowej. Udowodnione zostało twierdzenie dające warunki konieczne i dostateczne istnienia punktu stałego w ogólnej przestrzeni metrycznej. Warunki te wyrażone są w terminach epsilon przybliżonego punktu...
-
A note on total reinforcement in graphs
PublicationIn 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.
-
Convergence of rational multistep methods of Adams-Padé type
Publication -
Periodicity of a sequence of local fixed point indices of iterations
PublicationPraca uogólnia klasyczne twierdzenie Shuba i Sullivana o periodyczności ciągu indeksów punktu stałego iteracji odwzorowań gładkich na szerszą klasę przekształeń.
-
On bipartization of cubic graphs by removal of an independent set
PublicationWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Method of lines for physiologically structured models with diffusion
PublicationWe deal with a size-structured model with diffusion. Partial differential equations are approximated by a large system of ordinary differential equations. Due to a maximum principle for this approximation method its solutions preserve positivity and boundedness. We formulate theorems on stability of the method of lines and provide suitable numerical experiments.
-
Edge-coloring of 3-uniform hypergraphs
PublicationWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
On the partition dimension of trees
PublicationGiven 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...
-
Fractional problems with advanced arguments
PublicationThis paper concerns boundary fractional differential problems with advanced arguments. We investigate the existence of initial value problems when the initial point is given at the end point of an interval. Nonhomogeneous linear fractional differential equations are also studied. The existence of solutions for fractional differential equations with advanced arguments and with boundary value problems has been investigated by using...
-
Positive solutions to fractional differential equations involving Stieltjes integral conditions
PublicationIn this paper, we investigate nonlocal boundary value problems for fractional differential equations with dependence on the first-order derivatives and deviating arguments. Sufficient conditions which guarantee the existence of at least three positive solutions are new and obtained by using the Avery–Peterson theorem. We discuss problems (1) and (2) when argument b can change the character on [0, 1], so in some subinterval I of...
-
Monotone iterative method for first-order differential equations at resonance
PublicationThis paper concerns the application of the monotone iterative technique for first-order differential equations involving Stieltjes integrals conditions. We discuss such problems at resonance when the measure in the Stieltjes integral is positive and also when this measure changes the sign. Sufficient conditions which guarantee the existence of extremal, unique and quasi-solutions are given. Three examples illustrate the results.
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
Symmetry-Breaking Bifurcation for Free Elastic Shell of Biological Cluster, Part 2
PublicationWe 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...
-
Convergence of rational multistep methods of of Adams-Padé type
PublicationRational generalizations of multistep schemes, where the linear stiff part of a given problem is treated by an A-stable rational approximation, have been proposed by several authors, but a reasonable convergence analysis for stiff problems has not been provided so far. In this paper we directly relate this approach to exponential multistep methods, a subclass of the increasingly popular class of exponential integrators. This natural,...
-
Boundary problems for fractional differential equations
PublicationIn this paper, the existence of solutions of fractional differential equations with nonlinear boundary conditions is investigated. The monotone iterative method combined with lower and upper solutions is applied. Fractional differential inequalities are also discussed. Two examples are added to illustrate the results.
-
Elastoplastic law of Cosserat type in shell theory with drilling rotation
PublicationWithin the framework of six-parameter non-linear shell theory, with strain measures of the Cosserat type, we develop small-strain J2-type elastoplastic constitutive relations. The relations are obtained from the Cosserat plane stress relations assumed in each shell layer, by through-the-thickness integration employing the first-order shear theory. The formulation allows for unlimited translations and rotations. The constitutive...
-
Interval incidence coloring of bipartite graphs
PublicationIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
Interval incidence graph coloring
PublicationIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublicationWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
Equitable coloring of hypergraphs
PublicationA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Surface effects of network materials based on strain gradient homogenized media
PublicationThe asymptotic homogenization of periodic network materials modeled as beam networks is pursued in this contribution, accounting for surface effects arising from the presence of a thin coating on the surface of the structural beam elements of the network. Cauchy and second gradient effective continua are considered and enhanced by the consideration of surface effects. The asymptotic homogenization technique is here extended to...
-
Weakly connected Roman domination in graphs
PublicationA 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...
-
The law of the Iterated Logarithm for random interval homeomorphisms
PublicationA proof of the law of the iterated logarithm for random homeomorphisms of the interval is given.
-
Infinite chromatic games
PublicationIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
On solvability of initial boundary-value problems of micropolar elastic shells with rigid inclusions
PublicationThe problem of dynamics of a linear micropolar shell with a finite set of rigid inclusions is considered. The equations of motion consist of the system of partial differential equations (PDEs) describing small deformations of an elastic shell and ordinary differential equations (ODEs) describing the motions of inclusions. Few types of the contact of the shell with inclusions are considered. The weak setup of the problem is formulated...
-
A convergence result for mountain pass periodic solutions of perturbed Hamiltonian systems
PublicationIn this work, we study second-order Hamiltonian systems under small perturbations. We assume that the main term of the system has a mountain pass structure, but do not suppose any condition on the perturbation. We prove the existence of a periodic solution. Moreover, we show that periodic solutions of perturbed systems converge to periodic solutions of the unperturbed systems if the perturbation tends to zero. The assumption on...
-
Laplace domain BEM for anisotropic transient elastodynamics
PublicationIn this paper, we describe Laplace domain boundary element method (BEM) for transient dynamic problems of three-dimensional finite homogeneous anisotropic linearly elastic solids. The employed boundary integral equations for displacements are regularized using the static traction fundamental solution. Modified integral expressions for the dynamic parts of anisotropic fundamental solutions and their first derivatives are obtained....
-
Bistability in a One-Dimensional Model of a Two-Predators-One-Prey Population Dynamics System
PublicationIn this paper, we study a classical two-predators-one-prey model. The classical model described by a system of three ordinary differential equations can be reduced to a one-dimensional bimodalmap. We prove that this map has at most two stable periodic orbits. Besides, we describe the bifurcation structure of the map. Finally, we describe a mechanism that leads to bistable regimes. Taking this mechanism into account, one can easily...
-
A spline-based FE approach to modelling of high frequency dynamics of 1-D structures
PublicationIn this paper a computational methodology leading to the development of a new class of FEs, based on the application of continuous and smooth approximation polynomials, being splines, has been presented. Application of the splines as appropriately defined piecewise elemental shape functions led the authors to the formulation of a new approach for FEM, named as spFEM, where contrary to the well-known NURBS approach, the boundaries...
-
A chemo-mechano-thermodynamical contact theory for adhesion, friction, and (de)bonding reactions
PublicationThis work presents a self-contained continuum formulation for coupled chemical, mechanical, and thermal contact interactions. The formulation is very general and, hence, admits arbitrary geometry, deformation, and material behavior. All model equations are derived rigorously from the balance laws of mass, momentum, energy, and entropy in the framework of irreversible thermodynamics, thus exposing all the coupling present in the...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublicationGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...