Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.12146 v1 pith:UC5DM2Z4 submitted 2025-04-16 math.AC math.CO

Computation of dominant ideals

classification math.AC math.CO
keywords dominantidealsdeterminingmodelmonomialadoptallowingalternative
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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 multiple of generators using combinatorial methods. Then, we adopt a probabilistic approach via the \er\ type model, examining both homogeneous and non-homogeneous cases. This model offers an efficient alternative to exhaustive enumeration, allowing the study of dominance through small random samples, even in high-dimensional settings.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.