An official website of the United States government
We introduce the class of principal symmetric ideals, which are ideals generated by the orbit of a single polynomial under the action of the symmetric group. Fixing the degree of the generating polynomial, this class of ideals is parametrized by points in a suitable projective space. We show that the minimal free resolution of a principal symmetric ideal is constant on a non-empty Zariski open subset of this projective space and we determine this resolution explicitly. Along the way, we study two classes of graded algebras which we term narrow and extremely narrow; both of which are instances of compressed artinian algebras.
more »
« less
Products and powers of principal symmetric ideals
Principal symmetric ideals were recently introduced by Harada et al. in [The minimal free resolution of a general principal symmetric ideal, preprint (2023), arXiv:2308.03141], where their homological properties are elucidated. They are ideals generated by the orbit of a single polynomial under permutations of variables in a polynomial ring. In this paper, we determine when a product of two principal symmetric ideals is principal symmetric and when the powers of a principal symmetric ideal are again principal symmetric ideals. We characterize the ideals that have the latter property as being generated by polynomials invariant up to a scalar multiple under permutation of variables. Recognizing principal symmetric ideals is an open question for the purpose of which we produce certain obstructions. We also demonstrate that the Hilbert functions of symmetric monomial ideals are not all given by symmetric monomial ideals, in contrast to the non-symmetric case.
more »
« less
- PAR ID:
- 10557423
- Publisher / Repository:
- World Scientific
- Date Published:
- Journal Name:
- Journal of Algebra and Its Applications
- ISSN:
- 0219-4988
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Symmetric strongly shifted ideals constitute a class of monomial ideals which are equipped with an action of the symmetric group and are analogous to the well-studied class of strongly stable monomial ideals. In this paper, we focus on algebraic and combinatorial properties of symmetric strongly shifted ideals. On the algebraic side, we elucidate properties that pertain to behavior under ideal operations, primary decomposition, and the structure of their Rees algebra. On the combinatorial side, we develop a notion of partition Borel generators which leads to connections to discrete polymatroids, convex polytopes, and permutohedral toric varieties.more » « less
-
Abstract We study a class of combinatorially defined polynomial ideals that are generated by minors of a generic symmetric matrix. Included within this class are the symmetric determinantal ideals, the symmetric ladder determinantal ideals, and the symmetric Schubert determinantal ideals of A. Fink, J. Rajchgot, and S. Sullivant. Each ideal in our class is a type C analog of a Kazhdan–Lusztig ideal of A. Woo and A. Yong; that is, it is the scheme‐theoretic defining ideal of the intersection of a type C Schubert variety with a type C opposite Schubert cell, appropriately coordinatized. The Kazhdan–Lusztig ideals that arise are exactly those where the opposite cell is 123‐avoiding. Our main results include Gröbner bases for these ideals, prime decompositions of their initial ideals (which are Stanley–Reisner ideals of subword complexes), and combinatorial formulas for their multigraded Hilbert series in terms of pipe dreams.more » « less
-
Given a representation of a finite group G over some commutative base ring k, the cofixed space is the largest quotient of the representation on which the group acts trivially. If G acts by k-algebra automorphisms, then the cofixed space is a module over the ring of G-invariants. When the order of G is not invertible in the base ring, little is known about this module structure. We study the cofixed space in the case that G is the symmetric group on n letters acting on a polynomial ring by permuting its variables. When k has characteristic 0, the cofixed space is isomorphic to an ideal of the ring of symmetric polynomials in n variables. Localizing k at a prime integer p while letting n vary reveals striking behavior in these ideals. As n grows, the ideals stay stable in a sense, then jump in complexity each time n reaches a multiple of p.more » « less
-
Two new efficient algorithms for computing greatest common divisors (gcds) of parametric multivariate polynomials over k[U][X]are presented. The key idea of the first algorithm is that the gcd of two non-parametric multivariate polynomials can be obtained by dividing their product by the generator of the intersection of two principal ideals generated by the polynomials. The second algorithm is based on another simple insight that the gcd can be extracted using the generator of the ideal quotient of a polynomial with respect to the second polynomial. Since the ideal intersection and ideal quotient in these cases are also principal ideals, their generators can be obtained by computing minimal Gröbner bases of the ideal intersection and ideal quotient, respectively. To avoid introducing new variables which can adversely affect the efficiency, minimal Gröbner bases computations are performed on modules. Both of these constructions generalize to the parametric case as shown in the paper. Comprehensive Gröbner system constructions are used for the parametric ideal intersection and ideal quotient using the Kapur-Sun-Wang’s algorithm. It is proved that whether in a minimal comprehensive Gröbner system of a parametric ideal 20intersection or in that of a parametric ideal quotient, each branch of the specializations corresponds to a principal parametric ideal with a single generator. Using this generator, the parametric gcd of that branch is obtained by division. For the case of more than two parametric polynomials, we can use the above two algorithms to compute gcds recursively, and get an extended algorithm by generalizing the idea of the second algorithm. Algorithms do not suffer from having to apply expensive steps such as ensuring whether parametric polynomials are primitive w.r.t. the main variable as used in both the algorithms proposed by Nagasaka (ISSAC, 2017). The resulting algorithms are not only conceptually simple to understand but are more efficient in practice. The proposed algorithms and both of Nagasaka’s algorithms have been implemented in Singular, and their performance is compared on a number of examples.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1142/S0219498825503207
