Related papers: Computing generalized Frobenius powers of monomial…
Previous work by Mora and Sala provides the reduced Groebner basis of the ideal formed by the elementary symmetric polynomials in $n$ variables of degrees $k=1,\dots,n$, $\langle e_{1,n}(x), \dots, e_{n,n}(x) \rangle$. Haglund, Rhoades, and…
We introduce a weighted sum of irreducible character ratios as an estimator for commutator probabilities. The estimator yields Frobenius formula when applied to a regular representation
The aim of this work is to compare symbolic and ordinary powers of monomial ideals using commutative algebra and combinatorics. Monomial ideals whose symbolic and ordinary powers coincide are called Simis ideals. Weighted monomial ideals…
The main objective of this paper is to introduce an algorithm for solving fractional and classical differential equations based on a new generalized fractional power series. The algorithm relies on expanding the solution of an FDE or an ODE…
The main goal of this paper is to prove, in positive characteristic $p$, stability behavior for the graded Betti numbers in the periodic tails of the minimal resolutions of Frobenius powers of the homogeneous maximal ideals for very general…
This paper investigates the symbolic powers of toric ideals. We first describe them in terms of the kernel of certain linear maps derived from the lattice structure of the toric ideal. Furthermore, we apply our results to show that symbolic…
Let $(R,\frak m)$ be a Noetherian local ring of prime characteristic $p>0$, and $t$ an integer such that $H_{\frak m}^j(R)/0^F_{H^j_{\frak m}(R)}$ has finite length for all $j<t$. The aim of this paper is to show that there exists an…
We count the numbers of associated primes of powers of ideals as defined by Bandari, Hibi, and Herzog in 2014. We generalize those ideals to monomial ideals $\operatorname{BHH}(m,r,s)$ for $r \ge 2$, $m$, $s \ge 1$; we establish partially…
We survey classical and recent results on symbolic powers of ideals. We focus on properties and problems of symbolic powers over regular rings, on the comparison of symbolic and regular powers, and on the combinatorics of the symbolic…
Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…
In this paper we give an explicit solution to the rank constrained matrix approximation in Frobenius norm, which is a generalization of the classical approximation of an m by n matrix A by a matrix of rank k at most.
We introduce a new class of monomial ideals which we call symmetric shifted ideals. Symmetric shifted ideals are fixed by the natural action of the symmetric group and, within the class of monomial ideals fixed by this action, they can be…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
In this note, we find a monomization of a certain power ideal associated to a directed graph. This power ideal has been studied in several settings. The combinatorial method described here extends earlier work of other, and will work on…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
This note describes a \emph{Macaulay2} package for computations in prime characteristic commutative algebra. This includes Frobenius powers and roots, $p^{-e}$-linear and $p^{e}$-linear maps, singularities defined in terms of these maps,…
In this paper, we study the notion of special ideals. We generalize the results on those as well as the algorithm obtained for finite dimensional power series rings by Mordechai Katzman and Wenliang Zhang to finite dimensional polynomial…
Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…
Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.
When a monomial ideal has linear quotients with respect to an admissible order of increasing support-degree, we provide two proofs of different flavors to show that it is componentwise support-linear. We also introduce the variable…