587 views

Uploaded by E Frank Cornelius

Using the S-root basis for polynomials over an integral domain and its derived matrix, some known identities for complete homogeneous symmetric polynomials are obtained via matrix methods instead of the usual generating functions. Published in the JP Journal of Algebra, Number Theory and Applications, Volume 21, Number 1, 2011, Pages 109-116, by the Pushpa Publishing House. Published online May 11, 2011. This paper is available online to subscribers at http://pphmj.com/journals/jpanta.htm. There is a typographical error in the Proof Theorem 3.2, equation (i); the order of the indices should be reversed, j < i. Use of all or any part of the article requires attribution to the author and to the journal and its publisher. This work is a by-product of "Root bases of polynomials over integral domains", by E. F. Cornelius, Jr. and Phill Schultz, which appears on pages 235-248 of "Models, Modules, and Abelian Groups", edited by Rudiger Gobel and Brendan Goldsmith, and published by Walter de Gruyter, Berlin 2008.

Using the S-root basis for polynomials over an integral domain and its derived matrix, some known identities for complete homogeneous symmetric polynomials are obtained via matrix methods instead of the usual generating functions. Published in the JP Journal of Algebra, Number Theory and Applications, Volume 21, Number 1, 2011, Pages 109-116, by the Pushpa Publishing House. Published online May 11, 2011. This paper is available online to subscribers at http://pphmj.com/journals/jpanta.htm. There is a typographical error in the Proof Theorem 3.2, equation (i); the order of the indices should be reversed, j < i. Use of all or any part of the article requires attribution to the author and to the journal and its publisher. This work is a by-product of "Root bases of polynomials over integral domains", by E. F. Cornelius, Jr. and Phill Schultz, which appears on pages 235-248 of "Models, Modules, and Abelian Groups", edited by Rudiger Gobel and Brendan Goldsmith, and published by Walter de Gruyter, Berlin 2008.

Attribution Non-Commercial (BY-NC)

- Properties of Slender Rings
- Endomorphisms and Product Bases of the Baer-Specker Group
- Product Bases and Endomorphisms of Products of Integers
- Sequences Generated by Polynomials
- Root Bases of Polynomials Over Integral Domains
- Polynomial Points
- Generic Combinatorial Identities 4-7-14
- A Generalization of Separable Groups
- Multinomial Points
- prob03
- Cardinalities of Chains of Sets
- Characterization of a Class of Torsion Free Groups in Terms of Endomorphisms
- Mathematical Methods for Numerical Analysis and Optimization
- Polynomial Improve Ws
- A Sufficient Condition for Separability
- Note on Quasi-Decompositions of Irreducible Groups
- Calculator Techniques
- 14_陈友明_墙体传导传递函数计算方法的适用性研究
- Scilab Documentation (2)
- maths

You are on page 1of 10

E. F. CORNELIUS, JR.

Volume 21, Number 1, 2011, Pages 109-116, by the Pushpa Publishing House.

requires attribution to the author and to the journal and its publisher.

1

Abstract

Through use of the S-root basis for polynomials over an integral domain, it

P

in n variables x1 ; : : : ; xn , hk (x1 ; : : : ; xn ) = xi1 xin , can be ex-

1 i1 ::: ik n

n

X

Qn xn+k 1

pressed as the sum of rational functions, i

. Consequently

j=1;j6=i

(xi xj )

i=1

1

X n

X n 1

hk (x1 ; : : : ; xn ) = 1

= Qnxi .

(1 x1 ) (1 xn ) (1 xi ) (xi xj )

j=1;j6=i

k=0 i=1

Keywords

trix

2

1 The S-Root Basis of D[x]n and the Evaluation

With respect to this basis, the evaluation map, eval : D[x]n ! Dn , de…ned as

8

>

> 0 for 0 i<j n 1

>

>

<

cij = j (si ) = 1 for j = 0

>

>

>

> Qj

: 1

k=0 (si sk ) for n 1 i j 1

8

>

> 0 for 0 i<j n 1

>

>

<

bij = 1 for i = 0 = j

>

>

>

>

: Q i

1

for n 1 i j 1

k=0;k6=j (sj sk )

The inverse Cn 1 was computed through use of the following lemma, which

3

P

n

n

is a generalization of the well known combinatorial identity ( 1)i i = 1.

i=1

n

X n

X i

Y

i (dn d0 )(dn d1 ) (dn di 1) i dn dj 1

( 1) d1 di = ( 1) ( dj ) = 1

i=1 i=1 j=1

S-root basis, then the matrix for eval is the familiar Vandermonde matrix, Vn =

[KA67, p. 572]

0 X 1

( 1)i sk 0 s kn 1 i

B 0 k0 <:::<kn n 1 C

B 1 i C

1 B k0 ;:::;kn 1 i 6=j C

Vn =B : i; j = 0; : : : ; n 1C

B Y

n 1

C

@ (sl sj ) A

l=0;l6=j

The matrix of the transition from the S-root basis of D[x]n to the standard

4

with mij = ( 1)j i

ej i (s0 ; : : : ; sj 1 ), where er (s0 ; : : : ; st ) is the elementary

X

symmetric polynomial sp0 spr 1 , with the conventions that

0 p0 <:::<pr 1 t

er (s0 ; : : : ; st ) = 0 for r < 0 and r > t, and e0 (s0 ; : : : ; st ) = 1. [M95, pp. 19-20].

0 1

1 s0 s0 s1 s0 s1 s2 s0 s1 s2 s3

B C

B C

B 0 1 (s0 + s1 ) s0 s1 + s0 s2 + s1 s2 (s0 s1 s2 + s0 s1 s3 + s0 s2 s3 + s1 s2 s3 ) C

B C

B C

B 0 0 1 (s0 + s1 + s2 ) s0 s1 + s0 s2 + s0 s3 + s1 s2 + s1 s3 + s2 s3 C

B C

B C

B C

B 0 0 0 1 (s0 + s1 + s2 + s3 ) C

@ A

0 0 0 0 1

X

which hr (s0 ; : : : ; st ) = sq0 sqr 1 , with the conventions that

0 q0 ::: qr 1 t

3 The Identities

5

or Bn = Cn 1 = Mn 1 Vn 1

= Nn Vn 1 , yielding Nn = Bn Vn . This relationship is

both Mn and Nm have all 1’s on their diagonals, it further su¢ ces to con…rm

only that all entries of Bn Vn Mn = Nm Mn , which lie above the diagonal, are 0;

computed.

Pn 1

First, (Vn Mn )ij = l=0 sli mlj = j (si ) because the mlj ’s are simply the

Pn 1

nP1

coe¢ cients of j (x). Hence (Bn Vn Mn )ij = k=0 bik (Vn Mn )kj = bik j (sk ).

k=0

In this last expression, the upper limit for k can be replaced by i because

nP1 Pn 1

bik = 0 for k > i, so the expression bik j (sk ) reduces to k=0 bik j (sk ) =

k=0

Pi Pi

k=0 bik j (sk ). Now this latter expression reduces further to k=0 bik j (sk ) =

Pi

k=j bik j (sk ) because j (sk ) = 0 for k < j. But as noted at the outset, only

P

i

the cases i < j need be checked, so that only vacuous sums bik j (sk ) re-

k=j

main, which were obtained by deleting 0 terms. Thus all key terms are 0, and

6

The result below was known to Jacobi [S99, Ex. 7.4]; the proof given here

X

k in n variables, x1 ; : : : ; xn , hk (x1 ; : : : ; xn ) = xi1 xik , can be ex-

0 i1 ::: ik n

X n

X xn+k 1

hk (x1 ; : : : ; xn ) = xi1 xik = Yn l

m=1;m6=l

n

X1 i

X i

X sjl

bil sjl = bil sjl = Yi because Bn is lower-triangular.

l=0 l=0 l=0 (sl sm )

m=0;m6=l

i

X sjl

For 0 < i < j n 1, (i) Yi = 0 because Nn is upper-

l=0 (sl sm )

m=0;m6=l

X0

triangular. In the special case i = 0; b00 = 1, (ii) 0j = b0l sjl = b00 sj0

l=0

i

X sil

= sj0 . When i = j, (iii) 1 = Yi because ii = h0 (s0 ; : : : ; si )

l=0 (sl sm )

m=0;m6=l

X i

X sjl

ij = hj i (s0 ; : : : ; si ) = sq0 sqj i 1 = Yi

0 q0 ::: qj i l=0 (sl sm )

i 1 m=0;m6=l

Observe that (iv) subsumes the case (v) j i = 1; see Remark 3.5 infra.

7

to obtain a su¢ ciently large matrix in which n 1;n+k 1 = hk (s0 ; : : : ; sn 1) =

X n

X1 sn+k 1

si0 sik 1

= Yn 1

l

. Changing the limits of

0 i0 ::: ik n 1 l=0 (sl sm )

1 m=0;m6=l

X n

X tn+k 1

= ti1 ti k = Yn l

. Setting ti = xi for i = 1;

0 i1 ::: ik n l=1 (tl tm )

m=1;m6=l

1

X n

X n 1

hk (x1 ; : : : ; xn ) = (1 1

= Qnxi

x1 ) (1 xn ) (1 xi ) (xi xj )

j=1;j6=i

k=0 i=1

P

1

1

h2 (x1 ; : : : ; xn )z 2 + : : : = hk (x1 ; : : : ; xn )z k = (1 x1 z) (1 xn z) , [KD73, p.

k=0

P

1

1

91; M95, p. 21], so that Gn (1) = hk (x1 ; : : : ; xn ) = (1 x1 ) (1 xn ) .

k=0

P

1 P

1 P

n

xk+n 1

From Theorem 3.2, also hk (x1 ; : : : ; xn ) = Qn i

=

k=0 k=0 i=1 j=1;j6=i

(xi xj )

P

n P

1 P

n

xn 1

( Qn 1

)( xik+n 1

) = ( Qn 1

)( i

) =

(xi xj ) (xi xj ) 1 xi

i=1 j=1;j6=i k=0 i=1 j=1;j6=i

P

n n 1

Qnxi .

i=1 (1 xi ) j=1;j6=i

(xi xj )

Remark 3.4. Theorem 3.2 and Corollary 3.3 hold for polynomials over com-

Remark 3.5. N5 = B5 V5 =

8

0 1

1 s0 s20 s30 s40

B C

B C

B 0 1 s0 + s1 s20 + s0 s1 + s21 s30 + s20 s1 + s0 s21 + s31 C

B C

B C

B 0 0 1 s0 + s1 + s2 2 2 2 C

s0 + s0 s1 + s0 s2 + s1 + s1 s2 + s2 C

B

B C

B C

B 0 0 0 1 s0 + s1 + s2 + s3 C

@ A

0 0 0 0 1

ed here. Cf. (i), (iii), and (v) in the proof of Theorem 3.2, supra. The proof

suggested in [KD73, pp. 471-472] for those limited portions appears far more

complicated than that presented here, which covers the entire Bn Vn matrix.

Remark 3.7. This paper is based upon a talk entitled Module-Building With

Polynomials and Power Series, presented by the author at the 1st Joint Meeting

of the Amercian Mathematical Society and the New Zealand Mathematical So-

4 References

[CS08] Cornelius, E. F., Jr. & Schultz, P., “Root bases of polynomials over

9

integral domains”, in Models, Modules, and Abelian Groups, Göbel, R.

& Goldsmith, B., eds., W. de Gruyter & Co., Berlin-New York, 2008,

235-248

[M95] Macdonald, I. G., Symmetric Functions and Hall Polynomials, 2nd ed.,

[KA67] Klinger, A., The Vandermonde Matrix, Amer. Math. Monthly, 1967,

571-574

10

- Properties of Slender RingsUploaded byE Frank Cornelius
- Endomorphisms and Product Bases of the Baer-Specker GroupUploaded byE Frank Cornelius
- Product Bases and Endomorphisms of Products of IntegersUploaded byE Frank Cornelius
- Sequences Generated by PolynomialsUploaded byE Frank Cornelius
- Root Bases of Polynomials Over Integral DomainsUploaded byE Frank Cornelius
- Polynomial PointsUploaded byE Frank Cornelius
- Generic Combinatorial Identities 4-7-14Uploaded byE Frank Cornelius
- A Generalization of Separable GroupsUploaded byE Frank Cornelius
- Multinomial PointsUploaded byE Frank Cornelius
- prob03Uploaded byKevin Peng
- Cardinalities of Chains of SetsUploaded byE Frank Cornelius
- Characterization of a Class of Torsion Free Groups in Terms of EndomorphismsUploaded byE Frank Cornelius
- Mathematical Methods for Numerical Analysis and OptimizationUploaded byGuruKPO
- Polynomial Improve WsUploaded byAshli Black
- A Sufficient Condition for SeparabilityUploaded byE Frank Cornelius
- Note on Quasi-Decompositions of Irreducible GroupsUploaded byE Frank Cornelius
- Calculator TechniquesUploaded byAnn Kim
- 14_陈友明_墙体传导传递函数计算方法的适用性研究Uploaded byAbdul Munir
- Scilab Documentation (2)Uploaded bypsingh9
- mathsUploaded bychikkuomana
- Ecuaciones r DeformadasUploaded byanderjoe20
- Macro Bundle 10Uploaded bygirish_jagad
- 1st Monthly ExamUploaded byVilma Centro Macarasig
- SGT_BengaliUploaded byMadhavi Priya
- intermediate-algebra-posttest.pdfUploaded byachuth
- Algebra-Questions.docUploaded byMark Jason
- Tut 10ab Sem2 1011Uploaded byFeeling_so_fly
- Text FileUploaded byJohn Vergel Enciso Retoma
- SCCHS_ACTIVITY_SHEET(STUDENTS).docxUploaded byAndrea Lorraine Duran
- BackwardUploaded byH Alee Hyder

- Generation of Integer Sequences 4-6-19Uploaded byE Frank Cornelius
- Arbitration Opinions of E. Frank Cornelius, PhD, JD, Arbitrator & Consultant, and Citations to ThemUploaded byE Frank Cornelius
- Problem 1269 SolutionUploaded byE Frank Cornelius
- Court Opinion in PPOA v USPS, __ F Supp 3d __, 2019 US Dist LEXIS 58575, 2019 WL 1324022 (ED Mich 2019)Uploaded byE Frank Cornelius
- UAW and IAC Opinion 8-1-18Uploaded byE Frank Cornelius
- OPEIU Local 268 and UAW Local 1853 5-4-04Uploaded byE Frank Cornelius
- American Federation of Government Employees Local 2317 and U.S. Marine Corps Logistics BaseUploaded byE Frank Cornelius
- Polynomial PointsUploaded byE Frank Cornelius
- List of Mathematics Papers of E F ("Frank") Cornelius Jr and Citations to Them 7-4-18Uploaded byE Frank Cornelius
- DVA GCVHCS Arbitration Opinion 3-30-2018Uploaded byE Frank Cornelius
- Multinomial PointsUploaded byE Frank Cornelius
- SEIU District 1199 and Lorain County Community Action Agency 1-26-15Uploaded byE Frank Cornelius
- ON THE ZEROES OF MULTIVARIABLE POLYNOMIALS OVER AN INTEGRAL DOMAINUploaded byE Frank Cornelius
- Sixth Circuit Fails Pension Math 3-22-16Uploaded byE Frank Cornelius
- AFGE Local 3981 and BOP Opinion Re Electronic TestimonyUploaded byE Frank Cornelius
- UTU Local 1715 and Transit Management 10-5-12Uploaded byE Frank Cornelius
- AGFE Local 3981 and Bureau of PrisonsUploaded byE Frank Cornelius
- AFGE Local 3509 and Social Security AdministrationUploaded byE Frank Cornelius
- Generic Combinatorial Identities 4-7-14Uploaded byE Frank Cornelius
- AFGE Local 1658 and Army Tank Command 9-6-11Uploaded byE Frank Cornelius
- Endomorphisms and Product Bases of the Baer-Specker GroupUploaded byE Frank Cornelius
- Note on Quasi-Decompositions of Irreducible GroupsUploaded byE Frank Cornelius
- The Perils of Moral Turpitude 10-18-11Uploaded byE Frank Cornelius
- A Sufficient Condition for SeparabilityUploaded byE Frank Cornelius
- Characterization of a Class of Torsion Free Groups in Terms of EndomorphismsUploaded byE Frank Cornelius
- A Generalization of Separable GroupsUploaded byE Frank Cornelius
- Cardinalities of Chains of SetsUploaded byE Frank Cornelius

- Part IUploaded bynegisbabi
- A 01 MobileUploaded byspark4u
- Analysis of VelocityUploaded bySean Crespo Gomez
- C2_MATLABUploaded byDiana Carolina Leon
- UT Dallas Syllabus for math6313.501.10s taught by Janos Turi (turi)Uploaded byUT Dallas Provost's Technology Group
- Linear and Integer Optimization Theory and Practice Third Edition Download PDF Book FreeUploaded bySyarif Prasetyo Adyuta
- ANALYTICAL AND NUMERICAL COMPARATIVE STUDY OF PROBLEM IN 2D ELASTICITY OF A HOLLOW TUBE SUBJECT TO NORMAL AND SHEAR STRESSES IN THE INTERNAL CONTOUR.Uploaded byThiago Arnaud
- theory of equationsUploaded byBodhayan Prasad
- Numerical Simulation in Applied Geophysics 3319484567Uploaded byAnonymous QlJjisdlLI
- Xiang 2014Uploaded byVivian Itu Bioage
- 0270_PDF_C13.pdfUploaded byBao Tram Nguyen
- Assessmt QnUploaded byedmund forgoat
- Iaea Flac CourseUploaded bygeotekdemir
- Hao-ICPR-06Uploaded bytamann2004
- Disselkamp-Bachelor.pdfUploaded byGlory ann Vicente
- CUBIC CONVERGENT MODIFIED NEWTON’S METHOD.Uploaded byIJAR Journal
- Generalized SOR Method for solving Non-Square Linear SystemsUploaded byInternational Journal of Innovative Science and Research Technology
- hw9Uploaded byLinda Hlophe
- chap3Uploaded bySasidhar Jannu
- Mechthild Thalhammer- High-order time-splitting spectral methods for Gross–Pitaevskii systemsUploaded byVortices3443
- D1,L9 Solving Linear Programming problems.pptUploaded bymokhtarppg
- Ma2264- Numerical MethodsUploaded bySUNILKHUNTIA1988
- AP3114 Lecture WK11 Solving Differential Eqautions IIUploaded byGuoXuanChan
- scilab-MBelurUploaded byfrancisco_barboza_1
- numerical methodsUploaded byTanilay özdemir
- 2 Linear Programming ProblemUploaded byangel190693
- Vishu -Numerical Analysis PptUploaded byayushi28
- Quiz BEEUploaded byads
- ppt_002Uploaded byLam Wong
- Chapter 6 EnotesUploaded byEmerald Splash