Related papers: Computing generalized Frobenius powers of monomial…
Principal symmetric ideals were recently introduced by Harada, Seceleanu, and Sega, with a focus on their homological properties. They are ideals generated by the orbit of a single polynomial under permutations of variables in a polynomial…
In this article, we define three new operations on ideals which generalize integral closure and Frobenius closure of ideals, whose definitions incorporate an auxiliary ideal and a real parameter. These additional ingredients are common in…
This paper studies Frobenius powers of parameter ideals in a commutative Noetherian local ring $R$ of prime characteristic $p$. For a given ideal $\fa$ of $R$, there is a power $Q$ of $p$, depending on $\fa$, such that the $Q$-th Frobenius…
In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…
We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…
Let $R=\mathbb{K}[X_1, \ldots , X_n ]$ be a polynomial ring over a field $\mathbb{K}$. We introduce an endomorphism $\mathcal{F}^{[m]}: R \rightarrow R $ and denote the image of an ideal $I$ of $R$ via this endomorphism as $I^{[m]}$ and…
We study the symbolic powers of square-free monomial ideals via symbolic Rees algebras and methods in prime characteristic. In particular, we prove that the symbolic Rees algebra and the symbolic associated graded algebra are split with…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
By using a new formula of cubing ideals in imaginary quadratic number and function fields combined with Shank's NUCOMP algorithm, Imbert et al. presented a fast algorithms that compute a reduced output of cubing ideals and keep the sizes of…
We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…
We give criteria for graded ideals to have the property that all their powers are componentwise linear. Typical examples to which our criteria can be applied include the vertex cover ideals of certain finite graphs.
We give tight bounds for logarithmic mean. We also give new Frobenius norm inequalities for two positive semidefinite matrices. In addition, we give some matrix inequalities on matrix power mean.
We describe an algorithm for computing parameter-test-ideals in certain local Cohen-Macaulay rings. The algorithm is based on the study of a Frobenius map on the injective hull of the residue field of the ring and on the application of…
Test ideals were first introduced by Mel Hochster and Craig Huneke in their celebrated theory of tight closure, and since their invention have been closely tied to the theory of Frobenius splittings. Subsequently, test ideals have also…
Inspired by the study of random graphs and simplicial complexes, and motivated by the need to understand average behavior of ideals, we propose and study probabilistic models of random monomial ideals. We prove theorems about the…
We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the…
In this article we produce Groebner bases for the defining ideal of a monomial curve that corresponds to an almost arithmetic sequence of positive integers, correcting previous work of Sengupta,(2003).
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
It was previously known, by work of Smith-Swanson and of Sharp-Nossem, that the linear growth property of primary decompositions of Frobenius powers of ideals in rings of prime characteristic has strong connections to the localization…