Related papers: Computing generalized Frobenius powers of monomial…

In this paper, we introduce a new class of monomial ideals, called $d$-fixed ideals, which generalize the class of $p$-Borel ideals and show how some results for $p$-Borel ideals can be transfered to this new class. In particular, we give…

We describe a version of the FGLM algorithm that can be used to compute generic fibers of positive-dimensional polynomial ideals. It combines the FGLM algorithm with a Hensel lifting strategy. In analogy with Hensel lifting, we show that…

It is shown that any set of nonzero monomial prime ideals can be realized as the stable set of associated prime ideals of a monomial ideal. Moreover, an algorithm is given to compute the stable set of associated prime ideals of a monomial…

We introduce the class of sparse symmetric shifted monomial ideals. These ideals have linear quotients and their Betti numbers are computed. Using this, we prove that the symbolic powers of the generalized star configuration ideal are…

We introduce the abstract notion of squarefree-power-like functions, which unify the sequences of squarefree ordinary and symbolic powers of squarefree monomial ideals. By employing the Tor-vanishing criteria for mixed sums of ideals, we…

Mixture models have found uses in many areas. To list a few: unsupervised learning, empirical Bayes, latent class and trait models. The current applications of mixture models to empirical data is limited to computing a mixture model from…

Generalized trigonometric functions are applied to the Legendre-Jacobi standard form of complete elliptic integrals, and a new form of the generalized complete elliptic integrals of the Borweins is presented. According to the form, it can…

In this paper we study the index of reducibility of powers of a standard parameter ideal. An explicit formula is proved for the extremely case. We apply the main result to compute Hilbert polynomials of socle ideals of standard parameter…

In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…

We study Hilbert-Kunz multiplicity of the powers of an ideal and establish existence of the second coefficient at the full level of generality, thus extending a recent result of Trivedi. We describe the second coefficient as the limit of…

The classical Frobenius problem is to compute the largest number g not representable as a non-negative integer linear combination of non-negative integers x_1, x_2, ..., x_k, where gcd(x_1, x_2, ..., x_k) = 1. In this paper we consider…

The proliferation of probable prime tests in recent years has produced a plethora of definitions with the word ``pseudoprime'' in them. Examples include pseudoprimes, Euler pseudoprimes, strong pseudoprimes, Lucas pseudoprimes, strong Lucas…

In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the…

In this paper, we focus on the associated primes of powers of monomial ideals and asymptotic behavior properties such as normally torsion-freeness, normality, the strong persistence property, and the persistence property. In particular, we…

We determine a new technique which allows the computation of the arithmetical rank of certain monomial ideals.

We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.

Frobenius problem and its many generalizations have been extensively studied in several areas of mathematics. We study semigroups of totally positive algebraic integers in totally real number fields, defining analogues of the Frobenius…

We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…

We develop theory and examples of monoidal functors on tensor categories in positive characteristic that generalise the Frobenius functor from \cite{Os, EOf, Tann}. The latter has proved to be a powerful tool in the ongoing classification…

In this paper we consider graded ideals in a polynomial ring over a field and ask when such an ideal has the property that all of its powers have a linear resolution. In particular it is shown that all powers of a monomial ideal with…