Related papers: Computing generalized Frobenius powers of monomial…
In this paper, we characterize the (generalized) Frobenius powers and critical exponents of two classes of monomial ideals of a polynomial ring in positive characteristic: powers of the homogeneous maximal ideal, and ideals generated by…
This article extends the notion of a Frobenius power of an ideal in prime characteristic to allow arbitrary nonnegative real exponents. These generalized Frobenius powers are closely related to test ideals in prime characteristic, and…
This paper concerns the exponentiation of monomial ideals. While it is customary for the exponentiation operation on ideals to consider natural powers, we extend this notion to powers where the exponent is a positive real number. Real…
In this paper, we show the equality of the (local) $\mathrm{v}$-number and Castelnuovo-Mumford regularity of certain classes of Gorenstein algebras, including the class of Gorenstein monomial algebras. Also, for the same classes of algebras…
Over a field of characteristic two, we develop a theory of standard monomials for polynomial rings modulo a Frobenius power of the maximal ideal generated by all variables. As a result, we obtain a filtration by modular GL_n-representations…
The Frobenius method can be used to represent solutions of ordinary differential equations by (generalized) power series. It is useful to have prior knowledge of the coefficients of this series. In this contribution we demonstrate that the…
The Frobenius method can be used to compute solutions of ordinary linear differential equations by generalized power series. Each series converges in a circle which at least extends to the nearest singular point; hence exponentially fast…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which is for larger models by far more efficient than directly computing Groebner bases or the interpolation method proposed in the first…
This is an exposition of some new results on associated primes and the depth of different kinds of powers of monomial ideals in order to show a deep connection between commutative algebra and some objects in combinatorics such as simplicial…
Suppose that R is a two-dimensional normal standard-graded domain over a finite field. We prove that there exists a uniform Frobenius test exponent b for the class of homogeneous ideals in R generated by at most n elements. This means that…
We associate to each $r$-multigraded, locally finitely generated ideal in the "large polynomial ring" on countably many indeterminates a power series in $r$ variables; this power series is the limit in the adic topology of the numerators of…
In this paper we prove the existence of a uniform bound for Frobenius test exponents for parameter ideals of a local ring $(R, \frak m)$ of prime characteristic in the following cases: (1) $R$ is generalized Cohen-Macaulay. Our proof is…
We survey results produced from the interaction between methods in prime characteristic and combinatorial commutative algebra. We showcase results for edge ideals, toric varieties, Stanley-Reisner rings, and initial ideals that were proven…
We survey research relating algebraic properties of powers of squarefree monomial ideals to combinatorial structures. In particular, we describe how to detect important properties of (hyper)graphs by solving ideal membership problems and…
We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common…
Symbolic powers are studied in the combinatorial context of monomial ideals. When the ideals are generated by quadratic squarefree monomials, the generators of the symbolic powers are obstructions to vertex covering in the associated graph…
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…
Frobenius built a representation theory of finite groups in the process of obtaining the irreducible factorization of the group determinant. Here, we give a generalization of Frobenius' theorem. The generalization leads to a corollary on…