Abstract:In this paper we study primality and primary decomposition of certain ideals which are generated by homogeneous degree 2 polynomials and occur naturally from determinantal conditions. Normality is derived from these results.2010 Mathematics Subject Classification. Primary 13C40, 13P10.
“…, g n form a regular sequence as well; see Lemma 4.3 and Theorem 6.1. However, this Gröbner basis is too small in size to be of much help in applications like computing primary decomposition of I 1 (XY ) or computing Betti numbers of ideals of the form I 1 (XY ) + J, carried out in [15] and [16] respectively. This motivated us to look for a a different Gröbner basis for I; see Theorem 4.1.…”
Section: Defining the Problemsmentioning
confidence: 99%
“…We prove that g 1 , · · · , g n : g n+1 = g 1 , · · · , g n , ∆ ; where ∆ = det(X). This proof requires the fact that g 1 , · · · , g n , ∆ is a prime ideal, which has been proved in Theorem 5.4 in [15]. Step 3.…”
Section: Gröbner Basis For Jmentioning
confidence: 99%
“…We need detailed information about the ideal g 1 , · · · , g n , ∆ , where ∆ = det(X). We need the fact that this ideal is a prime ideal, which has been proved in Theorem 5.4 in [15]. We also need a minimal free resolution for this ideal, which has been proved below in Lemma 6.10.…”
Section: Gröbner Basis For Jmentioning
confidence: 99%
“…We will see that computing Betti numbers for I 1 (XY ) in the first two cases is not difficult, while the last two cases are not so straightforward. We will use some results from [15] and [16] which have some more deep consequences of the Gröbner basis computation carried out in this paper.…”
In this paper we compute Gröbner bases for determinantal ideals of the form I 1 (XY ), where X and Y are both matrices whose entries are indeterminates over a field K. We use the Gröbner basis structure to determine Betti numbers for such ideals.2010 Mathematics Subject Classification. Primary 13P10; Secondary 13C40, 13D02.
“…, g n form a regular sequence as well; see Lemma 4.3 and Theorem 6.1. However, this Gröbner basis is too small in size to be of much help in applications like computing primary decomposition of I 1 (XY ) or computing Betti numbers of ideals of the form I 1 (XY ) + J, carried out in [15] and [16] respectively. This motivated us to look for a a different Gröbner basis for I; see Theorem 4.1.…”
Section: Defining the Problemsmentioning
confidence: 99%
“…We prove that g 1 , · · · , g n : g n+1 = g 1 , · · · , g n , ∆ ; where ∆ = det(X). This proof requires the fact that g 1 , · · · , g n , ∆ is a prime ideal, which has been proved in Theorem 5.4 in [15]. Step 3.…”
Section: Gröbner Basis For Jmentioning
confidence: 99%
“…We need detailed information about the ideal g 1 , · · · , g n , ∆ , where ∆ = det(X). We need the fact that this ideal is a prime ideal, which has been proved in Theorem 5.4 in [15]. We also need a minimal free resolution for this ideal, which has been proved below in Lemma 6.10.…”
Section: Gröbner Basis For Jmentioning
confidence: 99%
“…We will see that computing Betti numbers for I 1 (XY ) in the first two cases is not difficult, while the last two cases are not so straightforward. We will use some results from [15] and [16] which have some more deep consequences of the Gröbner basis computation carried out in this paper.…”
In this paper we compute Gröbner bases for determinantal ideals of the form I 1 (XY ), where X and Y are both matrices whose entries are indeterminates over a field K. We use the Gröbner basis structure to determine Betti numbers for such ideals.2010 Mathematics Subject Classification. Primary 13P10; Secondary 13C40, 13D02.
“…Ideals of the form I 1 (X n Y n ) has been studied by [2] and they appear in some of our recent works; see [4], [5], [6], [7]. We described its Gröbner bases, primary decompositions and Betti numbers through computational techniques, mostly under the assumption that X n is either a generic or a generic symmetric matrix.…”
In this paper we propose a model for computing a minimal free resolution for ideals of the form I 1 (X n Y n ), where X n is an n × n skew-symmetric matrix with indeterminate entries x ij and Y n is a generic column matrix with indeterminate entries y j . We verify that the model works for n = 3 and n = 4 and pose some statements as conjectures. Answering the conjectures in affirmative would enable us to compute a minimal free resolution for general n.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.