REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS 1. INTRODUCTION

Size: px
Start display at page:

Download "REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS 1. INTRODUCTION"

Transcription

1 REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS LOUIZA FOULI AND KUEI-NUAN LIN ABSTRAT. We study the defining equations of the Rees algebras of square-free onoial ideals in a polynoial ring over a field. We deterine the defining equations of the Rees algebra of an ideal I in the case I is a square-free onoial ideal such that each connected coponent of the line graph of the hypergraph corresponding to I has at ost 5 vertices. Moreover we show in this case that the non-linear equations are arising fro even closed walks of the line graph and we also give a description of the defining ideal of the toric ring when I is generated by square-free onoials of the sae degree. Furtherore we provide a new class of ideals of linear type. We show that when I is a square-free onoial ideal with any nuber of generators and the line graph of the hypergraph corresponding to I is the graph of a disjoint union of trees and graphs with a unique odd cycle then I is an ideal of linear type.. INTRODUTION The ain proble of interest in this article is the question of deterining the defining equations of the Rees algebra of a square-free onoial ideal in a polynoial ring over a field. Let R be a Noetherian ring and let I be an ideal. The Rees algebra R (I) is defined to be the graded algebra R (I) = R[It] = I i t i R[t] where t is an indeterinate. The Rees algebra of an ideal encodes i 0 any of the analytic properties of the variety defined by I and it is the algebraic realization of the blowup of a variety along a subvariety. The blowup of Spec(R) along V (I) is the projective spectru of the Rees algebra R (I) of I. This iportant construction is the ain tool in the resolution of singularities of an algebraic variety. Fro the algebraic point of view the Rees algebra of an ideal facilitates the study of the asyptotic behavior of the ideal and it is essential in coputing the integral closure of powers of ideals. The Rees algebra of an ideal I in a Noetherian ring can be realized as a quotient of a polynoial ring and hence once the defining ideal of R (I) is deterined it is straightforward to copute the integral closure R (I). It is well known that R (I) = I i t i and one obtains I i = [R (I)] i. i 0 Another reason for exploring the Rees algebra of an ideal is to deterine the defining ideal of toric rings. Recall that a toric ideal is the ideal of relations of a onoial subring of a polynoial ring see Section for a detailed definition. For a Noetherian local ring (R) and I an R-ideal the special fiber ring F (I) of I is defined to be F (I) = R (I)/IR (I) R/. When R is a polynoial ring over a field k and I is generated by square-free onoials of the sae degree then the defining ideal of the special fiber ring F (I) is the toric ideal associated to I. Notice that in this case F (I) = k[ f... f n ] where f... f n is a inial onoial generating set of I. There are any questions 00 Matheatics Subject lassification. 3A30 3A0 3A5 05E40 05E Key words and phrases. Rees algebras square-free onoial ideals relation type ideals of linear type graph.

2 L. FOULI AND K. N. LIN arising fro the study of toric varieties as these have applications in cobinatorics and in geoetry for exaple see [ ]. Once we understand R (I) then we can obtain a concrete description of the toric ring corresponding to a square-free onoial ideal generated in the sae degree directly fro R (I). The proble of finding an explicit description of the defining ideal of the Rees algebra has been addressed by any authors see for exaple [ ]. In general finding the generators for the defining ideal of the Rees algebra of an ideal is difficult. Recently Kustin Polini and Ulrich in [] studied the defining equations of the Rees algebra of height ideals generated by fors of the sae degree in k[xy] where k is any field. Furtherore in [6] ox Kustin Polini and Ulrich provide a detailed study of the singularities of rational curves in P by studying the defining equations of the Rees algebra. We consider the following construction for the Rees algebra. Let R be a Noetherian ring and let I be an R-ideal. Let f... f n be a inial generating set for I. onsider the polynoial ring S = R[T...T n ] where T...T n are indeterinates. Then there is a natural ap φ : S R (I) = R[It] that sends T i to f i t. Let J = kerφ be the defining ideal of R (I). Then R (I) S/J and J = J i is a graded ideal. A inial generating set for J is often referred to as the defining equations of the Rees algebra. Also J is known as the ideal of linear relations as it is the defining ideal of the syetric algebra Sy(I) of I and it is generated by linear fors in the T i. The generators of J arise fro the first syzygies of I. When J = J then I is called an ideal of linear type. In this case R (I) Sy(I) and the defining ideal of R (I) is well understood. Furtherore there is a hooorphis ψ : k[t...t n ] F (I) that sends T i to f i where k is the residue field of R. Then F (I) k[t...t n ]/H where H = kerψ. An ideal I is called an ideal of fiber type if the defining ideal J of R (I) is obtained by the linear relations and the defining equations for the special fiber ring i.e. J = SJ + SH. In the case of square-free onoial ideals generated in degree naely edge ideals Villarreal showed that they are all ideals of fiber type [34 Theore 3.]. Moreover Villarreal gave an explicit description of the defining equations of the Rees algebra of any edge ideal [34 Theore 3.]. It is also worth noting that Villarreal exhibited an exaple to show that his techniques do not extend for onoial ideals generated in degree higher than [34 Exaple 3.]. His exaple is a squarefree onoial ideal generated in degree 3 that is not of fiber type. We reark that in general a square-free onoial ideal generated in degree greater or equal to 3 is not necessarily of fiber type. Therefore as the degree of the generators exceeds the coplexity of the proble increases. In Section we develop a series of leas that allow us to deterine conditions under which an eleent in the defining ideal of the Rees algebra becoes redundant and hence not needed in the defining equations. One of our essential tools is the classic result of Taylor in which she deterines a non-inial generating set for the defining ideal of the Rees algebra of any onoial ideal [30]. We construct a graph associated to onoial ideals which is also known as the line graph of the corresponding hypergraph. The onoial generators are the vertices for this graph and the edges

3 REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS 3 are deterined by the greatest coon divisor aong the generators see onstruction.6. In the ain result in this section we show that when I is a square-free onoial ideal such that the line graph of the corresponding hypergraph is the disjoint union of graphs with at ost 5 vertices then one can describe the defining equations of the Rees algebra of I Theore.0. Furtherore we show that the non-linear part of the defining equations of R (I) arise fro even closed walks of the line graph of the corresponding hypergraph Theore.0. Moreover in Exaple. we give a concrete explanation of how one obtains the defining equations for the ideal in [34 Exaple 3.]. As entioned above one can deterine the toric ideal of a square-free onoial ideal generated in the sae degree directly fro the defining equations of the Rees algebra. Villarreal provided a concrete description of the toric ideal in the case of square-free onoials generated in degree [34 Proposition 3.]. We are then able to give a generalization of Villarreal s result in the case of square-free onoial ideals generated in any degree orollary.3. In Section 3 we concentrate on the special class of ideals of linear type. The first well known class of ideals of linear type are coplete intersection ideals [3]. Many authors have worked on establishing other classes of ideals of linear type see for exaple [ ]. In the case of square free onoial ideals generated in degree Villarreal gave a coplete characterization of ideals of linear type. More precisely he showed that such an ideal I is of linear type if and only if the graph of I is the disjoint union of graphs of trees or graphs that have a unique odd cycle [34 orollary 3.]. In this work we establish new classes of square-free onoial ideals that are of linear type. We prove that when I is an ideal generated by square-free onoials and the line graph of the hypergraph corresponding to I is a disjoint union of graphs of trees and graphs with a unique odd cycle then I is an ideal of linear type Theore 3.4. Our results have a siilar flavor as those of Villarreal in [34]. In soe sense these results extend the work of Villarreal even though we do not fully recover his results. Nonetheless our techniques allow us to consider square-free onoial ideals without any restrictions on the degrees of the generators nor any restrictions on the nuber of inial generators. We conclude with soe final rearks. In [3] onca and De Negri introduced the notion of onoial ideals generated by M-sequences. They showed that all ideals generated by an M-sequence are ideals of Gröbner linear type and in particular of linear type. In [9] Soleyan and Zheng introduced the class of onoial ideals of forest type and showed that in the case of square-free onoial ideals the class of onoial ideals of forest type coincides with the class of onoial ideals generated by M-sequences. It is straightforward to establish that an ideal whose line graph is a graph of a forest is an ideal of forest type and hence aking it an ideal generated by an M- sequence. Hence by [3 Theore.4] these ideals are of (Gröbner) linear type. However an ideal whose line graph is the graph of an odd cycle is not an ideal of forest type but nonetheless it is an ideal of linear type. Hence the class of ideals of linear type that we uncovered in Theore 3.4 are not necessarily generated by M-sequences and thus our result is incoparable to the results of onca and De Negri in [3].

4 4 L. FOULI AND K. N. LIN. THE DEFINING EQUATIONS OF THE REES ALGEBRA Let R be a polynoial ring over a field and let I be a onoial ideal in R. Let f... f n be a inial onoial generating set of I and let R (I) denote the Rees algebra of I. Then R (I) = R[ f t... f n t] R[t] and there is an epiorphis φ : S = R[T...T n ] R (I) induced by φ(t i ) = f i t. Let J = kerφ. We note that J = J i is a graded ideal of S. As entioned in the Introduction a inial generating set for the ideal J is referred to as the defining equations of the Rees algebra of I. Definition.. Let I be a onoial ideal in a polynoial ring R over a field k. Let f... f n be a inial onoial generating set of I. Let I s denote the set of all non-decreasing sequences of integers α = (i...i s ) {...n} of length s. Then f α = f i f is is the corresponding product of onoials in I. We also let T α = T i T is be the corresponding product of indeterinates in S = f R[T...T n ]. For every αβ I β s we consider the binoial T αβ = gcd( f α f β ) T f α α gcd( f α f β ) T β. The following is in [30] and we cite it here for ease of reference. Theore.. ([30]) Let R be a polynoial ring over a field and let I be a onoial ideal in R. Let f... f n be a inial onoial generating set of I and let R (I) be the Rees algebra of I. Then R (I) S/J where S = R[T...T n ] is a polynoial ring T...T n are indeterinates and J = SJ + S ( J i ) such that J s = {T αβ for αβ I s }. The following reark states soe properties for the greatest coon divisor aong square-free onoials. The proofs are oitted as they are eleentary. Reark.3. Let abcd...b s be square-free onoials in a polynoial ring R over a field. Let n l r be positive integers. Then (a) gcd(a n b ) = gcd(ab) in{n} (b) gcd(a n b s ) = gcd(a s b s ) for all n s (c) gcd(a n b c l ) = gcd(ab)in{n} gcd(ac) in{nl} for soe R. The ain goal in this section is to deterine conditions under which for sequences αβ of length s we have T αβ SJ + S ( s J i ). In other words we are interested in finding conditions on the sequences αβ such that the generator T αβ is redundant in the defining ideal of the Rees algebra. The following two leas follow directly fro Definition.. Le.4. Let R be a polynoial ring over a field and let I be a onoial ideal in R. Let α = (...a s ) β = (...b s ) I s be two sequences of length s where I s is as in Definition.. Suppose that a i = b j for soe i and soe j. Then T αβ SJ + S ( s J i ).

5 REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS 5 Proof. Without loss of generality we ay assue that =. Let α = (...a s ) and β = (...b s ). Then gcd( f α f β ) = f a gcd( f α f β ) = f b gcd( f α f β ). Notice that f a = f b and T a = T b. Then T αβ = f β gcd( f α f β ) T α f α s = T a [T α β ] SJ + S ( J i ). f β gcd( f α f β ) T β = T a [ gcd( f α f β ) T α f α gcd( f α f β ) T β ] Le.5. Let R be a polynoial ring over a field and let I be a onoial ideal in R. Let α β I s be two sequences of length s where I s is as in Definition.. Suppose that α = (α...α ) and β = (β...β ) where α β I and s. Then T αβ SJ + S ( J i ). Proof. First we observe that s is a ultiple of. Let l be an integer such that s = l. Notice that f α = fα l and f β = fβ l. Also by Reark.3 (a) we have that gcd( f α f β ) = gcd( f α f β ) l. Let f β T α a = gcd( f α f β ) b = f α T β gcd( f α f β ) and let A = (al + a l b ab l + b l ). Notice that ab S and thus A S. Then f β T αβ = gcd( f α f β ) T f α α gcd( f α f β ) T β = a l b l = (a b)(a l + a l b ab l + b l ) = T a A SJ + S ( J i ). We observe the following properties for greatest coon divisors aong onoials. Again we oit the proofs as they are eleentary. Reark.6. Let abcde f be onoials in a polynoial ring R over a field. (a) gcd(abc) = gcd(ab)gcd(ac) for soe R. (b) Suppose that gcd(a c) =. Then gcd(ab c) = gcd(b c). The following Lea plays an iportant role in the rest of this article as it allows us to show that certain expressions T αβ are redundant in the defining ideal of the Rees algebra. Le.7. Let R be a polynoial ring over a field and let I be a onoial ideal in R. Let α β I s be two sequences of length s where I s is as in Definition.. Suppose α = (α...α ) and β = (β...β ) with α i β i I si and s s = s. Suppose that for all i there exist i R such that gcd( f α f β ) = gcd( i f α j f β )gcd( j= k=i where epty products are taken to be. Then [ T αβ = A i j=i+ T α j i k= f αk k=i+ f βk )gcd( f αi f βi ) i T βk ]T αi β i SJ + S ( r J i )

6 6 L. FOULI AND K. N. LIN where r = ax{s...s } and A i R for all i. Proof. Notice that f α = f αi and f β = f βi. Then we have T αβ = = f β gcd( f α f β ) T α i i f α j j= f α gcd( f α f β ) T β f βk k=i+ j=i+ gcd( i f α j f β )gcd( j= k=i i T α j T βk k= f αk k=i+ f βk ) ( ) f βi gcd( f αi f βi ) T f αi α i gcd( f αi f βi ) T β i. Finally we note that A i = i i j= f α j f βk k=i+ gcd( i f α j f β )gcd( j= k=i f αk k=i+ R. f βk ) Next we give a list of conditions that when satisfied by two sequences αβ then the generator T αβ is not a inial generator in the defining ideal of the Rees algebra of the corresponding ideal. Proposition.8. Let R be a polynoial ring over a field and let I be a onoial ideal in R. Let α β I s be two sequences of length s where I s is as in Definition.. Let α = (...a s )β = (...b s ). Suppose that after soe reordering there exist integers kl with kl s such that gcd( f ai f b j ) = for every i l and every k+ j s. We further assue that gcd( f au f bv ) = for every l + u s and every v k. Then T αβ SJ + S ( r J i ) where r = ax{k k l s ks l}. Proof. Suppose that l = k and write α = (α α ) and β = (β β ) where α = (...a k ) α = (a k+...a s ) β = (...b k ) and β = (b k+...b s ). By our assuptions we have gcd( f αi f β j ) = for i j. Hence by Reark.6 we have gcd( f α f β ) = gcd( f α f β )gcd( f α f β ) = gcd( f α f β )gcd( f α f β ) gcd( f α f β ) = gcd( f α f β )gcd( f α f β ) = gcd( f α f β )gcd( f α f β ). The result follows fro Le.7 with =. Without loss of generality we ay now assue that l < k. We write α = (α α α 3 ) and β = (β β β 3 ) with α = (...a l ) α = (a l+...a k ) α 3 = (a k+...a s ) β = (...b l ) β = (b l+...b k ) and β 3 = (b k+...b s ). Then gcd( f α f β3 ) = and gcd( f αi f β j ) = for i = 3 and j =. Hence by Reark.6 we have

7 REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS 7 gcd( f α f β ) = gcd( f α f β )gcd( f α f β f β3 ) = gcd( f α f β )gcd( f α f β f β3 ) gcd( f α f β ) = gcd( f α f β )gcd( f α f α3 f β ) = gcd( f α f β )gcd( f α f α3 f β3 )gcd( f α f α3 f β f β ) = gcd( f α f β )gcd( f α f α3 f β3 )gcd( f α f α3 f β ) = gcd( f α f β )gcd( f α f α3 f β3 )gcd( f α f β ) and gcd( f α f β ) = gcd( f α f α f β )gcd( f α3 f β ) = gcd( f α f α f β )gcd( f α3 f β3 ). 3 3 Therefore we ay apply Le.7 with = 3. The next three Leas deal with possible repetitions in the sequences αβ I s and how that affects the ter T αβ. Le.9. Let R be a polynoial ring over a field and let I be a square-free onoial ideal in R. Let α β I s be two sequences of length s where I s is as in Definition.. Suppose that α = (... ) and β = (...b s ). Then T αβ SJ + S ( s J i ). Proof. Notice that f α = f s and f β = f b f bs. Let β = (...b s ). We also note that gcd( f s f b ) = gcd( f a f b ) by Reark.3 (a). Then gcd( f α f β ) = gcd( f a s f b )gcd( fa s f β ) = gcd( f f b )gcd( fa s f β ) for soe R by Reark.3 (b) and (c). Hence T αβ SJ + S ( s J i ) by Le.7. Le.0. Let R be a polynoial ring over a field and let I be a square-free onoial ideal in R. Let α β I s be two sequences of length s where I s is as in Definition.. Suppose that α = ( ) and β = ( ). Then T αβ SJ + SJ. Proof. We will proceed by induction on s. If s = then there is nothing to show. Suppose that s >. Suppose that there are l i distinct copies of a i in α and k i distinct copies of b i in β for i =. Then f α = f l and f β = f k f k. For siplicity we write α = (a l a l ) and β = (b k bk ). If k = k and l = l then the result follows fro Le.5. Thus we ay assue without loss of generality that k > k and l l. We will show gcd( f α f β ) = gcd( f l f k f k )gcd( f a f b ) G = gcd( f l f k f k )gcd( f l f b ) H

8 8 L. FOULI AND K. N. LIN for soe GH R. Then T αβ SJ SJ by Le.7 and the induction. Notice that we have the following equalities: gcd( f α f β ) = gcd( f l f k f k )gcd( f a f k f k ) = gcd( f l f k f k )gcd( f a f k f k )gcd( f a f b ) D gcd( f α f β ) = gcd( f l f k f k )gcd( f l f b ) E = gcd( f l f k f k )gcd( f a f k f k )gcd( f l f b ) EF for soe DEF R by Reark.6 (a). We will show that for any integer t and any variable x R if x t gcd( f a f k f k ) then x t D and x t EF. This is equivalent to showing that for any variable x R and any integer u if x gcd( f a f k f k ) and x u gcd( f α f β ) then x u gcd( f l f k f k )gcd( f a f b ) and x u gcd( f l f k f k )gcd( f l f b ). This follows iediately since s = l + l = k + k > l and l s > k. Le.. Let R be a polynoial ring over a field and let I be a square-free onoial ideal in R. Let α β I s be two sequences of length s 4 where I s is as in Definition.. Suppose that α = ( a 3...a 3 ) and β = ( ). Then T αβ SJ + S (J J 3 ). Proof. We will show T αβ SJ + S ( s J i ) and by induction on s 4 we conclude that T αβ SJ + S (J J 3 ). Suppose that there are l i distinct copies of a i in α and k i distinct copies of b i in β. Then l + l + l 3 = k + k = s 4. Without lost of generality we assue that l l l 3 and k k. Since s 4 we have l and k. We write α = (a l a l a l 3 3 ) and β = (b k bk ). We then have three possible scenarios. We clai the following: (i) If l + l > k then gcd( f α f β ) = gcd( f a f a f b f b )gcd( f α f β )/A = gcd( f α f b f b )gcd( f α f β )/B for soe AB R and α = (a l a l a l 3 3 ) and β = (b k b k ). (ii) If l > k then gcd( f α f β ) = gcd( f a f b )gcd( f α f β )/ = gcd( f α f b )gcd( f α f β )/D for soe D R and α = (a l a l a l 3 3 ) and β = (b k b k ). (iii) If l + l k and l k then gcd( f α f β ) = gcd( f s/3 f s/3 f s/3 a 3 f s/3 f s/3 ) = (gcd( f a f a f a3 f f b )) s/3.

9 REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS 9 Once we obtain the above clais then the result will follow by Le.7. To establish clai (i) we notice that we have the following equalities: gcd( f α f β ) = gcd( f a f a f β )gcd( f α f β )/E = gcd( f a f a f b f b )gcd( f a f a f β )gcd( f α f β )/EF = gcd( f α f b f b )gcd( f α f β )/G = gcd( f α f b f b )gcd( f α f β )gcd( f a f a f β )/GH for soe EFGH R. It is enough to show that for any variable x R and any positive integer t if x t gcd( f a f a f β ) then x t EF and x t GH. This is equivalent to showing that if x u gcd( f α f β ) and x gcd( f a f a f β ) then x u gcd( f a f a f b f b )gcd( f α f β ) and x u gcd( f α f b f b )gcd( f α f β ) for any positive integer u. But this follows iediately since l +l > k k and l +l < l +l +l 3 = s = k + k. For clai (ii) we notice that we have the following equalities: gcd( f α f β ) = gcd( f a f β )gcd( f α f β )/K = gcd( f a f b )gcd( f a f β )gcd( f α f β )/KL = gcd( f α f b )gcd( f α f β )/M = gcd( f α f b )gcd( f α f β )gcd( f a f β )/MN for soe KLMN R. The clai follows since l > k. Finally to establish the last clai we note that the assuption l k is equivalent to l + l 3 k and thus l + l 3 k l + l. Hence l 3 l l l 3 which iplies l i = s/3 and s/3 k. Furtherore s/3 k s/3 and hence k = s/3 and k = s/3. The next Theore is one of the ain results of this section. We will use all the inforation we obtained about how various conditions on two sequences αβ I s affect the ter T αβ to obtain a bound on the relation type of I as well as a description of the defining equations of the Rees algebra. Recall that the relation type of an ideal I is defined to be rt(i) = in{s J = s J i } where J is the defining ideal of R (I). In other words the relation type of I is the largest degree (in the T i ) of any inial generator of J. In particular when I is of linear type it is of relation type. The relation type of an ideal has been explored in various articles see for instance [ ]. Theore.. Let R be a polynoial ring over a field and let I be a square-free onoial ideal generated by n square-free onoials in R. When n 5 then R (I) = S/J where S = R[T...T n ] and J = SJ + S ( n J i ). In particular rt(i) n. Proof. By Theore. it suffices to show that given two sequences αβ I s of length s > n then T αβ SJ + S ( n J i ). Suppose that there are l i distinct copies of a i in α and k i distinct copies of b i in β and write α = (a l...a l ) and β = (b k...bk t t ).

10 0 L. FOULI AND K. N. LIN By Le.4 we ay assue a i b j for all i j. Also by Le.9 we ay assue < 3 and < t since n 5. We are now left with the following cases: (i) Suppose that α = (a l a l ) and β = (b k bk ) where l + l = k + k 3. The result follows fro Le.0. (ii) Suppose that α = (a l a l a l 3 3 ) and β = (b k bk ) where l + l + l 3 = k + k 4. The result follows fro Le.. The following exaple provides a class of square-free onoial ideals generated by n > 4 square-free onoials for which the relation type is at least n 7. Notice when n = 5 one has n 7 = n. In particular this establishes that the bound given in Theore. is sharp. We also note that the ideals in the following exaple are not of fiber type. Exaple.3. Let R = k[yx...x n zu...u n ] be a polynoial ring over a field k with n a positive integer such that n > 4. Let I = ( f... f n ) where f = ( n x i )z f i = x i y( n u j ) for all j= j i i =...n f n = ( n F = T n 4 n x i )y and f n = ( n u i )z. onsider T i Tn n 3 T n n 4 and G = zt n 5 n T i yt n 5 n T n. It is clear that F and G are in the defining ideal of the Rees algebra of I. Moreover F and G are irreducible and thus F SJ n 7 \ S ( n 8 J i ) and G SJ n 8 \ S ( n 9 J i ). Hence the relation type of I is at least n 7. Finally we note that G is not in the defining ideal of the special fiber of I and therefore I is not an ideal of fiber type. The next lea establishes conditions for when various generators of the defining ideal of the Rees algebra as in Theore. are irredundant. Le.4. Let R be a polynoial ring over a field and let I be a square-free onoial ideal in R. Let Let α β I s be two sequences of length s 4 where I s is as in Definition.. Suppose that α = (...a s ) β = (... ) where a i b j for all i j. Suppose that for all i there exists a variable x i R such that x i f a j for all j i and x i f b x i f ai and x i f b. Furtherore suppose that for all i there exists a variable z i R such that z i gcd( f ai f b ) z i f a j for all j i and z i f b. Then T αβ SJ s \ S ( s J i ). s j= j i Proof. We write f ai = z i h i ( x j ) for all i =...s f b = k ( s x i ) and f b = k ( s z i ) for soe square-free onoials h...h s k k R such that x i h j x i k l z i h j and z i k l for all i

11 j l. Then we have f α = s M = f α gcd( f α f β ) = REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS x s i s s z i s h i gcd( s h i k s k ) h i and f β = k s k ( s and N = x s i s f β gcd( f α f β ) = z i ). Let k s k gcd( s h i k s k ) One can observe iediately that x i M and z i N for all i. Let α and β be any proper subsequences f α of α and β. Then there exists either x i or z j such that x i gcd( f α f β ) or z f α j gcd( f α f β ) by f α our assuptions. Therefore gcd( f α f β ) M and siilarly f β N. This shows that gcd( f α f β ) T αβ SJ s \ S ( s J i ). The following Theore that establishes precisely the defining equations for the Rees algebra of a square-free onoial ideal with up to five generators.. Theore.5. Let R be a polynoial ring over a field and let I be a square-free onoial ideal generated by n square-free onoials in R. Suppose that n 5. Suppose that there does not exist a pair of sequences αβ I s of length s as in Definition. such that the conditions of Le.4 are satisfied. Then I is an ideal of linear type. Proof. onsider a pair of sequences αβ as in Definition. of length s such that α = (...a s ) β = (... ) where a i b j for all i j. Suppose that one of the following conditions is not satisfied: for all i there exists a variable x i R such that x i f a j for all j i and x i f b x i f ai and x i f b and for all i there exists a variable z i R such that z i gcd( f ai f b ) z i f a j for all j i and z i f b. We will show that T αβ SJ + S ( s J i ) and by induction T αβ SJ. By the Theore. and Leas.4.9 it is enough to consider sequences of length or 3 i.e. either α = ( ) and β = ( ) or α = ( a 3 ) and β = ( ). The proof for the first case can be treated as a special case of the second and thus we will only consider the case with α = ( a 3 ) and β = ( ). Without lost of generality we will show that if there does not exist a variable x R such that x gcd( f a f a3 ) x f b x f a and x f b then for soe AB R. gcd( f a f a f a3 f f b ) = gcd( f f b )gcd( f α f b f b ) A = gcd( f f β )gcd( f a f a3 f b f b ) B Siilarly if there does not exist a variable z R such that z gcd( f a f b ) z f a j for j = 3 and z f b then

12 L. FOULI AND K. N. LIN gcd( f a f a f a3 f f b ) = gcd( f f b )gcd( f a f a3 f β ) = gcd( f α f b )gcd( f a f a3 f b f b ) D for soe D R. Hence we ay apply Le.7 to obtain the result. For the first part we notice that gcd( f a f a f a3 f f b ) = gcd( f α f b )gcd( f α f b f b ) E = gcd( f f b )gcd( f a f a3 f b )gcd( f α f b f b ) EF gcd( f a f a f a3 f f b ) = gcd( f f β )gcd( f a f a3 f β ) G = gcd( f f β )gcd( f a f a3 f b )gcd( f a f a3 f b f b ) GH for soe EFGH R. It is enough to show for any variable x R if x gcd( f a f a3 f b ) then x EF and x GH. This is equivalent to showing that for any integer u if x u gcd( f α f β ) then x u gcd( f a f b )gcd( f α f b f b ) and x u gcd( f a f β )gcd( f a f a3 f b f b ). This is straightforward to verify and the only case that is not trivial is when x f a and x gcd( f a f a3 ). Then x f b by assuption. Hence x gcd( f α f b f b ) and x gcd( f a f a3 f b f b ). We can use a siilar arguent for the second part and the only case that is not trivial is when x gcd( f a f b f b ) and x f b. Then x f b and x f a or x f a3 by assuption. Hence x gcd( f α f β ) x gcd( f a f a3 f β ) and x gcd( f a f a3 f b f b ). We now introduce a construction that is also known as the line graph of the hypergraph corresponding to a onoial ideal. onstruction.6. Let R be a polynoial ring over a field and let I be a onoial ideal in R. Let f... f n be a inial onoial generating set of I. We construct the following graph G(I): For each f i we associate a vertex y i to it. The edges of this graph are {y i y j } where gcd( f i f j ). We call the graph G(I) the line graph of I. The purpose of introducing the line graph of the hypergraph corresponding to a onoial ideal is to utilize the graph structure in order to deterine cobinatorial conditions that deterine the defining equations of the Rees algebra. We first observe the following. Reark.7. With the sae assuptions as in Le.4 the sequences αβ correspond to an even closed walk in G(I). Indeed the following {y b {y b y a }y a {y a y b }y b {y b y a }y a {y a y b }y b... y b {y b y as }y as {y as y b }y b {y b y as }y as {y as y b }y b } is an even closed walk and T αβ SJ s \ S ( s J i ).

13 REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS 3 We now introduce the notion of a subgraph induced by two sequences. Definition.8. Let R be a polynoial ring over a field and let I be a onoial ideal in R. Let α β I s be two sequences of length s where I s is as in Definition.. Let α = (a l a l...a l ) and β = (b r...br t t ) where l i and r i are the nuber of distinct copies of a i and b i respectively. Let α = (...a ) and β = (b i...b ir ) where {b i...b ir } = {...b t } \ {...a }. The last condition ensures that a i b ik for all ii k. onsider K = ( f a... f a f bi... f bir ) and the line graph G(K) of K. Notice that K I and that G(K) is a subgraph of G(I) since a i b ik for all ii k. We call G(K) the graph induced by α and β. Reark.9. Let R be a polynoial ring over a field and let I be a onoial ideal in R. Let αβ I s be two sequences of length s where I s is as in Definition.. Let G be the graph induced by α and β. If G is a disconnected graph then T αβ SJ + S ( s J i ) by Proposition.8. The following Theore is an extension of Theore.. We use the line graph to give a description for the defining equations of the Rees algebra. Theore.0. Let R be a polynoial ring over a field and let I be a square-free onoial ideal generated by n square-free onoials in R. Suppose that the line graph of I is the disjoint union of graphs with at ost 5 vertices. Let R (I) = S/J where S = R[T...T n ]. Then J = SJ +S (J J 3 ) and in particular rt(i) 3. Furtherore if T αβ S (J J 3 ) \ SJ then the subgraph induced by αβ is an even closed walk of G(I). Proof. By Reark.9 we ay assue that G(I) is connected. Then the first part follows iediately by Theore.. The last part follows fro Theore.5 Le.4 and Reark.7. The next exaple illustrates the result of Theore.0. Exaple.. Let R = k[x...x 7 ] be a polynoial ring over a field k. Let I = ( f... f 5 ) where f = x x x 3 f = x x x 4 x 7 f 3 = x x 3 x 6 f 4 = x 4 x 5 x 6 and f 5 = x x 3 x 5. Let R (I) = S/J where S = R[T...T 5 ]. Let α = (4) and β = (35). The subgraph induced by αβ is the even closed walk {y {y y }y {y y }y {y y 3 }y 3 {y 3 y 4 }y 4 {y 4 y 5 }y 5 {y y 5 }} of the line graph of I shown below: y = x x x 4 x 7 y 3 = x x 3 x 6 y = x x x 3 y 4 = x 4 x 5 x 6 y 5 = x x 3 x 5 Then by Theore.0 we have that T αβ = T T 3 T 5 x 7 T T 4 SJ 3 \ (SJ + SJ ) since it is irreducible.

14 4 L. FOULI AND K. N. LIN The following exaple coes fro [34 Exaple 3.]. Villarreal uses this exaple to show that his ethods do not extend in the case of square-free onoial ideals generated in degree higher than. In light of Theore.0 we now give an explicit description of the defining equations of the Rees algebra for this exaple. Exaple.. Let R = k[x...x 7 ] where k is a field and let I be an ideal of R generated by f = x x x 3 f = x x 4 x 5 f 3 = x 5 x 6 x 7 f 4 = x 3 x 6 x 7. Then the defining ideal of R (I) is inially generated by the binoials: x 3 T 3 x 5 T 4 x 6 x 7 T x x T 4 x 6 x 7 T x x 4 T 3 x 4 x 5 T x x 3 T x 4 T T 3 x T T 4. Notice that the only binoial that is not linear is x 4 T T 3 x T T 4 and it coes fro the unique even cycle of G(I) which in this case is the graph of a square. Before concluding this section we turn our attention to toric ideals. Recall that a toric ideal is the ideal of relations of a onoial subring of a polynoial ring. Let A = {...a n } N c \ {0} and let A be a atrix with coluns a i and suppose that A has rank c. Let k be a field and let S = k[t...t n ] and let φ : S k[t...t c ] be a ap defined by φ(x i ) = t a i. Then kerφ is a prie ideal and it s called the toric ideal associated to A. In particular when I is generated by square-free onoials of the sae degree then the defining ideal of the special fiber ring F (I) = R (I) k is the toric ideal associated to I. Notice that in this case F (I) = k[ f... f n ] where f... f n is a inial onoial generating set of I. In light of Theore.0 we can give a concrete description of such toric ideals. orollary.3. Let R be a polynoial ring over a field k let f... f n be square-free onoials of the sae degree and let I = ( f... f n ). Suppose that the line graph of I is the disjoint union of graphs with at ost 5 vertices. Let F (I) = k[ f... f n ] be the onoial subring of R generated by f... f n. Then F (I) k[t...t n ]/J and the toric ideal J corresponding to I is generated by {T α T β αβ I s with s = 3 and f α = f β where αβ induce an even closed walk in G(I)}. 3. SQUARE-FREE MONOMIAL IDEALS OF LINEAR TYPE In this section we turn our attention to ideals of linear type. Villarreal showed that when I is the edge ideal of a graph then I is of linear type if and only if the graph of I is the disjoint union of graphs of trees or graphs that have a unique odd cycle [34 orollary 3.]. Inspired by this result we use the line graph associated to any onoial ideal as in onstruction.6 in order to obtain siilar results as Villarreal for any square-free onoial ideal without restrictions on the degrees of the generators. A natural first class to consider is ideals with line graph the graph of a forest. Proposition 3.. Let R be a polynoial ring over a field and let I be a square-free onoial ideal in R. We further assue that the line graph G(I) is the graph of a forest. Then I is an ideal of linear type.

15 REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS 5 Proof. Let f... f n be a inial onoial generating set for I. We show that for all sequences αβ I s of length s where I s is as in Definition. we have T αβ SJ + S ( s J i ) and by induction it follows that T αβ SJ. Since G(I) is the graph of a forest then every subgraph of G(I) is also a forest. By Proposition.8 we ay assue that G(I) is connected i.e. it is the graph of a tree. Notice that for every graph of a tree there exists a vertex that is only connected to one other vertex. Suppose that s. Let α = (a l a l...a l ) and β = (b r...br t t ) where l i and r i are the nuber of distinct copies of a i and b i respectively. Notice that if a i = b j for soe i and soe j then the result follows by Le.4 and the induction hypothesis. Hence we ay assue that a i b j for all i j. Let α = (...a ) and β = (...b t ). Then the graph G induced by α β is a subgraph of G(I) by Definition.8. Hence G is the graph of a forest. If G is disconnected then the result follows by Proposition.8 and the induction hypothesis. Therefore we ay assue that G is connected and hence the graph of a tree. Thus without loss of generality we ay assue that y a is only connected to y b. If l r then gcd( f a f r f r t b t ) = and hence T αβ SJ + S ( s J i ) by Proposition.8. So we ay assue that l < r. Then we clai that (a) gcd( f α f β ) = gcd( f l f l )gcd( f l a f β ) (b) gcd( f α f β ) = gcd( f α f l )gcd( f l k a f r l f r f r t A for soe A R. Notice that by the clai and Le.7 it follows that T αβ SJ + S ( s Therefore it reains to prove the clai. For part (a) notice that gcd( f α f β ) = gcd( f l f β )gcd( f l a f β ) = ( f l f l )gcd( f l a f β ) where the equalities follow fro the fact that gcd( f a f ai ) = gcd( f a f b j ) = for any i > j > and Reark.6 (b). For part (b) notice that b t ) J i ). gcd( f α f β ) = gcd( f α f l )gcd( f α f r l f r f r t b t )/B = gcd( f α f l )gcd( f l f r l f r f r t b t )gcd( f l a f r l f r f r t b t )/B = gcd( f α f l )gcd( f l f r l )gcd( f l a f r f r t b t )/B for soe B R since gcd( f l f r f r t b t ) =. It is enough to show that gcd( f l f r l ) B i.e. for any variable x R and any integer v if x v gcd( f l f r l ) then x v B. This is equivalent to showing that for any variable x R if x gcd( f l f r l ) and x u gcd( f α f β ) for soe integer u then x u gcd( f α f l )gcd( f l a f r l f r f r t b t ). If x gcd( f l f r l ) and x u gcd( f α f β ) then u l by the fact that y a is only connected to y b and l < r. Therefore x u gcd( f α f l ).

16 6 L. FOULI AND K. N. LIN The following lea allows us to handle the induction step in the case of odd cycles in order to prove that when the line graph of a square-free onoial ideal is the graph of an odd cycle then the ideal is of linear type. Lea 3.. Let R be a polynoial ring over a field and let I be a square-free onoial ideal in R. Let α β I s be two sequences of length s 4 where I s is as in Definition.. Let α = (a l a l...a l ) and β = (b r...br t t ) where l i and r i are the nuber of distinct copies of a i and b i respectively. Suppose that l < r l < r and that the graph G(I) is the graph of an odd cycle of length at least 5. We further assue that y a is connected to y b and y a only and y a is connected to y a and y b only. Then T αβ SJ + S ( s J i ). Proof. Let α = (a l a l ) and β = (b r l b r l b r br t t ). Using Reark.6 and Reark.3 we have that since l < r and l < r. gcd( f α f β ) = gcd( f l f β )gcd( f α f β ) = gcd( f l f l )gcd( f α f β ) We clai that gcd( f α f β ) = gcd( f α f l )( f α f β ) for soe R. Then the result will follow by Le.7. Notice that gcd( f α f β ) = gcd( f α f l )gcd( f α f β ) D = gcd( f α f l )gcd( f α f β )gcd( f l f β ) DE = gcd( f α f l )gcd( f α f β )gcd( f l f r l f r l DE where DE R and the third equality follows fro the fact that y a and y a are only connected to ) y b and y b respectively. It is enough to show that for any variable x R and any integer v if x v gcd( f l f r l f r l ) then x v DE. This is equivalent to showing that if x gcd( f l f r l f r l and x u gcd( f α f β ) then x u gcd( f α f l )gcd( f α f β ). If x gcd( f l f r l f r l ) then x can not divide both f a and f a since otherwise {y a y a y b } or {y a y a y b } will for a 3-cycle in G(I). Siilarly x can not divide both f b and f b. Therefore without loss of generality we ay assue x f a and x f b. Since l < r and y a is not connected to y ai for all i > we obtain that if x u gcd( f α f β ) then u l. Therefore x u gcd( f α f l ). In the next Proposition we are able to handle the case where each of the connected coponents of the line graph has a unique odd cycle. Proposition 3.3. Let R be a polynoial ring over a field and let I be a square-free onoial ideal in R. We further assue that line graph G(I) of I is the disjoint union of graphs with a unique odd cycle. Then I is an ideal of linear type. )

17 REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS 7 Proof. By Reark.9 it suffices to consider the connected coponents of G(I). Hence we ay assue that G(I) is connected and it has a unique odd cycle. We show that for all sequences αβ I s of length s where I s is as in Definition. we have T αβ SJ +S ( s J i ). By induction it will follow that T αβ SJ. Let α = (a l a l...a l ) and β = (b r...br t t ) where l i and r i are the nuber of distinct copies of a i and b i respectively. Using Le.4 we ay assue without loss of generality that a i b j for all i and j. Let α = (...a ) and β = (...b t ). Then the graph G induced by α and β is a subgraph of G(I) by Definition.8. By Proposition.8 we ay assue that G is a connected graph. Notice that if there exists a vertex y i that is only connected to one of the y j then T αβ SJ + S ( s J i ) by the proof of Proposition 3.. Hence we ay assue that G is the graph of an odd cycle. Therefore every vertex is only connected to two other vertices. Let l = +t. Since G is the graph of an odd cycle then l is odd and hence t. We proceed by induction on l. If l = 3 then G(I) is the graph of a triangle and the result follows fro Le.4 and Le.9. Suppose that l 5. Using Le.9 we ay assue that and t. Notice that y a is connected to two other vertices. Without loss of generality we ay assue that we have the following possible cases: (i) y a is connected only to y a and y a3 (ii) y a is connected only to y a and y b (iii) y a is connected only to y b and y b. We handle each case separately. For case (i) we note that since y a is connected only to y a and y a3 then using k = l in Proposition.8 and induction we obtain the result. For case (ii) suppose that y a is connected only to y a and y b. If l r then using k = l in Proposition.8 and induction we obtain the result. If l < r then we consider y a. Notice that y a can not be connected to y b since then {y a y a y b } will for a triangle which is a contradiction since l 5. Hence either y a is connected to y a3 or y a is connected to y bi for soe i. If y a is connected to y a3 then case (i) yields the result. Suppose that y a is connected to y bi for soe i. Without loss of generality suppose that i =. I r then we ay use k = l in Proposition.8 and induction. I < r and since l < r we can use Lea 3. and induction. Finally for case (iii) suppose that y a is connected only to y b and y b. If every y ai is connected to y bi and y bi for i i then either = t which is ipossible since l is odd or there exist i j such that y bi is connected to y b j. Then by switching the role of α and β we are in either case (i) or case (ii). We are now ready to state the ain theore of this section. Theore 3.4. Let R be a polynoial ring over a field and let I be a square-free onoial ideal in R. We further assue that the line graph of I G(I) is the disjoint union of graphs of trees and graphs with a unique odd cycle. Then I is an ideal of linear type.

18 8 L. FOULI AND K. N. LIN Proof. The result follows iediately by Proposition 3. Proposition 3.3 and Proposition.8. We conclude this article with the following reark. Reark 3.5. Let R be a polynoial ring over a field and let I be a square-free onoial ideal generated by 3 square-free onoials in R. Then the fact that I is of linear type is already known but it also follows iediately fro Proposition 3. and Proposition 3.3. Acknowledgeents. We wish to thank Ali Alilooee and Yi-Huang Shen for their coents on an earlier version of the anuscript. REFERENES [] I. Aberbach L. Ghezzi H. T. Há Hoology ultipliers and the relation type of paraeter ideals Pacific J. Math. 6 (006) 39. [] L. Busé Eliination theory in codiension one and applications INRIA 598 June [3] A. onca E. De Negri M-sequences graph ideals and ladder ideals of linear type J. Algebr (999) [4] A. onca J. Herzog N.V. Trung G. Valla Diagonal subalgebras of bigraded algebras and ebeddings of blow-ups of projective spaces Aer. J. Math. 9 (997) [5] A. orso U. Nagel Monoial and toric ideals associated to Ferrers graphs Trans. Aer. Math. Soc. 36 (009) [6] D. ox A. Kustin. Polini B. Ulrich A study of singularities on rational curves via syzygies preprint Me. Aer. Math. Soc. (03) no. 045 x+6 pp. [7] D. ox J. Little H. Schenck Toric varieties Graduate Studies in Matheatics 4. Aerican Matheatical Society Providence RI 0 xxiv+84 pp. [8] V. Gasharov N. Horwitz I. Peeva Hilbert functions over toric rings Michigan Math. J. 57 (008) [9] A. Geraita A. Giigliano Generators for the defining ideal of certain rational surfaces Duke Math. J. 6 (99) [0] A. Geraita A. Giigliano B. Harbourne Projectively noral but superabundant ebeddings of rational surfaces in projective space J. Algebr69 (994) [] A. Giigliano On Veronesean surface Proc. Konin. Ned. Akad. van Wetenschappen Ser. A 9 (989) [] A. Giigliano A. Lorenzini On the ideal of veronesean surfaces anad. J. Math. 43 (993) [3] H.T. Hà Box-shaped atrices and the defining ideal of certain blowup surfaces J. Pure Appl. Algebr67 (00) [4] H.T. Hà On the Rees algebra of certain codiension two perfect ideals Manuscripta Math. 07 (00) [5] S. Huckaba On coplete d-sequences and the defining ideals of Rees algebras Math. Proc. abridge Philos. Soc. 06 (989) [6] J. Herzog A. Siis W. V. Vasconcelos Approxiation coplexes of blowing-up rings J. Algebra 74 (98) [7] J. Herzog A. Siis W. V. Vasconcelos Approxiation coplexes of blowing-up rings. II. J. Algebra 8 (983) [8] J. Herzog W. V. Vasconcelos R. H. Villarreal Ideals with sliding depth Nagoya Math. J. 99 (985) [9]. Huneke Deterinantal ideals of linear type Arch. Math. (Basel) 47 (986) [0]. Huneke On the syetric and Rees algebra of an ideal generated by a d-sequence J. Algebra 6 (980) [] A. Kustin. Polini B. Ulrich Rational noral scrolls and the defining equations of Rees algebras J. Reine Angew. Math. 650 (0) [] Y-H. Lai On the relation type of systes of paraeters J. Algebr75 (995) [3] A. Micali Sur les algèbres universelles Ann. Inst. Fourier 4 (964) [4] S. Morey Equations of blowups of ideals of codiension two and three J. Pure Appl. Algebr09 (996) 97. [5] S. Morey B. Ulrich Rees algebras of ideals with low codiension Proc. Aer. Math. Soc. 4 (996) [6] H. Ohsugi T. Hibi Toric ideals generated by quadratic binoials J. Algebr8 (999) no. 509?57. [7] E. Reyes. Tatakis A. Thoa Minial generators of toric ideals of graphs Adv. in Appl. Math. 48 (0) [8] A. Siis N. Trung G. Valla The diagonal subalgebra of a blow-up algebra J. Pure Appl. Algebr5 (998)

19 REES ALGEBRAS OF SQUARE-FREE MONOMIAL IDEALS 9 [9] J. A. Soleyan X. Zheng Monoial ideals of forest type o. Algebra 40 (0) [30] D. Taylor Ideals generated by onoials in an R sequence Ph. D. thesis University of hicago 966. [3] N. V. Trung Reduction exponent and degree bound for the defining equations of graded rings Proc. Aer. Math. Soc. 0 (987) [3] G. Valla On the syetric and Rees algebra of an ideal Manuscripta Math. 30 (980) [33] W. Vasconcelos Arithetic of Blowup Algebras in: London Matheatical Society Lecture Note Series vol. 95 abridge University Press abridge 994. [34] R. H. Villarreal Rees algebras of edge ideals o. Algebr3 (995) [35] H- J. Wang The relation-type conjecture holds for rings with finite local cohoology o. Algebr5 (997) DEPARTMENT OF MATHEMATIAL SIENES NEW MEXIO STATE UNIVERSITY LAS RUES NEW MEXIO USA E-ail address: lfouli@ath.nsu.edu DEPARTMENT OF MATHEMATIS AND STATISTIS SMITH OLLEGE NORTHAMPTON MASSAHUSETTS 0063 E-ail address: klin@sith.edu

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

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

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

When is a squarefree monomial ideal of linear type?

When is a squarefree monomial ideal of linear type? Commutative Algebra and Noncommutative Algebraic Geometry, I MSRI Publications Volume 67, 2015 When is a squarefree monomial ideal of linear type? ALI ALILOOEE AND SARA FARIDI In 1995 Villarreal gave a

More information

arxiv: v2 [math.ac] 24 Sep 2014

arxiv: v2 [math.ac] 24 Sep 2014 When is a Squarefree Monomial Ideal of Linear Type? Ali Alilooee Sara Faridi October 16, 2018 arxiv:1309.1771v2 [math.ac] 24 Sep 2014 Abstract In 1995 Villarreal gave a combinatorial description of the

More information

Chicago, Chicago, Illinois, USA b Department of Mathematics NDSU, Fargo, North Dakota, USA

Chicago, Chicago, Illinois, USA b Department of Mathematics NDSU, Fargo, North Dakota, USA This article was downloaded by: [Sean Sather-Wagstaff] On: 25 August 2013, At: 09:06 Publisher: Taylor & Francis Infora Ltd Registered in England and Wales Registered Nuber: 1072954 Registered office:

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

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

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

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

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

#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

Solutions of some selected problems of Homework 4

Solutions of some selected problems of Homework 4 Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next

More 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

Singularities of divisors on abelian varieties

Singularities of divisors on abelian varieties Singularities of divisors on abelian varieties Olivier Debarre March 20, 2006 This is joint work with Christopher Hacon. We work over the coplex nubers. Let D be an effective divisor on an abelian variety

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

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

ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS

ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS #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 jkritsch@iastateedu Adriana Salerno

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

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More 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

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint. 59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far

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

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

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

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

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

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

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

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

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

An EGZ generalization for 5 colors

An EGZ generalization for 5 colors An EGZ generalization for 5 colors David Grynkiewicz and Andrew Schultz July 6, 00 Abstract Let g zs(, k) (g zs(, k + 1)) be the inial integer such that any coloring of the integers fro U U k 1,..., g

More 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

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

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

arxiv: v1 [math.co] 19 Apr 2017

arxiv: v1 [math.co] 19 Apr 2017 PROOF OF CHAPOTON S CONJECTURE ON NEWTON POLYTOPES OF q-ehrhart POLYNOMIALS arxiv:1704.0561v1 [ath.co] 19 Apr 017 JANG SOO KIM AND U-KEUN SONG Abstract. Recently, Chapoton found a q-analog of Ehrhart polynoials,

More 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

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

Alireza Kamel Mirmostafaee

Alireza Kamel Mirmostafaee Bull. Korean Math. Soc. 47 (2010), No. 4, pp. 777 785 DOI 10.4134/BKMS.2010.47.4.777 STABILITY OF THE MONOMIAL FUNCTIONAL EQUATION IN QUASI NORMED SPACES Alireza Kael Mirostafaee Abstract. Let X be a linear

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

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

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

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

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

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

Numerically repeated support splitting and merging phenomena in a porous media equation with strong absorption. Kenji Tomoeda

Numerically repeated support splitting and merging phenomena in a porous media equation with strong absorption. Kenji Tomoeda Journal of Math-for-Industry, Vol. 3 (C-), pp. Nuerically repeated support splitting and erging phenoena in a porous edia equation with strong absorption To the eory of y friend Professor Nakaki. Kenji

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

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

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket. Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,

More information

Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes

Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi

More information

arxiv: v3 [math.nt] 14 Nov 2016

arxiv: v3 [math.nt] 14 Nov 2016 A new integral-series identity of ultiple zeta values and regularizations Masanobu Kaneko and Shuji Yaaoto Noveber 15, 2016 arxiv:1605.03117v3 [ath.nt] 14 Nov 2016 Abstract We present a new integral =

More information

Holomorphic curves into algebraic varieties

Holomorphic curves into algebraic varieties Annals of Matheatics, 69 29, 255 267 Holoorphic curves into algebraic varieties By Min Ru* Abstract This paper establishes a defect relation for algebraically nondegenerate holoorphic appings into an arbitrary

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

MULTIPLAYER ROCK-PAPER-SCISSORS

MULTIPLAYER ROCK-PAPER-SCISSORS MULTIPLAYER ROCK-PAPER-SCISSORS CHARLOTTE ATEN Contents 1. Introduction 1 2. RPS Magas 3 3. Ites as a Function of Players and Vice Versa 5 4. Algebraic Properties of RPS Magas 6 References 6 1. Introduction

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

Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2

Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2 Hypergraphs not containing a tight tree with a bounded trunk II: -trees with a trunk of size Zoltán Füredi Tao Jiang Alexandr Kostochka Dhruv Mubayi Jacques Verstraëte July 6, 08 Abstract A tight r-tree

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

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

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

LEADING COEFFICIENTS AND THE MULTIPLICITY OF KNOWN ROOTS

LEADING COEFFICIENTS AND THE MULTIPLICITY OF KNOWN ROOTS LEADING COEFFICIENTS AND THE MULTIPLICITY OF KNOWN ROOTS GREGORY J. CLARK AND JOSHUA N. COOPER Abstract. We show that a onic univariate polynoial over a field of characteristic zero, with k distinct non-zero

More information

Divisibility of Polynomials over Finite Fields and Combinatorial Applications

Divisibility of Polynomials over Finite Fields and Combinatorial Applications Designs, Codes and Cryptography anuscript No. (will be inserted by the editor) Divisibility of Polynoials over Finite Fields and Cobinatorial Applications Daniel Panario Olga Sosnovski Brett Stevens Qiang

More information

Acyclic Colorings of Directed Graphs

Acyclic Colorings of Directed Graphs Acyclic Colorings of Directed Graphs Noah Golowich Septeber 9, 014 arxiv:1409.7535v1 [ath.co] 6 Sep 014 Abstract The acyclic chroatic nuber of a directed graph D, denoted χ A (D), is the iniu positive

More information

INDEPENDENT SETS IN HYPERGRAPHS

INDEPENDENT SETS IN HYPERGRAPHS INDEPENDENT SETS IN HYPERGRAPHS Abstract. Many iportant theores and conjectures in cobinatorics, such as the theore of Szeerédi on arithetic progressions and the Erdős-Stone Theore in extreal graph theory,

More information

On the Inapproximability of Vertex Cover on k-partite k-uniform Hypergraphs

On the Inapproximability of Vertex Cover on k-partite k-uniform Hypergraphs On the Inapproxiability of Vertex Cover on k-partite k-unifor Hypergraphs Venkatesan Guruswai and Rishi Saket Coputer Science Departent Carnegie Mellon University Pittsburgh, PA 1513. Abstract. Coputing

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

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

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

SINGULAR POLYNOMIALS FOR THE SYMMETRIC GROUPS

SINGULAR POLYNOMIALS FOR THE SYMMETRIC GROUPS SINGULAR POLYNOMIALS FOR THE SYMMETRIC GROUPS CHARLES F. DUNKL Abstract. For certain negative rational nubers 0, called singular values, and associated with the syetric group S N on N objects, there exist

More information

arxiv:math/ v1 [math.nt] 6 Apr 2005

arxiv:math/ v1 [math.nt] 6 Apr 2005 SOME PROPERTIES OF THE PSEUDO-SMARANDACHE FUNCTION arxiv:ath/05048v [ath.nt] 6 Apr 005 RICHARD PINCH Abstract. Charles Ashbacher [] has posed a nuber of questions relating to the pseudo-sarandache function

More information

arxiv:math/ v1 [math.nt] 15 Jul 2003

arxiv:math/ v1 [math.nt] 15 Jul 2003 arxiv:ath/0307203v [ath.nt] 5 Jul 2003 A quantitative version of the Roth-Ridout theore Toohiro Yaada, 606-8502, Faculty of Science, Kyoto University, Kitashirakawaoiwakecho, Sakyoku, Kyoto-City, Kyoto,

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

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

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

MULTIPLICITIES OF MONOMIAL IDEALS

MULTIPLICITIES OF MONOMIAL IDEALS MULTIPLICITIES OF MONOMIAL IDEALS JÜRGEN HERZOG AND HEMA SRINIVASAN Introduction Let S = K[x 1 x n ] be a polynomial ring over a field K with standard grading, I S a graded ideal. The multiplicity of S/I

More information

On a class of squarefree monomial ideals of linear type

On a class of squarefree monomial ideals of linear type On a class of squarefree monomial ideals of linear type University of Science and Technology of China Shanghai / November 2, 2013 Basic definition Let K be a field and S = K[x 1,...,x n ] a polynomial

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

Page 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011

Page 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011 Page Lab Eleentary Matri and Linear Algebra Spring 0 Nae Due /03/0 Score /5 Probles through 4 are each worth 4 points.. Go to the Linear Algebra oolkit site ransforing a atri to reduced row echelon for

More 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

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

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

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter

More information

Inclusions Between the Spaces of Strongly Almost Convergent Sequences Defined by An Orlicz Function in A Seminormed Space

Inclusions Between the Spaces of Strongly Almost Convergent Sequences Defined by An Orlicz Function in A Seminormed Space Inclusions Between the Spaces of Strongly Alost Convergent Seuences Defined by An Orlicz Function in A Seinored Space Vinod K. Bhardwaj and Indu Bala Abstract The concept of strong alost convergence was

More information

Closed-form evaluations of Fibonacci Lucas reciprocal sums with three factors

Closed-form evaluations of Fibonacci Lucas reciprocal sums with three factors Notes on Nuber Theory Discrete Matheatics Print ISSN 30-32 Online ISSN 2367-827 Vol. 23 207 No. 2 04 6 Closed-for evaluations of Fibonacci Lucas reciprocal sus with three factors Robert Frontczak Lesbank

More 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

arxiv: v1 [math.co] 22 Oct 2018

arxiv: v1 [math.co] 22 Oct 2018 The Hessenberg atrices and Catalan and its generalized nubers arxiv:80.0970v [ath.co] 22 Oct 208 Jishe Feng Departent of Matheatics, Longdong University, Qingyang, Gansu, 745000, China E-ail: gsfjs6567@26.co.

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

arxiv: v1 [math.co] 15 Nov 2018

arxiv: v1 [math.co] 15 Nov 2018 arxiv:1811.0617v1 [ath.co] 15 Nov 018 Forbidden rainbow subgraphs that force large onochroatic or ulticolored connected subgraphs Xihe Li a,b and Ligong Wang a,b, a Departent of Applied Matheatics, School

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

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

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

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

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

A Quantum Observable for the Graph Isomorphism Problem

A Quantum Observable for the Graph Isomorphism Problem A Quantu Observable for the Graph Isoorphis Proble Mark Ettinger Los Alaos National Laboratory Peter Høyer BRICS Abstract Suppose we are given two graphs on n vertices. We define an observable in the Hilbert

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

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

Multi-Dimensional Hegselmann-Krause Dynamics

Multi-Dimensional Hegselmann-Krause Dynamics Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory

More information

Research Article On the Isolated Vertices and Connectivity in Random Intersection Graphs

Research Article On the Isolated Vertices and Connectivity in Random Intersection Graphs International Cobinatorics Volue 2011, Article ID 872703, 9 pages doi:10.1155/2011/872703 Research Article On the Isolated Vertices and Connectivity in Rando Intersection Graphs Yilun Shang Institute for

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

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

Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography

Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography Tight Bounds for axial Identifiability of Failure Nodes in Boolean Network Toography Nicola Galesi Sapienza Università di Roa nicola.galesi@uniroa1.it Fariba Ranjbar Sapienza Università di Roa fariba.ranjbar@uniroa1.it

More information