More Like this

1. Frobenius powers

   https://doi.org/10.1007/s00209-019-02442-2  

   Hernández, Daniel J.; Teixeira, Pedro; Witt, Emily E. (January 2020, Mathematische Zeitschrift)

   null (Ed.)

   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 multiplier ideals over fields of characteristic zero. For instance, like these well-known families of ideals, Frobenius powers also give rise to jumping exponents that we call critical Frobenius exponents. In fact, the Frobenius powers of a principal ideal coincide with its test ideals, but Frobenius powers appear to be a more refined measure of singularities than test ideals in general. Herein, we develop the theory of Frobenius powers in regular domains, and apply it to study singularities, especially those of generic hypersurfaces. These applications illustrate one way in which multiplier ideals behave more like Frobenius powers than like test ideals. 

   more » « less
2. Orthogonal Dirichlet Polynomials

   https://doi.org/10.1007/978-3-030-84122-5_30  

   Lubinsky, D. (January 2022, Approximation and Computation in Science and Engineering)

   Daras, N.; Rassias, T. (Ed.)

   Abstract. Let fj g1 j=1 be a sequence of distinct positive numbers. Let w be a nonnegative function, integrable on the real line. One can form orthogonal Dirichlet polynomials fng from linear combinations of n 

   more » « less
3. Products and powers of principal symmetric ideals

   https://doi.org/10.1142/S0219498825503207  

   Dannetun, Eric; Fang, Bruce; Formenti, Riccardo; Gao, Bo Y; Geraci, Juliann; Kogel, Ross; Li, Yuelin; Mandal, Shreya; Rupasinghe, Vinuge; Seceleanu, Alexandra; et al (July 2024, Journal of Algebra and Its Applications)

   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
4. Algorithms for computing greatest common divisors of parametric multivariate polynomials

   Kapur, Deepak; Lu, Dong; Monagan, Micheal; Sun, Yao; Wang, Dingkang (January 2021, Journal of symbolic computation)

   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
5. Sparse Polynomial Hermite Interpolation

   https://doi.org/10.1145/3476446.3535501  

   Kaltofen, Erich L. (July 2022, ISSAC '22 Proc. 2022 ACM Internat. Symp. Symbolic Algebraic Comput.)

   Amir Hashemi (Ed.)

   We present Hermite polynomial interpolation algorithms that for a sparse univariate polynomial f with coefficients from a field compute the polynomial from fewer points than the classical algorithms. If the interpolating polynomial f has t terms, our algorithms, require argument/value triples (w^i, f(w^i), f'(w^i)) for i=0,...,t + ceiling( (t+1)/2 ) - 1, where w is randomly sampled and the probability of a correct output is determined from a degree bound for f. With f' we denote the derivative of f. Our algorithms generalize to multivariate polynomials, higher derivatives and sparsity with respect to Chebyshev polynomial bases. We have algorithms that can correct errors in the points by oversampling at a limited number of good values. If an upper bound B >= t for the number of terms is given, our algorithms use a randomly selected w and, with high probability, ceiling( t/2 ) + B triples, but then never return an incorrect output. The algorithms are based on Prony's sparse interpolation algorithm. While Prony's algorithm and its variants use fewer values, namely, 2t+1 and t+B values f(w^i), respectively, they need more arguments w^i. The situation mirrors that in algebraic error correcting codes, where the Reed-Solomon code requires fewer values than the multiplicity code, which is based on Hermite interpolation, but the Reed-Solomon code requires more distinct arguments. Our sparse Hermite interpolation algorithms can interpolate polynomials over finite fields and over the complex numbers, and from floating point data. Our Prony-based approach does not encounter the Birkhoff phenomenon of Hermite interpolation, when a gap in the derivative values causes multiple interpolants. We can interpolate from t+1 values of f and 2t-1 values of f'. 

   more » « less