ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS

Size: px
Start display at page:

Download "ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS"

Transcription

1 #A34 INTEGERS 17 (017) ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS Jürgen Kritschgau Departent of Matheatics, Iowa State University, Aes, Iowa Adriana Salerno Departent of Matheatics, Bates College, Lewiston, Maine Received: 10/3/16, Revised: /14/17, Accepted: 7/5/17, Published: 8/7/17 Abstract In the aking of origai, one starts with a piece of paper, and through a series of folds along a given set of points one constructs coplicated three-diensional shapes Matheatically, one can think of the coplex nubers as representing the piece of paper, and the initial points and folds as a way to generate a subset of the coplex nubers Under certain constraints, this construction can give rise to a ring, which we call an origai ring We will talk about the basic construction of an origai ring and further extensions and iplications of these ideas in algebra and nuber theory, extending results of Buhler, etal In particular, in this paper we show that it is possible to obtain the ring of integers of an iaginary quadratic field through an origai construction 1 Introduction In origai, the artist uses intersections of folds as reference points to ake new folds This kind of construction can be extended to points on the coplex plane In [1], the authors define one such atheatical construction In this construction one can think of the coplex plane as representing the paper, and lines representing the folds The question they explored is: which points in the plane can be constructed through iterated intersections of lines, starting with a prescribed set of allowable angles and only the points 0 and 1? First, we say that the set S = {0, 1} is the set of initial points We fix a set U of angles, or directions, deterining which lines we can draw through the points in our set Thus, we can define the fold through the point p with angle u as the

2 INTEGERS: 17 (017) line given by L u (p) := {p + ru : r R} Notice that U can also be coprised of points (thinking of u U as defining a direction) on the unit circle, ie the circle group T Moreover, u and u define the sae line, so we can think of the directions as being in the quotient group T/{±1} Finally, if u and v in U deterine distinct folds, we say that I u,v (p, q) = L u (p) \ L v (q) is the unique point of intersection of the lines L u (p) and L v (q) We define R(U) to be the set of points obtained by iterated intersections I u,v (p, q), starting with the points in S and angles in U Alternatively, we ay define R(U) to be the sallest subset of C that contains 0 and 1 and I u,v (p, q) whenever it contains p and q, and u, v deterine distinct folds The ain theore of [1] is the following: Theore 1 If U is a subgroup of T/{±1}, and U of C 3, then R(U) is a subring Let U n denote the cyclic group of order n generated by e i /n (od {±1}) Then Buhler, et al, obtain the following corollary Theore Let n 3 If n is prie, then R(U n ) = Z[ n ] is the cyclotoic integer ring If n is not prie, then R(U n ) = Z[ n, 1 n ] In [4], Nedrenco explores whether R(U) is a subring of C even if U is not a group, and obtains a negative answer and soe necessary conditions for this to be true The ain result is that given the set of directions U = {1, e i, e i }, if 6 od then R(U) = Z + zz for soe z C Clearly, this will not always be a ring, as it will not always be closed under ultiplication In this paper, we explore the inverse proble, that is, given an interesting subring of C, can we obtain it via an origai construction? The answer is a rative in the case of the ring of integers of an iaginary quadratic field The next section of this paper delves deeper into the origai construction, in particular the intersection operator Soe properties in this section are crucial for understanding the proofs of our ain results This section also explores an exaple of an origai construction in ore depth, that of the Gaussian integers, since it illustrates the geoetric and algebraic approach through a very well known ring Finally, in Section 3, we state and prove our ain result

3 INTEGERS: 17 (017) 3 Properties of Origai Rings 1 The Intersection Operator Let U T, as before There are iportant properties of the I u,v (p, q) operator that are integral for us to prove our theore Let u, v U be two distinct angles Let p, q be points in R(U) Consider the pair of intersecting lines L u (p) and L v (q) In [1], it is shown that we can express I u,v (p, q) as I u,v (p, q) = u pv ūpv u v ūv + q vu qvu ūv u v [u, p] [v, q] = v + [u, v] [v, u] u, ( ) where [x, y] = xy xy Fro the algebraic closed for ( ) of the intersection operator, we can see by straightforward coputation that the following properties hold for for p, q, u, v C Syetry I u,v (p, q) = I v,u (q, p) Reduction I u,v (p, q) = I u,v (p, 0) + I v,u (q, 0) Linearity I u,v (p + q, 0) = I u,v (p, 0) + I u,v (q, 0) and ri u,v (p, 0) = I u,v (rp, 0) where r R Projection I u,v (p, 0) is a projection of p on the line {rv : r R} in the u direction Rotation For w T, wi u,v (p, q) = I wu,wv (wp, wq) An Illustrative Exaple Let S = {0, 1} be our set of initial points Now, let U = {1, e i /4, i} This is clearly not a group, since e i 4 i = e 3i 4 6 U, and so does not satisfy the hypotheses of Theore 1 Given a set of points, the set generated by intersections can be coputed in two ways; using the closed forula ( ), or geoetrically In Figure 1, we illustrate how to generate the first few points through line intersections Figure 1: Starting with {0, 1} and drawing lines with angles 0, /, /4, we see that we only generate two new points, 1 + i and i

4 INTEGERS: 17 (017) 4 In Figure, we show the di erent stages of the construction obtained by iterated intersections These figures were created by coding the forula for iterated intersections into Maple [] Figure : These graphs illustrate the sequence of point creation, where each successive graph shows all possible intersections fro the previous graph using U = {1, e i /4, i} as our set of allowable angles In the last graph, not all of the new points fit into the section of the plane we are picturing Notice that a pattern sees to eerge: the points constructed all have the for

5 INTEGERS: 17 (017) 5 a+bi where a, b Z This sees to indicate that this origai construction generates the Gaussian integers, a subring of C In fact, this is a special case of the ain result of [4], where z = i So, in fact, this suggests that it is possible to construct a subring of C without U being a group We prove in the next section that the ring of algebraic integers of an iaginary quadratic field can always be obtained through an origai construction 3 Constructing O(Q( p )) A natural question related to the previous section is: which subrings of C can be generated through an origai construction, that is, which subrings are origai rings? We have seen that the cyclotoic integers Z[ n ], where n is prie, are origai rings by Theore 1 Let < 0 be a square-free integer, so Q( p ) is an iaginary quadratic field Denote by O(Q( p )) the ring of algebraic integers in Q( p ) Recall that a coplex nuber is an algebraic integer if and only if it is the root of soe onic polynoial with coe cients in Z Then we have the following well-known theore (for details see, for exaple, [3, pg 15]) Theore 3 The set of algebraic integers in the quadratic field Q( p ) is {a + b p : a, b Z} if or 3 (od 4), p a + b : a, b Z, a b (od ) if 1 (od 4) And so, we can state our ain theore Theore 4 Let < 0 be a squarefree integer, and let = arg(1 + p ) Then O(Q( p )) = R(U) where 1 U = {1, i, e i }, if or 3 (od 4), and U = {1, e i, e i( ) }, if 1 (od 4) Notice that the Gaussian integers are a special case of Theore Proof of Theore 41 Let or 3 (od 4) and < 0 Let U = {1, i, e i } where is the principal arguent of 1 + p Lea 1 We have that I u,v (p, q) Z[ p ] whenever u, v U and p, q Z[ p ] Proof Since there are three possible directions, there are 3 Let p = a + b p and q = c + d p Then = 6 cases to consider

6 INTEGERS: 17 (017) 6 1 I 1,i (p, q) = c + b p I 1,e i (p, q) = b + c d + b p 3 I i,1 (p, q) = a + d p 4 I i,e i (p, q) = a + (a c + d) p 5 I e i,1(p, q) = a b + d + d p 6 I e i,i(p, q) = c + ( a + b + c) p In other words, if p, q Z[ p ], then so is I u,v (p, q) All of these can be obtained fro straightforward coputations using equation ( ) For exaple, I 1,i (p, q) = [1, a + bp ] i + [i, c + dp ] = c + b p [1, i] [i, 1] This concludes the proof for the closure of the intersection operator In other words, as long as our set of known points starts with eleents in Z[ p ], then the intersections will also be in Z[ p ] We can also express this clai as R(U) Z[ p ] It reains to be shown that any eleent in Z[ p ] is also an eleent in R(U) Lea The set Z[ p ] R(U) Proof Let a + b p be an eleent in Z[ p ] We want to show that it can be constructed fro starting with {0, 1} and the given set U We can reduce the proble by showing that given points {n+k p, n+1+k p } we can construct n 1 + k p, n + + k p, n + (k ± 1) p and n (k ± 1) p In Figure 3 we give an illustration of this step of the proof In essence, the following is the induction step to a double induction on the real and iaginary coponents of an arbitrary integer we are constructing We prove that for any two adjacent points in the construction, we can construct points that are adjacent in every direction Since our initial set of points is {0, 1}, we can construct any eleent of the for a + b p We will now construct the desired points using the appropriate reference points Constructing n + + k p Consider I i,1 (I 1,e i (I e i,i(n + k p, n k p ), n k p ), n k p )

7 INTEGERS: 17 (017) 7 Figure 3: Given two points next to each other, we want to show that we can generate all the points iediately around the This results in ore points next to each other, upon which we can repeat the process Notice that we can evaluate this expression using the six cases enuerated in Lea 1 In particular, we apply case (6) first to get I i,1 (I 1,e i (n (k + 1) p, n k p ), n k p ) Next, we apply case () to get I i,1 (n (k + 1) p, n k p ) Finally, we use case (3) to get n + + k p Constructing n 1 + k p Consider I i,1 (I 1,e i (I i,e i (n + k p, n k p ), n + k p ), n + k p ) First, we apply case (4) to get I i,1 (I 1,e i (n + (k 1) p, n + k p ), n + k p ) Next, we apply case () to get I i,1 (n 1 + (k 1) p, n) Finally, we apply case (3) to get n 1 + k p Constructing n + (k + 1) p and n (k + 1) p Consider I e i,i(n + k p, n k p ) Using case (6) we get n (k + 1) p Now consider I i,1 (n + k p, n (k + 1) p ) Using case (3) we get n + (k + 1) p Constructing n + (k 1) p and n (k 1) p Consider I i,e i (n + k p, n k p ) Using case (4) we get n+(k 1) p Consider I i,1 (n+1+k p, n+(k 1) p ) Using case (3) we get n (k 1) p Thus we have shown that Z[ p ] R(U), copleting the proof

8 INTEGERS: 17 (017) 8 3 Proof of Theore 4 The proof for Theore 4 eploys the sae strategy as the proof for 41, with a subtle di erence given by the slightly di erent structure of the ring Let 1 (od 4) and < 0 Let U = {1, e i, e i( ) } where is the principal arguent of 1 + p Lea 3 We have that I u,v (p, q) O(Q( p )) where u, v U and p, q O(Q( p )) Proof Again, there are six cases to consider Let p = a+bp and q = c+dp, where a b od and c d od The cases are as follows 1 I 1,e i (p, q) = b + c d + b p I 1,e i( )(p, q) = c + d b + b p 3 I e i,1(p, q) = a b + d + d p 4 I e i,e i( )(p, q) = (a b+c+d)+(b a+c+d)p 5 I e i( ),1(p, q) = a + b d + d p 6 I e i( ),e i (p, q) = (a+b+c d)+(a+b c+d)p All of these cases can be obtained, again, by straightforward coputation using ( ), and are left as an exercise Notice that (1), (), (3), and (5) all are clearly in the ring of algebraic integers The only additional fact to show is that (4) and (6) are as well But it s easy to see that a b + c + d b a + c + d od, since a b od And siilarly a + b + c d a + b c + d od, because c d od This concludes the proof for the closure of the intersection operator In other words, as long as our set of known points contains only eleents in O(Q( p )), then the intersections will also be in O(Q( p )) That is, R(U) O(Q( p )) It reains to be shown that any eleent in O(Q( p )) is also an eleent in R(U) Lea 4 The set O(Q( p )) R(U) Proof Let a + bp be an eleent in O(Q( p )) As before, we can reduce the proble to one of double induction This is done by showing that given points p n + k, n + + kp

9 INTEGERS: 17 (017) 9 Figure 4: Given two points next to each other, we want to show that we can generate all the points iediately around the Notice that this can be iterated to generate all points The graph on the left illustrates the starting points The graph on the right shows the points whose construction is su cient to prove the theore we can construct n + k p, n kp, n (k 1)p Figure 4 is an illustration of the points we want to construct We will now show how to construct the desired points Constructing n+1+(k 1)p Consider p n + k I e i,e, n + + kp i( ) By applying case (4) fro above, we see that p n + k I e i,e, n + + kp i( ) and n (k + 1)p = n (k 1)p Constructing n+1+(k+1)p Consider p n + k I e i( ),e, n + + kp i By applying case (6) fro above, we see that p n + k I e i( ),e, n + + kp i = n (k + 1)p

10 INTEGERS: 17 (017) 10 Constructing n +kp Consider p n (k + 1) I e i,1 I 1,e i( ), n + kp, n + kp By applying case (1) fro above, we can reduce the previous expression to p n 1 + (k + 1) I e i,1, n + kp We further reduce the expression using case (5) fro above The result is p n 1 + (k + 1) I e i,1, n + kp = n + kp Constructing n+4+kp Consider p n (k + 1) I e i( ),1 I 1,e, n + + kp, n + + kp By applying case (5) fro above, we can reduce the previous expression to p n (k + 1) I e i( ),1, n + + kp We further reduce the expression using case (1) fro above The result is p n (k + 1) I e i( ),1, n + + kp = n kp By induction, given our initial set of points {0, 1} and the proofs above, we see that p a + b : a, b Z, a b (od ) R(U), copleting the proof 33 Soe Final Illustrations and Rearks In Figure 5 we see that when we use U = {1, i, e i } as our angle set, then the origai ring grows into the first and third quadrants, and bleeds into the others As discussed, R(U) = Z[i] In Figure 6 we see that when we use U = {1, e i arg(1+p 3), e i( arg(1+p 3)) } as our angle set, then the origai ring grows along the real line, and slowly bleeds into

11 INTEGERS: 17 (017) 11 the rest of the coplex plane This is an illustration of the second case of Theore 4 In this case, R(U) = O(Q( p 3)) Of course, R(U) is assued to be closed under the intersection operator, so the growth pattern doesn t atter in an abstract sense However, coputationally, it eans that the nuber of steps it takes to construct a point is not related to that point s odulus In fact, we get an entirely di erent easure of distance if we only consider the nuber of steps it takes to generate a point One possible additional exploration is, given ore general starting angles and points, to describe the dynaics of the iterative process These exaples also serve to illustrate the progression of the iterative process, which was coded into Maple [] to produce the graphs Figure 5: This graph depicts the first 5 generations of origai points using U = {1, i, e i 4 } Figure 6: This graph depicts the first 5 generations of origai points using U = {1, e i arg(1+p 3), e i( arg(1+p 3)) }

12 INTEGERS: 17 (017) 1 Acknowledgeents This work was part of Kritschgau s senior Honors Thesis at Bates College, advised by Salerno, and we thank the Bates Matheatics Departent, in particular Peter Wong, for useful feedback and discussions throughout the thesis process We would also like to thank the rest of the Honors coittee, Paela Harris and Matthew Coté, for the careful reading of the thesis and their insightful questions Finally, we would like to thank the 015 Suer Undergraduate Applied Matheatics Institute (SUAMI) at Carnegie Mellon University for inspiring the research proble We also thank the referee for suggestions that largely iproved the iages and presentation References [1] J Buhler, S Butler, W de Launey, and R Graha, Origai rings, J Aust Math Soc 9 (01), [] Maple 17 Maplesoft, a division of Waterloo Maple Inc, Waterloo, Ontario [3] D A Marcus, Nuber Fields Springer Verlag, New York, 1997 [4] D Nedrenco, On origai rings, arxiv: v1, (015)

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

A Bernstein-Markov Theorem for Normed Spaces

A Bernstein-Markov Theorem for Normed Spaces A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :

More information

EXPLORING ORIGAMI GENERATED STRUCTURES IN C 1. INTRODUCTION

EXPLORING ORIGAMI GENERATED STRUCTURES IN C 1. INTRODUCTION EXPLORING ORIGAMI GENERATED STRUCTURES IN C YU XUAN HONG ABSTRACT. The origami generator problem can be described as follows: given a set U of angles, and a set S of points containing 0 and 1, construct

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

1. INTRODUCTION AND RESULTS

1. INTRODUCTION AND RESULTS SOME IDENTITIES INVOLVING THE FIBONACCI NUMBERS AND LUCAS NUMBERS Wenpeng Zhang Research Center for Basic Science, Xi an Jiaotong University Xi an Shaanxi, People s Republic of China (Subitted August 00

More information

THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT

THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and

More information

Poly-Bernoulli Numbers and Eulerian Numbers

Poly-Bernoulli Numbers and Eulerian Numbers 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441

More information

3.8 Three Types of Convergence

3.8 Three Types of Convergence 3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to

More information

M ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1.

M ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1. M ath. Res. Lett. 15 (2008), no. 2, 375 388 c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS Van H. Vu Abstract. Let F q be a finite field of order q and P be a polynoial in F q[x

More information

arxiv: v1 [math.nt] 14 Sep 2014

arxiv: v1 [math.nt] 14 Sep 2014 ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row

More information

Feature Extraction Techniques

Feature Extraction Techniques Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that

More information

4 = (0.02) 3 13, = 0.25 because = 25. Simi-

4 = (0.02) 3 13, = 0.25 because = 25. Simi- Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =

More information

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns

More information

VC Dimension and Sauer s Lemma

VC Dimension and Sauer s Lemma CMSC 35900 (Spring 2008) Learning Theory Lecture: VC Diension and Sauer s Lea Instructors: Sha Kakade and Abuj Tewari Radeacher Averages and Growth Function Theore Let F be a class of ±-valued functions

More information

lecture 36: Linear Multistep Mehods: Zero Stability

lecture 36: Linear Multistep Mehods: Zero Stability 95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,

More information

q-analog of Fleck s congruence

q-analog of Fleck s congruence Introducing Fleck s Congruence -binoial coefficients Basic ingredients in proof Observations A -analog of Fleck s congruence Wellesley College October 2, 2011 -analog of Fleck s congruence Introducing

More information

Algebraic Montgomery-Yang problem: the log del Pezzo surface case

Algebraic Montgomery-Yang problem: the log del Pezzo surface case c 2014 The Matheatical Society of Japan J. Math. Soc. Japan Vol. 66, No. 4 (2014) pp. 1073 1089 doi: 10.2969/jsj/06641073 Algebraic Montgoery-Yang proble: the log del Pezzo surface case By DongSeon Hwang

More information

MODULAR HYPERBOLAS AND THE CONGRUENCE ax 1 x 2 x k + bx k+1 x k+2 x 2k c (mod m)

MODULAR HYPERBOLAS AND THE CONGRUENCE ax 1 x 2 x k + bx k+1 x k+2 x 2k c (mod m) #A37 INTEGERS 8 (208) MODULAR HYPERBOLAS AND THE CONGRUENCE ax x 2 x k + bx k+ x k+2 x 2k c (od ) Anwar Ayyad Departent of Matheatics, Al Azhar University, Gaza Strip, Palestine anwarayyad@yahoo.co Todd

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal

More information

Linear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions

Linear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions Linear recurrences and asyptotic behavior of exponential sus of syetric boolean functions Francis N. Castro Departent of Matheatics University of Puerto Rico, San Juan, PR 00931 francis.castro@upr.edu

More information

On Certain C-Test Words for Free Groups

On Certain C-Test Words for Free Groups Journal of Algebra 247, 509 540 2002 doi:10.1006 jabr.2001.9001, available online at http: www.idealibrary.co on On Certain C-Test Words for Free Groups Donghi Lee Departent of Matheatics, Uni ersity of

More information

EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS

EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

A1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3

A1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3 A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)

More information

The Weierstrass Approximation Theorem

The Weierstrass Approximation Theorem 36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined

More information

a a a a a a a m a b a b

a a a a a a a m a b a b Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice

More information

THE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n

THE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n THE POLYNOMIAL REPRESENTATION OF THE TYPE A n RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n SHEELA DEVADAS AND YI SUN Abstract. We study the polynoial representation of the rational Cherednik algebra

More information

Infinitely Many Trees Have Non-Sperner Subtree Poset

Infinitely Many Trees Have Non-Sperner Subtree Poset Order (2007 24:133 138 DOI 10.1007/s11083-007-9064-2 Infinitely Many Trees Have Non-Sperner Subtree Poset Andrew Vince Hua Wang Received: 3 April 2007 / Accepted: 25 August 2007 / Published online: 2 October

More information

ON SOME PROBLEMS OF GYARMATI AND SÁRKÖZY. Le Anh Vinh Mathematics Department, Harvard University, Cambridge, Massachusetts

ON SOME PROBLEMS OF GYARMATI AND SÁRKÖZY. Le Anh Vinh Mathematics Department, Harvard University, Cambridge, Massachusetts #A42 INTEGERS 12 (2012) ON SOME PROLEMS OF GYARMATI AND SÁRKÖZY Le Anh Vinh Matheatics Departent, Harvard University, Cabridge, Massachusetts vinh@ath.harvard.edu Received: 12/3/08, Revised: 5/22/11, Accepted:

More information

Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus

Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus ACTA ARITHMETICA XCII1 (2000) Exponential sus and the distribution of inversive congruential pseudorando nubers with prie-power odulus by Harald Niederreiter (Vienna) and Igor E Shparlinski (Sydney) 1

More information

Descent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA,

Descent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA, Descent polynoials arxiv:1710.11033v2 [ath.co] 13 Nov 2017 Alexander Diaz-Lopez Departent of Matheatics and Statistics, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, USA, alexander.diaz-lopez@villanova.edu

More information

Research Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials

Research Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials Discrete Dynaics in Nature and Society Volue 202, Article ID 927953, pages doi:055/202/927953 Research Article Soe Forulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynoials Yuan He and

More information

The Fundamental Basis Theorem of Geometry from an algebraic point of view

The Fundamental Basis Theorem of Geometry from an algebraic point of view Journal of Physics: Conference Series PAPER OPEN ACCESS The Fundaental Basis Theore of Geoetry fro an algebraic point of view To cite this article: U Bekbaev 2017 J Phys: Conf Ser 819 012013 View the article

More information

Homework 3 Solutions CSE 101 Summer 2017

Homework 3 Solutions CSE 101 Summer 2017 Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing

More information

PREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL

PREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL PREPRINT 2006:7 Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL Departent of Matheatical Sciences Division of Matheatics CHALMERS UNIVERSITY OF TECHNOLOGY GÖTEBORG UNIVERSITY

More information

G G G G G. Spec k G. G Spec k G G. G G m G. G Spec k. Spec k

G G G G G. Spec k G. G Spec k G G. G G m G. G Spec k. Spec k 12 VICTORIA HOSKINS 3. Algebraic group actions and quotients In this section we consider group actions on algebraic varieties and also describe what type of quotients we would like to have for such group

More information

arxiv: v1 [math.gr] 18 Dec 2017

arxiv: v1 [math.gr] 18 Dec 2017 Probabilistic aspects of ZM-groups arxiv:7206692v [athgr] 8 Dec 207 Mihai-Silviu Lazorec Deceber 7, 207 Abstract In this paper we study probabilistic aspects such as (cyclic) subgroup coutativity degree

More information

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,

More information

Perturbation on Polynomials

Perturbation on Polynomials Perturbation on Polynoials Isaila Diouf 1, Babacar Diakhaté 1 & Abdoul O Watt 2 1 Départeent Maths-Infos, Université Cheikh Anta Diop, Dakar, Senegal Journal of Matheatics Research; Vol 5, No 3; 2013 ISSN

More information

ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS

ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS Palestine Journal of Matheatics Vol 4) 05), 70 76 Palestine Polytechnic University-PPU 05 ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS Julius Fergy T Rabago Counicated by

More information

The Frobenius problem, sums of powers of integers, and recurrences for the Bernoulli numbers

The Frobenius problem, sums of powers of integers, and recurrences for the Bernoulli numbers Journal of Nuber Theory 117 (2006 376 386 www.elsevier.co/locate/jnt The Frobenius proble, sus of powers of integers, and recurrences for the Bernoulli nubers Hans J.H. Tuenter Schulich School of Business,

More information

THE SUPER CATALAN NUMBERS S(m, m + s) FOR s 3 AND SOME INTEGER FACTORIAL RATIOS. 1. Introduction. = (2n)!

THE SUPER CATALAN NUMBERS S(m, m + s) FOR s 3 AND SOME INTEGER FACTORIAL RATIOS. 1. Introduction. = (2n)! THE SUPER CATALAN NUMBERS S(, + s FOR s 3 AND SOME INTEGER FACTORIAL RATIOS XIN CHEN AND JANE WANG Abstract. We give a cobinatorial interpretation for the super Catalan nuber S(, + s for s 3 using lattice

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

ON THE 2-PART OF THE BIRCH AND SWINNERTON-DYER CONJECTURE FOR QUADRATIC TWISTS OF ELLIPTIC CURVES

ON THE 2-PART OF THE BIRCH AND SWINNERTON-DYER CONJECTURE FOR QUADRATIC TWISTS OF ELLIPTIC CURVES ON THE 2-PART OF THE BIRCH AND SWINNERTON-DYER CONJECTURE FOR QUADRATIC TWISTS OF ELLIPTIC CURVES LI CAI, CHAO LI, SHUAI ZHAI Abstract. In the present paper, we prove, for a large class of elliptic curves

More information

Prerequisites. We recall: Theorem 2 A subset of a countably innite set is countable.

Prerequisites. We recall: Theorem 2 A subset of a countably innite set is countable. Prerequisites 1 Set Theory We recall the basic facts about countable and uncountable sets, union and intersection of sets and iages and preiages of functions. 1.1 Countable and uncountable sets We can

More information

IMPLICIT FUNCTION THEOREM FOR FORMAL POWER SERIES

IMPLICIT FUNCTION THEOREM FOR FORMAL POWER SERIES #A9 INTEGERS 8A (208) IMPLICIT FUNCTION THEOREM FOR FORMAL POWER SERIES ining Hu School of Matheatics and Statistics, Huazhong University of Science and Technology, Wuhan, PR China huyining@protonail.co

More information

arxiv: v2 [math.co] 8 Mar 2018

arxiv: v2 [math.co] 8 Mar 2018 Restricted lonesu atrices arxiv:1711.10178v2 [ath.co] 8 Mar 2018 Beáta Bényi Faculty of Water Sciences, National University of Public Service, Budapest beata.benyi@gail.co March 9, 2018 Keywords: enueration,

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

Physics 215 Winter The Density Matrix

Physics 215 Winter The Density Matrix Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it

More information

Symmetric properties for the degenerate q-tangent polynomials associated with p-adic integral on Z p

Symmetric properties for the degenerate q-tangent polynomials associated with p-adic integral on Z p Global Journal of Pure and Applied Matheatics. ISSN 0973-768 Volue, Nuber 4 06, pp. 89 87 Research India Publications http://www.ripublication.co/gpa.ht Syetric properties for the degenerate q-tangent

More information

Lecture 21. Interior Point Methods Setup and Algorithm

Lecture 21. Interior Point Methods Setup and Algorithm Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and

More information

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40 On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering

More information

Reed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product.

Reed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product. Coding Theory Massoud Malek Reed-Muller Codes An iportant class of linear block codes rich in algebraic and geoetric structure is the class of Reed-Muller codes, which includes the Extended Haing code.

More information

MA304 Differential Geometry

MA304 Differential Geometry MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question

More information

Finite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields

Finite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for

More information

A new type of lower bound for the largest eigenvalue of a symmetric matrix

A new type of lower bound for the largest eigenvalue of a symmetric matrix Linear Algebra and its Applications 47 7 9 9 www.elsevier.co/locate/laa A new type of lower bound for the largest eigenvalue of a syetric atrix Piet Van Mieghe Delft University of Technology, P.O. Box

More information

Congruences and Modular Arithmetic

Congruences and Modular Arithmetic Congruenes and Modular Aritheti 6-17-2016 a is ongruent to b od n eans that n a b. Notation: a = b (od n). Congruene od n is an equivalene relation. Hene, ongruenes have any of the sae properties as ordinary

More information

A note on the realignment criterion

A note on the realignment criterion A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,

More information

Math Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65

Math Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65 The Monotone Lindelöf Property and Separability in Ordered Spaces by H. Bennett, Texas Tech University, Lubbock, TX 79409 D. Lutzer, College of Willia and Mary, Williasburg, VA 23187-8795 M. Matveev, Irvine,

More information

A NOTE ON HILBERT SCHEMES OF NODAL CURVES. Ziv Ran

A NOTE ON HILBERT SCHEMES OF NODAL CURVES. Ziv Ran A NOTE ON HILBERT SCHEMES OF NODAL CURVES Ziv Ran Abstract. We study the Hilbert schee and punctual Hilbert schee of a nodal curve, and the relative Hilbert schee of a faily of curves acquiring a node.

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

Bernoulli numbers and generalized factorial sums

Bernoulli numbers and generalized factorial sums Bernoulli nubers and generalized factorial sus Paul Thoas Young Departent of Matheatics, College of Charleston Charleston, SC 29424 paul@ath.cofc.edu June 25, 2010 Abstract We prove a pair of identities

More information

Lecture 21 Principle of Inclusion and Exclusion

Lecture 21 Principle of Inclusion and Exclusion Lecture 21 Principle of Inclusion and Exclusion Holden Lee and Yoni Miller 5/6/11 1 Introduction and first exaples We start off with an exaple Exaple 11: At Sunnydale High School there are 28 students

More information

Lectures 8 & 9: The Z-transform.

Lectures 8 & 9: The Z-transform. Lectures 8 & 9: The Z-transfor. 1. Definitions. The Z-transfor is defined as a function series (a series in which each ter is a function of one or ore variables: Z[] where is a C valued function f : N

More information

CSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13

CSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13 CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture

More information

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and

More information

#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES

#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES #A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

12 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 Power Round-Poles and Polars

12 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 Power Round-Poles and Polars 1 th Annual Johns Hopkins Math Tournaent Saturday, February 19, 011 Power Round-Poles and Polars 1. Definition and Basic Properties 1. Note that the unit circles are not necessary in the solutions. They

More information

The Euler-Maclaurin Formula and Sums of Powers

The Euler-Maclaurin Formula and Sums of Powers DRAFT VOL 79, NO 1, FEBRUARY 26 1 The Euler-Maclaurin Forula and Sus of Powers Michael Z Spivey University of Puget Sound Tacoa, WA 98416 spivey@upsedu Matheaticians have long been intrigued by the su

More information

The concavity and convexity of the Boros Moll sequences

The concavity and convexity of the Boros Moll sequences The concavity and convexity of the Boros Moll sequences Ernest X.W. Xia Departent of Matheatics Jiangsu University Zhenjiang, Jiangsu 1013, P.R. China ernestxwxia@163.co Subitted: Oct 1, 013; Accepted:

More information

The Hilbert Schmidt version of the commutator theorem for zero trace matrices

The Hilbert Schmidt version of the commutator theorem for zero trace matrices The Hilbert Schidt version of the coutator theore for zero trace atrices Oer Angel Gideon Schechtan March 205 Abstract Let A be a coplex atrix with zero trace. Then there are atrices B and C such that

More information

NON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS

NON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volue 126, Nuber 3, March 1998, Pages 687 691 S 0002-9939(98)04229-4 NON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS DAVID EISENBUD, IRENA PEEVA,

More information

NORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS

NORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS NORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS NIKOLAOS PAPATHANASIOU AND PANAYIOTIS PSARRAKOS Abstract. In this paper, we introduce the notions of weakly noral and noral atrix polynoials,

More information

arxiv: v2 [math.nt] 5 Sep 2012

arxiv: v2 [math.nt] 5 Sep 2012 ON STRONGER CONJECTURES THAT IMPLY THE ERDŐS-MOSER CONJECTURE BERND C. KELLNER arxiv:1003.1646v2 [ath.nt] 5 Sep 2012 Abstract. The Erdős-Moser conjecture states that the Diophantine equation S k () = k,

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

An Attack Bound for Small Multiplicative Inverse of ϕ(n) mod e with a Composed Prime Sum p + q Using Sublattice Based Techniques

An Attack Bound for Small Multiplicative Inverse of ϕ(n) mod e with a Composed Prime Sum p + q Using Sublattice Based Techniques Article An Attack Bound for Sall Multiplicative Inverse of ϕn) od e with a Coposed Prie Su p + q Using Sublattice Based Techniques Pratha Anuradha Kaeswari * and Labadi Jyotsna Departent of Matheatics,

More information

Note on generating all subsets of a finite set with disjoint unions

Note on generating all subsets of a finite set with disjoint unions Note on generating all subsets of a finite set with disjoint unions David Ellis e-ail: dce27@ca.ac.uk Subitted: Dec 2, 2008; Accepted: May 12, 2009; Published: May 20, 2009 Matheatics Subject Classification:

More information

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes

More information

PERMANENT WEAK AMENABILITY OF GROUP ALGEBRAS OF FREE GROUPS

PERMANENT WEAK AMENABILITY OF GROUP ALGEBRAS OF FREE GROUPS PERMANENT WEAK AMENABILITY OF GROUP ALGEBRAS OF FREE GROUPS B. E. JOHNSON ABSTRACT We show that all derivations fro the group algebra (G) of a free group into its nth dual, where n is a positive even integer,

More information

Supplement to: Subsampling Methods for Persistent Homology

Supplement to: Subsampling Methods for Persistent Homology Suppleent to: Subsapling Methods for Persistent Hoology A. Technical results In this section, we present soe technical results that will be used to prove the ain theores. First, we expand the notation

More information

Combinatorial Primality Test

Combinatorial Primality Test Cobinatorial Priality Test Maheswara Rao Valluri School of Matheatical and Coputing Sciences Fiji National University, Derrick Capus, Suva, Fiji E-ail: aheswara.valluri@fnu.ac.fj Abstract This paper provides

More information

In this chapter, we consider several graph-theoretic and probabilistic models

In this chapter, we consider several graph-theoretic and probabilistic models THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions

More information

CHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS. Nicholas Wage Appleton East High School, Appleton, WI 54915, USA.

CHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS. Nicholas Wage Appleton East High School, Appleton, WI 54915, USA. INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 CHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS Nicholas Wage Appleton East High School, Appleton, WI 54915, USA

More information

Lecture 9 November 23, 2015

Lecture 9 November 23, 2015 CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)

More information

1 Generalization bounds based on Rademacher complexity

1 Generalization bounds based on Rademacher complexity COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges

More information

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words) 1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu

More information

Estimating Parameters for a Gaussian pdf

Estimating Parameters for a Gaussian pdf Pattern Recognition and achine Learning Jaes L. Crowley ENSIAG 3 IS First Seester 00/0 Lesson 5 7 Noveber 00 Contents Estiating Paraeters for a Gaussian pdf Notation... The Pattern Recognition Proble...3

More information

Order Ideals in Weak Subposets of Young s Lattice and Associated Unimodality Conjectures

Order Ideals in Weak Subposets of Young s Lattice and Associated Unimodality Conjectures Annals of Cobinatorics 8 (2004) 1-0218-0006/04/020001-10 DOI ********************** c Birkhäuser Verlag, Basel, 2004 Annals of Cobinatorics Order Ideals in Weak Subposets of Young s Lattice and Associated

More information

Solving initial value problems by residual power series method

Solving initial value problems by residual power series method Theoretical Matheatics & Applications, vol.3, no.1, 13, 199-1 ISSN: 179-9687 (print), 179-979 (online) Scienpress Ltd, 13 Solving initial value probles by residual power series ethod Mohaed H. Al-Sadi

More information

Hermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s

Hermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s International Matheatical Foru, 4, 9, no. 34, 663-686 Herite s Rule Surpasses Sipson s: in Matheatics Curricula Sipson s Rule Should be Replaced by Herite s Vito Lapret University of Lublana Faculty of

More information

Egyptian Mathematics Problem Set

Egyptian Mathematics Problem Set (Send corrections to cbruni@uwaterloo.ca) Egyptian Matheatics Proble Set (i) Use the Egyptian area of a circle A = (8d/9) 2 to copute the areas of the following circles with given diaeter. d = 2. d = 3

More information

Chapter 6: Economic Inequality

Chapter 6: Economic Inequality Chapter 6: Econoic Inequality We are interested in inequality ainly for two reasons: First, there are philosophical and ethical grounds for aversion to inequality per se. Second, even if we are not interested

More information

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN

More information

Gamma Rings of Gamma Endomorphisms

Gamma Rings of Gamma Endomorphisms Annals of Pure and Applied Matheatics Vol. 3, No.1, 2013, 94-99 ISSN: 2279-087X (P), 2279-0888(online) Published on 18 July 2013 www.researchathsci.org Annals of Md. Sabur Uddin 1 and Md. Sirajul Isla

More information

An Introduction to the Algebra of Complex Numbers and the Geometry in the Complex Plane

An Introduction to the Algebra of Complex Numbers and the Geometry in the Complex Plane Ursinus College Digital Coons @ Ursinus College Coplex Nubers Transforing Instruction in Undergraduate Matheatics via Priary Historical Sources (TRIUMPHS) Spring 2019 An Introduction to the Algebra of

More information

ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE

ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE CHRISTOPHER J. HILLAR Abstract. A long-standing conjecture asserts that the polynoial p(t = Tr(A + tb ] has nonnegative coefficients whenever is

More information

A REMARK ON PRIME DIVISORS OF PARTITION FUNCTIONS

A REMARK ON PRIME DIVISORS OF PARTITION FUNCTIONS International Journal of Nuber Theory c World Scientific Publishing Copany REMRK ON PRIME DIVISORS OF PRTITION FUNCTIONS PUL POLLCK Matheatics Departent, University of Georgia, Boyd Graduate Studies Research

More information

Analysis of Polynomial & Rational Functions ( summary )

Analysis of Polynomial & Rational Functions ( summary ) Analysis of Polynoial & Rational Functions ( suary ) The standard for of a polynoial function is ( ) where each of the nubers are called the coefficients. The polynoial of is said to have degree n, where

More information