Secant Tree Calculus. Dominique Foata and Guo-Niu Han
|
|
- Arlene York
- 5 years ago
- Views:
Transcription
1 October 4, 203 Secant Tree Calculus Doinique Foata and Guo-Niu Han Abstract. A true Tree Calculus is being developed to ae a joint study of the two statistics eoc (end of inial chain) and po (parent of axiu leaf) on the set of secant trees. Their joint distribution restricted to the set {eoc po } is shown to satisfy two partial difference equation systes, to be syetric and to be expressed in the for of an explicit three-variable generating function.. Introduction Recently, a revival of studies on arithetical and cobinatorial properties of both tangent and secant nubers has taen place, using Désiré André s old odel of alternating perutations [An979, An88], or the equivalent structure of binary increasing labeled trees, called tangent and secant trees. See, e.g., the papers [GHZ0, Pr08, Pr00, Fu00, HRZ0, Jos0, SZ0, KR2, FH2], or the eoir [St0] and our studies on the doubloon odel [FH0, FH0a, FH]. Recall that the secant nubers, denoted by E, appear in the Taylor expansions of sec u: (.) sec u = cos u = n 0 u ()! E = + u2 2! + u4 4! 5 + u6 u8 u ! 8! 0! (see, e.g., [Ni23, p ], [Co74, p ]). The study of the secant nubers E (n 0) developed in the present paper aes use of the cobinatorial odel of binary increasing labeled trees (T ) (n 0) with an even nuber of nodes, also called secant trees, as #T = E. Their definitions are recalled in Section 2; just note that in such a tree each node has no child (it is then called a leaf), or two children, except the rightost one that has one left child only. See, e.g., the whole set T 4 displayed in Fig... The refineent of each secant nuber E, we are concerned with, taes the for of a double su E =, f (, ) of positive integers, where each suand f (, ) is defined by eans of two statistics eoc ( end of inial chain ) and po ( parent of axiu leaf ), whose doain is T, in the following anner: (.2) f (, ) := #{t T :eoc(t) = and po(t) = }. Key words and phrases. Tree Calculus, partial difference equations, binary increasing labeled trees, secant and tangent trees, end of inial chain, parent of axiu leaf, bivariate distributions, secant nubers, Entringer distribution, alternating perutations. Matheatics Subject Classifications. 05A5, 05A30, B68.
2 DOMINIQUE FOATA AND GUO-NIU HAN The end-of-inial-chain eoc(t) of a tree t is defined to be the label of the leaf that is reached, when, starting with the tree root, one gets along a chain of nodes, always going fro parent to the saller child, if any. The parent-of-axiu-leaf po(t) of t fro T is siply defined to be the label of the father of leaf. Again, chec Fig.. where the values of eoc and po are given for all trees fro T eoc = po = Fig Those two statistics have been introduced by Poupard [Po89] on tangent trees (n odd). She proved that eoc and +po were equidistributed on each set T + of tangent trees, also that their coon univariable distribution satisfied a difference equation syste; she further calculated their generating function. In [FH3] it was proved that the equidistribution actually holds on every set T n (n ) of tangent and secant trees by constructing an explict bijection φ of T n onto itself with the property that: +po(t) = eoc φ(t) for all t. The purpose of this paper is then to calculate the joint distribution of eoc and po on each T and in particular derive an explicit threevariable exponential generating function (Theore.5). To achieve this we prove that the coefficients f (, ) are solutions of two partial difference equation systes. The proof is based on an original true Tree Calculus, which consists of partitioning each set of secant trees into saller subsets and developing a natural algebra on those subsets (Sections 3, 4 and 5). Note that the ranges of eoc and po on T are the intervals [2, ] and [, ], respectively. The first values of the atrices M := (f (, )) (2 ; ) are listed in Table.2. For each atrix have been evaluated the row sus f (, ) := f (, ) = #{t T : eoc(t) = } (resp. colun sus f (, ) := f (, ) = #{t T :po(t) = }) on the rightost colun (resp. the botto row). In the South-East-corner is written the total su (.3) f (, ) =, f (, ) = E. As +po and eoc are equidistributed, we have: (.4) f (, ) = f (, ) (2 ). 2
3 TREE SECANT CALCULUS = 2 3 f 4 (,.) = f 2 (,.) = 2.. M 2 = = 2 M 4 = f 2 (., ) E 2 = 4.. f 4 (., ) 3 E 4 = 5 M 6 = = f 6 (,.) = f 6 (., ) E 6 = 6 M 8 = = f 8 (,.) = f 8 (., ) E 8 = 385 M 0 = = f 0 (,.) = f 0 (., ) E 0 = 5052 Table.2: the atrices M ( n 5) 3
4 DOMINIQUE FOATA AND GUO-NIU HAN On each entry f (, ) ay be defined two partial differences with respect to and as follows: (.5) f (, ) := f ( +, ) f (, ); (.6) f (, ) := f (, + ) f (, ). By convention f (, ) := 0 if (, ) [2, ] [, ]. Our ain results are the following. Theore.. The finite difference equation systes hold: (R ) 2 f (, ) + 4 f 2 (, 2) = 0 (2 3 < ); (R 2) 2 f (, ) + 4 f 2 (, ) = 0 (2 < 3). The first two top rows and rightost two coluns of the upper triangles {f (, ) : 2 < } (n 2) can be evaluated in function of the row or colun sus f 2 (, ), f 2 (, ), as is now stated. Theore.2. We have: (.7) f (2, ) = f 2 (, 2) = f 2 (, ) (3 ); [First top row] f (3, ) = 3 f (2, ) (4 ); [Second top row] f (, ) = f 2 (, ) = f 2 (, ) (2 2); f (, 2) = 3 f (, ) (2 3). Proposition.3. We further have: (.8) (.9) (R 3) [Rightost colun] [Next to rightost colun] f 2 (, ) = ; f (, ) = f 2 (, ) = E 2 (n 2); f (, 2) = 3f 2 (, ) = 3E 2 (n 2); 2 f (, ) + 4 f 2 (, ) = 0 (2 2); (R 4) 2 f (, ) + 4 f 2 (, ) = 0 ( 3). Theore.4. The previous two theores and Proposition.3 provide an explicit algorith for calculating the entries of the upper triangles of the atrices M = (f (, )) (n ). The entries of the lower triangles {f (, ) : < } in Tables. have been calculated directly by eans of forula (.2). Contrary to the upper triangles we do not have any explicit nuerical algorith to get the; only the entries situated on the three sides of those lower triangles can be directly evaluated, as shown in Section 6. See, in particular, Table 6.. For the upper triangles, we can derive an explicit generating function, as stated in the next theore. 4
5 TREE SECANT CALCULUS Theore.5. The triple exponential generating function for the upper triangles of the atrices (f (, )) is given by x y z 2 (.0) f (, ) ( )! ( )! ( 2)! 2 < = cos(2y) + 2 cos(2(x z)) cos(2(z + x)) 2 cos 3. (x + y + z) The right-hand side of (.0) is syetric in x, z. Hence, the change x z in the left-hand side of (.0) shows that (.) f ( +, + ) = f (, ). The upper triangles already entioned are then syetric with respect to their counter-diagonals. This result can also be extended as follows. Theore.6. Let Up() be the set of all (, ) fro [2, ] [, ] such that either, (, ) = (3, ), or (, ) = (, 2). Then (.) holds for every (, ) Up(). Those theores and proposition are proved in the next sections, once the ain ingredients on Tree Calculus have been developed. 2. Tree Calculus We use the traditional vocabulary on trees, such as node, leaf, child, root,... When a node is not a leaf, it is called an internal node. Definition. For each positive integer n a secant tree of size, that is, an eleent of T, is defined by the following axios: () it is a labeled tree with nodes, labeled, 2,..., ; the node labeled being the root; (2) each node has no child (then called a leaf ), or one child, or two children; (3) the label of each node is saller than the label of its children, if any; (4) the tree is planar and each child of each node is, either on the left (it is then called the left child), or on the right (the right child); oreover, the tree can be ebedded on the Euclidean plane as follows: the root has coordinates (0, 0), the left child (if any) (, ), the right child (if any) (, ), the grandchildren (if any) ( 3/2, 2), ( /2, 2), (/2, 2), (3/2, 2), the greatgrandchildren (if any) ( 7/4, 3), ( 5/4, 3),..., (7/4, 3), etc. With this convention all the nodes have different abscissas. The node having the axiu abscissa is then defined in a unique anner. Call it the rightost node. (5) every node is, either a leaf, or a node with two children, except the rightost node, which has one left child, but no right child. This rightost node will then be referred to as being the one-child node. 5
6 DOMINIQUE FOATA AND GUO-NIU HAN The orthogonal projections of the nodes of a secant tree t fro T onto a horizontal axis yields a perutation σ = σ()σ(2) σ() of 2 having the property that x > x 2, x 2 < x 3, x 3 > x 4,..., in an alternating way, usually naed alternating (see [Vi88], [KPP94], [St99]). The corresponding alternating perutation has been indicated for each t T 4 in Fig.. Let t T (n ). If a node labeled a has two children labeled b and c, define in a := in{b, c}; if it has one child b, let in a := b. The inial chain of t is defined to be the sequence a a 2 a 3 a j a j, with the following properties: (i) a = is the label of the root; (ii) for i =, 2,..., j 2 the (i+)-st ter a i+ is the label of an internal node and a i+ = in a i ; (iii) a j is the node of a leaf. Define the end of the inial chain of t to be eoc(t) := a j. If the leaf with the axiu label is incident to a node labeled, define its parent of the axiu leaf to be po(t) :=. See Fig... We adopt the following notations and conventions: for each triple (n,, ) let T,, (resp. T,,, resp. T,,) denote the subset of T of all trees t such that eoc(t) = and po(t) = (resp. eoc(t) =, resp. po(t) = ). Also, sybols representing failies of trees will also designate their cardinalities. With this convention T n,, := #T n,,. The atrix of the upper triangles T,, (2 < ) will be denoted by Upper(T ). Subtrees (possibly epty) are indicated by the sybols,, or. The notation (resp. \, resp. \ ) is used to indicate that the subtree (resp., resp. ) contains the one-child node or is epty. Letters occurring below or next to subtrees are labels of their roots. The end of the inial chain in each tree is represented by a bullet. In the sequel certain failies of secant trees will be represented by sybols, called truns. For exaple, the sybol A = b is the trun that designates the faily of all trees t fro the underlying set T having a node b, parent of both a subtree and the leaf, which is also the end of the inial chain. Notice that unlie the secant trees which are ordered, the trun is unordered, so that (2.) b b. 6
7 TREE SECANT CALCULUS When the subtree contains the one-child node or is epty, we let b A() := b, be the faily of all trees t fro the underlying set T having a node b, parent of the right child and the left child leaf. Let A( ) be the set of all trees fro A such that is not epty and does not contain the one-child node. We have the following decoposition (2.2) A = A( ) + A(). When a further condition (C) is iposed on a trun A we shall use the notation [A, (C)]. For exaple, the sybol B = [ b, a ] is the trun that has the sae characteristic of the trun A as above with the further property that the node labeled a belongs, neither to the subtree of root b, nor to the path going fro root to b. In our Tree Calculus we shall ostly copare the cardinalities of certain pairs of truns, as shown in the following two exaples. Exaple. The two truns + +2 [, ] and [ +, + 2] have the sae cardinalities, by using the bijection ( ). Exaple 2. To copare the cardinalities of the following two truns C = and D =, we decopose the according to the location of the one-child node: +2 C = + +2 \ \ +2
8 DOMINIQUE FOATA AND GUO-NIU HAN := C( ) + C( \ ) + C() + C(\ ); +2 D = + +2 := D( ) + D( \ ) + D(). \ + +2 In the above seven truns of the two decopositions the sybols,, without slash are not epty and do not contain the one-child node. Furtherore, note that D = D( ) + D( \ ) + D(\ ) also holds. Pivoting the two subtrees on each of the nodes, (), (+2) in C( ) (resp. in D( )) yields the sae trun, as in (2.). We then say that subtree pivoting is peritted on those nodes. Furtherore, the three subtrees, and in C( ) play a syetric role, while in D( ) only and, on the one hand, and and, on the other hand, have a syetric role. Hence, C( ) = 2 D( ). Now, reeber that in each secant tree the one-child node lies at the rightost position. This iplies that subtree pivoting on each of the ancestors of the one-child is not peritted. Thus, subtree pivoting in C( \ ) and D( \ ) is only peritted on nodes + 2 and +. On the other hand, the two subtrees and play a syetric role in C( \ ), but not in D( \ ). Hence, C( \ ) = 2 D( \ ). In C() and D() the two subtrees and play a syetric role. Moreover, subtree pivoting on nodes + 2 is peritted in C(), but not in D(). Hence, so that C() = 2 D(), C 2 D = C(\ ). The decoposition 3. Proof that (R ) holds T,, = + + [ 8, + ]
9 TREE SECANT CALCULUS eans that in each tree fro T,, the node ( + ) is, or is not, the sibling of the leaf. In the next decoposition the node is, or is not, the parent of the leaf ( + ): + T,+, = + + [, ]. As already explained in Exaple, Section 2, we can write: + T,, = T,+, T,, = so that +, 2 T,, = (T,+2, T,+, ) (T,+, T,, ) = + := A B C + D. + Depending on the utual positions of nodes, ( + ) and ( + 2) the further decopositions prevail, as again still reains attached to (): A = [, ] := A + A 2 ; + B = [, ] := B + B 2 ; C = + + [, + 2] := C + C 2 + C 3 ; D = + [, + 2] := D + D 2. In the above decopositions the subsets B and C are identical. Furtherore, A 2 = C 3 and B 2 = D 2. Accordingly, 2 T +,, = 9
10 DOMINIQUE FOATA AND GUO-NIU HAN A 2 B C 2 +D. A further decoposition of those four ters, depending upon the occurrence of the one-child node, is to be wored out: A := A ( ) + A () + A (\ ); B := B ( ) + B (\ ); Now, B ( ) can be decoposed into C 2 := C 2 ( ) + C 2 () + C 2 (\ ); D := D ( ) + D () + D (\ ). + B ( ) = +2 + = +2 + = B, ( ) + B,2 ( ), + +2 where and are supposed to be non-epty in B,2 ( ). By the Tree Calculus techniques developed in Section 2, we have A ( ) = 2 B,2 ( ). On the other hand, B (\ ) can also be written \ + +2 B (\ ) =, so that A () = 2 B (\ ) and A (\ ) = B (\ ). Furtherore, C 2 ( ) = D ( ), C 2 () = 2 D () and C 2 (\ ) = D (\ ). Altogether, A 2 B C 2 + D = ( A ( ) + A () + A (\ ) ) 2 ( B, ( ) + B,2 ( ) + B (\ ) ) ( C 2 ( ) + C 2 () + C 2 (\ ) ) + ( D ( ) + D () + D (\ ) ) = A (\ ) 2 B, ( ) D (). As is supposed to be at least equal to 2, we can write +2\ + +2 A (\ ) =, D () = +, which shows that those two failies are equal. Thus, + 2 T,, = 2 B, ( ) = This expression is also equal to 4 T 2,, 2, because in each tree t fro B the nodes ( + ) and ( + 2) are both leaves. Reove the, as well as the two edges going out of, and subtract 2 fro all the reaining nodes greater than ( + 2). The tree thereby derived belongs to T 2,, 2. 0
11 TREE SECANT CALCULUS 4. Tree Calculus for proving that (R 2) holds With n 3 and 2 < 3 we have: T,, = [, ] + [,, + ], eaning that each tree fro T,, has one of the two fors: either + is incident to, or not, and the leaf is the end of the inial chain. Using the sae dichotoy, T,, = [, ] + [,, ]. As the second ters of the above two equations are in one-to-one correspondence by the transposition (, + ) we have: T,, T,, = [, ] [, ] := B A. In the sae anner, T,,+2 T,, = [, ] [, ] := D C. Thus, 2 T,, = ( T,,+2 T,, ) ( T,, T,, ) = D C B + A. The further decopositions of the coponents of the previous su depend on the utual positions of the nodes, ( + ), ( + 2); D = [ C = [, ] = [ +2 +2,, ] + [, ] := D + D 2 ; +2 +2, ] = [,, ] + [ := C + C 2 ;, ]
12 DOMINIQUE FOATA AND GUO-NIU HAN +2 B = [, ] = [,, + 2] + [, ] [, ] + [, ] + [, ] := B + B 2 + B 3 + B 4 + B 5 ; +2 A = [, ] = [,, + 2 ] + [ := A + A 2,, ] where and cannot be both epty in B 3 and B 5. Obviously, D = B and C = A, so that the su D C B + A ay be written (B 2 B 4 ) (C 2 A 2 ) + (D 2 B 3 B 5 ) 2 B 2, showing that the coponents fall in three categories: () B 2 and B 4 having one subtree to deterine; (2) C 2 and A 2 having two such subtrees; (3) D 2, B 3 and B 5 having three of the. () With the sae notation as in (2.2) write: B 2 = B 2 ( ) + B 2 () and B 4 = B 4 ( ) + B 4 (). First, B 2 ( ) = B 4 ( ), but B 2 () = 2 B 4 (). Hence, +2 B 2 B 4 = B 4 () = [, ]. (2) Next, C 2 = C 2 ( ) + C 2 () + C 2 (\ ) and A 2 = A 2 ( ) + A 2 () + A 2 (\ ). As before, C 2 ( ) = A 2 ( ) and also C 2 (\ ) = A 2 (\ ). However, C 2 () = 2 A 2 (). Altogether, +2 C 2 A 2 = A 2 () = [, ]. (3) The calculation of the third su requires the following decopositions: D 2 := D 2 ( ) + D 2 ( \ ) + D 2 () + D 2 (\ ); B 3 := B 3 ( ) + B 3 ( \ ) + B 3 (); B 5 := B 5 ( ) + B 5 ( \ ) + B 5 (); 2
13 TREE SECANT CALCULUS By the Tree Calculus techniques developed in Section 2, especially Exaple 2, we have D 2 ( ) = 2 B 3 ( ) = 2 B 5 ( ); D 2 ( \ ) = 2 B 3 ( \ ) = 2 B 3 ( \ ); D 2 () = 2 B 3 () = 2 B 3 (). Hence, \ +2 D 2 B 3 B 5 = D 2 (\ ) = [, ]. Now A 2 () = [, ] = [, ] + [, ], where the two subtrees and are non-epty. The last identity can be rewritten: A 2 () = B 4 () + D 2 (\ ). Hence, 2 T,, = D C B + A = (B 2 B 4 ) (C 2 A 2 ) + (D 2 B 3 B 5 ) 2 B 2 = B 4 () A 2 () + D 2 (\ ) 2 B 2 = 2 B 2 = 2 [, ]. The last ter is also equal to 4 T 2,,, because in each tree t fro B 2 the nodes ( + 2) and () are both leaves. Reove the, as well as the two edges going out of ( +), change ( +) into ( 2) and subtract 2 fro all the reaining nodes greater than ( + 2). The tree thereby derived belongs to T 2,,. 5. Proofs of Theore.2, Proposition.3 and Theore.4 Proof of Theore.2. First top row. The trees t fro T such that eoc(t) = 2 contain the edge 2. Reove it and change each reaining node label j by j 2. We get a tree t fro T 2 such that po(t ) = 2. The second equality is a consequence of (.4). Second top row. As 4, the subtrees and below are nonepty, so that \ 3 2 f (3, ) = = := A = A( ) + A(\ ); 3
14 DOMINIQUE FOATA AND GUO-NIU HAN f (2, ) = 3 2 := B = 2 3 = B(), since B( ) is epty. Therefore, A( ) = 2 B( ), A(\ ) = B( ) and then f 2,n (3, ) = 3 f (2, ). Rightost colun. The trees t fro T such that eoc(t) = and po(t) = contain the rightost path ( ). Reove it. What is left is a tree t fro T 2 such that eoc(t ) =. The second equality is a consequence of (.4). Next to rightost colun. If t T and po(t) =, then t contains the rightost path ( ), as already noted. On the other hand, the node with label ( 2) is necessarily a leaf. The transposition ( 2, ) transfors t into a tree t such that po(t ) = 2. Also, reoving the path ( ) and rooting either the subtree, or the subtree, onto the leaf labeled ( 2) gives rise to two trees t 2, t 3 such that po(t 2 ) = po(t 3 ) = 2. Proof of Proposition.3. For (.8) and (.9) we only have to reproduce the proofs ade in Theore.2 for the first and second top rows, the parent of the axiu node playing no role. To obtain (R 4) siply write (R 2) for = 2 and rewrite it using the first identity of Theore.2 dealing with the first top row. Next, (R 3) is deduced fro (R 4) by using identity (.4). Proof of Theore.4. By induction, the row and colun sus f (, ) and f (, ) of the atrices M can be calculated by eans of relations (.8), (.9) and, either (R 3), or (R 4). The first and second top rows (resp. rightost and next to rightost coluns) of the atrix M are nown by Theore.2. It then suffices to apply, either rule (R ), fro top to botto, or rule (R 2) fro right to left to obtain the reaining entries of the upper triangles of M. 6. The lower triangles Observe that for 6 the non-zero entries of the first row, first colun and last colun of M are identical and they differ fro the entries in the botto row. For instance, the sequence 5, 5, 2, 5, 5 in M 8 appears three ties, but the botto row reads: 6, 6, 4, 0, 5. 4
15 TREE SECANT CALCULUS By Theore.2 we already now that f (2, ) = f 2 (, ) = f (, ) (3 ). We also have: f (, ) = f 2 (, ) (3 ), by using this arguent: each tree t fro T satisfying po(t) = has its leaf node incident to root. Just reove the edge. Change each reaining label j to j. We get a secant tree t belonging to T 2. The apping t t is bijective; oreover, eoc(t ) = eoc(t). As a suary, (6.) f (2, ) = f (, ) = f (, ) (3 ). Introduce a further statistic ent (short hand for Entringer ) on each tree t fro T n (even for tangent trees) as follows: ent(t) is the label of the rightost node of t. The distribution of ent is well-nown, ostly associated with the odel of the alternating perutations and traditionally called Entringer distribution (see, e.g., [En66], [Po82], [Po87], [GHZ0]). We also now how to calculate the generating function of that distribution and build up the Entringer triangle (Ent n (j)) ( j n ; n 2), as done in Table 6.. For instance, the leftost 6 on the row n = 7 is the su of all the entries in the previous row (including an entry 0 on the right!); the second 6 is the su of the leftost five entries; 56, the su of the leftost four entries; 46, the su of the leftost three entries; 32, the su of the leftost two entries and 6 is equal to the leftost entry. Let Ent n (j) = #{t T n : ent(t) = j}. j = n = Table 6.. The Entringer distribution Proposition 6.. For 2 2 we have: (6.2) f (, ) = Ent 2 ( ). Proof. Note that in a tree t T such that eoc(t) = and po(t) = the leaf labeled is the unique son of the node labeled, which is also the rightost node. Let ( = a ) a 2 a 3 (a j = ) (a j = ) be the inial chain of t. For a new tree t by eans of the following changes: 5
16 DOMINIQUE FOATA AND GUO-NIU HAN (i) delete the path a j ; (ii) for i =, 2,..., j 2 replace each node label a i of the inial chain by a i+ ; (iii) replace each other node label b by b. The label of the rightost node of t is then equal to the po(t) =. The apping t t is obvious bijective. Finally, the upper diagonal {f ( +, ) : ( )} of the lower triangle in each atrix M can also be fully evaluated. First, in an obvious anner, (6.3) f (2, ) = f (, ) = 0. Second, the identities (6.4) f (3, 2) = 2 f (3, ) = f (, 2) = 2 f (, 2) (also equal to f 4 (, ) = E 4 ) can be proved as follows. To each tree t T such that eoc(t) = 3, po(t) = there correspond two trees, whose eoc and po are equal to 2 and 3, respectively, as illustrated by the diagra: f (3, ) = = f (3, 2). Liewise, each tree t T such that eoc(t) = and po(t) = 2 necessarily has its rightost four nodes equal to ( ), b,, ( 2) in that order, with b being a node less than ( 2). In particular, the latter node is its rightost (one-child) node. To such a tree there correspond two trees, whose eoc and po are equal to ( ), ( 2), respectively, as illustrated by the next diagra. In particular, the node b becoes the rightost node of those two such trees. b 2 2 b. Proposition 6.2. We have the crossing equalities: (6.5) f (, ) + f ( +, )=f (, ) + f (, + ), for
17 TREE SECANT CALCULUS The involved entries are located on the four bullets drawn in the following diagrae. + + Proof. Let i, j be two different integers fro the set {( ),, ()}. Say that i and j are connected in a tree t, if the tree contains the edge i j, or if i and j are brothers and of the is the end of the inial chain of t. Each of the four ingredients of the previous identity is now decoposed into five ters, depending on whether the nodes ( ),, ( + ) are connected or not, naely: no connectedness; only, ( + ) connected; ( ), connected; ( ), ( + ) connected; all connected. Thus, f (, ) = [,, + ] + [ + [, + ] + [,, := A + A 2 + A 3 + A 4 + A 5 ; f ( +, ) = [,, ] + [ + [, f (, ) = [ ] + [ := B + B 2 + B 3 + B 4 + B 5 ;, +, ] + [ + [, + ] + [,, ] + ], ] ] + ] := C + C 2 + C 3 + C 4 ; f (, + ) = [,, ] + [ 7, ], ]
18 + [ DOMINIQUE FOATA AND GUO-NIU HAN, ] + [, := D + D 2 + D 3 + D 4 + D 5. ] + Now, the following identities hold: A = C, A 2 = C 4, A 3 = D 2, A 4 = C 2, B = D, B 3 = D 4, B 4 = D 3, so that i (A i + B i ) i (C i + D i ) = (B 5 D 5 ) (C 3 A 5 B 2 ). As before, we ay write B 5 = B 5 ( ) + B 5 (\ ), D 5 = D 5 ( ) + D 5 (\ ). As B 5 ( ) = D 5 ( ) and B 5 (\ ) = 2 D 5 (\ ), we get: \ (6.6) B 5 D 5 = D 5 (\ ) = = \, as is supposed to be greater than 3. Next, C 3 B 2 = [, + ] [, ] = [, + ] [, ] = C 3 B 2 A 5 = := E F = (E( ) F ( )) + (E(\ ) F (\ )) ; (6.7) \ = F (\ ) = \ =. By coparing the evaluations (6.6) and (6.7) we get: (B 5 D 5 ) (C 3 A 5 B 2 ) = 0. This copletes the proof of (6.5). 8
19 TREE SECANT CALCULUS The entries f (3, 2) and f (, 2), belonging to the upper diagonal of the lower triangle atrix M, being evaluated by identity (6.4), and the entries of the upper triangle being nown by Theore.4, we can apply the crossing equalities (6.5), starting with = 3, and obtain all the values of the entries of that upper diagonal. Altogether, besides the entries of the upper triangle, all the entries lying on the border of the lower triangle can be calculated, as illustrated in boldface in the following atrix M 8. M 8 = = f 8 (,.) = f 8 (., ) E 8 = 385 Table 6.: the atrix M 8, bold-faced entries analytically evaluated. 7. Generating functions for the f (, ) The calculation of the generating functions for the f (, ) is siilar to the calculation ade for the tangent tree case in a our previous paper [FH3]. Recall the definition and soe basic properties of the Poupard atrix. Let G = (g i,j ) (i 0, j 0) be an infinite atrix with nonnegative integral entries. Say that G is a Poupard atrix, if for every i 0, j 0 the following identity holds: (7.) g i,j+2 2 g i+,j+ + g i+2,j + 4 g i,j = 0. Rear. Last coefficient is 4, not 2 as in [FH3]. Let G(x, y) := g i,j (x i /i!) (y j /j!); R i (y) := g i,j (y j /j!) i 0, j 0 (i 0); C j (x) := i 0 g i,j (x i /i!) (j 0) be the exponential generating functions for the atrix itself, its rows and coluns, respectively. The next two leas, serving to prove Theore.5, are replica of Propositions 9. and 9.2 in [FH3]. Their proofs are oitted. 9 j 0
20 DOMINIQUE FOATA AND GUO-NIU HAN Lea 7.. The following four properties are equivalent. (i) G = (g i,j ) (i 0, j 0) is a Poupard atrix; (ii) R i (y) 2 R i+ (y) + R i+2(y) + 4 R i (y) = 0 for all i 0; (iii) C j (x) 2 C j+ (x) + C j+2(x) + 4 C j (x) for all j 0; (iv) G(x, y) satisfies the partial differential equation: 2 G(x, y) (7.2) x G(x, y) + 2 G(x, y) x y y G(x, y) = 0. Lea 7.2. Let G(x, y) be the exponential generating function for a Poupard atrix G. Then, (7.3) G(x, y) = A(x + y) cos(2 y) + B(x + y) sin(2 y), where A(y) and B(y) are two arbitrary series. The entries of the upper triangles of the atrices (M ) (see Table.2) are now recorded as entries of infinite atrices (Ω (p) ) (p ) by (7.4) ω (p) i,j := { 0, if i + j p od 2; f (, ), if i + j p od 2; with := p +, := p + j + 2, := p + i + j + 3. Conversely, i :=, j :=, p :=. In particular, the first one Ω () = (ω () i,j ) (i, j 0) contains the first rows of the upper triangles, displayed as counter-diagonals. Furtherore, a counter-diagonal with zero entries is placed between two successive rows. Ω () = f 4 (2, 3) 0 f 6 (2, 5) 0 f 8 (2, 7) 0 f 0 (2, 9) 0 0 f 6 (2, 4) 0 f 8 (2, 6) 0 f 0 (2, 8) 0 2 f 6 (2, 3) 0 f 8 (2, 5) 0 f 0 (2, 7) f 8 (2, 4) 0 f 0 (2, 6) 0 4 f 8 (2, 3) 0 f 0 (2, 5) f 0 (2, 4) 0 6 f 0 (2, 3) =
21 TREE SECANT CALCULUS Proposition 7.3. Every atrix Ω (p) (p ) is a Poupard atrix. Proof. Using Definition (7.4) we have ω (p) i,j+2 2 ω(p) i+,j+ + ω(p) i+2,j + 4 ω(p) i,j = f +2 (, + 2) 2 f +2 (, + ) + f +2 (, ) + 4 f (, ) = f +2 (, ) + 4 f (, ) = 0, by rule (R 2). The row labeled i of Ω (p) will be denoted by Ω (p) i, and the exponential generating function for that row by Ω (p) i, (y) = j 0 ω(p) i,j yj /j!. Also, Ω (p) (x, y) := i 0 Ω(p) i, (y)xi /i! will be the double exponential generating function for the atrix Ω (p). Proposition 7.4. For all p we have: Ω (p+) 0, (y) = Ω () p,(y) and Ω (p), (y) = 3 d dy Ω(p) 0, (y) = 3 d dy Ω() p, (y). Proof. For the first identity it suffices to prove ω (p+) 0,j = ω () p,j, that is f (, ) = f (2, + ). This is true by the syetry property of the Poupard triangle, as proved in Corollary.3 in [FH2]. For the second identity it suffices to prove ω (p),j = 3ω(p) 0,j+, that is This is true by Theore.2. f (, 2) = 3f (, ). As x and y play a syetric role in (7.3), the solution in (7.3) ay also be written G(x, y) = A(x + y) cos(2 x) + B(x + y) sin(2 x), so that the generating function of each atrix Ω (p) is of the for Ω (p) (x, y) = A(x + y) cos(2 x) + B(x + y) sin(2 x). Hence, Ω (p) (x, y) = Ω (p) (y) = A(y). Also, {x=0} 0, ( / x)ω (p) (x, y) = (( / x)a(x + y)) cos(2 x) + A(x + y)( 2) sin(2 x) + (( / x)b(x + y)) sin(2 x) + B(x + y) 2 cos(2 x) 2
22 and x Ω(p) (x, y) DOMINIQUE FOATA AND GUO-NIU HAN {x = 0} = x A(x + y) {x = 0} +2 B(x + y) = d A(y) + 2 B(y) dy = Ω (p), (y). {x = 0} By Proposition 7.4 we have A(y) = Ω () (y) and B(y) = (Ω(p) (y) p,, d ( dy A(y))/2 = 3 d dy Ω() (y) d ) p, dy Ω() (y) /2 = d p, dy Ω() (y). Hence, p, (7.5) Ω (p) (x, y) = cos(2 x) Ω () (x + y) + sin(2 x) p, y Ω() (x + y). p, First, ae the evaluation of Ω () (x, y). The row labeled 0 of the atrix Ω () reads:, 0,, 0, 5, 0, 6,..., which is the sequence of the coefficients of the Taylor expansion of sec y. Thus, Ω () (y) = sec y. Taing p = in 0, (7.5) we get Ω () (x, y) = sec(x + y) cos(2 x) + sec(x + y) tan(x + y) sin(2 x) (7.6) cos(x y) = cos 2 (x + y). For further use let us also calculate the partial derivative of Ω () (x, y) with respect of y: y Ω() (x, y) = (7.7) (7.8) = Now, define cos 3 (x + y) 2 cos 3 (x + y) ( ) sin(x y) cos(x + y) + 2 cos(x y) sin(x + y) ( sin(2y) + 3 sin(2x) ). zp Ω(x, y, z) := Ω (p) (x, y) (p )! p and ae use of (7.5) (7.8): Ω(x, y, z) = cos(2x) p Ω () p, + sin(2x) y (x + y) zp (p )! ( p 22 Ω () p, ) (x + y) zp (p )!
23 TREE SECANT CALCULUS = cos(2x) Ω () (z, x + y) + sin(2x) y Ω() (z, x + y) (7.9) cos(x + y z) = cos(2x) cos 2 (x + y + z) sin(2(x + y)) + 3 sin(2z) + sin(2x) 2 cos 3 (x + y + z) = (cos(2x) ( 2 cos 3 cos(2(x + y)) + cos(2z) ) (x + y + z) + sin(2x) ( sin(2(x + y)) + 3 sin(2z) )) ( ) = 2 cos 3 cos(2y) + 2 cos(2(x z)) cos(2(z + x)). (x + y + z) By definition of the ω (p) i,j s we get,,n ω (p) i,j z p Ω(x, y, z) = (p, i 0, j 0); (p )! p,i,j = x y (7.0) f (, ) ( )! ( )! x i i! y j j! z 2 ( 2)!, the latter su over the set {3 + }. We have proved Theore.5. References [An879] Désiré André. Développeent de sec x et tan x, C. R. Math. Acad. Sci. Paris, vol. 88, 879, p [An88] Désiré André. Sur les perutations alternées, J. Math. Pures et Appl., vol. 7, 88, p [Co74] Louis Cotet. Advanced Cobinatorics. D. Reidel/Dordrecht-Holland, Boston, 974. [En66] R.C. Entringer. A cobinatorial interpretation of the Euler and Bernoulli nubers, Nieuw Arch. Wis., vol. 4, 966, p [FH0] Doinique Foata; Guo-Niu Han. The doubloon polynoial triangle, Raanujan J., vol. 23, 200, p (The Andrews Festschrift). [FH0a] Doinique Foata; Guo-Niu Han. Doubloons and q-secant nubers, Münster J. of Math., vol. 3, 200, p [FH] Doinique Foata; Guo-Niu Han. Doubloons and new q-tangent nubers, Quarterly J. Math., vol. 62, 20, p [FH2] Doinique Foata; Guo-Niu Han. Finite difference calculus for alternating perutations, J. Difference Equations and Appl., 203, 6 p. or 23
24 DOMINIQUE FOATA AND GUO-NIU HAN [FH3] Doinique Foata; Guo-Niu Han. Tree Calculus for Bivariable Difference Equations, preprint, 36 p. [Fu00] Marus Fule. A continued fraction expansion for a q-tangent function, Sé. Lothar. Cobin., B45b (2000), 3pp. [GHZ0] Yoann Gelineau; Heesung Shin; Jiang Zeng. Bijections for Entringer failies, Europ. J. Cobin., vol. 32, 20, p [HRZ0] Guo-Niu Han; Arthur Randrianarivony; Jiang Zeng. Un autre q-analogue des nobres d Euler, The Andrews Festschrift. Seventeen Papers on Classical Nuber Theory and Cobinatorics, D. Foata, G.-N. Han eds., Springer-Verlag, Berlin Heidelberg, 200, pp Sé. Lothar. Cobin., Art. B42e, 22 pp. [Jo39] Charles Jordan. Calculus of Finite Differences. Röttig and Rowalter, Budapest, 939. [Jos0] M. Josuat-Vergès. A q-enueration of alternating perutations, Europ. J. Cobin., vol. 3, 200, p [KR2] Sergey Kitaev; Jeffrey Reel. Quadrant Mared Mesh Patterns in Alternating Perutations, Sé. Lothar. Cobin., B68a (202), 20pp. [KPP94] A. G. Kuznetsov; I. M. Pa; A. E. Postniov. Increasing trees and alternating perutations, Uspehi Mat. Nau, vol. 49, 994, p [Ni23] Niels Nielsen. Traité éléentaire des nobres de Bernoulli. Paris, Gauthier- Villars, 923. [Po82] Christiane Poupard. De nouvelles significations énuératives des nobres d Entringer, Discrete Math., vol. 38, 982, p [Po89] Christiane Poupard. Deux propriétés des arbres binaires ordonnés stricts, Europ. J. Cobin., vol. 0, 989, p [Po97] Christiane Poupard. Two other interpretations of the Entringer nubers, Europ. J. Cobin., vol. 8, 997, p [Pr00] Helut Prodinger. Cobinatorics of geoetrically distributed rando variables: new q-tangent and q-secant nubers, Int. J. Math. Math. Sci., vol. 24, 2000, p [Pr08] Helut Prodinger. A Continued Fraction Expansion for a q-tangent Function: an Eleentary Proof, Sé. Lothar. Cobin., B60b (2008), 3 pp. [St0] Richard P. Stanley. A Survey of Alternating Perutations, in Cobinatorics and graphs, 65 96, Contep. Math., 53, Aer. Math. Soc. Providence, RI, 200. [SZ0] Heesung Shin; Jiang Zeng. The q-tangent and q-secant nubers via continued fractions, Europ. J. Cobin., vol. 3, 200, p [Vi88] Xavier G. Viennot. Séries génératrices énuératives, chap. 3, Lecture Notes, 60 p., 988, notes de cours donnés à l École Norale Supérieure Ul (Paris), UQAM (Montréal, Québec) et Université de Wuhan (Chine) Viennot/cours.htl. Doinique Foata Institut Lothaire, rue Murner F Strasbourg, France foata@unistra.fr Guo-Niu Han I.R.M.A. UMR 750 Université de Strasbourg et CNRS 7, rue René-Descartes F Strasbourg, France guoniu.han@unistra.fr 24
The Poupard statistics on tangent and secant trees
The Poupard statistics on tangent and secant trees Guoniu Han IRMA, Strasbourg (Based on some recent papers with Dominique Foata) 1 Taylor expansion of tan u: Tangent numbers tanu = n 0 u ()! T = u 1!
More informationA1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3
A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)
More informationPoly-Bernoulli Numbers and Eulerian Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationResearch Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials
Discrete Dynaics in Nature and Society Volue 202, Article ID 927953, pages doi:055/202/927953 Research Article Soe Forulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynoials Yuan He and
More informationLATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS.
i LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS. C. A. CHURCH, Jr. and H. W. GOULD, W. Virginia University, Morgantown, W. V a. In this paper we give
More information#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES
#A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,
More informationAlgorithms for Bernoulli and Related Polynomials
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007, Article 07.5.4 Algoriths for Bernoulli Related Polynoials Ayhan Dil, Veli Kurt Mehet Cenci Departent of Matheatics Adeniz University Antalya,
More informationexp(y u). exp(su) s exp(u)
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Xxxx 2005 THE q-tangent AND q-secant NUMBERS VIA BASIC EULERIAN POLYNOMIALS DOMINIQUE FOATA AND GUO-NIU HAN Abstract. The classical
More informationLeft-to-right maxima in words and multiset permutations
Left-to-right axia in words and ultiset perutations Ay N. Myers Saint Joseph s University Philadelphia, PA 19131 Herbert S. Wilf University of Pennsylvania Philadelphia, PA 19104
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationA symbolic operator approach to several summation formulas for power series II
A sybolic operator approach to several suation forulas for power series II T. X. He, L. C. Hsu 2, and P. J.-S. Shiue 3 Departent of Matheatics and Coputer Science Illinois Wesleyan University Blooington,
More informationA Bernstein-Markov Theorem for Normed Spaces
A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationarxiv: v2 [math.co] 8 Mar 2018
Restricted lonesu atrices arxiv:1711.10178v2 [ath.co] 8 Mar 2018 Beáta Bényi Faculty of Water Sciences, National University of Public Service, Budapest beata.benyi@gail.co March 9, 2018 Keywords: enueration,
More informationON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN
More informationOrder Ideals in Weak Subposets of Young s Lattice and Associated Unimodality Conjectures
Annals of Cobinatorics 8 (2004) 1-0218-0006/04/020001-10 DOI ********************** c Birkhäuser Verlag, Basel, 2004 Annals of Cobinatorics Order Ideals in Weak Subposets of Young s Lattice and Associated
More informationOn a Multisection Style Binomial Summation Identity for Fibonacci Numbers
Int J Contep Math Sciences, Vol 9, 04, no 4, 75-86 HIKARI Ltd, www-hiarico http://dxdoiorg/0988/ics0447 On a Multisection Style Binoial Suation Identity for Fibonacci Nubers Bernhard A Moser Software Copetence
More informationThe Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters
journal of ultivariate analysis 58, 96106 (1996) article no. 0041 The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Paraeters H. S. Steyn
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationEXPLICIT CONGRUENCES FOR EULER POLYNOMIALS
EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit
More informationInfinitely Many Trees Have Non-Sperner Subtree Poset
Order (2007 24:133 138 DOI 10.1007/s11083-007-9064-2 Infinitely Many Trees Have Non-Sperner Subtree Poset Andrew Vince Hua Wang Received: 3 April 2007 / Accepted: 25 August 2007 / Published online: 2 October
More informationarxiv: v1 [math.co] 19 Apr 2017
PROOF OF CHAPOTON S CONJECTURE ON NEWTON POLYTOPES OF q-ehrhart POLYNOMIALS arxiv:1704.0561v1 [ath.co] 19 Apr 017 JANG SOO KIM AND U-KEUN SONG Abstract. Recently, Chapoton found a q-analog of Ehrhart polynoials,
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationThe concavity and convexity of the Boros Moll sequences
The concavity and convexity of the Boros Moll sequences Ernest X.W. Xia Departent of Matheatics Jiangsu University Zhenjiang, Jiangsu 1013, P.R. China ernestxwxia@163.co Subitted: Oct 1, 013; Accepted:
More informationMonochromatic images
CHAPTER 8 Monochroatic iages 1 The Central Sets Theore Lea 11 Let S,+) be a seigroup, e be an idepotent of βs and A e There is a set B A in e such that, for each v B, there is a set C A in e with v+c A
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationM ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1.
M ath. Res. Lett. 15 (2008), no. 2, 375 388 c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS Van H. Vu Abstract. Let F q be a finite field of order q and P be a polynoial in F q[x
More informationMath Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65
The Monotone Lindelöf Property and Separability in Ordered Spaces by H. Bennett, Texas Tech University, Lubbock, TX 79409 D. Lutzer, College of Willia and Mary, Williasburg, VA 23187-8795 M. Matveev, Irvine,
More informationOn Certain C-Test Words for Free Groups
Journal of Algebra 247, 509 540 2002 doi:10.1006 jabr.2001.9001, available online at http: www.idealibrary.co on On Certain C-Test Words for Free Groups Donghi Lee Departent of Matheatics, Uni ersity of
More informationPoornima University, For any query, contact us at: , 18
AIEEE//Math S. No Questions Solutions Q. Lets cos (α + β) = and let sin (α + β) = 5, where α, β π, then tan α = 5 (a) 56 (b) 9 (c) 7 (d) 5 6 Sol: (a) cos (α + β) = 5 tan (α + β) = tan α = than (α + β +
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationStochastic vertex models and symmetric functions
Stochastic vertex odels and syetric functions Alexey Bufetov MIT 6Noveber,2017 Applications of the algebra of syetric functions to probability: Schur easures (Okounkov), Schur processes (Okounkov-Reshetikhin),
More informationLinear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions
Linear recurrences and asyptotic behavior of exponential sus of syetric boolean functions Francis N. Castro Departent of Matheatics University of Puerto Rico, San Juan, PR 00931 francis.castro@upr.edu
More informationPattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationMODULAR HYPERBOLAS AND THE CONGRUENCE ax 1 x 2 x k + bx k+1 x k+2 x 2k c (mod m)
#A37 INTEGERS 8 (208) MODULAR HYPERBOLAS AND THE CONGRUENCE ax x 2 x k + bx k+ x k+2 x 2k c (od ) Anwar Ayyad Departent of Matheatics, Al Azhar University, Gaza Strip, Palestine anwarayyad@yahoo.co Todd
More informationE0 370 Statistical Learning Theory Lecture 5 (Aug 25, 2011)
E0 370 Statistical Learning Theory Lecture 5 Aug 5, 0 Covering Nubers, Pseudo-Diension, and Fat-Shattering Diension Lecturer: Shivani Agarwal Scribe: Shivani Agarwal Introduction So far we have seen how
More informationClosed-form evaluations of Fibonacci Lucas reciprocal sums with three factors
Notes on Nuber Theory Discrete Matheatics Print ISSN 30-32 Online ISSN 2367-827 Vol. 23 207 No. 2 04 6 Closed-for evaluations of Fibonacci Lucas reciprocal sus with three factors Robert Frontczak Lesbank
More informationEvaluation of various partial sums of Gaussian q-binomial sums
Arab J Math (018) 7:101 11 https://doiorg/101007/s40065-017-0191-3 Arabian Journal of Matheatics Erah Kılıç Evaluation of various partial sus of Gaussian -binoial sus Received: 3 February 016 / Accepted:
More informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More informationThe Hilbert Schmidt version of the commutator theorem for zero trace matrices
The Hilbert Schidt version of the coutator theore for zero trace atrices Oer Angel Gideon Schechtan March 205 Abstract Let A be a coplex atrix with zero trace. Then there are atrices B and C such that
More informationDescent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA,
Descent polynoials arxiv:1710.11033v2 [ath.co] 13 Nov 2017 Alexander Diaz-Lopez Departent of Matheatics and Statistics, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, USA, alexander.diaz-lopez@villanova.edu
More informationTHE SUPER CATALAN NUMBERS S(m, m + s) FOR s 3 AND SOME INTEGER FACTORIAL RATIOS. 1. Introduction. = (2n)!
THE SUPER CATALAN NUMBERS S(, + s FOR s 3 AND SOME INTEGER FACTORIAL RATIOS XIN CHEN AND JANE WANG Abstract. We give a cobinatorial interpretation for the super Catalan nuber S(, + s for s 3 using lattice
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationFix-Mahonian Calculus, I: two transformations. Dominique Foata and Guo-Niu Han
2007/08/29/14:15 Fix-Mahonian Calculus, I: two transformations Dominique Foata and Guo-Niu Han Tu es Petrus, et super hanc petram, aedificavisti Lacim Uqam tuam. To Pierre Leroux, Montreal, Sept. 2006,
More informationCompleteness of Bethe s states for generalized XXZ model, II.
Copleteness of Bethe s states for generalized XXZ odel, II Anatol N Kirillov and Nadejda A Liskova Steklov Matheatical Institute, Fontanka 27, StPetersburg, 90, Russia Abstract For any rational nuber 2
More informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationINNER CONSTRAINTS FOR A 3-D SURVEY NETWORK
eospatial Science INNER CONSRAINS FOR A 3-D SURVEY NEWORK hese notes follow closely the developent of inner constraint equations by Dr Willie an, Departent of Building, School of Design and Environent,
More informationDESIGN OF MECHANICAL SYSTEMS HAVING MAXIMALLY FLAT RESPONSE AT LOW FREQUENCIES
DESIGN OF MECHANICAL SYSTEMS HAVING MAXIMALLY FLAT RESPONSE AT LOW FREQUENCIES V.Raachran, Ravi P.Raachran C.S.Gargour Departent of Electrical Coputer Engineering, Concordia University, Montreal, QC, CANADA,
More informationON REGULARITY, TRANSITIVITY, AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV
ON REGULARITY TRANSITIVITY AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV Departent of Coputational & Theoretical Sciences Faculty of Science International Islaic University
More informationAlgebraic Montgomery-Yang problem: the log del Pezzo surface case
c 2014 The Matheatical Society of Japan J. Math. Soc. Japan Vol. 66, No. 4 (2014) pp. 1073 1089 doi: 10.2969/jsj/06641073 Algebraic Montgoery-Yang proble: the log del Pezzo surface case By DongSeon Hwang
More informationFourier Series Summary (From Salivahanan et al, 2002)
Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t
More informationG G G G G. Spec k G. G Spec k G G. G G m G. G Spec k. Spec k
12 VICTORIA HOSKINS 3. Algebraic group actions and quotients In this section we consider group actions on algebraic varieties and also describe what type of quotients we would like to have for such group
More informationTHE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n
THE POLYNOMIAL REPRESENTATION OF THE TYPE A n RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n SHEELA DEVADAS AND YI SUN Abstract. We study the polynoial representation of the rational Cherednik algebra
More informationSupplementary Material for Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion
Suppleentary Material for Fast and Provable Algoriths for Spectrally Sparse Signal Reconstruction via Low-Ran Hanel Matrix Copletion Jian-Feng Cai Tianing Wang Ke Wei March 1, 017 Abstract We establish
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I Contents 1. Preliinaries 2. The ain result 3. The Rieann integral 4. The integral of a nonnegative
More informationExplicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi
More informationReed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product.
Coding Theory Massoud Malek Reed-Muller Codes An iportant class of linear block codes rich in algebraic and geoetric structure is the class of Reed-Muller codes, which includes the Extended Haing code.
More informationFixed-to-Variable Length Distribution Matching
Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de
More informationMath 262A Lecture Notes - Nechiporuk s Theorem
Math 6A Lecture Notes - Nechiporuk s Theore Lecturer: Sa Buss Scribe: Stefan Schneider October, 013 Nechiporuk [1] gives a ethod to derive lower bounds on forula size over the full binary basis B The lower
More informationNON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volue 126, Nuber 3, March 1998, Pages 687 691 S 0002-9939(98)04229-4 NON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS DAVID EISENBUD, IRENA PEEVA,
More informationLectures 8 & 9: The Z-transform.
Lectures 8 & 9: The Z-transfor. 1. Definitions. The Z-transfor is defined as a function series (a series in which each ter is a function of one or ore variables: Z[] where is a C valued function f : N
More informationSTRONG LAW OF LARGE NUMBERS FOR SCALAR-NORMED SUMS OF ELEMENTS OF REGRESSIVE SEQUENCES OF RANDOM VARIABLES
Annales Univ Sci Budapest, Sect Cop 39 (2013) 365 379 STRONG LAW OF LARGE NUMBERS FOR SCALAR-NORMED SUMS OF ELEMENTS OF REGRESSIVE SEQUENCES OF RANDOM VARIABLES MK Runovska (Kiev, Ukraine) Dedicated to
More informationPage 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011
Page Lab Eleentary Matri and Linear Algebra Spring 0 Nae Due /03/0 Score /5 Probles through 4 are each worth 4 points.. Go to the Linear Algebra oolkit site ransforing a atri to reduced row echelon for
More informationA New Operation on Sequences: The Boustrophedon Transform
A New Operation on Sequences: The Boustrophedon Transform J. Millar, N. J. A. Sloane and N. E. Young Mathematical Sciences Research Center AT&T Bell Laboratories Murray Hill, New Jersey 07974 January 5,
More informationThe Number of Convex Permutominoes
The Nuber of Convex Perutoinoes Paolo Boldi, Violetta Lonati, Roberto Radicioni, and Massio Santini Dipartiento di Scienze dell Inforazione Università degli Studi di Milano Abstract. Perutoinoes are polyoinoes
More informationLecture 21 Principle of Inclusion and Exclusion
Lecture 21 Principle of Inclusion and Exclusion Holden Lee and Yoni Miller 5/6/11 1 Introduction and first exaples We start off with an exaple Exaple 11: At Sunnydale High School there are 28 students
More informationBernoulli Numbers. Junior Number Theory Seminar University of Texas at Austin September 6th, 2005 Matilde N. Lalín. m 1 ( ) m + 1 k. B m.
Bernoulli Nubers Junior Nuber Theory Seinar University of Texas at Austin Septeber 6th, 5 Matilde N. Lalín I will ostly follow []. Definition and soe identities Definition 1 Bernoulli nubers are defined
More informationGeneralized binomial expansion on Lorentz cones
J. Math. Anal. Appl. 79 003 66 75 www.elsevier.co/locate/jaa Generalized binoial expansion on Lorentz cones Honging Ding Departent of Matheatics and Matheatical Coputer Science, University of St. Louis,
More informationTHE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT
THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and
More informationNew upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.
New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing
More informationSolving initial value problems by residual power series method
Theoretical Matheatics & Applications, vol.3, no.1, 13, 199-1 ISSN: 179-9687 (print), 179-979 (online) Scienpress Ltd, 13 Solving initial value probles by residual power series ethod Mohaed H. Al-Sadi
More informationi ij j ( ) sin cos x y z x x x interchangeably.)
Tensor Operators Michael Fowler,2/3/12 Introduction: Cartesian Vectors and Tensors Physics is full of vectors: x, L, S and so on Classically, a (three-diensional) vector is defined by its properties under
More informationSINGULAR POLYNOMIALS FOR THE SYMMETRIC GROUPS
SINGULAR POLYNOMIALS FOR THE SYMMETRIC GROUPS CHARLES F. DUNKL Abstract. For certain negative rational nubers 0, called singular values, and associated with the syetric group S N on N objects, there exist
More informationR. L. Ollerton University of Western Sydney, Penrith Campus DC1797, Australia
FURTHER PROPERTIES OF GENERALIZED BINOMIAL COEFFICIENT k-extensions R. L. Ollerton University of Western Sydney, Penrith Capus DC1797, Australia A. G. Shannon KvB Institute of Technology, North Sydney
More informationarxiv:math/ v1 [math.co] 4 Mar 2007
2006/11/29/14:15 arxiv:math/0703099v1 [math.co] 4 Mar 2007 Fix-Mahonian Calculus, I: two transformations Dominique Foata and Guo-Niu Han Tu es Petrus, et super hanc petram, aedificavisti Lacim Uqam tuam.
More informationON A CLASS OF DISTRIBUTIONS STABLE UNDER RANDOM SUMMATION
Applied Probability Trust (6 Deceber 200) ON A CLASS OF DISTRIBUTIONS STABLE UNDER RANDOM SUMMATION L.B. KLEBANOV, Departent of Probability and Statistics of Charles University A.V. KAKOSYAN, Yerevan State
More information4 = (0.02) 3 13, = 0.25 because = 25. Simi-
Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =
More informationALGEBRA REVIEW. MULTINOMIAL An algebraic expression consisting of more than one term.
Page 1 of 6 ALGEBRAIC EXPRESSION A cobination of ordinary nubers, letter sybols, variables, grouping sybols and operation sybols. Nubers reain fixed in value and are referred to as constants. Letter sybols
More informationAn EGZ generalization for 5 colors
An EGZ generalization for 5 colors David Grynkiewicz and Andrew Schultz July 6, 00 Abstract Let g zs(, k) (g zs(, k + 1)) be the inial integer such that any coloring of the integers fro U U k 1,..., g
More informationPartitions of finite frames
Rowan University Rowan Digital Works Theses and Dissertations 5--06 Partitions of finite fraes Jaes Michael Rosado Rowan University, jarosado09@gail.co Follow this and additional works at: http://rdw.rowan.edu/etd
More informationGeneralized AOR Method for Solving System of Linear Equations. Davod Khojasteh Salkuyeh. Department of Mathematics, University of Mohaghegh Ardabili,
Australian Journal of Basic and Applied Sciences, 5(3): 35-358, 20 ISSN 99-878 Generalized AOR Method for Solving Syste of Linear Equations Davod Khojasteh Salkuyeh Departent of Matheatics, University
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More informationTight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography
Tight Bounds for axial Identifiability of Failure Nodes in Boolean Network Toography Nicola Galesi Sapienza Università di Roa nicola.galesi@uniroa1.it Fariba Ranjbar Sapienza Università di Roa fariba.ranjbar@uniroa1.it
More informationON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS
Palestine Journal of Matheatics Vol 4) 05), 70 76 Palestine Polytechnic University-PPU 05 ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS Julius Fergy T Rabago Counicated by
More informationOn Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40
On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationDIFFERENTIAL EQUATIONS AND RECURSION RELATIONS FOR LAGUERRE FUNCTIONS ON SYMMETRIC CONES
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volue 359, Nuber 7, July 2007, Pages 3239 3250 S 0002-9947(07)04062-7 Article electronically published on February 8, 2007 DIFFERENTIAL EQUATIONS AND RECURSION
More informationPrerequisites. We recall: Theorem 2 A subset of a countably innite set is countable.
Prerequisites 1 Set Theory We recall the basic facts about countable and uncountable sets, union and intersection of sets and iages and preiages of functions. 1.1 Countable and uncountable sets We can
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationHandout 6 Solutions to Problems from Homework 2
CS 85/185 Fall 2003 Lower Bounds Handout 6 Solutions to Probles fro Hoewor 2 Ait Charabarti Couter Science Dartouth College Solution to Proble 1 1.2: Let f n stand for A 111 n. To decide the roerty f 3
More informationPRELIMINARIES This section lists for later sections the necessary preliminaries, which include definitions, notations and lemmas.
MORE O SQUARE AD SQUARE ROOT OF A ODE O T TREE Xingbo Wang Departent of Mechatronic Engineering, Foshan University, PRC Guangdong Engineering Center of Inforation Security for Intelligent Manufacturing
More informationNew Classes of Positive Semi-Definite Hankel Tensors
Miniax Theory and its Applications Volue 017, No., 1 xxx New Classes of Positive Sei-Definite Hankel Tensors Qun Wang Dept. of Applied Matheatics, The Hong Kong Polytechnic University, Hung Ho, Kowloon,
More informationNORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS
NORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS NIKOLAOS PAPATHANASIOU AND PANAYIOTIS PSARRAKOS Abstract. In this paper, we introduce the notions of weakly noral and noral atrix polynoials,
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More information