Results 81 to 90 of about 237,348 (199)
Poincaré series of monomial rings with minimal Taylor resolution
Le Matematiche, 2012 We give a comparison between the Poincaré series of two monomial rings: R = A/I and R_q = A/I_q where I_q is a monomial ideal generated by the q’th power of monomial generators of I.
Yohannes Tadesse
doaj
Numerical Identification of Stationary States and Their Stability in a Model of Quantum Droplets
Studies in Applied Mathematics, Volume 157, Issue 3, September 2026.ABSTRACT In this work, we are motivated by a recent variant of the nonlinear Schrödinger (NLS) equation describing cold, dilute atomic condensates with quantum fluctuation effects. Our goal is to develop robust numerical methods capable of uncovering diverse stationary solutions in such NLS models.
Sun Lee +2 more
wiley +1 more source
Repelled Point Processes With Application to Numerical Integration
Scandinavian Journal of Statistics, Volume 53, Issue 3, Page 1101-1133, September 2026.ABSTRACT We look at Monte Carlo numerical integration from a stochastic geometry point of view. While crude Monte Carlo estimators relate to linear statistics of a homogeneous Poisson point process (PPP), linear statistics of more regularly spread point processes can yield unbiased estimators with faster‐decaying variance, and thus lower integration ...
Diala Hawat +3 more
wiley +1 more source
Bar code for monomial ideals [PDF]
Journal of Symbolic Computation, 2019 58 ...
openaire +8 more sources
Parametric Decomposition of Monomial Ideals, II [PDF]
, 1997 Letx1,…,xdbe anR-sequence in a commutative ringRand letIbe a monomial idea (soIis generated by elements of the formx1e1···xded, where eacheiis a nonnegative integer).
Shah, Kishor +3 more
core +1 more source
Elevating PGBMain algorithm performance through strategic minimal Dickson basis selection [PDF]
Computational Algorithms and Numerical DimensionsIn this paper, we enhance the PGBMain algorithm, an efficient method for computing Gröbner bases of parametric polynomial ideals, or Gröbner systems. A key step in the PGBMain algorithm involves computing a minimal Dickson basis in each iteration, which ...
Mahdi Dehghani Darmian
doaj +1 more source
The DGA of planar loops when 2n=4$2n=4$
Bulletin of the London Mathematical Society, Volume 58, Issue 9, September 2026.Abstract The DGA of planar loops is a pictorial chain complex introduced in a recent paper of the author, Boyd, Randal‐Williams and Sroka, where a minimal model for it was given. In the first non‐trivial case, 2n=4$2n=4$, we give a new model which incorporates two natural ‘reflection’ involutions, as well as a more explicit description of the existing ...
Guy Boyde
wiley +1 more source
, 2023 The core of an ideal is defined as the intersection of all of its reductions. In this paper we provide an explicit description for the core of a monomial ideal $I$ satisfying certain residual conditions, showing that ${\rm core}(I)$ coincides with the ...
Fouli, Louiza +3 more
core
Strength and partition rank under limits and field extensions
Bulletin of the London Mathematical Society, Volume 58, Issue 9, September 2026.Abstract The strength of a multivariate homogeneous polynomial is the minimal number of terms in an expression as a sum of products of lower‐degree homogeneous polynomials. Partition rank is the analogue for multilinear forms. Both ranks can drop under field extensions, and both can jump in a limit.
Arthur Bik +3 more
wiley +1 more source
Local Cohomology at Monomial Ideals
Journal of Symbolic Computation, 2000 For a reduced monomial ideal B in R=k[X_1,...,X_n], we write H^i_B(R) as the union of {Ext^i(R/B^[d],R)}_d, where {B^[d]}_d are the "Frobenius powers of B". We describe H^i_B(R)_p, for every p in Z^n, in the spirit of the Stanley-Reisner theory. As a first application we give an isomorphism Tor_i(B', k)_p\iso Ext^{|p|-i}(R/B,R)_{-p} for all p in {0,1 ...
openaire +4 more sources