Nie znaleźliśmy wyników w zadanych kryteriach!
Ale mamy wyniki w innych katalogach.Filtry
wszystkich: 4120
-
Katalog
- Publikacje 3079 wyników po odfiltrowaniu
- Czasopisma 12 wyników po odfiltrowaniu
- Osoby 61 wyników po odfiltrowaniu
- Wynalazki 2 wyników po odfiltrowaniu
- Projekty 4 wyników po odfiltrowaniu
- Kursy Online 35 wyników po odfiltrowaniu
- Wydarzenia 2 wyników po odfiltrowaniu
- Dane Badawcze 925 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: TURÁN NUMBERS
-
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...
-
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.
-
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...
-
Pipelined division of signed numbers with the use of residue arithmetic for small number range with the programmable gate array
PublikacjaIn this work an architecture of the pipelined signed residue divider for the small number range is presented. Its operation is based on reciprocal calculation and multiplication by the dividend. The divisor in the signed binary form is used to compute the approximated reciprocal in the residue form by the table look-up. In order to limit the look-up table address an algorithm based on segmentation of the divisor into two segments...
-
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....
-
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 )....
-
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...
-
Turun historiallinen arkisto
Czasopisma -
Minun seikkailuni Turun Kiikurit Laulu- ja Tanssiyhtyeen kanssa… [My adventure with the folk group of song and dance Turun Kiikurit…]
Publikacja -
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...