On the Distribution o f Vertex-Degrees in a Strata o f a Random Recursive Tree. Marian D O N D A J E W S K I and Jerzy S Z Y M A N S K I
|
|
- Joseph Cox
- 5 years ago
- Views:
Transcription
1 BULLETIN DE L ACADÉMIE POLONAISE DES SCIENCES Série des sciences mathématiques Vol. XXX, No. 5-6, 982 COMBINATORICS On the Distribution o f Vertex-Degrees in a Strata o f a Rom Recursive Tree by Marian D O N D A J E W S K I Jerzy S Z Y M A N S K I Presented by C R Y L L -N A R D Z E W S K I on September 4, 98 Summary. We shall derive a formula for the expected value Ar {n,k ) of the number of vertices of degree r in Sk of a rom recursive tree with n vertices. A strata Sk is a set o f such vertices of a tree that their distance from the root is equal to k.. Introduction. A tree Rn with n vertices labelled,2,..., n is a recursive tree if n = or if n ^ 2 the и-th vertex is joined to one o f n vertices o f R _ j. A vertex with label is a root o f a recursive tree (see [ ] for definitions not given here). A strata Sk is a set o f such vertices o f a tree that their distance from root is equal to k, where k = 0,,..., n. Let Ar (и, к) denote the expected value o f the number o f vertices o f degree r in Sk over the family o f all recursive trees with n vertices. Moreover, let у4г (n) denote the expected value of the number o f vertices o f degree r in a tree R (the root is not taken into account). Our main object here is to determine Ar(n,k). Summing Ar(n,k) over к we can calculate Ar (и) compare it with the results obtained by Na Rapoport [7]. 2. Results for end-vertices. Let ц (n, k) denote the expectation o f the number o f vertices in Sk. Meir M oon [5 ] have shown that ц(п,к) fulfills the following recursive equation ( ) li (и +, к + ) = pi (n, к -f ) + Ц (n, k)/n, where ц(п, 0) = ц (n, k) = 0 for k^ n. They also proved that - к! ^ flq û 2 a* where the sum is over all positive integers ah such that ^ a, ^ n cti Ф üj for ^ i, j ^ к i Ф j. [205]
2 206 M. Dondajewski, J. Szymanski W e have found that gin,k) can be presented in the following form T heorem. s (и, k+ ) (2) /t(n,k) = (- l)" +k+ (л-)! where s(n,k) denotes the Stirling numbers of the first kind. P r o o f. It is easy to see that we can rewrite equation () as follows (3) b (n +, k) = b in, k i) n b (n, k), where b (in, k) = ( - l)n+* + ( n - )! g (n, k-\). Obviously (3) is the recursive equation for the Stirling numbers of the first kind. Boundary condition b(l, ) = is also fulfilled. Using the above Theorem one can prove the following result. T heorem 2. (4) A' (n k) = - ^ T = Z - -( J T Î )! for n ^ 2, к =,2,..., n. P r o o f. It follows from the construction o f recursive trees that (5) Ax(n+, k) = Ax(n, k)-\ /j. (n, к ). n n Let f (n) {n ) Ax(n, k), then it follows from (5) that where Af (n) = f (n + l ) f (n). we get Af{n) = g {п, к - ), N ow from the well-known facts o f the theory of recursive equations (6) / (n) = c + x n a,k - )= c + У n (/, * - и, i = because g in, k) = 0 for к > n. Obviously Ax(n +, n) = fn\. The abo\e identity combined with (6) implies C = 0. This completes the proof. Summing Axin,k) over к we can prove i = к Corollary. (7) A j in) = n/2. P r o o f. л,(")= I («Д) = Ц- I f II, S (- fs(i,k) = к = i = l l* lc= l
3 Distribution o f Vertex-Degrees 207 / n- I! = ( - У 0 - )! ( )' il = n/2. So, we arrive at the thesis. Similar result was obtained by N a Rapoport [7 ] in another way. Th ey count the root additionally prove that the number of end-vertices in Rn is (n/2 + /(л )). 3. Vertices o f degree r ^ 2. N ow let us consider the more complicated case when r ^ 2. The following lemma is an immediate consequence o f the way in which Rn+ i is obtained from Rn. (8) L e m m a. I f r ^ 2 then Ar (n, к) = n Z /- ; = A r _ i (i, /с), (9) fo r n ^ k + r. i = k + r - Л'(") = 7~Г Z ^-i (*) C o r o l l a r y 2. I f r ^ 2 n ^ k + r then n Ar(n+\, k) = (n-\) Ar (n, k) + Ar_l (n, k), (/-) Ar (n) = Ar-i (/ l) + (/i 2) Ar (/ i- l). N ow we shall prove the following Theorem. T h e o r e m 3. If r ^ 2 n ^ k + r then ( 0) where (- )* v ( - iys(j,k) Ar {n,k) = / - k О - D! Л Г /I г л г яаг= Z Z - Z Hj,r, ц-м а-it «r-i =.,-2 * (J2+ ) (Ir - i + r _ 2) Relation (0) can easily be proved by induction by r using formula (8). C o r o l l a r y 3. If r ^ 2 n > r then () Ar (n) = 2~r n+ s ( n -, k) ( 2). P r o o f. T o prove () let us introduce a generating function: (2) G ( x, y ) = X Z A r ( n ) x r yn~ l. n= 2 r =
4 208 M. Dondajewski, J. Szymanski It converges for \x\ ^, y <. Obviously (3) G (0, y) = G (x, 0) = 0, n - G ( l, y ) = X / X А г ( п ) = X (и - l ) / = y/(l yÿ n = 2 r = n= 2 From (2), (9) (5) we get But G(x,y) = Z X Ar(n)xr yn~ l + x X A i ( и ) / _ = n = 3 г = 2 n 2 XV (2 vi * n~ -, ~ (l-y)-2+ I I I Л-(0*г/->- ). Z n = 3 r= 2 i= r 5 G fx v) 0 0 n -l n -l ', w = х ( - у ) - з + П n=3 r = 2 i= r finally dg (x,y ) dy = x (i-y )_3+ x X Л-(0*г X / ~ 2* i= 2 г = n= I + = x ( l - y ) 3 + xg (x, y)/(l y). The solution of this equation with boundary condition (3) has the form (4) But G{x,y) = ~----- (( y) 2 ( y) x). 2 x - ^ - = - l + (l- x / 2 ) - = X (*/2)*, i x k= i (-уг 2-( -у Г х = X {fc+l-(*)*/*!}/, * = П where (x)k= x (x + l)...(x + n ) = ( )" X s (и, к) ( l)k xk. lt = о Formula (4) can be rewritten as follows (5) G (x, y) = X (*/2)* X { + --!!, X s f a - U r H - l / x ' } / -. * = i я= 2 i (и )! r = i J Formula () can be obtained by comparing coefficients o f power series (2) (5).
5 Distribution o f Vertex-Degrees 209 Using the asymptotic formula of Jordan for the Stirling number o f the first kind we can easily find that for fixed r n -* оо AT(n) = n 2-r + o (). This result is the same as that of relation (49) by N a Rapoport [7]. Using relation (2) we can present (0) () in equivalent form (6) (7) Ar{n,k) = -Ц - д О 'Д - l )Hj,r, n i j = k Ar(n) = 2 г «- - ^ з у - Z М и - Д ~ ) 2 к. INSTITUTE OF MATHEMATICS, TECHNICAL UNIVERSITY, PIOTROWO 3a, POZNAN (INSTYTUT MATEMATYKI, POLITECHNIKA POZNANSKA) REFERENCES [ ] F. H arary, E. P alm er, Graphical enumeration, Academic Press, New York, 973. [2 ] J. L. G a stw irth, A probability model of a pyramid scheme, Amer. Statistician, 3 (977), [3 ] M. K aron sk i, A review o f rom graphs, Komunikaty i Rozprawy IM UAM, Poznan, 978. [4 ] A M eir, J W. M o o n. The distance between points in rom trees, J. Comb. Theory, 8 (970), [5 ] A M eir, J W. M o o n, On the altitude o f nodes in rom trees, Can. J. Math., 30 (978), [ 6] A. M eir, J. W. M o o n, Path edge-covering constants for certain families o f trees, Util. Math., 4 (978), [7 ] H. S. N a, A R a p o p o r t, Distribution o f nodes o f a tree by degree. Mathematical Biosciences, 6 (970), M. Дондаевский, E. Шиманьский, О распределении степеней вершии в слоях случайных рекуррентных деревьев Слой S/< корневого дерева это множество всех вершин, расстояние от корня которых равняется к. Пусть Аг (п, к) есть математическое ожидание числа вершин степени г в слое Sk для семьи всех рекуррентных деревьев, имеющих п вершин. Целью настоящей статьи является обозначение Аг (п, к).
Storm Open Library 3.0
S 50% off! 3 O L Storm Open Library 3.0 Amor Sans, Amor Serif, Andulka, Baskerville, John Sans, Metron, Ozdoby,, Regent, Sebastian, Serapion, Splendid Quartett, Vida & Walbaum. d 50% f summer j sale n
More informationREMARKS ON ESTIMATING THE LEBESGUE FUNCTIONS OF AN ORTHONORMAL SYSTEM UDC B. S. KASlN
Мат. Сборник Math. USSR Sbornik Том 106(148) (1978), Вып. 3 Vol. 35(1979), o. 1 REMARKS O ESTIMATIG THE LEBESGUE FUCTIOS OF A ORTHOORMAL SYSTEM UDC 517.5 B. S. KASl ABSTRACT. In this paper we clarify the
More informationAbout One way of Encoding Alphanumeric and Symbolic Information
Int. J. Open Problems Compt. Math., Vol. 3, No. 4, December 2010 ISSN 1998-6262; Copyright ICSRS Publication, 2010 www.i-csrs.org About One way of Encoding Alphanumeric and Symbolic Information Mohammed
More informationMath-Net.Ru All Russian mathematical portal
Math-Net.Ru All Russian mathematical portal U. V. Linnik, On the representation of large numbers as sums of seven cubes, Rec. Math. [Mat. Sbornik] N.S., 1943, Volume 12(54), Number 2, 218 224 Use of the
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Garyfalos Papaschinopoulos; John Schinas Criteria for an exponential dichotomy of difference equations Czechoslovak Mathematical Journal, Vol. 35 (1985), No. 2, 295 299
More informationSection 11.1 Sequences
Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Otto Steinfeld On semigroups which are unions of completely 0-simple subsemigroups Czechoslovak Mathematical Journal, Vol. 16 (1966), No. 1, 63 69 Persistent URL: http://dml.cz/dmlcz/100710
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Stanislav Jílovec On the consistency of estimates Czechoslovak Mathematical Journal, Vol. 20 (1970), No. 1, 84--92 Persistent URL: http://dml.cz/dmlcz/100946 Terms of
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Vítězslav Novák On a power of relational structures Czechoslovak Mathematical Journal, Vol. 35 (1985), No. 1, 167 172 Persistent URL: http://dml.cz/dmlcz/102006 Terms
More informationON ALGORITHMS INVARIANT T 0 NONLINEAR SCALING WITH INEXACT SEARCHES
Chin. Aim. of Math. 8B (1) 1987 ON ALGORITHMS INVARIANT T 0 NONLINEAR SCALING WITH INEXACT SEARCHES 'В щ о К л х о д ш (ЯДОф).* Oh en Zh i (F&, Abstract Among the researches of unconstrained optimization
More informationTHE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES. Changwoo Lee. 1. Introduction
Commun. Korean Math. Soc. 18 (2003), No. 1, pp. 181 192 THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES Changwoo Lee Abstract. We count the numbers of independent dominating sets of rooted labeled
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Štefan Schwarz Prime ideals and maximal ideals in semigroups Czechoslovak Mathematical Journal, Vol. 19 (1969), No. 1, 72 79 Persistent URL: http://dml.cz/dmlcz/100877
More informationDisjoint Hamiltonian Cycles in Bipartite Graphs
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),
More informationNUMERICAL SIMULATION OF MHD-PROBLEMS ON THE BASIS OF VARIATIONAL APPROACH
NUMERICAL SIMULATION OF MHD-PROBLEMS ON THE BASIS OF VARIATIONAL APPROACH V.M. G o lo v izn in, A.A. Sam arskii, A.P. Favor s k i i, T.K. K orshia In s t it u t e o f A p p lie d M athem atics,academy
More informationV X Y Y X D Z D Z. D is V D Y Y D. ,, if,, V V X V X. f we will compare binary relation
International Journal of Engineering Science and Innovative echnology (IJESI) Volume Issue 3 May 201 Finite semigroups of binary relations defined by semi lattices of the class Σ( ) Mzevinar Bakuridze
More informationPLISKA STUDIA MATHEMATICA BULGARICA
Provided for non-commercial research and educational use. Not for reproduction, distribution or commercial use. PLISKA STUDIA MATHEMATICA BULGARICA ПЛИСКА БЪЛГАРСКИ МАТЕМАТИЧЕСКИ СТУДИИ The attached copy
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
More informationSlowing-down of Charged Particles in a Plasma
P/2532 France Slowing-down of Charged Particles in a Plasma By G. Boulègue, P. Chanson, R. Combe, M. Félix and P. Strasman We shall investigate the case in which the slowingdown of an incident particle
More informationPOSITIVE FIXED POINTS AND EIGENVECTORS OF NONCOMPACT DECRESING OPERATORS WITH APPLICATIONS TO NONLINEAR INTEGRAL EQUATIONS** 1.
Chin. Ann. of Math. 14B: 4(1993), 419-426. POSITIVE FIXED POINTS AND EIGENVECTORS OF NONCOMPACT DECRESING OPERATORS WITH APPLICATIONS TO NONLINEAR INTEGRAL EQUATIONS** Guo D a j u n * * A b stra c t The
More informationNEW ALGORITHM FOR MINIMAL SOLUTION OF LINEAR POLYNOMIAL EQUATIONS
KYBERNETIKA - VOLUME 18 (1982), NUMBER 6 NEW ALGORITHM FOR MINIMAL SOLUTION OF LINEAR POLYNOMIAL EQUATIONS JAN JEZEK In this paper, a new efficient algorithm is described for computing the minimal-degree
More information3 /,,,:;. c E THE LEVEL DENSITY OF NUCLEI IN THE REGION 230 ~ A < 254. A.L.Komov, L.A.Malov, V.G.Soloviev, V.V.Voronov.
~ - t-1 'I I 3 /,,,:;. c E4-9236 A.L.Komov, L.A.Malov, V.G.Soloviev, V.V.Voronov THE LEVEL DENSITY OF NUCLEI IN THE REGION 230 ~ A < 254 1975 E4-9236 AX.Komov, L.A.Malov, V.G.SoIoviev, V.V.Voronov THE
More informationCounterexamples in Analysis
Counterexamples in Analysis Bernard R. Gelbaum University of California, Irvine John M. H. Olmsted Southern Illinois University Dover Publications, Inc. Mineola, New York Table of Contents Part I. Functions
More informationITERATION OF ANALYTIC NORMAL FUNCTIONS OF MATRICES
Ohin. Ann. of Math. 6B (1) 1985 ITERATION OF ANALYTIC NORMAL FUNCTIONS OF MATRICES Tao Zhigttang Abstract In this paper,, the author proves that the classical theorem of Wolff in the theory of complex
More informationISOMORPHISMS OF STABLE STEINBERG GROUPS** 1. Introduction
Cbm. Ann. of Math. 14B: 2(1993), 183-188: ISOMORPHISMS OF STABLE STEINBERG GROUPS** L i F u a n * Abstract In [2] the author discussed the isomorphisms between two unstable Steinberg groups St %(A) : and
More informationConstructing models of flow chemicals technology systems by realization theory
Constructing models of flow chemicals technology systems by realization theory "P. BRUNO VSKÝ, b J. ILAVSKÝ, and b M. KRÁLIK "Institute of Applied Mathematics and Computing, Komenský University, 816 31
More informationKRUSKAL-WALLIS TEST ÍN MULTIPLE COMPARISONS
A C T A U N I V E R S I T A T I S L O D Z I E N S I S FO LIA OECONOM ICA 225, 2009 D a riu sz P a rys 5j( KRUSKAL-WALLIS TEST ÍN MULTIPLE COMPARISONS A bstract In this paper we show that the Kruskal-Wallis
More informationSINGULAR PERTURBATIONS FOR QUASIUNEAR HYPERBOUC EQUATIONS. a " m a *-+».(«, <, <,«.)
Chm. Am. of Math. 4B (3) 1983 SINGULAR PERTURBATIONS FOR QUASIUNEAR HYPERBOUC EQUATIONS G a o R ttxi ( «* * > ( Fudan University) Abstract This paper deals with the following mixed problem for Quasilinear
More informationNONLINEAR CONTROL FOR HIGH-ANGLE-OF-ATTACK AIRCRAFT FLIGHT USING THE STATE-DEPENDENT RICCATI EQUATION
UDC 629.72.57 A. Prach, O. ekinalp Р о з д і л 3. 159 NONLINEAR CONROL FOR HIGH-ANGLE-OF-AACK AIRCRAF FLIGH USING HE SAE-DEPENDEN RICCAI EQUAION Introduction Flight control systems for aerospace vehicles
More informationDependence of Slater- Condon parameters on electron configuration. II. Slater Condon parameters of elements of the first transition series
Dependence of Slater- Condon parameters on electron configuration. II. Slater Condon parameters of elements of the first transition series "P. PELIKÁN, b R. BOČA, Ь М. UŠKA, and C L. TURI NAÜY 'Department
More informationEquilibrium "solidus liquidus" in systems with limited solid solutions*
Equilibrium "solidus liquidus" in systems with limited solid solutions* M. MALINOVSKÝ Department of Inorganic Technology, Slovak Technical University, SSO 37 Bratislava Received 29 July 1976 An equation
More informationC-CC514 NT, C-CC514 PL C-CC564 NT, C-CC564 PL C-CC574 NT, C-CC574 PL C-CC714 NT, C-CC714 PL C-CC764 NT, C-CC764 PL C-CC774 NT, C-CC774 PL
SETUP MANUAL COMBINATION CAMERA OUTDOOR COMBINATION CAMERA C-CC514 NT, C-CC514 PL C-CC564 NT, C-CC564 PL C-CC574 NT, C-CC574 PL C-CC714 NT, C-CC714 PL C-CC764 NT, C-CC764 PL C-CC774 NT, C-CC774 PL Thank
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Jan Kučera Solution in large of control problem ẋ = (Au + Bv)x Czechoslovak Mathematical Journal, Vol. 17 (1967), No. 1, 91 96 Persistent URL: http://dml.cz/dmlcz/100763
More informationK.G.Klimenko ON NECESSARY AND SUFFICIENT CONDITIONS FOR SOME HIGGS POTENTIALS TO BE BOUNDED FROM BELOW
I N S T I T U T E F O R H I G H E N E R G Y P H Y S I C S И Ф В Э 84-43 ОТФ K.G.Klimenko ON NECESSARY AND SUFFICIENT CONDITIONS FOR SOME HIGGS POTENTIALS TO BE BOUNDED FROM BELOW Serpukhov 2984 K.G.Kllmenko
More informationSolution properties of poly (vinyl chloride) in tetrahydropyran
Solution properties of poly (vinyl chloride) in tetrahydropyran "L. LAPČÍK, b D. LATH, b E. LATHOVÁ, a J. VALÁŠEK, and C B. POLEK "Polygraphy and Photctechnology Group, Department of Textile, Pulp, and
More informationMolar electrical conductivity of the system Ca(N0 3 ) 2 + CaBr 2 + H 2 0
Molar electrical conductivity of the system Ca(N0 3 0 J. NOVÁK and I. SLÁMA Institute of Inorganic Chemistry, Czechoslovak Academy of Sciences, 160 00 Prague eceived 28 September 1979 Molar electrical
More informationFormal first-order chemical kinetics
Formal first-order chemical kinetics V KVASNIČKA Department of Mathematics, Faculty of Chemical Technology, Slovak Technical University, CS-812 37 Bratislava Received 29 May 1986 Dedicated to Professor
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More informationCOMPLETE HYPERSURFACES WITH CONSTANT SCALAR CURVATURE AND CONSTANT MEAN CURVATURE IN Я4. Introduction
Chm. A m. of Math. 6B (2) 1985 COMPLETE HYPERSURFACES WITH CONSTANT SCALAR CURVATURE AND CONSTANT MEAN CURVATURE IN Я4 H u a n g Х и А Ж го о С ^ ^ Щ )* Abstract Let M be a 3-dimersionaI complete and connected
More informationOn the normalized Laplacian energy and general Randić index R 1 of graphs
On the normalized Laplacian energy and general Randić index R of graphs Michael Cavers a Shaun Fallat a Steve Kirkland ab3 a Department of Mathematics and Statistics University of Regina Regina SK Canada
More informationBounds for pairs in partitions of graphs
Bounds for pairs in partitions of graphs Jie Ma Xingxing Yu School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0160, USA Abstract In this paper we study the following problem of Bollobás
More informationA note on a construction of J. F. Feinstein
STUDIA MATHEMATICA 169 (1) (2005) A note on a construction of J. F. Feinstein by M. J. Heath (Nottingham) Abstract. In [6] J. F. Feinstein constructed a compact plane set X such that R(X), the uniform
More informationCOMPARING PERIODIC ORBITS OF MAPS OF THE INTERVAL
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 333, Number 2, October 1992 COMPARING PERIODIC ORBITS OF MAPS OF THE INTERVAL C. BERNHARDT, E. COVEN, M. MISIUREWICZ, AND I. MULVEY Abstract. Let
More informationMath-Net.Ru All Russian mathematical portal
Math-Net.Ru All Russia mathematical portal H. G. Tucker, A Estimate of the Compoudig Distributio of a Compoud Poisso Distributio, Teor. Veroyatost. i Primee., 1963, Volume 8, Issue 2, 211 216 Use of the
More informationOn the number of matchings of a tree.
On the number of matchings of a tree. Stephan G. Wagner Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-800 Graz, Austria Abstract In a paper of Klazar, several counting examples
More informationGraceful Tree Conjecture for Infinite Trees
Graceful Tree Conjecture for Infinite Trees Tsz Lung Chan Department of Mathematics The University of Hong Kong, Pokfulam, Hong Kong h0592107@graduate.hku.hk Wai Shun Cheung Department of Mathematics The
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Ladislav Bican Completely decomposable abelian groups any pure subgroup of which is completely decomposable Czechoslovak Mathematical Journal, Vol. 24 (1974), No. 2, 176
More information; ISBN
Ы IV - (9 2017.) 2017 629.488; 629.4.015 39.2 : IV - /. -., 2017. 368.,,,,,.,,.,.. 213.. 31.. 154. :.,.. (. );.,.. ;.,.. ;.,.. ;.,.. (.. ). :.,.. ;.,... ISBN 978-5-949-41182-7., 2017 2 ..,..,..... 7..,..,.........
More informationThe Fluxes and the Equations of Change
Appendix 15 The Fluxes nd the Equtions of Chnge B.l B. B.3 B.4 B.5 B.6 B.7 B.8 B.9 Newton's lw of viscosity Fourier's lw of het conduction Fick's (first) lw of binry diffusion The eqution of continuity
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationDepartment of Chemical Engineering, Slovak Technical Bratislava. Received 8 October 1974
Calculation of the activity coefficients and vapour composition from equations of the Tao method modified for inconstant integration step Ax. П. Ternary systems J. DOJČANSKÝ and J. SUROVÝ Department of
More informationTibetan Unicode EWTS Help
Tibetan Unicode EWTS Help Keyboard 2003 Linguasoft Overview Tibetan Unicode EWTS is based on the Extended Wylie Transliteration Scheme (EWTS), an approach that avoids most Shift, Alt, and Alt + Shift combinations.
More informationInfra-red spectra of sodium salts of some primary nitroparaffins. Z. BUCZKOWSKI and T. URBAŃSKI
Spectrochimica Acta, 902, Vol. IS, pp. 87 to 94. Pcrgamon Press Ltd. Printed in Northern Ireland Infra-red spectra of sodium salts of some primary nitroparaffins Z. BUCZKOWSKI and T. URBAŃSKI Warsaw Institute
More informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
More informationtfb 1 U ъ /ъ /5 FOREIGN OFFICE llftil HNP XI?/ Чо /о/ F il e ... SI» ИJ ... -:v. ' ' :... N a m e of File : Re turned Re turned Re turned.
J, FOREIGN OFFICE w l Ê! Ê È, Ê f y / " / f ^ ' ß (P rt (C L A IM S ) f llftil! ^ ' F il e "V U L V -» HNP т с т а э т! У ^ у д а и г - д л? г; j g r ; ' / ' '...1.?.:, ;, v',. V -.. M '. - ni/jjip.'*
More informationMath-Net.Ru All Russian mathematical portal
Math-Net.Ru All Russian mathematical portal N. Tchudakoff, On the difference between two neighbouring prime numbers, Rec. Math. [Mat. Sbornik] N.S., 936, Volume (43), Number 6, 799 84 Use of the all-russian
More information1. s& is a Generator on V'
Chin. Atm. of Math. 6B (1) 1985 GENERALIZED SEMIGROUP ON (V, H, a) Y ao Y unlong A b stract Let 7 and H be two Hilbert spaces satisfying the imbedding relation V c.r. Let л/г F >F' be the linear operator
More informationD ETERM IN ATIO N OF SO URCE A N D V A R IA B LE CO EFFICIEN T IN TH E INVERSE PROBLEM FO R TH E W A V E S EQUATION. G.I.
НАУЧНЫЕ ВЕДОМОСТИ i^p. I Серия Математика. Физика. 2017 6 (255). Выпуск 46 У Д К 517.958:531-72, 51 7-958:539-3(4) D ETERM IN ATIO N OF SO URCE A N D V A R IA B LE CO EFFICIEN T IN TH E INVERSE PROBLEM
More informationTHE DEGREE DISTRIBUTION OF RANDOM PLANAR GRAPHS
THE DEGREE DISTRIBUTION OF RANDOM PLANAR GRAPHS Michael Drmota joint work with Omer Giménez and Marc Noy Institut für Diskrete Mathematik und Geometrie TU Wien michael.drmota@tuwien.ac.at http://www.dmg.tuwien.ac.at/drmota/
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Milan Tvrdý Correction and addition to my paper The normal form and the stability of solutions of a system of differential equations in the complex domain Czechoslovak
More informationShort cycles in random regular graphs
Short cycles in random regular graphs Brendan D. McKay Department of Computer Science Australian National University Canberra ACT 0200, Australia bdm@cs.anu.ed.au Nicholas C. Wormald and Beata Wysocka
More informationarxiv: v2 [math.nt] 4 Jun 2016
ON THE p-adic VALUATION OF STIRLING NUMBERS OF THE FIRST KIND PAOLO LEONETTI AND CARLO SANNA arxiv:605.07424v2 [math.nt] 4 Jun 206 Abstract. For all integers n k, define H(n, k) := /(i i k ), where the
More informationExtremal Kirchhoff index of a class of unicyclic graph
South Asian Journal of Mathematics 01, Vol ( 5): 07 1 wwwsajm-onlinecom ISSN 51-15 RESEARCH ARTICLE Extremal Kirchhoff index of a class of unicyclic graph Shubo Chen 1, Fangli Xia 1, Xia Cai, Jianguang
More informationPartitioning a graph into highly connected subgraphs
Partitioning a graph into highly connected subgraphs Valentin Borozan 1,5, Michael Ferrara, Shinya Fujita 3 Michitaka Furuya 4, Yannis Manoussakis 5, Narayanan N 5,6 and Derrick Stolee 7 Abstract Given
More informationAlgorithmic Approach to Counting of Certain Types m-ary Partitions
Algorithmic Approach to Counting of Certain Types m-ary Partitions Valentin P. Bakoev Abstract Partitions of integers of the type m n as a sum of powers of m (the so called m-ary partitions) and their
More informationOn Weak Chromatic Polynomials of Mixed Graphs
On Weak Chromatic Polynomials of Mixed Graphs Daniel Blado California Institute of Technology Joseph Crawford Morehouse College July 27, 2012 Taïna Jean-Louis Amherst College Abstract Modeling of metabolic
More informationA = A U. U [n] P(A U ). n 1. 2 k(n k). k. k=1
Lecture I jacques@ucsd.edu Notation: Throughout, P denotes probability and E denotes expectation. Denote (X) (r) = X(X 1)... (X r + 1) and let G n,p denote the Erdős-Rényi model of random graphs. 10 Random
More informationREMARKS ON CLASSICAL MEANS FOR ONE AND MANY SAMPLES. 1. Introduction
A C T A U N I V E R S I T A T I S L O D Z I E N S I S FOLIA OECONOMICA 225, 2009 sje W iesła w W agner REMARKS ON CLASSICAL MEANS FOR ONE AND MANY SAMPLES A bstract In the paper there were given basic
More informationCounting the average size of Markov graphs
JOURNAL OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4866, ISSN (o) 2303-4947 www.imvibl.org /JOURNALS / JOURNAL Vol. 7(207), -6 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA
More informationOn Odd Sum Graphs. S.Arockiaraj. Department of Mathematics. Mepco Schlenk Engineering College, Sivakasi , Tamilnadu, India. P.
International J.Math. Combin. Vol.4(0), -8 On Odd Sum Graphs S.Arockiaraj Department of Mathematics Mepco Schlenk Engineering College, Sivakasi - 66 00, Tamilnadu, India P.Mahalakshmi Department of Mathematics
More informationJ.Bell, C.T.Coffin, B.P.Roe, A.A.Seidl, D.Sinclair, E.Wang (University of Michigan,Ann Arbon, Michigan USA)
I N S T I T U T E FOR HIGH ENERGY P H Y S I C S И В Э 81-в5 Н V.V.Ammosov, A.G.Denisov, P.F.Ermolov, G.S.Gapienko, V.A.Gapienko, V.I.Klyukhin, V.I.Koreshev, P.V.Pitukhin, V.I.Sirotenko, E.A.Slobodyuk,
More informationPLISKA STUDIA MATHEMATICA BULGARICA
Provided for non-commercial research and educational use. Not for reproduction, distribution or commercial use. PLISKA STUDIA MATHEMATICA BULGARICA ПЛИСКА БЪЛГАРСКИ МАТЕМАТИЧЕСКИ СТУДИИ The attached copy
More informationDYNAMIC THEORY X-RAY RADIATION BY RELATIVISTIC ELECTRON IN COMPOSITE TARGET. S.V. Blazhevich, S.N. Nemtsev, A.V. Noskov, R.A.
96 НАУЧНЫЕ ВЕДОМОСТИ ': Серия Математика. Физика. 2015 23 (220). Выпуск 41 УДК 537-8 DYNAMIC THEORY X-RAY RADIATION BY RELATIVISTIC ELECTRON IN COMPOSITE TARGET S.V. Blazhevich, S.N. Nemtsev, A.V. Noskov,
More informationMULTISECTION METHOD AND FURTHER FORMULAE FOR π. De-Yin Zheng
Indian J. pure appl. Math., 39(: 37-55, April 008 c Printed in India. MULTISECTION METHOD AND FURTHER FORMULAE FOR π De-Yin Zheng Department of Mathematics, Hangzhou Normal University, Hangzhou 30036,
More informationX n = c n + c n,k Y k, (4.2)
4. Linear filtering. Wiener filter Assume (X n, Y n is a pair of random sequences in which the first component X n is referred a signal and the second an observation. The paths of the signal are unobservable
More informationMath-Net.Ru All Russian mathematical portal
Math-Net.Ru All Russian mathematical portal P. Masani, N. Wiener, On Bivariate Stationary Processes and the Factorization of Matrix-Valued Functions, Teor. Veroyatnost. i Primenen., 1959, Volume 4, Issue
More informationReverse mathematics of some topics from algorithmic graph theory
F U N D A M E N T A MATHEMATICAE 157 (1998) Reverse mathematics of some topics from algorithmic graph theory by Peter G. C l o t e (Chestnut Hill, Mass.) and Jeffry L. H i r s t (Boone, N.C.) Abstract.
More informationPartitioning a graph into highly connected subgraphs
Partitioning a graph into highly connected subgraphs Valentin Borozan 1,5, Michael Ferrara, Shinya Fujita 3 Michitaka Furuya 4, Yannis Manoussakis 5, Narayanan N 6 and Derrick Stolee 7 Abstract Given k
More informationGraphic sequences, adjacency matrix
Chapter 2 Graphic sequences, adjacency matrix Definition 2.1. A sequence of integers (d 1,..., d n ) is called graphic if it is the degree sequence of a graph. Example 2.2. 1. (1, 2, 2, 3) is graphic:
More information\ / I N S T I T U T E FOR HIGH ENERGY PHYSICS И Ф В Э
\ / I N S T I T U T E FOR HIGH ENERGY PHYSICS И Ф В Э 80-179 ОЭФ SERP-E-134 R.I.Dzhelyadin, S.V.Golovkin, A.S.Konstantinov, V.F.Konstantinov, V.P.Kubarovski, L.G.Landsberg, V.A.Mukhin, V.F.Obrastsov, Yu.D.Prokoshkin,
More informationPath decompositions and Gallai s conjecture
Journal of Combinatorial Theory, Series B 93 (005) 117 15 www.elsevier.com/locate/jctb Path decompositions and Gallai s conjecture Genghua Fan Department of Mathematics, Fuzhou University, Fuzhou, Fujian
More informationaw. WARADZIN andbj. SUROVÝ ^Research Laboratory of the Establishment "Duslo", n.e., Šala
Equilibrium data of the liquid vapour systems containing acetone, vinyl acetate, crotonaldehyde, and acetic acid. II. Experimental data for isothermal binary systems processed by means of the Renon NRTL
More informationPLISKA STUDIA MATHEMATICA BULGARICA
Provided for non-commercial research and educational use. Not for reproduction, distribution or commercial use. PLISKA STUDIA MATHEMATICA BULGARICA ПЛИСКА БЪЛГАРСКИ МАТЕМАТИЧЕСКИ СТУДИИ The attached copy
More information2 8 P. ERDŐS, A. MEIR, V. T. SÓS AND P. TURÁN [March It follows thus from (2.4) that (2.5) Ak(F, G) =def 11m 1,,,,(F, G) exists for every fixed k. By
Canad. Math. Bull. Vol. 15 (1), 1972 ON SOME APPLICATIONS OF GRAPH THEORY III BY P. ERDŐS, A. MEIR, V. T. SOS, and P. TURAN In memory of Leo Moser, a friend and colleague 1. In the first and second parts
More informationAalborg Universitet. The number of independent sets in unicyclic graphs Pedersen, Anders Sune; Vestergaard, Preben Dahl. Publication date: 2005
Aalborg Universitet The number of independent sets in unicyclic graphs Pedersen, Anders Sune; Vestergaard, Preben Dahl Publication date: 2005 Document Version Publisher's PDF, also known as Version of
More informationDominating a family of graphs with small connected subgraphs
Dominating a family of graphs with small connected subgraphs Yair Caro Raphael Yuster Abstract Let F = {G 1,..., G t } be a family of n-vertex graphs defined on the same vertex-set V, and let k be a positive
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Eduard Feireisl On the existence of periodic solutions of a semilinear wave equation with a superlinear forcing term Czechoslovak Mathematical Journal, Vol. 38 (1988),
More informationBulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26
Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts - 001 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 6 SOME SPECTRAL PROPERTIES OF STARLIKE TREES M. LEPOVIĆ, I.
More informationASYMPTOTIC DISTRIBUTION OF THE MAXIMUM CUMULATIVE SUM OF INDEPENDENT RANDOM VARIABLES
ASYMPTOTIC DISTRIBUTION OF THE MAXIMUM CUMULATIVE SUM OF INDEPENDENT RANDOM VARIABLES KAI LAI CHUNG The limiting distribution of the maximum cumulative sum 1 of a sequence of independent random variables
More informationScientific Periodicals NASB (online-access)
СЕРЫЯ БIЯЛАГIЧНЫХ НАВУК 2011 3 СЕРИЯ БИОЛОГИЧЕСКИХ НАУК 2011 3 ЗАСНАВАЛЬНIК НАЦЫЯнальнАЯ АКАДЭМIЯ НАВУК БЕЛАРУСI Часопіс выдаецца са студзеня 1956 г. Выходзіць чатыры разы ў год ВЕСЦІ НАЦЫЯНАЛЬНАЙ АКАДЭМІІ
More informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationestimate the diameters of the octahedron B, 1 <i?i<oo, in the metric of Let us specify some of the notation to be used below.
SOME PROPERTIES OF MATRICES OF BOUNDED OPERATORS FROM SPACE i\ TO l\ B. S. Kashi n Izvestiya Akademii Nauk Armyanskoi SSR. Matematika, Vol. 15, No. 5, pp. 379-394, 1980 UDC 517.51 Introduction. Assume
More informationDetermination of Molar Gibbs Energies and Entropies of Mixing of Melts in Binary Subsystems of the System CaO Si0 2. Si0 2
Determination of Molar Gibbs Energies and Entropies of Mixing of Melts in Binary Subsystems of the CaO Si CaO Al Si CaO Al Si I. Theoretical Part. CaO Al Si CaO Al Si I. PROKS, J. STREČKO, L KOSA, I. NERÁD,
More informationLecture 20: Lagrange Interpolation and Neville s Algorithm. for I will pass through thee, saith the LORD. Amos 5:17
Lecture 20: Lagrange Interpolation and Neville s Algorithm for I will pass through thee, saith the LORD. Amos 5:17 1. Introduction Perhaps the easiest way to describe a shape is to select some points on
More informationSome hierarchies for the communication complexity measures of cooperating grammar systems
Some hierarchies for the communication complexity measures of cooperating grammar systems Juraj Hromkovic 1, Jarkko Kari 2, Lila Kari 2 June 14, 2010 Abstract We investigate here the descriptional and
More informationPacking chromatic number of subcubic graphs
Packing chromatic number of subcubic graphs József Balogh Alexandr Kostochka Xujun Liu arxiv:1703.09873v2 [math.co] 30 Mar 2017 March 31, 2017 Abstract A packing k-coloring of a graph G is a partition
More informationAn Application of Catalan Numbers on Cayley Tree of Order 2: Single Polygon Counting
BULLETIN of the Malaysian Mathematical Sciences Society http://math.usm.my/bulletin Bull. Malays. Math. Sci. Soc. (2) 31(2) (2008), 175 183 An Application of Catalan Numbers on Cayley Tree of Order 2:
More informationMath-Net.Ru All Russian mathematical portal
Math-Net.Ru All Russian mathematical portal A. Hall, M. da Graça Temido, On the maximum term of MA and Max-AR models with margins in Anderson s class, Teor. Veroyatnost. i Primenen., 2006, Volume 51, Issue
More informationGraph Theory and Interconnection Networks
Graph Theory and Interconnection Networks Lih-Hsing Hsu and Cheng-Kuan Lin @ CRC Press Taylor & Francis Group Boca Raton London New York CRC Press is an imprint of the Taylor & Francis Group, an informa
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Milan Tvrdý The normal form and the stability of solutions of a system of differential equations in the complex domain Czechoslovak Mathematical Journal, Vol. 20 (1970),
More information