PROBABILITY AND INTERPOLATION
|
|
- Leslie Gray
- 5 years ago
- Views:
Transcription
1 transactions of the american mathematical society Volume 268, Number 2, December 1981 PROBABILITY AND INTERPOLATION BY G. G. LORENTZ1 AND R. A. LORENTZ Abstract. An m x n matrix E with n ones and (m l)/i zeros, which satisfies the Polya condition, may be regular and singular for Birkhoff interpolation. We prove that for random distributed ones, E is singular with probability that converges to one if m, n -» oo. Previously, this was known only if m > (1 + 8)n/log n. For constant m and n -» oo, the probability is asymptotically at least i. 1. Introduction. For an m X n matrix E = (e,ft) _,^_, with elements that are zeros and ones, and with exactly n ones, we study the Birkhoff interpolation problem: P(k~x\x,) = cik if eik = 1, for polynomials P of degree < n 1. If the problem is solvable for all real knots X: xx < <xm and all data cik, the matrix E is regular (or poised). Otherwise it is singular. Schoenberg [13] has asked to determine the character of a matrix by using only the distribution of ones in it. This problem proved to be extremely difficult, and one is satisfied to answer some particular questions in this direction. For an exposition of known results in Birkhoff interpolation see [8], [9]. We shall use notations and results of these two papers. The main result of this paper is that for large m and n, a Polya m X n matrix E, with n ones distributed at random, is singular with probability close to \ if m and n are large (Theorem 1 below). Previously, this result was known [10] under the assumption that (1.1) m > (1 + 8)-r^, for any constants > 0. v ' log n A few words of justification for our Theorem 1, which is somewhere between the result of [10] and the ultimate truth. Probability theorems of the kind treated here, depend, of course, upon criteria of regularity and singularity of matrices. At present, there are only four such criteria of real importance. We list them below, indicating the probability that they apply to an m X n Polya matrix E (these probabilities are either easy to find, or follow along the lines of the present paper). (1) The only general test of regularity is given by the theorem of Atkinson- Sharma [1] which in hidden form is present already in G. D. Birkhoff's paper [2]. Received by the editors April 30, 1980 and, in revised form, March 12, Mathematics Subject Classification. Primary 41A05; Secondary 60C05, 60E99. Key words and phrases. Birkhoff interpolation, Polya matrix, regularity and singularity, coalescence of rows, probability of singularity, hypergeometric distribution. 'Supported by NSF Grant MCS American Mathematical Society /81 / S8/$03.S0
2 478 G. G. LORENTZ AND R. A. LORENTZ Probability of its applicability tends to zero for n -^ oo. The problem to improve this theorem is well known, but no progress has been achieved. The following are three (quite different) tests of singularity. (2a) A matrix E is singular (Lorentz [7]) if it has odd supported sequences and if all but one of its rows contain exactly one one. Probability of applicabihty tends to 0 for n» oo. (2b) A matrix E is singular (Lorentz-Zeller [11]) if it has a row consisting of a supported one. A stronger (and more difficult to prove) version (Lorentz [6]) replaces this by an arbitrary row which contains exactly one odd supported sequence. Probability of applicability tends to 1, but only if m is large (hence condition (1.1)). (2c) A matrix E is singular if As 1 (mod 2), where A is some integer easily computed if E is given (Lorentz [8]); for three row matrices only, this is equivalent to a test of Karlin and Karon [4]. The probability that the test applies converges to \ as n > oo. To improve our Theorem 1, one has either to find a criterion of regularity which has probability > c0 > 0, or to find a singularity test which is apphcable with probability converging to one. One of the points of this paper is perhaps that it underlines problems, whose solution would signify an important achievement in Birkhoff interpolation. Necessary for the regularity of E is the forward Polya condition, which means that for k = 1,..., n, the first k columns of E contain at least k ones. Then E is called a Polya matrix. Equivalent to this is the backward Polya condition: any last n k columns of E contain at most n k ones. Both forms of the Polya condition are equivalent, if E has exactly \E\ = n ones. If \E\ < n, one should use the backward Polya conditions, and if \E\ > n, the forward condition. Let M(m, n) be the set of all m X n matrices E with n ones, let P(m, n) be its subset consisting of all Polya matrices. We allow empty rows (without ones) in E, but will always assume m < n. For these matrices we have the counts [6] (12) \M(m,n)\ = ( ), p(w'n)] = (^TTj( m(v1}) * Const imm'n)x- This inequality shows that most E G M(m, n) are singular. The purpose of the present paper is to show that Polya matrices with large m, n are singular with probability close to one. We shall establish (see announcement [12]) Theorem 1. For each e > 0 there is an n0 with the property that for m > n^ all but e\p(m, n)\ matrices of the class P(m, n) are singular. Theorem 2. Let e > 0 and m > 3 be given, let p = [m/3]. Then for n > n0 the number of regular matrices of the class P(m, n) does not exceed (2~p + e)\p(m, n)\. First we state the test of singularity that we shall need.
3 PROBABILITY AND INTERPOLATION 479 A row F of zeros and ones from matrix E can be also represented by the positions of ones in F. For example to F, = ( ) corresponds Fx = (1, 3, 5, 8). Precoalescence of Fx with respect to another row F2 (see [9, p. 202]), denoted by (Fx)2, leads to precoalescnece (F,)2. For example, if F2 = ( ), then F2 = (1, 4, 5, 8, 9) and (Fx)2 = ( ),(F,)2 = (2, 3, 6, 10). There is a corresponding operation for permutations of Fx, thus (3, 5, 8, 1)2 = (3, 6, 10, 2). We shall write (F,)23 for the sequence F, precoalesced to the coalescence of rows F2 and F3, and FF' for the sequence of elements of F followed by those of F'. The following obvious remark about precoalescences of two permutations of row F, with respect to a fixed row F2 will be used in 3. Remark. If in the row Fx, positions of two integers I, I are interchanged, then also in (Fx)2 exactly two integers are interchanged, namely images of I, I under precoalescence. The singularity theorem mentioned above can be explained as follows. Let E0 be any mx X n matrix of zeros and ones with w, < m. We shall say that EQ is a singular strip, if any matrix E G M(m, n) containing the rows of E0 as consecutive rows, is singular. As a special case of a theorem in [8, p. 188] we have: Proposition sequences 1. Let E0be a 3 X n matrix consisting of the rows Fx, F2, F3. The two (1.3) S = ((F,)2F2)3, (1-4) S' = (F,)23(F2)3 consist of the same integers (namely, of the positions of ones in the coalescence of E0 to one row less the ones in F3). Let A = +1 (or A = -1) if S requires an even (or an odd) number of permutations in order to bring it to the natural order, let A' be a similar number for S'. If (1.5) A * A', then E0 is a singular strip. This statement remains true if E0 is formed by three groups of rows Ex, E2, E3 (instead of three rows), but then for / = 1, 2, 3, Fj should mean the coalescence of the mattrix F, to one row. 2. Probabilities: hypergeometric distribution. Let G be a set of cells, containing N = \G\ of them, among the cells we distribute n < N ones. Each cell can accept only one one. Let Gx c G be a subset of G consisting of Nx cells. Among the (^) possible distributions of ones we single out those which have k ones in Gx (and n k ones in the complement of Gx). The number of all distributions with this property will be In other words, the probability of k ones falling into G, is P.» w«-*c*>-(x.:?)/w
4 480 G. G. LORENTZ AND R. A. LORENTZ We are interested in the cases when k is far away from nnx/n. By means of Stirling's formula and some elementary computations one gets Lemma 1. For n» oo and each e > 0, (2-2) 2 /» (*) < P", *-nar,/jv >en /or some p, 0 < p < 1, dependent on e. Actually, stronger estimates are known in probability theory. Let Xx be the random number of ones falling into G,. The random variable A', has expectation E(XX) = nnx/n and the hypergeometric distribution Lemma 1*. One has (2.4) />( *, - -^ > en) < 2 exp^ne2). For the proof see for example Serfling [14, p. 41, Corollary 1.1]. A simple proof can be also read off formulas (4.8)-(4.10) in Kemperman [5]. If G is an m X n table, then a distribution of n ones in G can be interpreted as a matrix E G M(m, n). Often we shall have a fixed number/? of subsets Gq of G (for example, some rows of G) with union G. Then a matrix E will define submatrices Eq, q = 1,...,/?, contained in Eq. The inequality (2.2) means that for each q, all but p"(%) matrices E will have in Eq a number of ones satisfying (2.5) *, - Nq/m\ < en. If we want (2.5) to be valid for each q = 1,...,/?, we must exclude a larger set of size/?p"0 < p,"0, 0 < p, < 1. We have from Lemma 1: Lemma 2. All matrices E G M(m, n), except for at most p"\m(m, n)\ of them, have in Eq, q = 1,...,p,a number kq of ones which satisfies (2.5). We shall say that some phenomenon happens for "almost all" matrices of a class S, if for some p, 0 < p < 1 and all large n it happens for at most p" Sn matrices of &. From (1.1) it follows: if some phenomenon happens for "almost all" matrices of the class M(m, n), then the same is true for matrices of the class P(m, n). 3. Properties of matrices. We collect here some lemmas needed for our theorems. Let P(m, n) and P(m, n;n + q), q = 1, 2,..., respectively be the numbers of m X n matrices which satisfy the forward Polya condition and have n, respectively n + q ones. Proposition 2. With a constant C depending only on q, (3.1) P(m, n + q) < CmqP(m, n), (3.2) P(m, n;n + q) < Cm"P(m, n).
5 Proof. Using (1.1) we have PROBABILITY AND INTERPOLATION 481 P(m, + i) = -L-(^ + ^) n + 2 \ n + 1 / _ 1 (mn + m) (mn + m n + 1) ~ (n + l)(n + 2) n\ (mn + 2m) (mn + m + 1) (mn + 2m n 1) (mn + m n + 1) 1 / 1 \m_1 < (n+l)(n + 2){n + 1)P(W' n){mn + 2mV + 1*7=1} < emp(m, n). By induction, (3.1) follows with C = eq; and (3.2) follows from P(m, n;n + q) < P(m, n + q). A column k, k = 2,..., n in an m X n matrix E will be called special, if the submatrix of E consisting of the first k 1 columns satisfies the backward Polya condition. If E has N < n ones, special columns of E exist: Proposition not special. 3. If E has N < n ones, then there are at most Npositions k that are Proof. Let mk, k = 1,..., n, be the Polya function of E, namely the number of ones in the A:th column of E. We want to prove that for at least n N values of j, (3.3) j 2 m, <j - i + 1, / = 1, 2,... J - 1. l=i We will consider the Polya numbers as having subscript modulo n: mk + ln = mk> 1 = 0, ±\,- An interval [J0>/ol witn _0 < 'o < Jo < ^U De called a chain if j (3.4) 2 mt >J ~ 'o + 1 f r alb' with i0 < / < j0. l-'o. Of particular interest are maximal chains, which are not contained in any other chain. It is easy to see that (a) two different maximal chains are disjoint, (b) for a maximal chain [i,j], one always has m,_, = mj+x = 0, (c) if mt > 0, then i belongs to some maximal chain. Thus maximal chains are separated from each other by intervals of zero values of w,. Moreover (d) for a maximal chain [i,j], j 2 rn, =j - i + 1. l-i It follows from (d) that N = 2?_, m,, which is equal to the sum of the m, in all the maximal chains, is also equal to the sum of the lengths of all maximal chains. Thus there are exactly n N integers^ in [1, n] which do not belong to any chain.
6 482 G. G. LORENTZ AND R. A. LORENTZ To complete the proof, it is now sufficient to observe that an integery satisfies (3.5) 2 m, <j - / + 1 l-i for all i < j (which implies that j is special), exactly when j does not belong to a chain. Indeed, if j does not satisfy this condition, we take the largest integer /0, with / < j and then for ally',, i0 < y, < j, we must have / 2 m, >j - i0 + 1, /=<o j\ 2 m, >jx - i l-k This implies thaty belongs to the chain [/0,y]. For three row matrices we need the following singularity theorem, which is of independent interest: Theorem 3. Let the 3 X n matrices Ex, E2 be identical except for their columns k and k + 1, which are (I) for Ex and (11) for E2: k k + 1 k k [1 0' (3.6) (I): 1 Ii 0 ; oj (II): 0 U 1. oj Then at least one of the matrices is a singular strip. Proof. For the matrices,, E2, we compare sequences S, S" and numbers A, A' of Proposition 1, distinguishing them by subscripts. We want to show that either A, = A', or A2 ^ A2. This will follow from (3.7) A, > A2, A', = A2. The first row F, of Ex and of F2 is of the form F, = (/,,...,l k, lt+2,..., lp), the row F2 is almost identical for both matrices, namely F2 = (/;,..., /;, k, /;+2,_...,ij) for f, and f2 = (/;,...,/;, k + 1, /;+2,...,/;) for e2. If we precoalesce F, to F2, there will be an overflow X > 0 at k, that is, there will be A terms < k in F,, which will move to X positions > k of zeros zq of F2. The overflow will move /,_A+i,..., /,, A: of F, to /c + 1, z..., za for the matrix Ex and to k, zx,..., zx for E2. Terms < k and > zx will be the same in both precoalescences. This shows that (3.8) Sx = (/,,..., l,-\, k + 1, zx,..., zx,...,/,,..., «,_j, k, ls+1,, lq)3, (3.9) S2 = (/..., l,_x, k,zx,...,zx,...,tx,..., /;_ k +1, /;+..., /,')3.
7 PROBABILITY AND INTERPOLATION 483 Using the remark of 1, we see that Sx is obtainable from S2 by an odd number of permutations, and A, ^ A2. We turn our attention to the sequences S{, S2. Let F23 be the coalescence of rows F2 and F3. If F2 has one in position k, we can move it to position k + 1 before coalescence without changing F23. It follows that F23 is the same for both matrices Ex, E2. Also (F2)3 is the same. Hence S'x = S2 and A', = A2. Theorem 3 is trivial if there is no overflow X in coalescence of F,, F2, F3 to one row. In this case, we have to consider the elements of S, S' only in the interval [k, k + 2]. They are S, = k + 2, k + 1; S2 = k + 1, k + 2; S{ = S^. Assumption X = 0 allows us to extend the statement of Theorem 3 to strips of more than three rows. Desirable pairs of columns k, k + 1 in E0 are of the following two types (I) or (II): The only nonzero elements of columns k, k + 1 are contained in the rows I, < i2 < i3 of E0; they form either the submatrix (I) or (II) of (3.6). Proposition 4. // two mx X n matrices Ex, E2 with overflow X = 0 at k are identical except for their columns k, k + 1 and are of the types (I) and (II) respectively, then at least one of them is a singular strip. Proof. After coalescing (without overflow!) the matrices Ex, E2 to their three rows / i2, i3, we apply the above argument. One way to establish that X = 0 at k for a matrix E0 is to show that A: is a special position for F0. Hence the importance of Proposition Existence of special pairs of columns. For the proof of Theorem 1, we take a fixed integer/? > 5 and large m, m > 3p. We divide the m rows of E into/? groups Eq of consecutive rows of E, each Eq consisting of [m/p] = mx, rows, plus a remainder of < mx rows, which we will disregard. According to 1, for "almost all" E G P(m, n) each Eq will have approximately mxn/m, more exactly < (\/p + e)n ones. We denote by P(m, n) this subset of P(m, n). We shall call two columns 2k, 2k + 1 a special pair for Eq, if 2k is in special position for Eq, and if Eq is of the type (I) or (II) (of Proposition 4) with respect to the two columns. Proposition 5. Forp > 5, all but at most (4-1) C(p)-P(m,n) n matrices E G P(m, n) have a special pair in each of the Eq, q = 1,...,/?. The constant C(p) depends only on p. Proof. We count the number of E G P(m, n) which have no special pair in one of the submatrices Eq, for example in F,. Let S, be this set of matrices. There are at most (1//? + e)n ones in Ex, hence by Proposition 3, at most (\/p + e)n columns 2k which are not in special position in,, hence at least [n/2] - [(\/p + e)n] columns 2k in special position, and at least [n/2] 2[(\/p + e)n]
8 484 G. G. LORENTZ AND R. A. LORENTZ columns 2k with this property and for which columns 2k, 2k + 1 contain only zeros. For small e > 0, we obtain > en columns for some c > 0. In one of these pairs of columns 2k, 2k + 1 and some of the rows ix < i2 < i3 of Ex we introduce the group (I) or (II) of ones (see (3,6)). This will transform Ex into F, and E into a matrix E G P(m, n;n + 3). There are at least en choices of the column 2k, at least (m/p)3 choices of the rows /,, i2, i3. Hence each F, of our type will produce at least Const m3n/p3 matrices E. Conversely, each matrix E obtained can come only from one F,, for F, must have a special pair at the place selected, and can have no other special pair (otherwise this would be a special pair also for F,). By (3.2) therefore, 3 \&\\ r P < Const P(m, n;n + 3) < Cm3P(m, n), and we obtain S, < Const P(m, n)/n. For the proof of Theorem 2 we need the simpler Proposition 6 below. It is based on the following fact. Let a certain number N of ones, Cn < N < Cxn, where 0 < C < C, < 1 be distributed at random into n cells numbered 1, 2,..., n. Then (*)for some c0 > 0, "almost all" distributions contain > c0n groups of cells 2k, 2k + 1 with configuration 1, 0, and > c0n groups with configuration 0, 1. Consider for example the configuration 1, 0. From Lemma 2 we see that, for "almost all" distributions of ones, of the approximately n/2 positions 2k, at least (\C 8)n and at most ({-Cx + S)n of them will be occupied by ones. This leaves < (\CX + 8)n ones, hence > (1 \CX 8)n zeros for the odd positions. Let us consider distributions with fixed even elements. For almost all of them, among the > (\ C 8)n positions 2k + 1 following a one, at least ( C- 5)(l -±C, - 8)n = cqn will have a zero. There will be > c0n sequences 1, 0 assigned to 2k, 2k + 1. We consider now the set S of all 3 X n matrices E with > Cn and < Cxn ones, where 0 < C < C, < 1 are constants. A repeated application of the statement (*) and the above argument establishes Proposition 6. There are constants c0 and p, 0 < Cq, p < I so that all but p"\&\ matrices E G have at least c0n pairs of columns 2k, 2k + 1 which are of type (I) and of type (II) of (3.6). 5. Proof of the main theorems. Proof of Theorem 1. By Proposition 5, most of the matrices E G P(m, n) contain strips Eq,q= 1,...,/? with some special properties. Let e > 0 be arbitrary, we take/? so large that 2~p <\t, and m > 3/?. Next we require that n be so large that C(p)n~x <\e, then Proposition 5 yields that all but \e\p(m, n)\ matrices of the class P(m, ri) have the following property. Each strip Eq, q = 1,...,/? of E contains one or more special pairs of columns 2k, 2k + 1. This means that 2k is in special position and that the nonzero portion of Eq in 2k, 2k + 1 is contained in certain rows i, < i2 < i3 of Eq and is there of type (I) or of type (II) of (3.6).
9 PROBABILITY AND INTERPOLATION 485 Two strips Eq, E'q are equivalent, Eq ~ E'q, if they have the same set of special pairs 2k, 2k + 1, with the same rows ix < i2 < i3, but perhaps with portions of Eq, E'q contained there of different types (I), (II), and if the strips are identical elsewhere. Two matrices E, E' are equivalent if Eq ~ E'q, q = 1,...,/?. Let P(m, ri) be the set of all matrices E G P(m, n) which satisfy Proposition 5. We see that this set is invariant under equivalences. Consider an equivalence class of strips Eq. We transform a strip Eq of this class in an equivalent strip E'q. Let 2k, 2k + 1 be the special pair of Eq with smallest possible k. Then we replace the portion of Eq in these columns and in rows '] < i2 < i3 into matrix (3.6) of the opposite class. This transformation maps the equivalence class in a one-to-one way onto itself and according to Proposition 4 transforms a nonsingular Eq into a singular strip E'q. Hence at least half of the strips of an equivalence class consists of singular strips. This is true for q = 1,...,/?, and implies that for each equivalence class & of matrices E G P(m, n) at most 2~p\& \ of its matrices are regular. Since P(m, n) is a disjoint union of equivalence classes, at most 2~p\P(m, n)\ < \e\p(m, n)\ of its matrices are regular. Proof of Theorem 2. This is similar. For fixed m > 3 we take p = [m/3] and divide the m rows of F into /? groups of three rows; we neglect the last < 2 rows. For m = 3, p = 1 we cannot use Proposition 5, and special positions k for E need not exist, but we use the singularity Theorem 3 and Proposition 6 instead of Propositions 4, 5. As a corollary of Theorems 1 and 2 we can offer: Theorem 4. Let e > 0 be given, then for n > n0(e) and m > 3, at most (^ + e)\p(m, n)\ matrices of the class P(m, n) are regular. For m, n that are not necessarily large, we have only Corollary. There exists a number 8 > 0 for which the probability of singularity of a matrix E G P(m, ri) is > 8 for each m > 3, n > 2. It would be interesting to decide whether the matrices of the class F(3, ri) are singular with probability close to 1 for large n. However, the singularity theorem given by Proposition 1 is not sufficient for this purpose. It should be noted that all our theorems (based on Proposition 1) guarantee strong singularity. Bibliography 1. K. Atkinson and A. Sharma, A partial characterization of poised Hermite-Birkhoff interpolation problems, SIAM J. Numer. Anal. 6 (1969), G. D. Birkhoff, General mean value and remainder theorems with applications to mechanical differentiation and integration, Trans. Amer. Math. Soc. 7 (1906), W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc. 58 (1963), S. Karlin and J. M. Karon, Poised and non-poised Hermite-Birkhoff interpolations, Indiana Univ. Math. J. 21 (1972), J. H. B. Kemperman, Moment problems for sampling without replacement, Indag. Math. 35 (1973), G. G. Lorentz, Birkhoff interpolation and the problem of free matrices, J. Approx. Theory 6 (1972),
10 486 G. G. LORENTZ AND R. A. LORENTZ 7._, "The Birkhoff interpolation problem: New methods and results" in Linear operators and approximation, II edited by P. L. Butzer and B. Sz.-Nagy, ISMN No. 25, Birkhauser Verlag, Basel, 1974, pp _, Coalescence of matrices, regularity and singularity of Birkhoff interpolation problems, J. Approx. Theory 20 (1977), G. G. Lorentz and S. D. Riemenschneider, "Recent progress in Birkhoff interpolation" in Approximation theory and functional analysis edited by J. B. Prolla, North-Holland, Amsterdam, 1979, pp _, Probabilistic approach to Schoenberg's problem in Birkhoff interpolation theory, Acta Math. Acad. Sci. Hungar. 33 (1979), G. G. Lorentz and K. L. Zeller, Birkhoff interpolation, SIAM J. Numer. Anal. 8 (1971), R. A. Lorentz, "Interpolation and probability" in Approximation theory, III edited by E. W. Cheney, Academic Press, New York, 1980, pp J. Schoenberg, On Hermite-Birkhoff interpolation, J. Math. Anal. Appl. 16 (1966), R. J. Serfling, Probability inequalities for the sum in sampling without replacement, Ann. Statist. 2 (1974), Department of Mathematics, University of Texas, Austin, Texas Gesellschaft fur Mathematik und Datenverarbeitung, 5205 St. Augusttn, West Germany
CHAPTER 10 Shape Preserving Properties of B-splines
CHAPTER 10 Shape Preserving Properties of B-splines In earlier chapters we have seen a number of examples of the close relationship between a spline function and its B-spline coefficients This is especially
More informationPOLYA CONDITIONS FOR MULTIVARIATE BIRKHOFF INTERPOLATION: FROM GENERAL TO RECTANGULAR SETS OF NODES. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXIX, 1(20), pp. 9 18 9 POLYA CONDITIONS FOR MULTIVARIATE BIRKHOFF INTERPOLATION: FROM GENERAL TO RECTANGULAR SETS OF NODES M. CRAINIC and N. CRAINIC Abstract. Polya conditions
More information^-,({«}))=ic^if<iic/n^ir=iic/, where e(n) is the sequence defined by e(n\m) = 8^, (the Kronecker delta).
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 70, Number 1, June 1978 COMPOSITION OPERATOR ON F AND ITS ADJOINT R. K. SINGH AND B. S. KOMAL Abstract. A necessary and sufficient condition for
More informationAbstract. We find Rodrigues type formula for multi-variate orthogonal. orthogonal polynomial solutions of a second order partial differential
Bull. Korean Math. Soc. 38 (2001), No. 3, pp. 463 475 RODRIGUES TYPE FORMULA FOR MULTI-VARIATE ORTHOGONAL POLYNOMIALS Yong Ju Kim a, Kil Hyun Kwon, and Jeong Keun Lee Abstract. We find Rodrigues type formula
More informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationAnalytic Number Theory Solutions
Analytic Number Theory Solutions Sean Li Cornell University sxl6@cornell.edu Jan. 03 Introduction This document is a work-in-progress solution manual for Tom Apostol s Introduction to Analytic Number Theory.
More informationPACKING POLYNOMIALS ON SECTORS OF R 2. Caitlin Stanton Department of Mathematics, Stanford University, California
#A67 INTEGERS 14 (014) PACKING POLYNOMIALS ON SECTORS OF R Caitlin Stanton Department of Mathematics, Stanford University, California ckstanton@stanford.edu Received: 10/7/13, Revised: 6/5/14, Accepted:
More informationExtension of continuous functions in digital spaces with the Khalimsky topology
Extension of continuous functions in digital spaces with the Khalimsky topology Erik Melin Uppsala University, Department of Mathematics Box 480, SE-751 06 Uppsala, Sweden melin@math.uu.se http://www.math.uu.se/~melin
More informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More informationc 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp , March
SIAM REVIEW. c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp. 93 97, March 1995 008 A UNIFIED PROOF FOR THE CONVERGENCE OF JACOBI AND GAUSS-SEIDEL METHODS * ROBERTO BAGNARA Abstract.
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationSHABNAM AKHTARI AND JEFFREY D. VAALER
ON THE HEIGHT OF SOLUTIONS TO NORM FORM EQUATIONS arxiv:1709.02485v2 [math.nt] 18 Feb 2018 SHABNAM AKHTARI AND JEFFREY D. VAALER Abstract. Let k be a number field. We consider norm form equations associated
More informationQuadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin
Quadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin mcadam@math.utexas.edu Abstract: We offer a proof of quadratic reciprocity that arises
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationTwo-boundary lattice paths and parking functions
Two-boundary lattice paths and parking functions Joseph PS Kung 1, Xinyu Sun 2, and Catherine Yan 3,4 1 Department of Mathematics, University of North Texas, Denton, TX 76203 2,3 Department of Mathematics
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationUpper Bounds for Partitions into k-th Powers Elementary Methods
Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 9, 433-438 Upper Bounds for Partitions into -th Powers Elementary Methods Rafael Jaimczu División Matemática, Universidad Nacional de Luján Buenos Aires,
More informationA NUMBER-THEORETIC CONJECTURE AND ITS IMPLICATION FOR SET THEORY. 1. Motivation
Acta Math. Univ. Comenianae Vol. LXXIV, 2(2005), pp. 243 254 243 A NUMBER-THEORETIC CONJECTURE AND ITS IMPLICATION FOR SET THEORY L. HALBEISEN Abstract. For any set S let seq (S) denote the cardinality
More informationAN INEQUALITY OF TURAN TYPE FOR JACOBI POLYNOMIALS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 32, Number 2, April 1972 AN INEQUALITY OF TURAN TYPE FOR JACOBI POLYNOMIALS GEORGE GASPER Abstract. For Jacobi polynomials P^^Hx), a, ß> 1, let RAX)
More informationHW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below).
Teddy Einstein Math 430 HW Solutions Problem 1:. Find the sign and inverse of the permutation shown in the book (and below). Proof. Its disjoint cycle decomposition is: (19)(8)(37)(46) which immediately
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationGENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES
Journal of Applied Analysis Vol. 7, No. 1 (2001), pp. 131 150 GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES M. DINDOŠ Received September 7, 2000 and, in revised form, February
More informationA Chebyshev Polynomial Rate-of-Convergence Theorem for Stieltjes Functions
mathematics of computation volume 39, number 159 july 1982, pages 201-206 A Chebyshev Polynomial Rate-of-Convergence Theorem for Stieltjes Functions By John P. Boyd Abstract. The theorem proved here extends
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationMarkov s Inequality for Polynomials on Normed Linear Spaces Lawrence A. Harris
New Series Vol. 16, 2002, Fasc. 1-4 Markov s Inequality for Polynomials on Normed Linear Spaces Lawrence A. Harris This article is dedicated to the 70th anniversary of Acad. Bl. Sendov It is a longstanding
More informationSQUARES AND DIFFERENCE SETS IN FINITE FIELDS
SQUARES AND DIFFERENCE SETS IN FINITE FIELDS C. Bachoc 1 Univ Bordeaux, Institut de Mathématiques de Bordeaux, 351, cours de la Libération 33405, Talence cedex, France bachoc@math.u-bordeaux1.fr M. Matolcsi
More informationHankel Operators plus Orthogonal Polynomials. Yield Combinatorial Identities
Hanel Operators plus Orthogonal Polynomials Yield Combinatorial Identities E. A. Herman, Grinnell College Abstract: A Hanel operator H [h i+j ] can be factored as H MM, where M maps a space of L functions
More informationPERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS. A. M. Blokh. Department of Mathematics, Wesleyan University Middletown, CT , USA
PERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS A. M. Blokh Department of Mathematics, Wesleyan University Middletown, CT 06459-0128, USA August 1991, revised May 1992 Abstract. Let X be a compact tree,
More informationCOMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125
COMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125 ROBERT S. COULTER AND PAMELA KOSICK Abstract. This note summarises a recent search for commutative semifields of order 243 and 3125. For each of these two orders,
More information(3) lk'll[-i,i] < ci«lkll[-i,i]> where c, is independent of n [5]. This, of course, yields the following inequality:
proceedings of the american mathematical society Volume 93, Number 1, lanuary 1985 MARKOV'S INEQUALITY FOR POLYNOMIALS WITH REAL ZEROS PETER BORWEIN1 Abstract. Markov's inequality asserts that \\p' \\
More informationOn the usage of lines in GC n sets
On the usage of lines in GC n sets Hakop Hakopian, Vahagn Vardanyan arxiv:1807.08182v3 [math.co] 16 Aug 2018 Abstract A planar node set X, with X = ( ) n+2 2 is called GCn set if each node possesses fundamental
More informationDepartment of Applied Mathematics Faculty of EEMCS. University of Twente. Memorandum No Birth-death processes with killing
Department of Applied Mathematics Faculty of EEMCS t University of Twente The Netherlands P.O. Box 27 75 AE Enschede The Netherlands Phone: +3-53-48934 Fax: +3-53-48934 Email: memo@math.utwente.nl www.math.utwente.nl/publications
More informationA WEAK VERSION OF ROLLE S THEOREM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3147 3153 S 0002-9939(97)03910-5 A WEAK VERSION OF ROLLE S THEOREM THOMAS C. CRAVEN (Communicated by Wolmer
More informationCOMMUTATIVE PRESEMIFIELDS AND SEMIFIELDS
COMMUTATIVE PRESEMIFIELDS AND SEMIFIELDS ROBERT S. COULTER AND MARIE HENDERSON Abstract. Strong conditions are derived for when two commutative presemifields are isotopic. It is then shown that any commutative
More informationNOTES Edited by William Adkins. On Goldbach s Conjecture for Integer Polynomials
NOTES Edited by William Adkins On Goldbach s Conjecture for Integer Polynomials Filip Saidak 1. INTRODUCTION. We give a short proof of the fact that every monic polynomial f (x) in Z[x] can be written
More informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
More informationarxiv:math/ v1 [math.oa] 9 May 2005
arxiv:math/0505154v1 [math.oa] 9 May 2005 A GENERALIZATION OF ANDÔ S THEOREM AND PARROTT S EXAMPLE DAVID OPĚLA Abstract. Andô s theorem states that any pair of commuting contractions on a Hilbert space
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationNUMBER FIELDS WITHOUT SMALL GENERATORS
NUMBER FIELDS WITHOUT SMALL GENERATORS JEFFREY D. VAALER AND MARTIN WIDMER Abstract. Let D > be an integer, and let b = b(d) > be its smallest divisor. We show that there are infinitely many number fields
More informationSEVERAL PROOFS OF THE IRREDUCIBILITY OF THE CYCLOTOMIC POLYNOMIALS
SEVERAL PROOFS OF THE IRREDUCIBILITY OF THE CYCLOTOMIC POLYNOMIALS STEVEN H. WEINTRAUB ABSTRACT. We present a number of classical proofs of the irreducibility of the n-th cyclotomic polynomial Φ n (x).
More informationBP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS. 1. Introduction and results
BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS DONALD M. DAVIS Abstract. We determine the BP -module structure, mod higher filtration, of the main part of the BP -homology of elementary 2- groups.
More informationA SUFFICIENT CONDITION FOR STRICT TOTAL POSITIVITY OF A MATRIX. Thomas Craven and George Csordas
A SUFFICIENT CONDITION FOR STRICT TOTAL POSITIVITY OF A MATRIX Thomas Craven and George Csordas Abstract. We establish a sufficient condition for strict total positivity of a matrix. In particular, we
More informationFinite pseudocomplemented lattices: The spectra and the Glivenko congruence
Finite pseudocomplemented lattices: The spectra and the Glivenko congruence T. Katriňák and J. Guričan Abstract. Recently, Grätzer, Gunderson and Quackenbush have characterized the spectra of finite pseudocomplemented
More informationCOMPLETELY INVARIANT JULIA SETS OF POLYNOMIAL SEMIGROUPS
Series Logo Volume 00, Number 00, Xxxx 19xx COMPLETELY INVARIANT JULIA SETS OF POLYNOMIAL SEMIGROUPS RICH STANKEWITZ Abstract. Let G be a semigroup of rational functions of degree at least two, under composition
More informationKatarzyna Mieczkowska
Katarzyna Mieczkowska Uniwersytet A. Mickiewicza w Poznaniu Erdős conjecture on matchings in hypergraphs Praca semestralna nr 1 (semestr letni 010/11 Opiekun pracy: Tomasz Łuczak ERDŐS CONJECTURE ON MATCHINGS
More information1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA
Volume, Number 2, Pages 63 78 ISSN 75-0868 ON THE EQUATION n i= = IN DISTINCT ODD OR EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Abstract. In this paper we combine theoretical
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationOptimal global rates of convergence for interpolation problems with random design
Optimal global rates of convergence for interpolation problems with random design Michael Kohler 1 and Adam Krzyżak 2, 1 Fachbereich Mathematik, Technische Universität Darmstadt, Schlossgartenstr. 7, 64289
More informationAbsolute value equations
Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West
More informationExcluding a Long Double Path Minor
journal of combinatorial theory, Series B 66, 1123 (1996) article no. 0002 Excluding a Long Double Path Minor Guoli Ding Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana 70803
More informationHADAMARD DETERMINANTS, MÖBIUS FUNCTIONS, AND THE CHROMATIC NUMBER OF A GRAPH
HADAMARD DETERMINANTS, MÖBIUS FUNCTIONS, AND THE CHROMATIC NUMBER OF A GRAPH BY HERBERT S. WILF 1 Communicated by Gian-Carlo Rota, April 5, 1968 The three subjects of the title are bound together by an
More informationDIRECTED STUDIES IN MATHEMATICS - FINAL REPORT. 1. Introduction
DIRECTED STUDIES IN MATHEMATICS - FINAL REPORT ZHANG YONGQUAN 1. Introduction The factorial function n!, usually defined as the number of permutations of n distinct objects (or equivalently the product
More informationON FUNCTIONS WHOSE GRAPH IS A HAMEL BASIS II
To the memory of my Mother ON FUNCTIONS WHOSE GRAPH IS A HAMEL BASIS II KRZYSZTOF P LOTKA Abstract. We say that a function h: R R is a Hamel function (h HF) if h, considered as a subset of R 2, is a Hamel
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationIndependence of some multiple Poisson stochastic integrals with variable-sign kernels
Independence of some multiple Poisson stochastic integrals with variable-sign kernels Nicolas Privault Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological
More informationEdge Isoperimetric Theorems for Integer Point Arrays
Edge Isoperimetric Theorems for Integer Point Arrays R. Ahlswede, S.L. Bezrukov Universität Bielefeld, Fakultät für Mathematik Postfach 100131, 33501 Bielefeld, Germany Abstract We consider subsets of
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationFULLY COMMUTATIVE ELEMENTS AND KAZHDAN LUSZTIG CELLS IN THE FINITE AND AFFINE COXETER GROUPS. Jian-yi Shi
FULLY COMMUTATIVE ELEMENTS AND KAZHDAN LUSZTIG CELLS IN THE FINITE AND AFFINE COXETER GROUPS Jian-yi Shi Abstract. The main goal of the paper is to show that the fully commutative elements in the affine
More informationFinite groups determined by an inequality of the orders of their elements
Publ. Math. Debrecen 80/3-4 (2012), 457 463 DOI: 10.5486/PMD.2012.5168 Finite groups determined by an inequality of the orders of their elements By MARIUS TĂRNĂUCEANU (Iaşi) Abstract. In this note we introduce
More informationJordan Journal of Mathematics and Statistics (JJMS) 8(3), 2015, pp THE NORM OF CERTAIN MATRIX OPERATORS ON NEW DIFFERENCE SEQUENCE SPACES
Jordan Journal of Mathematics and Statistics (JJMS) 8(3), 2015, pp 223-237 THE NORM OF CERTAIN MATRIX OPERATORS ON NEW DIFFERENCE SEQUENCE SPACES H. ROOPAEI (1) AND D. FOROUTANNIA (2) Abstract. The purpose
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationUNIFORM BOUNDS FOR BESSEL FUNCTIONS
Journal of Applied Analysis Vol. 1, No. 1 (006), pp. 83 91 UNIFORM BOUNDS FOR BESSEL FUNCTIONS I. KRASIKOV Received October 8, 001 and, in revised form, July 6, 004 Abstract. For ν > 1/ and x real we shall
More informationThe chromatic number of ordered graphs with constrained conflict graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 69(1 (017, Pages 74 104 The chromatic number of ordered graphs with constrained conflict graphs Maria Axenovich Jonathan Rollin Torsten Ueckerdt Department
More informationApplication of Polynomial Interpolation in the Chinese Remainder Problem
Journal of Mathematical Research with Applications Jan., 017, Vol. 37, No. 1, pp. 90 96 DOI:10.3770/j.issn:095-651.017.01.008 Http://jmre.dlut.edu.cn Application of Polynomial Interpolation in the Chinese
More informationOn the indecomposability of polynomials
On the indecomposability of polynomials Andrej Dujella, Ivica Gusić and Robert F. Tichy Abstract Applying a combinatorial lemma a new sufficient condition for the indecomposability of integer polynomials
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationProjective Schemes with Degenerate General Hyperplane Section II
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 44 (2003), No. 1, 111-126. Projective Schemes with Degenerate General Hyperplane Section II E. Ballico N. Chiarli S. Greco
More informationThe Chromatic Number of Ordered Graphs With Constrained Conflict Graphs
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs Maria Axenovich and Jonathan Rollin and Torsten Ueckerdt September 3, 016 Abstract An ordered graph G is a graph whose vertex set
More informationCOUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF
COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationCombinatorial Batch Codes and Transversal Matroids
Combinatorial Batch Codes and Transversal Matroids Richard A. Brualdi, Kathleen P. Kiernan, Seth A. Meyer, Michael W. Schroeder Department of Mathematics University of Wisconsin Madison, WI 53706 {brualdi,kiernan,smeyer,schroede}@math.wisc.edu
More informationLIMITING CASES OF BOARDMAN S FIVE HALVES THEOREM
Proceedings of the Edinburgh Mathematical Society Submitted Paper Paper 14 June 2011 LIMITING CASES OF BOARDMAN S FIVE HALVES THEOREM MICHAEL C. CRABB AND PEDRO L. Q. PERGHER Institute of Mathematics,
More informationDecomposition of Riesz frames and wavelets into a finite union of linearly independent sets
Decomposition of Riesz frames and wavelets into a finite union of linearly independent sets Ole Christensen, Alexander M. Lindner Abstract We characterize Riesz frames and prove that every Riesz frame
More informationChapter 1 Vector Spaces
Chapter 1 Vector Spaces Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 110 Linear Algebra Vector Spaces Definition A vector space V over a field
More informationThe domination game played on unions of graphs
The domination game played on unions of graphs Paul Dorbec 1,2 Gašper Košmrlj 3 Gabriel Renault 1,2 1 Univ. Bordeaux, LaBRI, UMR5800, F-33405 Talence 2 CNRS, LaBRI, UMR5800, F-33405 Talence Email: dorbec@labri.fr,
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationMaximal Independent Sets In Graphs With At Most r Cycles
Maximal Independent Sets In Graphs With At Most r Cycles Goh Chee Ying Department of Mathematics National University of Singapore Singapore goh chee ying@moe.edu.sg Koh Khee Meng Department of Mathematics
More informationAsymptotics of Integrals of. Hermite Polynomials
Applied Mathematical Sciences, Vol. 4, 010, no. 61, 04-056 Asymptotics of Integrals of Hermite Polynomials R. B. Paris Division of Complex Systems University of Abertay Dundee Dundee DD1 1HG, UK R.Paris@abertay.ac.uk
More informationApproximation with Interpolation Conditions of an Asymptotic Function Using K-algebraic Lagrange Interpolation
Approximation with Interpolation Conditions of an Asymptotic Function Using K-algebraic Lagrange Interpolation G. Martínez-Guzmán, M. Bustillo-Díaz, A. Rangel-Huerta, G. Juárez-Díaz, A. Ata-Pérez and N.
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More information1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5
J. Korean Math. Soc. 36 (1999), No. 6, pp. 1181{1190 LINEAR OPERATORS THAT PRESERVE ZERO-TERM RANK OF BOOLEAN MATRICES LeRoy. B. Beasley, Seok-Zun Song, and Sang-Gu Lee Abstract. Zero-term rank of a matrix
More informationTHE CLOSED-POINT ZARISKI TOPOLOGY FOR IRREDUCIBLE REPRESENTATIONS. K. R. Goodearl and E. S. Letzter
THE CLOSED-POINT ZARISKI TOPOLOGY FOR IRREDUCIBLE REPRESENTATIONS K. R. Goodearl and E. S. Letzter Abstract. In previous work, the second author introduced a topology, for spaces of irreducible representations,
More information(V/í) : Y, A) - 0 mod 2. (V-tf) : Y,a) = 0 mod 2.
CHARACTERIZATION OF TOTALLY UNIMODULAR MATRICES PAUL CAMION In this paper A will always denote a matrix with entries equal to 1, 1 or. A is totally unimodular if every square submatrix has a determinant
More informationPrimitive Matrices with Combinatorial Properties
Southern Illinois University Carbondale OpenSIUC Research Papers Graduate School Fall 11-6-2012 Primitive Matrices with Combinatorial Properties Abdulkarem Alhuraiji al_rqai@yahoo.com Follow this and additional
More informationProblem 1A. Use residues to compute. dx x
Problem 1A. A non-empty metric space X is said to be connected if it is not the union of two non-empty disjoint open subsets, and is said to be path-connected if for every two points a, b there is a continuous
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationTHE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany
#A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,
More informationA NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS. Masaru Nagisa. Received May 19, 2014 ; revised April 10, (Ax, x) 0 for all x C n.
Scientiae Mathematicae Japonicae Online, e-014, 145 15 145 A NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS Masaru Nagisa Received May 19, 014 ; revised April 10, 014 Abstract. Let f be oeprator monotone
More informationDUNFORD-PETTIS OPERATORS ON BANACH LATTICES1
transactions of the american mathematical society Volume 274, Number 1, November 1982 DUNFORD-PETTIS OPERATORS ON BANACH LATTICES1 BY C. D. ALIPRANTIS AND O. BURKINSHAW Abstract. Consider a Banach lattice
More informationRegular finite Markov chains with interval probabilities
5th International Symposium on Imprecise Probability: Theories and Applications, Prague, Czech Republic, 2007 Regular finite Markov chains with interval probabilities Damjan Škulj Faculty of Social Sciences
More informationElementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),
Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes
More informationDEPTH OF FACTORS OF SQUARE FREE MONOMIAL IDEALS
DEPTH OF FACTORS OF SQUARE FREE MONOMIAL IDEALS DORIN POPESCU Abstract. Let I be an ideal of a polynomial algebra over a field, generated by r-square free monomials of degree d. If r is bigger (or equal)
More informationVandermonde Matrices for Intersection Points of Curves
This preprint is in final form. It appeared in: Jaén J. Approx. (009) 1, 67 81 Vandermonde Matrices for Intersection Points of Curves Hakop Hakopian, Kurt Jetter and Georg Zimmermann Abstract We reconsider
More informationON LARGE ZSIGMONDY PRIMES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 02, Number, January 988 ON LARGE ZSIGMONDY PRIMES WALTER FEIT (Communicated by Donald Passman) Abstract. If a and m are integers greater than, then
More informationTitle: Linear dependence of powers of linear forms
Title: Linear dependence of powers of linear forms Author: Andrzej Sładek Citation style: Sładek Andrzej. (015). Linear dependence of powers of linear forms. "Annales Mathematicae Silesianae" (Nr 9 (015),
More informationCharacterization of 2 n -Periodic Binary Sequences with Fixed 2-error or 3-error Linear Complexity
Characterization of n -Periodic Binary Sequences with Fixed -error or 3-error Linear Complexity Ramakanth Kavuluru Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA. Abstract
More information