Wyniki wyszukiwania dla: Lefchetz numbers of iterations
-
FPGA computation of magnitude of complex numbers using modified CORDIC algorithm
PublikacjaIn this work we present computation of the magnitude of complex numbers using a modified version of the CORDIC algorithm that uses only five iterations. The relationship between the computation error and the number of CORDIC iterations are presented for floating-point and integer arithmetics. The proposed modification of CORDIC for integer arithmetic relies upon the introduction of correction once basic computations are performed...
-
Minimization of the number of periodic points for smooth self-maps of simply-connected manifolds with periodic sequence of Lefschetz numbers
PublikacjaLet f be a smooth self-map of m-dimensional, m ≥ 4, smooth closed connected and simply-connected manifold, r a fixed natural number. For the class of maps with periodic sequence of Lefschetz numbers of iterations the authors introduced in [Graff G., Kaczkowska A., Reducing the number of periodic points in smooth homotopy class of self-maps of simply-connected manifolds with periodic sequence of Lefschetz numbers, Ann. Polon. Math....
-
Algebraic periods and minimal number of periodic points for smooth self-maps of 1-connected 4-manifolds with definite intersection forms
PublikacjaLet M be a closed 1-connected smooth 4-manifolds, and let r be a non-negative integer. We study the problem of finding minimal number of r-periodic points in the smooth homotopy class of a given map f: M-->M. This task is related to determining a topological invariant D^4_r[f], defined in Graff and Jezierski (Forum Math 21(3):491–509, 2009), expressed in terms of Lefschetz numbers of iterations and local fixed point indices of...
-
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublikacjaThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
Comparison of the Efficiency of Turbo Codes with Mechanisms of Reducing the Number of Iterations
PublikacjaThe paper presents the construction of encoders and decoders turbo codes with different number of states. Simulation results of the transmission quality of the turbo codes were presented. Decoders for turbo codes have worked with a fixed number of iterations and with the mechanisms reducing the number of iterations. Data were transmitted in Outdoor to Indoor & Pedestrian B environment for data rate 384 kbps. The SOVA algorithm...
-
Polyhedral Ramsey Numbers
PublikacjaGiven two polygons or polyhedrons P1 and P2, we can transform these figures to graphs G1 and G2, respectively. The polyhedral Ramsey number Rp(G1,G2) is the smallest integer n such that every graph, which represents polyhedron on n vertices either contains a copy of G1 or its complement contains a copy of G2. Using a computer search together with some theoretical results we have established some polyhedral Ramsey numbers, for example...
-
Generating sequences of Lefschetz numbers of iterates
PublikacjaDu, Huang and Li showed in 2003 that the class of Dold–Fermat sequences coincides with the class of Newton sequences, which are defined in terms of socalled generating sequences. The sequences of Lefschetz numbers of iterates form an important subclass of Dold–Fermat (thus also Newton) sequences. In this paper we characterize generating sequences of Lefschetz numbers of iterates.
-
On some open questions for Ramsey and Folkman numbers
PublikacjaWe discuss some of our favorite open questions about Ramsey numbers and a related problem on edge Folkman numbers. For the classical two-color Ramsey numbers, we first focus on constructive bounds for the difference between consecutive Ramsey numbers. We present the history of progress on the Ramsey number R(5,5) and discuss the conjecture that it is equal to 43.
-
On the connected and weakly convex domination numbers
PublikacjaIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
Indices of iterations of planar maps
PublikacjaArtykuł omawia najnowsze rezultaty badań dotyczące postaci indeksów punktu stałego iteracji odwzorowań planarnych.
-
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...
-
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...
-
The Urbanity Phenomenon – Tradition and New Cultural Iterations
PublikacjaCities that have managed to survive and rebuild lost urbanity do not close themselves towards new forms that are largely generated by culture. People are increasingly organized around common, local goals. They want to live in cities that open themselves up to differences, with culture as a tool for the revitalization of urbanity. Flexible management methods, tailored to the context and new needs, are therefore emphasized. Nowadays,...
-
Fixed point indices of iterations of planar homeomorphisms.
PublikacjaW pracy bada się postać indeksów iteracji lokalnych homeomorfizmów płaszczyzny.
-
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...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe paired domination subdivision number sdpr(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 paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Periodicity of a sequence of local fixed point indices of iterations
PublikacjaPraca 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ń.
-
Local fixed point indices of iterations of planar maps
PublikacjaW artykule podana zostaje postać indeksów iteracji dla pewnej klasy odwzorowań planarnych. Podstawowymi narzędziami stosowanym w pracy są liczba Nielsena i indeks Conleya.
-
Quadrtic convergence of monotone iterations of differential-algebraic equations
PublikacjaZastosowano tu metodę quazilinearyzacji do równań różniczkowo-algebraicznych z warunkiem początkowym. Pokazano, że odpowiednie iteracje monotoniczne są zbieżne do jedynego rozwiązania.
-
Sequences of fixed point indices of iterations in dimension 2.
PublikacjaW pracy dowodzi się, że każdy ciąg liczb całkowitych spełniający relacje Dolda może zostać zrealizowany jako ciąg indeksów punktu stałego iteracji ciągłego odwzorowania dwuwymiarowego dysku w siebie.
-
Scaling of numbers in residue arithmetic with the flexible selection of scaling factor
PublikacjaA scaling technique of numbers in resudue arithmetic with the flexible selection of the scaling factor is presented. The required scaling factor can be selected from the set of moduli products of the Residue Number System (RNS) base. By permutation of moduli of the number system base it is possible to create many auxilliary Mixed-Radix Systems associated with the given RNS with respect to the base, but they have different sets...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
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}...
-
Turán numbers for odd wheels
PublikacjaThe 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...
-
Shannon Capacity and Ramsey Numbers
PublikacjaRamsey-type theorems are strongly related to some results from information theory. In this paper we present these relations.
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
Quadratic convergence of monotone iterations to systems of differential-algebraic equations
PublikacjaZastosowano tu metodę dolnych i górnych rozwiązań do skonstruowania monotonicznych ciągów, które są zbieżne kwadratowo do jedynego rozwiązania układu równań różniczkowo-algebraicznych z warunkiem początkowym.
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Pipelined sceling of signed residue numbers with the mixed-radix conversion in the programmable gate array
PublikacjaIn this work a scaling technique of signed residue numbers is proposed. The method is based on conversion to the Mixed-Radix System (MRS) adapted for the FPGA implementation. The scaling factor is assumed to be a moduli product from the Residue Number System (RNS) base. Scaling is performed by scaling of terms of the mixed-radix expansion, generation of residue reprezentation of scaled terms, binary addition of these representations...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
Fixed point indices of iterations of C^1 maps in R^3
PublikacjaW przypadku gładkiego odwzorowania w R^3 dowiedziona została hipoteza Chowa, Malleta-Pareta i Yorka dotycząca postaci ciągów indeksow iteracji oraz podano kompletny opis możliwych ciągów indeksow.
-
Quadratic convergence of monotone iterations for differential equations with initial time difference
PublikacjaPodano warunki dostateczne na to, aby iteracje monotoniczne były zbieżne do jedynego rozwiązania równania różniczkowego przy różnych warunkach początkowych. Pokazano, że jest to zbieżność kwadratowa.
-
Total restrained domination numbers of trees
PublikacjaOpisane 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
PublikacjaW 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.
-
Weakly connected domination subdivision numbers
PublikacjaLiczba podziału krawędzi dla dominowania słabo spójnego to najmniejsza liczba krawędzi jaką należy podzielić, aby wzrosła liczba dominowania słabo wypukłego. W pracy przedstawione są własności liczby podziału krawędzi dla dominowania słabo spójnego dla różnych grafów.
-
Weakly convex and convex domination numbers.
PublikacjaW artykule przedstawione są nowo zdefiniowane liczby dominowania wypukłego i słabo wypukłego oraz ich porównanie z innymi liczbami dominowania. W szczególności, rozważana jest równość liczby dominowania spójnego i wypukłego dla grafów kubicznych.
-
Scaling of signed residue numbers with mixed-radix conversion in FPGA with extended scaling factor selection
PublikacjaA scaling technique of signed residue numbers in FPGA is proposed. The technique is based on conversion of residue numbers to the Mixed-Radix System (MRS). The scaling factor is assumed to be a moduli product from the Residue Number System (RNS) base. Scaling is performed by scaling of MRS terms, the subsequent generation of residue representations of scaled terms, binary addition of these representations and generation of residues...
-
DO WE NEED NAVIER NUMBER? – FURTHER REMARKS AND COMPARISON WITH ANOTHER DIMENSIONLESS NUMBERS
PublikacjaThis paper presents a role of the Navier number (Na-dimensionless slip-length) in universal modelling of flow reported in micro- and nano-channels like: capillary biological flows, fuel cell systems, micro-electro-mechanical systems and nano-electro-mechanical systems. Similar to another bulk-like and surface-like dimensionless numbers, the Na number should be treated as a ratio of internal viscous to external viscous momentum...
-
Improved magnitude estimation of complex numbers using alpha max and beta min algorithm
PublikacjaThe paper presents an improved algorithm for calculating the magnitude of complex numbers. This problem, which is a special case of square rooting, occurs for example, in FFT processors and complex FIR filters. The proposed method of magnitude calculation makes use of the modified alpha max and beta min algorithm. The improved version of the algorithm allows to control the maximum magnitude approximation error by using an adequate...
-
Total outer-connected domination numbers of trees
PublikacjaNiech G=(V,E) będzie grafem bez wierzchołków izolowanych. Zbiór wierzchołków D nazywamy zbiorem dominującym totalnym zewnętrznie spójnym jeżli każdy wierzchołek grafu ma sąsiada w D oraz podgraf indukowany przez V-D jest grafem spójnym. Moc najmniejszego zbioru D o takich własnościach nazywamy liczbą dominowania totalnego zewnątrznie spójnego. Praca m.in. zawiera dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego...
-
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...
-
Implementation of magnitude calculation of complex numbers using improved alpha max plus beta min algorithm
PublikacjaThe paper presents the hardware implementation of the improved alpha max plus beta min algorithm for calculating the magnitude of complex numbers. This version of the algorithm requires the general division which is performed using a noniterative multiplicative division algorithm. We analyze in detail the division algorithm, its error and the impact of finite word-length signal representations on the assumed total computation error....
-
Reducing the number of periodic points in the smooth homotopy class of a self-map of a simply-connected manifold with periodic sequence of Lefschetz numbers
PublikacjaLet f be a smooth self-map of an m-dimensional (m >3) closed connected and simply-connected manifold such that the sequence of the Lefschetz num- bers of its iterations is periodic. For a fixed natural r we wish to minimize, in the smooth homotopy class, the number of periodic points with periods less than or equal to r. The resulting number is given by a topological invariant J[f] which is defned in combinatorial terms and is...
-
On some ramsey and turan-type numbers for paths and cycles
PublikacjaUdowodniono, że R(P_3,C_k,C_k)= R(C_k,C_k)= 2k - 1, dla nieparzystych k. Udowodniono, że R(P_4,P_4,C_k) = k + 2 oraz R(P_3,P_5,C_k) = k + 1 dla k > 2.
-
Gene copy numbers of HER family in breast cancer
Publikacja -
Graphs with equal domination and 2-distance domination numbers
PublikacjaW publikacji scharakteryzowane są wszystkie te drzewa i grafy jednocykliczne, w których liczba dominowania oraz liczba 2-dominowania na odległość są sobie równe.
-
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.
-
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.
-
Ramsey numbers for triangles versus almost-complete graphs.
PublikacjaPokazano, że w każdym krawędziowym pokolorowaniu dwoma kolorami grafu pełnego o 38 wierzchołkach występuje trójkąt w pierwszym kolorze lub podgraf izomorficzny z K_10 - e w drugim kolorze. Stąd otrzymujemy górne oszacowanie R(K_3, K_10 - e) <= 38. Przedstawiamy także pokolorowanie krawędziowe grafu K_36, którego istnienie dowodzi, że R(K_3, K_10 - e) >= 37.
-
Domination numbers in graphs with removed edge or set of edges
PublikacjaW artykule przedstawiony jest wpływ usuwania krawędzi lub zbioru krawędzi na liczby dominowania spójnego i słabo spójnego.