NOTES ON THE DIVISIBILITY OF GCD AND LCM MATRICES
|
|
- Tracey Johnston
- 5 years ago
- Views:
Transcription
1 NOTES ON THE DIVISIBILITY OF GCD AND LCM MATRICES PENTTI HAUKKANEN AND ISMO KORKEE Receive 10 November 2004 Let S {,,...,x n } be a set of positive integers, an let f be an arithmetical function. The matrices S f [ f gcx i,x j ] an [S] f [ f lcm[x i,x j ]] are referre to as the greatest common ivisor GCD an the least common multiple LCM matrices on S with respect to f, respectively. In this paper, we assume that the elements of the matrices S f an [S] f are integers an stuy the ivisibility of GCD an LCM matrices an their unitary analogues in the ring M n Zofthen n matrices over the integers. 1. Introuction Let S {,,...,x n } be a set of positive integers with < < <x n,anlet f be an arithmetical function. Let S f enote the n n matrix having f evaluate at the greatest commonivisorx i,x j ofx i an x j as its ij entry, that is, S f [ f x i,x j ]. Analogously, let [S] f enote the n n matrix having f evaluate at the least common multiple [x i,x j ]ofx i an x j as its ij entry, that is, [S] f [ f [x i,x j ]]. The matrices S f an [S] f arereferretoasthegcdanlcmmatricesons with respect to f, respectively. If f m m for all positive integers m, we enote S f S an[s] f [S]. Smith [16] calculate ets f when S is a factor-close set an et[s] f in a more special case. Since Smith, a large number of results on GCD an LCM matrices have been presente in the literature. For general accounts, see, for example, [7, 12]. In this paper, we assume that the elements of the matrices S f an [S] f are integers an stuy the ivisibility of GCD an LCM matrices in the ring M n Z ofthen n matrices over the integers. This stuy was begun by Bourque an Ligh [2, 4], who showe that i if S is a factor-close set, then S [S], see [2, Theorem 3], an, more generally, ii if S is a factor-close set an f is a multiplicative function such that f x i an f µx i are nonzero for all x i S,thenS f [S] f,see[4,theorem4]. Hong [8, 9, 10] has stuie the ivisibility of GCD an LCM matrices extensively. We review these results here: iii if n 3, then for any gc-close set S with n elements, S [S], see [8,Theorem 3.1i], Copyright 2005 International Mathematics an Mathematical Sciences 2005: DOI: /IJMMS
2 926 Notes on the ivisibility of GCD an LCM matrices iv for each n 4 there exists a gc-close set S with n elements such that S [S], see [8, Theorem 3.1ii], v for each n 4 there exists a gc-close set S with n elements such that ets et[s] in the ring of integers, see [9, Theorem 3.3ii]. Note that iv is a consequence of v, vi if S is a gc-close set such that each member of S is less than 12, then ets et[s],see [9, Theorem 3.5], vii if S is a multiple-close set an if f is a completely multiplicative function satisfying certain conitions or if S is a ivisor chain of positive integers an f satisfies a ivisibility conition, then S f [S] f,see[10, Theorems 4.5 an 5.1]. In this paper, we present some generalizations an analogues of the statements i v. Our results involve GCD, LCM, GCUD, an LCUM matrices, where GCUD stans for the greatest common unitary ivisor an LCUM stans for the least common unitary multiple. The number-theoretic concepts use in the introuction are explaine in Section Preliminaries In this section, we review the basic results on arithmetical functions neee in this paper. For more comprehensive treatments of arithmetical functions, we refer to [1, 13, 15]. The Dirichlet convolution f g of two arithmetical functions f an g is efine as f gn n n f g. 2.1 The ientity uner the Dirichlet convolution is the arithmetical function δ efine as δ1 1anδn 0forn 1. An arithmetical function f possesses a Dirichlet inverse f 1 if an only if f 1 0. Let ζ enote the arithmetical function efine as ζn 1for all n Z +.TheMöbius function µ is the Dirichlet inverse of ζ. The ivisor functions σ k are efine as σ k n n k for all n Z +. A ivisor of n is sai to be a unitary ivisor of n an is enote by n if,n/ 1. The unitary convolution of arithmetical functions f an g is efine as f gn n n f g. 2.2 The ientity uner the unitary convolution is again the arithmetical function δ.anarithmetical function f possesses a unitary inverse if an only if f 1 0. We enote the inverse of ζ uner the unitary convolution as µ. The function µ is referre to as the unitary analogue of the Möbius function. An arithmetical function f is sai to be multiplicative if f 1 1an f mn f m f n 2.3
3 P. Haukkanen an I. Korkee 927 whenever m,n 1, an an arithmetical function f is sai to be completely multiplicative if f 1 1an2.3holsforallm an n. An arithmetical function f is multiplicative if an only if f 1 1an f n f p np 2.4 p P for all n>1, where n p P p np is the canonical factorization of n.herep is the set of all prime numbers. For example, the Möbius function µ an its unitary analogue µ are multiplicative functions. The Dirichlet inverse of a completely multiplicative function f is given as f 1 µf. Likewise, the unitary inverse of a multiplicative function f is µ f but we o not nee this result here. An arithmetical function f is sai to be semimultiplicative if f m,n f [m,n] f m f n 2.5 for all m an n. See[12, 14, 15]. Multiplicative functions f are semimultiplicative functions f with f 1 1. An arithmetical function f is sai to be a totient if there exist completely multiplicative functions f t an f v such that f f t f 1 v ft µf v. 2.6 The functions f t an f v are referre to as the integral an inverse parts of f, respectively. Euler s φ-function is a famous example of a totient. It is well known that φ t N an φ v ζ,wherenn n for all n Z +.Deekin sψ-function efine as ψn p n1 + 1/p is another example of a totient. It is easy to see that ψ t N an ψ v λ, whereλ is Liouville s function see, e.g., [13]. Each completely multiplicative function f is a totient with f t f an f v δ, an each totient is a multiplicative function. In Theorem 3.4,we consier semimultiplicative functions f satisfying x i x j x i x j 2.7 an f x i Z \{0} for all x i,x j S. Integer-value totients f are examples of semimultiplicative functions satisfying 2.7forallx i,x j Z +,see[6,corollary3]. We enote the greatest common unitary ivisor gcu of m an n as m,n.the least common unitary multiple lcum of m an n, writtenas[m,n],isefineasthe least positive integer x such that m x an n x. It is easy to see that m,n exists for all m an n,an[m,n] exists if an only if for all prime numbers p,wehavemp np, mp 0, or np 0. If [m,n] exists, then [m,n] [m,n]anm,n m,n. The n n matrix having f evaluate at the gcu x i,x j of x i an x j as its ij entry is enote by S f, an the n n matrix having f evaluate at the lcum [x i,x j ] of x i an x j as its ij entry is enote by [S] f provie that [x i,x j ] exists for all x i an x j. The matrices S f an [S] f are referre to as the GCUD an LCUM matrices on S with respect to f, respectively. If f m m for all positive integers m, we enote S f an [S] f [S]. S
4 928 Notes on the ivisibility of GCD an LCM matrices The concepts of a factor-close, a gc-close, an lcm-close, a unitary ivisor-close, a gcu-close, an an lcum-close set are evient. The set S is sai to be multiple-close if S is lcm-close an if x i x n S hols for all x i S. We nee the following results on GCD an relate matrices. Bourque an Ligh [3, Corollary 1] show that if S is a factor-close set an f is an arithmetical function such that f µx i 0forallx i S,thenS f is invertible an S 1 f [a ij ], where a ij xi x j x k µ x k /x i µ /x j f µ. 2.8 It follows from [5, Theorem 6] that if S is a unitary ivisor-close set an f is an arithmetical function such that f µx i 0forallx i S, thens f is invertible an S f 1 [b ij ], where 3. Results b ij xi x j x k µ x k /x i µ x k /x j f µ x k. 2.9 In this section, we consier the ivisibility of GCD, LCM, GCUD, an LCUM matrices in the ring M n Z ofthen n matrices over the integers an the ivisibility of their eterminants in the ring of integers. Therefore, we assume that f x i,x j, f [x i,x j ], f x i,x j, an f [x i,x j ] are integers for all x i,x j S. In Theorem 3.1, we note that in the statement ii one nee not assume that f x i 0 for all x i S,aninTheorem 3.2, we propose a unitary analogue of ii. Theorem 3.1. Suppose that S is a factor-close set an f is a multiplicative function such that f µx i 0 for all x i S. Then S f [S] f. Proof. From 2.8, we see that the ij element of the matrix [S] f S 1 f is [S] f S 1 f ij n f [ ] µ x k /x m µ /x j x i,x m m1 xm x k f µ x j x k µ /x j f [ x i, ] µ x j x k f µ x k. 3.1 We show that f µ x k f [ xi, ] µ 3.2
5 for all k 1,2,...,n in the ring of integers. From 2.4, we obtain P. Haukkanen an I. Korkee 929 x k f [ xi, ] µ f p max{xip,p} µ p p p x k p P x kp p x k v0 f p max{xip,v} µ p p v p x i p x k f p x ip p x k f p max{x ip,x kp} f p max{xip,p 1} p x i p x k f p x ip f p x kp f p p 1 f p x ip, if p x k : x k p >x i p, p x k p x i p x k 0, if p x k : x k p x i p. 3.3 Thus x k f [ xi, ] µ xi f µ, if p x k : x k p >x i p,,x i 0, if p x k : x k p x i p. 3.4 Thus 3.2 hols. This shows that [S] f S 1 f M n Z. Theorem 3.2. Suppose that S is a unitary ivisor-close set such that [x i,x j ] exists for all i, j 1,2,...,n an suppose that f is a multiplicative function such that f µ x i 0 for all x i S. Then S f [S] f. Proof. From 2.9, we see that the ij element of the matrix [S] f S f 1 is [S] f S 1 f n ij m1 f [ x i,x m ] xm x k x j x k µ x k /x m µ x k /x j f µ x k µ /x j f [ x x j x k f µ i, ] µ x k x k. 3.5 We show that f µ x k x k f [ xi, ] µ 3.6
6 930 Notes on the ivisibility of GCD an LCM matrices for all k 1,2,...,n in the ring of integers. From 2.4, we obtain x k f [ xi, ] µ f p max{xip,p} µ p p p x k p p x i p P f p x ip f p xip f p x kp f 1 p x k p x i 0, if p : p x k p x i, f µ x k f xi, otherwise. p x k p x i f p x ip 3.7 Thus 3.6 hols. This shows that [S] f S f 1 M n Z. Remark 3.3. If [x i,x j ] exists as assume in Theorem 3.2, then[x i,x j ] [x i,x j ]an x i,x j x i,x j. However, the concepts of a factor-close set an a unitary ivisorclose set o not coincie. Thus Theorem 3.2 is not a special case of Theorem 3.1. In Theorem 3.4, we present a generalization an an lcm analogue of the statement iii in the introuction. If f m m for all m Z + an S is gc-close, then Theorem 3.4 reuces to the statement iii. In Remark 3.5, Theorem 3.6, anremark 3.7, wepropose unitary analogues of iii. Theorem 3.4. Let S be a gc-close or an lcm-close set with n elements, where n 3. Let f be a semimultiplicative function satisfying 2.7an f x i 0 for all x i,x j S. Then S f [S] f. Proof. Suppose first that S is a gc-close set with n elements. If n 1, then S f [S] f. Let n 2. Then an thus accoring to 2.7wehave f f an further [S] f S 1 f [ f x1 ][ f x1 ] f M 3 Z Let n 3. Then either or,.let.thenaccoringto2.7 we have f f f an further [S] f S 1 f f x f M 3 Z. x 3 f
7 P. Haukkanen an I. Korkee 931 Let,. Then, applying 2.5, we obtain f [, ] f f /f anapplying 2.7, we obtain f f, f. Thus [S] f S 1 f f f f f f x3 f f f f x3 f f f M 3 Z. 0 f Suppose secon that S is an lcm-close set with n elements. The cases n 1ann 2 are exactly the same as for a gc-close set. Let n 3. Then either or [, ]. The case is again exactly the same as for a gc-close set. Let [, ]. Then,applying2.5, we obtain f, f f /f an applying 2.7, we obtain f, f f. Thus [S] f S 1 f f f f f f x2 f f x 3 f x2 f M 3 Z Remark 3.5. It follows from Remark 3.3 an Theorem 3.4 that if S is a gcu-close or an lcum-close set with less than or equal to 3 elements, [x i,x j ] exists for all x i,x j S, an f is a semimultiplicative function satisfying 2.7an f x i 0forallx i,x j S,then S [S]. Theorem 3.6. Suppose that S is a gcu-close set with n elements, where n 3, anthat [x i,x j ] exists for all x i,x j S. Then ets et[s] i.e., ets et[s].
8 932 Notes on the ivisibility of GCD an LCM matrices Proof. If n 1, then S [S].Ifn 2, then an further ets anet[s]. Since,wehave a ± a for all a an, in particular, ets et[s]. Suppose that n 3. Then either or,.if,thenets x2 2 + anet[s] x Since,we have ets et[s].if,,thenets x1 1 + / an et[s] + /. Since,,wehavex1 2 an further ets et[s].fromremark 3.3,weseethatS San[S] [S], an therefore ets etsanet[s] et[s]. Remark 3.7. There exist lcum-close i.e., lcm-close sets S such that n 3, [x i,x j ] exists for all i, j an ets et[s] i.e., ets et[s]. For example, if S {2,3,6}, then ets et[s]. In Theorem 3.8, we present unitary an lcm analogues of statements iv an v in the introuction. Theorem 3.8. For each n 4, there exist a an lcum-close set S with n elements such that ets et[s] an so S [S], b a gcu-close set S with n elements such that ets et[s] an so S [S], c an lcm-close set S with n elements such that ets et[s] an so S [S], a gc-close set S with n elements such that ets et[s] an so S [S]. Proof. We first prove a. Let S {x 0,,,...,x n }, n 3, where x 0 1, p 1 p 2, p 1 p 3, x i p 1 p 2 p i for i 3,4,...,n. Herep 1, p 2,..., p n are some istinct prime numbers in increasing orer. It is clear that S is lcum-close. Then By row reuction, we obtain p 1 p 2 p 1 p 1 p 2 p 1 p 2 S 1 p 1 p 1 p 3 p 1 p 3 p 1 p 3 1 p 1 p 2 p 1 p 3, p 1 p 2 p 1 p 3 x n 1 p 1 p 2 p 1 p 3 x n p 1 p 2 p 1 p 2 x n [S] p 1 p 3 p 1 p 3 x n x n x n x n x n x n x n 3.12 ets eta 4 [ x3 p4 1 x n 1 pn 1 ], 3.13
9 where A 4 is the leaing principal 4 4submatrixofS, an thus P. Haukkanen an I. Korkee 933 ets p 2 1 p2 1 p p 3 p 2 + p 1 p 2 p 3 [ x3 p4 1 x n 1 pn 1 ] Similarly, et[s] etb 4 [ x4 1 p4 xn 1 pn ], 3.15 where B 4 is the leaing principal 4 4submatrixof[S], an thus et[s] p1 3 p2 2 p3 2 p2 1 p 3 1 [ ] p 1 p 2 p 1 p 3 + p 1 p 2 p 3 x4 1 p4 xn 1 pn. If we let p 1 2, p 2 3, an p 3 5, then et[s] ets 1n 1 p 1 p2 2 p 2 [ ] 3 1 p1 p 2 p 1 p 3 + p 1 p 2 p 3 p4 p 5 p n 1 p 3 p 2 + p 1 p 2 p 3 1n p 4 p 5 p n Let p 4, p 5,..., p n 23. Then ets et[s] an so S [S]. Thus a hols. Next we prove b. Consier the set S {x 0,,,...,x n }, n 3, where x 0 1, p 1, p 2, x i p 1 p 2 p i for i 3,4,...,n. Herep 1, p 2,..., p n are some istinct prime numbers in increasing orer. Clearly, S is gcu-close. For the sake of brevity, we o not present the matrices S an [S] explicitly. By row reuction, we obtain ets eta 4 [ x3 p4 1 x n 1 pn 1 ], 3.18 where A 4 is the leaing principal 4 4submatrixofS, an thus ets p 1 1 p p 1 p 2 + p 1 p 2 p 3 [ x3 p4 1 x n 1 pn 1 ] Similarly, et[s] etb 4 [ x4 1 p4 xn 1 pn ], 3.20 where B 4 is the leaing principal 4 4submatrixof[S], an thus et[s] p1 2 p2 2 p 3 p1 1 p 2 1 [ ] p 1 p 3 p 2 p 3 + p 1 p 2 p 3 x4 1 p4 xn 1 pn.
10 934 Notes on the ivisibility of GCD an LCM matrices If we let p 1 2, p 2 3anp 3 5, then et[s] ets 1n 1 p1 2 p 2 2 p 3 1 p1 p 3 p 2 p 3 + p 1 p 2 p 3 p4 p 5 p n 1 p 1 p 2 + p 1 p 2 p 3 1n p 4 p 5 p n Let p 4, p 5,..., p n 13. Then ets et[s] an so S [S]. Thus b hols. Since S in a is also lcm-close an since S S an [S] [S],wehaveetS et[s] ansos [S]. Thus c hols. Since S in b is also gc-close an since S S an [S] [S],wehaveetS et[s]ansos [S]. Thus hols. Next we present some minor notes on the statements ii, iv, v, an vii in the introuction. The statement ii oes not hol in general if f is not a multiplicative function. For example, if f 1 2, f 2 1, an S {1,2}, then f is not a multiplicative function, S is a factor-close set, ets f et[s] f an S f [S] f.thechoice f 1 2, f 2 1, f 3 4, an S {1,2,3} is an example such that f is not a multiplicative function, S is a factor-close set, ets f et[s] f but S f [S] f. Further, the statement ii oes not hol in general if S is a gc-close set, that is, not factor-close. The statement iv gives counterexamples for each n 4.Wecanalsofin counterexamples for n 2ann 3. In fact, for n 2let f be a multiplicative function such that f 2 2an f 4 1anletSbe the gc-close set given as S {2,4}. Then ets f et[s] f an so S f [S] f.forn 3let f be a multiplicative function such that f 2 2, f 4 1, an f 8 1anletSbe the gc-close set given as S {2,4,8}.Then ets f et[s] f an so S f [S] f.if f is a multiplicative function such that f 2 2, f 4 1, an f 8 2anifS is again the gc-close set given as S {2,4,8}, then ets f et[s] f but S f [S] f. In the statements iv an v, we note that there exist gc-close sets S such that ets et[s] buts [S], for example, S {1,2,3,12}. Similarly, S {1,4,6,12} is an example of an lcm-close set such that ets et[s]buts [S]. In the statement vii, Hong [10] notes that there exist multiplicative functions f an multiple close sets S such that S f [S] f,forexample, f σ 1 an S {6,8,12,24}. A more simple example is f σ 0 an S {2,4}. The pair f σ 0 an S {2,4,8} is an example such that ets f et[s] f but S f [S] f. Finally, we note that [11, Conjectures 5.3 an 5.4] o not hol. In fact, let k be a positive integer an let f be an arithmetical function efine as f n n k.letsbe a finite set of o positive integers. Conjectures 5.3 an 5.4 state that if S is gc-close or lcmclose, then S f [S] f.however,ifs {1,3,5,45}, thens is gc-close but S f [S] f. Namely, calculation with the Mathematica system shows that, for example, the 2, 4 entry of the matrix [S] f S 1 f is 1 3 k 5 k +15 k 15 k +45 k k 2 5 k +3 1+k 5 k +9 k +25 k 75 k 135 k 225 k k, 3.23
11 P. Haukkanen an I. Korkee 935 which is never an integer. Similarly, if S {1,9,15,45}, thens is lcm-close but S f [S] f. Again, calculation with the Mathematica system shows that, for example, the 2, 4 entry of the matrix [S] f S 1 f is 3 k 2 9 k +27 k 9 k +45 k 3 1+3k 5 k +9 k 2 27 k 2 45 k +81 k k 675 k 1215 k 2025 k k, 3.24 which is never an integer. The authors have alreay announce these two counterexamples {1,3,5,45} an {1,9,15,45} in review on [11] by P. Haukkanen. References [1] T.M.Apostol,Introuction to Analytic Number Theory, Unergrauate Texts in Mathematics, Springer, New York, [2] K. Bourque an S. Ligh, On GCD an LCM matrices, Linear Algebra Appl , [3], Matrices associate with arithmetical functions, Linear an Multilinear Algebra , no. 3 4, [4], Matrices associate with multiplicative functions, Linear Algebra Appl , [5] P. Haukkanen, On meet matrices on posets, Linear Algebra Appl , [6], Some characterizations of totients, Int. J. Math. Math. Sci , no. 2, [7] P. Haukkanen, J. Wang, an J. Sillanpää, On Smith s eterminant, Linear Algebra Appl , [8] S. Hong, On the factorization of LCM matrices on gc-close sets, Linear Algebra Appl , [9], Divisibility of eterminants of least common multiple matrices on GCD-close sets, Southeast Asian Bull. Math , no. 4, [10], Factorization of matrices associate with classes of arithmetical functions, Colloq. Math , no. 1, [11], Notes on power LCM matrices,actaarith , no. 2, [12] I. Korkee an P. Haukkanen, On meet an join matrices associate with incience functions, Linear Algebra Appl , [13] P. J. McCarthy, Introuction to Arithmetical Functions, Universitext, Springer, New York, [14] D. Rearick, Semi-multiplicative functions, Duke Math. J , [15] R. Sivaramakrishnan, Classical Theory of Arithmetic Functions, Monographs an Textbooks in Pure an Applie Mathematics, vol. 126, Marcel Dekker, New York, [16] H. J. S. Smith, On the value of a certain arithmetical eterminant, Proc. Lonon Math. Soc , Pentti Haukkanen: Department of Mathematics, Statistics an Philosophy, University of Tampere, Tampere, Finlan aress: pentti.haukkanen@uta.fi Ismo Korkee: Department of Mathematics, Statistics an Philosophy, University of Tampere, Tampere, Finlan aress: ismo.korkee@uta.fi
12 Avances in Operations Research Avances in Decision Sciences Applie Mathematics Algebra Probability an Statistics The Scientific Worl Journal International Differential Equations Submit your manuscripts at International Avances in Combinatorics Mathematical Physics Complex Analysis International Mathematics an Mathematical Sciences Mathematical Problems in Engineering Mathematics Discrete Mathematics Discrete Dynamics in Nature an Society Function Spaces Abstract an Applie Analysis International Stochastic Analysis Optimization
NOTES ON THE DIVISIBILITY OF GCD AND LCM MATRICES
NOTES ON THE DIVISIBILITY OF GCD AND LCM MATRICES PENTTI HAUKKANEN AND ISMO KORKEE Receive 10 November 2004 Let S {,,...,x n } be a set of positive integers, an let f be an arithmetical function. The matrices
More informationResearch Article Determinant and Inverse of Meet and Join Matrices
International Mathematics and Mathematical Sciences Volume 2007, Article ID 37580, 11 pages doi:10.1155/2007/37580 Research Article Determinant and Inverse of Meet and Join Matrices Ercan Altinisik, Naim
More informationDeterminant and inverse of join matrices on two sets
Determinant and inverse of join matrices on two sets arxiv:1110.4953v1 [math.nt] 22 Oct 2011 Mika Mattila and Pentti Haukkanen School of Information Sciences FI-33014 University of Tampere, Finland May
More informationMeet and join matrices in the poset of exponential divisors
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 119, No. 3, June 2009, pp. 319 332. Printed in India Meet and join matrices in the poset of exponential divisors ISMO KORKEE and PENTTI HAUKKANEN Department of
More informationOn Meet and Join Matrices Associated with Incidence Functions
ISMO KORKEE On Meet and Join Matrices Associated with Incidence Functions ACADEMIC DISSERTATION To be presented, with the permission o the Faculty o Inormation Sciences o the University o Tampere, or public
More informationarxiv: v1 [math.nt] 29 Oct 2015
Non-divisibility of LCM Matrices by GCD Matrices on GCD-closed Sets arxiv:1510.09101v1 [math.nt] 29 Oct 2015 Abstract Ercan Altınışık a,, Mehmet Yıldız a, Ali Keskin a a Department of Mathematics, Faculty
More informationInt. J. Contemp. Math. Sciences, Vol. 3, 2008, no. 35, Fermat-GCD Matrices
Int. J. Contemp. Math. Sciences, Vol. 3, 2008, no. 35, 745-753 Fermat-GCD Matrices Şerife Büyükköse The University of AhiEvran, Faculty of Science and Arts Department of Mathematics, 4000 Kirşehir, Turkey
More informationA NOTE ON THE SINGULARITY OF LCM MATRICES ON GCD - CLOSED SETS WITH 9 ELEMENTS
Journal of Science and Arts Year 17, o. 3(40), pp. 413-422, 2017 ORIGIAL PAPER A OTE O THE SIGULARITY OF LCM MATRICES O GCD - CLOSED SETS WITH 9 ELEMETS ERCA ALTIIŞIK 1, TUĞBA ALTITAŞ 1 Manuscript received:
More informationGeneralized GCD matrices
Acta Univ Sapientiae, Mathematica, 2, 2 (2010) 160 167 Generalized GCD matrices Antal Bege Sapientia Hungarian University of Transylvania Department of Mathematics and Informatics, Târgu Mureş, Romania
More informationAn arithmetical equation with respect to regular convolutions
The final publication is available at Springer via http://dx.doi.org/10.1007/s00010-017-0473-z An arithmetical equation with respect to regular convolutions Pentti Haukkanen School of Information Sciences,
More informationRelatively Prime Uniform Partitions
Gen. Math. Notes, Vol. 13, No., December, 01, pp.1-1 ISSN 19-7184; Copyright c ICSRS Publication, 01 www.i-csrs.org Available free online at http://www.geman.in Relatively Prime Uniform Partitions A. Davi
More informationResearch Article Determinant and Inverse of Meet and Join Matrices
Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 2007, Article ID 37580, 11 pages doi:10.1155/2007/37580 Research Article Determinant and Inverse of
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationWitt#5: Around the integrality criterion 9.93 [version 1.1 (21 April 2013), not completed, not proofread]
Witt vectors. Part 1 Michiel Hazewinkel Sienotes by Darij Grinberg Witt#5: Aroun the integrality criterion 9.93 [version 1.1 21 April 2013, not complete, not proofrea In [1, section 9.93, Hazewinkel states
More informationOn the Invertibility and Eigenvalue Properties of Some Lattice-theoretic Matrices
Acta Universitatis Tamperensis 278 MIKA MATTILA On the Invertibility and Eigenvalue Properties of Some Lattice-theoretic Matrices Meet and join matrices studied via Möbius inversion MIKA MATTILA On the
More informationAn analysis of GCD and LCM matrices via the LDL^T-factorization
Electronic Journal of Linear Algebra Volume 11 Article 5 2004 An analysis of GCD and LCM matrices via the LDL^T-factorization Jeffrey S Ovall jovall@mathucsdedu Follow this and additional works at: http://repositoryuwyoedu/ela
More informationA Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential
Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix
More informationNEERAJ KUMAR AND K. SENTHIL KUMAR. 1. Introduction. Theorem 1 motivate us to ask the following:
NOTE ON VANISHING POWER SUMS OF ROOTS OF UNITY NEERAJ KUMAR AND K. SENTHIL KUMAR Abstract. For xe positive integers m an l, we give a complete list of integers n for which their exist mth complex roots
More informationTOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH
English NUMERICAL MATHEMATICS Vol14, No1 Series A Journal of Chinese Universities Feb 2005 TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH He Ming( Λ) Michael K Ng(Ξ ) Abstract We
More informationOn the multivariable generalization of Anderson-Apostol sums
arxiv:1811060v1 [mathnt] 14 Nov 018 On the multivariable generalization of Anerson-Apostol sums Isao Kiuchi, Frierich Pillichshammer an Sumaia Saa Ein Abstract In this paper, we give various ientities
More informationOn the enumeration of partitions with summands in arithmetic progression
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics
More informationREPRESENTATIONS FOR THE GENERALIZED DRAZIN INVERSE IN A BANACH ALGEBRA (COMMUNICATED BY FUAD KITTANEH)
Bulletin of Mathematical Analysis an Applications ISSN: 1821-1291, UL: http://www.bmathaa.org Volume 5 Issue 1 (2013), ages 53-64 EESENTATIONS FO THE GENEALIZED DAZIN INVESE IN A BANACH ALGEBA (COMMUNICATED
More informationChapter 5. Factorization of Integers
Chapter 5 Factorization of Integers 51 Definition: For a, b Z we say that a ivies b (or that a is a factor of b, or that b is a multiple of a, an we write a b, when b = ak for some k Z 52 Theorem: (Basic
More informationOn Fermat Power GCD Matrices Defined on Special Sets of Positive Integers
Applied Mathematical Sciences, Vol 13, 2019, no 8, 369-379 HIKARI Ltd, wwwm-hikaricom https://doiorg/1012988/ams20199230 On Fermat Power GCD Matrices Defined on Special Sets of Positive Integers Yahia
More informationGCD of Random Linear Combinations
JOACHIM VON ZUR GATHEN & IGOR E. SHPARLINSKI (2006). GCD of Ranom Linear Combinations. Algorithmica 46(1), 137 148. ISSN 0178-4617 (Print), 1432-0541 (Online). URL https://x.oi.org/10.1007/s00453-006-0072-1.
More informationOn unitary analogs of GCD reciprocal LCM matrices Pentti Haukkanen a ; Pauliina Ilmonen a ; Ayse Nalli b ; Juha Sillanpää a a
This article was downloaded by: [Tampere University] On: 5 July 2010 Access details: Access Details: [subscription number 917207124] Publisher Taylor & Francis Informa Ltd Registered in England and Wales
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationLie symmetry and Mei conservation law of continuum system
Chin. Phys. B Vol. 20, No. 2 20 020 Lie symmetry an Mei conservation law of continuum system Shi Shen-Yang an Fu Jing-Li Department of Physics, Zhejiang Sci-Tech University, Hangzhou 3008, China Receive
More informationApplications of the Wronskian to ordinary linear differential equations
Physics 116C Fall 2011 Applications of the Wronskian to orinary linear ifferential equations Consier a of n continuous functions y i (x) [i = 1,2,3,...,n], each of which is ifferentiable at least n times.
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationArithmetic Distributions of Convergents Arising from Jacobi-Perron Algorithm
Arithmetic Distributions of Convergents Arising from Jacobi-Perron Algorithm Valerie Berthe, H Nakaa, R Natsui To cite this version: Valerie Berthe, H Nakaa, R Natsui Arithmetic Distributions of Convergents
More informationMath 774 Homework 3. Austin Mohr. October 11, Let µ be the usual Möbius function, namely 0, if n has a repeated prime factor; µ(d) = 0,
Math 774 Homework 3 Austin Mohr October 11, 010 Problem 1 Let µ be the usual Möbius function, namely 0, if n has a repeate prime factor; µ(n = 1, if n = 1; ( 1 k, if n is a prouct of k istinct primes.
More informationLIAISON OF MONOMIAL IDEALS
LIAISON OF MONOMIAL IDEALS CRAIG HUNEKE AND BERND ULRICH Abstract. We give a simple algorithm to ecie whether a monomial ieal of nite colength in a polynomial ring is licci, i.e., in the linkage class
More informationDECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS
DECOMPOSITION OF POLYNOMIALS AND APPROXIMATE ROOTS ARNAUD BODIN Abstract. We state a kin of Eucliian ivision theorem: given a polynomial P (x) an a ivisor of the egree of P, there exist polynomials h(x),
More informationZachary Scherr Math 503 HW 5 Due Friday, Feb 26
Zachary Scherr Math 503 HW 5 Due Friay, Feb 26 1 Reaing 1. Rea Chapter 9 of Dummit an Foote 2 Problems 1. 9.1.13 Solution: We alreay know that if R is any commutative ring, then R[x]/(x r = R for any r
More informationZachary Scherr Math 503 HW 3 Due Friday, Feb 12
Zachary Scherr Math 503 HW 3 Due Friay, Feb 1 1 Reaing 1. Rea sections 7.5, 7.6, 8.1 of Dummit an Foote Problems 1. DF 7.5. Solution: This problem is trivial knowing how to work with universal properties.
More informationGCD MATRICES, POSETS, AND NONINTERSECTING PATHS
GCD MATRICES, POSETS, AND NONINTERSECTING PATHS ERCAN ALTINISIK, BRUCE E. SAGAN, AND NAIM TUGLU Abstract. We show that with any finite partially ordered set P (which need not be a lattice) one can associate
More informationA New Vulnerable Class of Exponents in RSA
A ew Vulnerable Class of Exponents in RSA Aberrahmane itaj Laboratoire e Mathématiues icolas Oresme Campus II, Boulevar u Maréchal Juin BP 586, 4032 Caen Ceex, France. nitaj@math.unicaen.fr http://www.math.unicaen.fr/~nitaj
More informationInterconnected Systems of Fliess Operators
Interconnecte Systems of Fliess Operators W. Steven Gray Yaqin Li Department of Electrical an Computer Engineering Ol Dominion University Norfolk, Virginia 23529 USA Abstract Given two analytic nonlinear
More informationEuler equations for multiple integrals
Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................
More informationInteger partitions into arithmetic progressions
Rostock. Math. Kolloq. 64, 11 16 (009) Subject Classification (AMS) 05A17, 11P81 Saek Bouroubi, Nesrine Benyahia Tani Integer partitions into arithmetic progressions ABSTRACT. Every number not in the form
More information2Algebraic ONLINE PAGE PROOFS. foundations
Algebraic founations. Kick off with CAS. Algebraic skills.3 Pascal s triangle an binomial expansions.4 The binomial theorem.5 Sets of real numbers.6 Surs.7 Review . Kick off with CAS Playing lotto Using
More informationRobustness and Perturbations of Minimal Bases
Robustness an Perturbations of Minimal Bases Paul Van Dooren an Froilán M Dopico December 9, 2016 Abstract Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important
More informationINVERSE PROBLEM OF A HYPERBOLIC EQUATION WITH AN INTEGRAL OVERDETERMINATION CONDITION
Electronic Journal of Differential Equations, Vol. 216 (216), No. 138, pp. 1 7. ISSN: 172-6691. URL: http://eje.math.txstate.eu or http://eje.math.unt.eu INVERSE PROBLEM OF A HYPERBOLIC EQUATION WITH AN
More informationTHE EXPLICIT EXPRESSION OF THE DRAZIN INVERSE OF SUMS OF TWO MATRICES AND ITS APPLICATION
italian journal of pure an applie mathematics n 33 04 (45 6) 45 THE EXPLICIT EXPRESSION OF THE DRAZIN INVERSE OF SUMS OF TWO MATRICES AND ITS APPLICATION Xiaoji Liu Liang Xu College of Science Guangxi
More informationNotes on Lie Groups, Lie algebras, and the Exponentiation Map Mitchell Faulk
Notes on Lie Groups, Lie algebras, an the Exponentiation Map Mitchell Faulk 1. Preliminaries. In these notes, we concern ourselves with special objects calle matrix Lie groups an their corresponing Lie
More informationMath 115 Section 018 Course Note
Course Note 1 General Functions Definition 1.1. A function is a rule that takes certain numbers as inputs an assigns to each a efinite output number. The set of all input numbers is calle the omain of
More informationSturm-Liouville Theory
LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory
More informationSome vector algebra and the generalized chain rule Ross Bannister Data Assimilation Research Centre, University of Reading, UK Last updated 10/06/10
Some vector algebra an the generalize chain rule Ross Bannister Data Assimilation Research Centre University of Reaing UK Last upate 10/06/10 1. Introuction an notation As we shall see in these notes the
More informationTHE GENUINE OMEGA-REGULAR UNITARY DUAL OF THE METAPLECTIC GROUP
THE GENUINE OMEGA-REGULAR UNITARY DUAL OF THE METAPLECTIC GROUP ALESSANDRA PANTANO, ANNEGRET PAUL, AND SUSANA A. SALAMANCA-RIBA Abstract. We classify all genuine unitary representations of the metaplectic
More informationMultiplicative properties of sets of residues
Multiplicative properties of sets of resiues C. Pomerance Hanover an A. Schinzel Warszawa Abstract: We conjecture that for each natural number n, every set of resiues mo n of carinality at least n/2 contains
More informationDiagonalization of Matrices Dr. E. Jacobs
Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is
More informationOn the Fourier transform of the greatest common divisor arxiv: v1 [math.nt] 16 Jan 2012
On the Fourier transform of the greatest common ivisor arxiv:1201.3139v1 [math.nt] 16 Jan 2012 Peter H. van er Kamp Department of Mathematics an Statistics La Trobe University Victoria 3086, Australia
More informationInternational Journal of Pure and Applied Mathematics Volume 35 No , ON PYTHAGOREAN QUADRUPLES Edray Goins 1, Alain Togbé 2
International Journal of Pure an Applie Mathematics Volume 35 No. 3 007, 365-374 ON PYTHAGOREAN QUADRUPLES Eray Goins 1, Alain Togbé 1 Department of Mathematics Purue University 150 North University Street,
More informationTwo formulas for the Euler ϕ-function
Two formulas for the Euler ϕ-function Robert Frieman A multiplication formula for ϕ(n) The first formula we want to prove is the following: Theorem 1. If n 1 an n 2 are relatively prime positive integers,
More informationON BEAUVILLE STRUCTURES FOR PSL(2, q)
ON BEAUVILLE STRUCTURES FOR PSL(, q) SHELLY GARION Abstract. We characterize Beauville surfaces of unmixe type with group either PSL(, p e ) or PGL(, p e ), thus extening previous results of Bauer, Catanese
More informationMultiplicative properties of sets of residues
Multiplicative properties of sets of resiues C. Pomerance Hanover an A. Schinzel Warszawa Abstract: Given a natural number n, we ask whether every set of resiues mo n of carinality at least n/2 contains
More informationWEIGHTED SELBERG ORTHOGONALITY AND UNIQUENESS OF FACTORIZATION OF AUTOMORPHIC L-FUNCTIONS
WEIGHTED SELBERG ORTHOGONALITY AND UNIQUENESS OF FACTORIZATION OF AUTOMORPHIC L-FUNCTIONS JIANYA LIU AND YANGBO YE 3 Abstract. We prove a weighte version of Selberg s orthogonality conjecture for automorphic
More informationMarkov Chains in Continuous Time
Chapter 23 Markov Chains in Continuous Time Previously we looke at Markov chains, where the transitions betweenstatesoccurreatspecifietime- steps. That it, we mae time (a continuous variable) avance in
More informationCHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold
CHAPTER 1 : DIFFERENTIABLE MANIFOLDS 1.1 The efinition of a ifferentiable manifol Let M be a topological space. This means that we have a family Ω of open sets efine on M. These satisfy (1), M Ω (2) the
More informationWeek 1: Number Theory - Euler Phi Function, Order and Primitive Roots. 1 Greatest Common Divisor and the Euler Phi Function
2010 IMO Summer Training: Number Theory 1 Week 1: Number Theory - Euler Phi Function, Orer an Primitive Roots 1 Greatest Common Divisor an the Euler Phi Function Consier the following problem. Exercise
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeare in a journal publishe by Elsevier. The attache copy is furnishe to the author for internal non-commercial research an eucation use, incluing for instruction at the authors institution
More informationON THE DISTANCE BETWEEN SMOOTH NUMBERS
#A25 INTEGERS (20) ON THE DISTANCE BETWEEN SMOOTH NUMBERS Jean-Marie De Koninc Département e mathématiques et e statistique, Université Laval, Québec, Québec, Canaa jm@mat.ulaval.ca Nicolas Doyon Département
More informationSUPPOSE A is an n n matrix, A =[a i,j ]=[(i, j)],
Two Different Computing Methods of the Smith Arithmetic Determinant Xing-Jian Li Shen Qu Open Science Index Mathematical and Computational Sciences wasetorg/publication/9996770 Abstract The Smith arithmetic
More informationPhysics 5153 Classical Mechanics. The Virial Theorem and The Poisson Bracket-1
Physics 5153 Classical Mechanics The Virial Theorem an The Poisson Bracket 1 Introuction In this lecture we will consier two applications of the Hamiltonian. The first, the Virial Theorem, applies to systems
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationA FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS
A FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS TODD COCHRANE, JEREMY COFFELT, AND CHRISTOPHER PINNER 1. Introuction For a prime p, integer Laurent polynomial (1.1) f(x) = a 1 x k 1 + + a r
More informationMultiplicative properties of sets of residues
Multiplicative properties of sets of resiues C. Pomerance Hanover an A. Schinzel Warszawa Abstract: We conjecture that for each natural number n, every set of resiues mo n of carinality at least n/2 contains
More informationInteger partitions into arithmetic progressions
7 Integer partitions into arithmetic progressions Nesrine Benyahia Tani Saek Bouroubi ICM 01, 11-14 March, Al Ain Abstract Every number not in the form k can be partitione into two or more consecutive
More informationSYMMETRIC KRONECKER PRODUCTS AND SEMICLASSICAL WAVE PACKETS
SYMMETRIC KRONECKER PRODUCTS AND SEMICLASSICAL WAVE PACKETS GEORGE A HAGEDORN AND CAROLINE LASSER Abstract We investigate the iterate Kronecker prouct of a square matrix with itself an prove an invariance
More informationLights Out!: A Survey of Parity Domination in Grid Graphs
Lights Out!: A Survey of Parity Domination in Grid Graphs William Klostermeyer University of North Florida Jacksonville, FL 32224 E-mail: klostermeyer@hotmail.com Abstract A non-empty set of vertices is
More informationA nonlinear inverse problem of the Korteweg-de Vries equation
Bull. Math. Sci. https://oi.org/0.007/s3373-08-025- A nonlinear inverse problem of the Korteweg-e Vries equation Shengqi Lu Miaochao Chen 2 Qilin Liu 3 Receive: 0 March 207 / Revise: 30 April 208 / Accepte:
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationGCD AND LCM POWER MATRICES. Sheii Ze Chun An-Gang Engineering College, Anshan, P.R. China, (Submitted October 1994)
Sheii Ze Chun An-Gang Engineering College, Anshan, P.R. China, 114001 (Submitted October 1994) 1. INTRODUCTION Let 3 = {x l,x 2,...,x n } be a set of distinct positive integers. By (x i9 Xj) and [x f,xj],
More informationThis document has been downloaded from Tampub The Institutional Repository of University of Tampere. Publisher's version
Ths ocument has been ownloae from Tampub The Insttutonal Repostory of Unversty of Tampere Publsher's verson Authors: Haukkanen Pentt Name of artcle: Some characterzatons of specally multplcatve functons
More informationHilbert functions and Betti numbers of reverse lexicographic ideals in the exterior algebra
Turk J Math 36 (2012), 366 375. c TÜBİTAK oi:10.3906/mat-1102-21 Hilbert functions an Betti numbers of reverse lexicographic ieals in the exterior algebra Marilena Crupi, Carmela Ferró Abstract Let K be
More informationSimilar Operators and a Functional Calculus for the First-Order Linear Differential Operator
Avances in Applie Mathematics, 9 47 999 Article ID aama.998.067, available online at http: www.iealibrary.com on Similar Operators an a Functional Calculus for the First-Orer Linear Differential Operator
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationMATH 566, Final Project Alexandra Tcheng,
MATH 566, Final Project Alexanra Tcheng, 60665 The unrestricte partition function pn counts the number of ways a positive integer n can be resse as a sum of positive integers n. For example: p 5, since
More informationPure Further Mathematics 1. Revision Notes
Pure Further Mathematics Revision Notes June 20 2 FP JUNE 20 SDB Further Pure Complex Numbers... 3 Definitions an arithmetical operations... 3 Complex conjugate... 3 Properties... 3 Complex number plane,
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationJournal of Algebra. A class of projectively full ideals in two-dimensional Muhly local domains
Journal of Algebra 32 2009 903 9 Contents lists available at ScienceDirect Journal of Algebra wwwelseviercom/locate/jalgebra A class of projectively full ieals in two-imensional Muhly local omains aymon
More informationTHE FOURIER TRANSFORM OF FUNCTIONS OF THE GREATEST COMMON DIVISOR. Wolfgang Schramm Schulgasse 62 / 11, A-1180 Vienna, AUSTRIA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A50 THE FOURIER TRANSFORM OF FUNCTIONS OF THE GREATEST COMMON DIVISOR Wolfgang Schramm Schulgasse 62 / 11, A-1180 Vienna, AUSTRIA
More informationLecture 6: Calculus. In Song Kim. September 7, 2011
Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear
More informationFractional Geometric Calculus: Toward A Unified Mathematical Language for Physics and Engineering
Fractional Geometric Calculus: Towar A Unifie Mathematical Language for Physics an Engineering Xiong Wang Center of Chaos an Complex Network, Department of Electronic Engineering, City University of Hong
More informationArithmetic progressions on Pell equations
Journal of Number Theory 18 (008) 1389 1409 www.elsevier.com/locate/jnt Arithmetic progressions on Pell equations A. Pethő a,1,v.ziegler b,, a Department of Computer Science, Number Theory Research Group,
More informationSELBERG S ORTHOGONALITY CONJECTURE FOR AUTOMORPHIC L-FUNCTIONS
SELBERG S ORTHOGONALITY CONJECTURE FOR AUTOMORPHIC L-FUNCTIONS JIANYA LIU 1 AND YANGBO YE 2 Abstract. Let π an π be automorphic irreucible unitary cuspial representations of GL m (Q A ) an GL m (Q A ),
More information6 General properties of an autonomous system of two first order ODE
6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x
More informationEXPLICIT BOUNDS ON MONOMIAL AND BINOMIAL EXPONENTIAL SUMS
EXPLICIT BOUNDS ON MONOMIAL AND BINOMIAL EXPONENTIAL SUMS TODD COCHRANE AND CHRISTOPHER PINNER Abstract. Let p be a prime an e p = e 2πi /p. First, we make explicit the monomial sum bouns of Heath-Brown
More informationA GENERALIZATION OF A FILBERT MATRIX WITH 3 ADDITIONAL PARAMETERS
A GENERALIZATION OF A FILBERT MATRIX WITH 3 ADDITIONAL PARAMETERS HELMUT PRODINGER Abstract A generalize Filbert matrix from [] is further generalize, introucing 3 aitional parameters Explicit formulæ
More informationarxiv:math/ v1 [math.ac] 4 Oct 2002
arxiv:math/0210074v1 [math.ac] 4 Oct 2002 Q GORENSTEIN SPLINTER RINGS OF CHARACTERISTIC p ARE F REGULAR ANURAG K. SINGH Department of Mathematics, University of Michigan, Ann Arbor, USA Receive: 5 May,
More informationDivisibility. 1.1 Foundations
1 Divisibility 1.1 Foundations The set 1, 2, 3,...of all natural numbers will be denoted by N. There is no need to enter here into philosophical questions concerning the existence of N. It will suffice
More informationA LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM
Teor Imov r. ta Matem. Statist. Theor. Probability an Math. Statist. Vip. 81, 1 No. 81, 1, Pages 147 158 S 94-911)816- Article electronically publishe on January, 11 UDC 519.1 A LIMIT THEOREM FOR RANDOM
More informationA Theorem on Unique Factorization Domains Analogue for Modules
Int. J. Contemp. Math. Sciences, Vol. 6, 2011, no. 32, 1589-1596 A Theorem on Unique Factorization Domains Analogue for Modules M. Roueentan Department of Mathematics Shiraz University, Iran m.rooeintan@yahoo.com
More information18.785: Analytic Number Theory, MIT, spring 2006 (K.S. Kedlaya) Dirichlet series and arithmetic functions
18.785: Analytic Number Theory, MIT, spring 2006 (K.S. Kedlaya) Dirichlet series and arithmetic functions 1 Dirichlet series The Riemann zeta function ζ is a special example of a type of series we will
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
More informationELEC3114 Control Systems 1
ELEC34 Control Systems Linear Systems - Moelling - Some Issues Session 2, 2007 Introuction Linear systems may be represente in a number of ifferent ways. Figure shows the relationship between various representations.
More informationThe maximal determinant and subdeterminants of ±1 matrices
Linear Algebra and its Applications 373 (2003) 297 310 www.elsevier.com/locate/laa The maximal determinant and subdeterminants of ±1 matrices Jennifer Seberry a,, Tianbing Xia a, Christos Koukouvinos b,
More informationOn Partition Functions and Divisor Sums
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.4 On Partition Functions and Divisor Sums Neville Robbins Mathematics Department San Francisco State University San Francisco,
More information