Search results for: applied mathematics
-
Interval vertex-coloring of a graph with forbidden colors
Publication -
A linear time algorithm for edge coloring of binomial trees
Publication -
The smallest hard-to-color graph for algorithm DSATUR
Publication -
Consecutive colorings of the edges of general graphs
Publication -
Interval edge coloring of a graph with forbidden colors
Publication -
The smallest hard-to-color graph for the SL algorithm
Publication -
On Directed Lattice Paths With Vertical Steps
Publication -
Enumerations of Plane Trees with Multiple Edges and Raney Lattice Paths
Publication -
Differential equations with a singular matrix and convergence of approximate solutions
PublicationZastosowano metodę kwazilinearyzacji dla równań różniczkowych z macierzą osobliwą aby pokazać, że odpowiednie ciągi rozwiązań przybliżonych są kwadratowo zbieżne do rozwiązania naszego problemu.Metodę tę zastosowano do układów takich równań różniczkowych.
-
Chaotic invariant sets of vibro-impact systems with one degree of freedom
Publication -
The circular chromatic index of some class 2 graphs
PublicationW artykule został wyznaczony cyrkularny indeks chromatyczny dla dwóch rodzin grafów klasy 2. Co więcej, podano nie trywialne oszacowania tego parametru dla snarków Isaacsa i Goldberga. Na koniec artykułu rozważana jest złożoność obliczeniowa problemów związanych z cyrkularnym kolorowaniem krawędzi.
-
Total restrained domination numbers of trees
PublicationOpisane są wszystkie drzewa, w których liczby dominowania totalnego i totalno - powściągniętego są sobie równe, a także podano dolne ograniczenie na liczbę dominowania totalno - powściągniętego w drzewach.
-
Distance paired domination numbers of graphs
PublicationW pracy przedstawione są pewne własności liczb k-dominowania parami w grafach. Wykazane jest, że problem decyzyjny liczby k-dominowania parami jest problemem NP-zupełnym nawet dla grafów dwudzielnych. Przedstawione są ograniczenia górne i dolne dla liczby k-dominowania parami w drzewach i scharakteryzowane drzewa, w których te ograniczenia są osiągnięte.
-
Greedy T-colorings of graphs
PublicationTreścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.
-
The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
PublicationW pracy pokazano, że problem L(p,q)-kolorowania przy użyciu ''t'' kolorów jest NP-zupełny nawet w wersji ograniczonej do grafów planarnych dwudzielnych małego stopnia, nawet dla stosunkowo niewielkich wartości ''t''. Jako wniosek z uzyskanych wyników stwierdzono, że problem L(2,1)-kolorowania grafów planarnych przy użyciu 4 kolorów jest NP-zupełny, a także że problem L(p,q)-kolorowania grafów o maksymalnym stopniu 4 jest NP-zupełny...
-
Paired bondage in trees
PublicationW pracy zdefiniowano pojęcie liczby zniewolenia parami jako moc najmniejszego zbioru krawędzi, którego usunięcie z grafu spowoduje wzrost liczby dominowania parami. W szczególności scharakteryzowane są wszystkie drzewa, w których liczba zniewolenia wynosi 0, czyli takie, w których usunięcie dowolnego podzbioru krawędzi nie zwiększy liczby dominowania parami.
-
Compact cyclic edge-colorings of graphs
PublicationArtykuł jest poświęcony modelowi zwartego cyklicznego kolorowania krawędzi grafów. Ten wariant kolorowania jest stosowany w modelowaniu uszeregowań w systemach produkcyjnych, w których proces produkcyjny ma charakter cykliczny. W pracy podano konstrukcje grafów, które nie zezwalają na istnienie pokolorowania w rozważanym modelu. Wykazano także kilka własności teoretycznych, takich jak ograniczenia górne na liczbę kolorów w optymalnym...
-
On the homotopy equivalence of the spaces of proper and local maps
Publication -
Uniform Expansivity Outside a Critical Neighborhood in the Quadratic Family
Publication -
A note on compact and compact circular edge-colorings of graphs
PublicationW pracy rozważamy dwa warianty kolorowania krawędzi grafów prostych i ważonych, mianowicie kolorowania zwarte oraz zwarte cyrkularne. Rozważamy relacje pomiędzy nimi. Dowodzimy, że każdy zewnętrznie planarny graf dwudzielny posiada zwarte pokolorowanie krawędziowe oraz, że problem ten dla grafów ogólnych jest NP-zupełny. Podajemy również wielomianowy 1.5-przybliżony algorytm oraz pseudowielomianowy dokładny algorytm zwartego cyrkularnego...
-
Mixed graph edge coloring
PublicationW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
Geometrical versus analytical approach in problem solving- an exploatory study
PublicationAbstract. 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...
-
Erratum to "Formulas and Theorems for the Special Functions of Mathematical Physics" by W. Magnus, F. Oberhettinger, R. P. Soni
PublicationWe correct a number of misprints in the handbook "Formulas and theorems for the special functions of mathematial physics" (3rd edition) by Magnus, Oberhettinger and Soni.
-
Turán numbers for odd wheels
PublicationThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
Independence in uniform linear triangle-free hypergraphs
PublicationThe independence number a(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show a new lower bound for a(H) for an r-uniform linear triangle-free hypergraph H with r>=2.
-
Strategic balance in graphs
PublicationFor 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,...
-
Global defensive sets in graphs
PublicationIn 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...
-
Minimum order of graphs with given coloring parameters
PublicationA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Graphs with isolation number equal to one third of the order
PublicationA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Boundary value problems for systems of functional differential equations
PublicationPraca dotyczy przybliżonych rozwiązań zagadnienia brzegowego dla funkcyjnych równań różniczkowych 2-go rzędu. Podano numeryczne algorytmy na wyznaczenie tego rozwiązania i warunki dostateczne, przy których metoda jest zgodna i zbieżna. Podano też konstrukcję metody dowolnego rzędu.
-
Individual entrepreneurial orientation: comparison of business and STEM students
PublicationAbstract Purpose – The purpose of this study is to determine whether there are differences in Individual Entrepreneurial Orientation (IEO) between students who are doing their major in business studies and the ones whose areas of study are science, technology, engineering, and mathematics (STEM). Design/methodology/approach – The current research investigates which factors and components contribute to EO orientation development...
-
Chemical Theory of Machines, basic principles of strength with examples of calculations
PublicationThis book encompasses the essential range of information on technical aspects of mechanical design. It was written primarily for the students and staff of chemistry faculties of technical universities, yet it may also be utilized by everyone, who ether would like to try or already enjoys designing, but cannot take advantage of typical stress & machine construction handbooks. These handbooks often require familiarity with the concepts...
-
Marcin Byczuk mgr inż.
People -
Tomasz Gzella mgr inż.
People -
Robert Krawczyk dr inż.
People -
Maximum transportation growth in energy and solute particles in Prandtl martial across a vertical 3D-heated surface: Simulations achieved using by finite element approach
PublicationThe goal of this study is to determine the maximum energy and solute particles' transportation growth in a 3D-heated region of Prandtl martial through a dynamic magnetic field. The effects of this field on the properties of solvent molecules and heat conduction are studied. A correctly stated functional method and a finite element approach are comparable to a certain type of differential equations. In order demonstrate the effects...
-
A general theory for anisotropic Kirchhoff–Love shells with in-plane bending of embedded fibers
PublicationThis work presents a generalized Kirchhoff–Love shell theory that can explicitly capture fiber-induced anisotropy not only in stretching and out-of-plane bending, but also in in-plane bending. This setup is particularly suitable for heterogeneous and fibrous materials such as textiles, biomaterials, composites and pantographic structures. The presented theory is a direct extension of classical Kirchhoff–Love shell theory to incorporate...
-
Existence of Two Periodic Solutions to General Anisotropic Euler-Lagrange Equations
PublicationAbstract. This paper is concerned with the following Euler-Lagrange system d/dtLv(t,u(t), ̇u(t)) =Lx(t,u(t), ̇u(t)) for a.e.t∈[−T,T], u(−T) =u(T), Lv(−T,u(−T), ̇u(−T)) =Lv(T,u(T), ̇u(T)), where Lagrangian is given by L=F(t,x,v) +V(t,x) +〈f(t),x〉, growth conditions aredetermined by an anisotropic G-function and some geometric conditions at infinity.We consider two cases: with and without forcing termf. Using a general version...
-
Local material symmetry group for first- and second-order strain gradient fluids
PublicationUsing an unified approach based on the local material symmetry group introduced for general first- and second-order strain gradient elastic media, we analyze the constitutive equations of strain gradient fluids. For the strain gradient medium there exists a strain energy density dependent on first- and higher-order gradients of placement vector, whereas for fluids a strain energy depends on a current mass density and its gradients....
-
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.
-
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...
-
Minimal surfaces and conservation laws for bidimensional structures
PublicationWe discuss conservation laws for thin structures which could be modeled as a material minimal surface, i.e., a surface with zero mean curvatures. The models of an elastic membrane and micropolar (six-parameter) shell undergoing finite deformations are considered. We show that for a minimal surface, it is possible to formulate a conservation law similar to three-dimensional non-linear elasticity. It brings us a path-independent...
-
Attractors of dissipative homeomorphisms of the infinite surface homeomorphic to a punctured sphere
PublicationA class of dissipative orientation preserving homeomorphisms of the infinite annulus,pairs of pants, or generally any infinite surface homeomorphic to a punctured sphere isconsidered. We prove that in some isotopy classes the local behavior of such homeomor-phisms at a fixed point, namely the existence of so-called inverse saddle, impacts thetopology of the attractor — it cannot be arcwise connected
-
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 -
Convergence of rational multistep methods of Adams-Padé type
Publication -
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.
-
The exponential law for partial, local and proper maps and its application to otopy theory
Publication -
Simplifying biochemical tumorous bone remodeling models through variable order derivatives
Publication