Commutative Algebra · arXiv:2611.16362 v1 · submitted 12 Nov 2026 · 9 references
On the h-polynomials of cyclotomic standard graded Cohen-Macaulay rings
The paper says
“We say that a standard graded algebra is cyclotomic if all roots of its h-polynomial lie on the complex unit circle.”
more of the abstract
We study which products of cyclotomic polynomials can occur as h-polynomials of standard graded Cohen–Macaulay algebras without being of complete intersection type. For each fixed positive integer a, we reduce the nonexistence problem for multiplicities ap over all sufficiently large primes p to finitely many cases. Combining this reduction with explicit constructions, we completely characterize the positive integers k for which such a polynomial of multiplicity 8k exists: precisely those satisfying \[k\notin\{1,2,3,6\}u̧p\{p:p\ge7\text is prime\}u̧p\{3p:p\ge17\text is prime\}.\]
from the abstract
Pith says
Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
Holds up, with conditions. The 8k classification is real and the Theorem 1.2 reduction is reusable, but the only-if half hangs on a finite search the paper describes rather than ships; treat it as conditional until the computation is reproducible. This line is wrong
4 major objections · 16 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 9 references say.
The paper says, at Appendix A, Lemma A.1(i)
The review did not quote this passage.
Pith says: Objection 1 of 4 · major
The enumeration for n ≤ 99 is described as: 'Enumerate these finite sequences, retain those satisfying Macaulay's inequalities, and factor the corresponding polynomials over Q. Apply Lemma 2.2 whenever all irreducible factors are cyclotomic.' This is also not reproducible without code or a detailed list.
more of objection 1
However, the n ≤ 99 case is less load-bearing because the main theorem concerns 8k, and the small n are only used for the excluded k in N (k=1,2,3,6,7) and for the partial results in Section 5. The paper could be accepted without this if the main result's nonexistence for k≥11 is fully verifiable, but currently it is not.
The paper says, at Appendix A, Lemma A.1(ii)-(iii)
The review did not quote this passage.
Pith says: Objection 2 of 4 · major
The bound m ≤ 2φ(m)^2 is used to limit the search. This bound is not proved or referenced in the paper. The authors state 'm ≤ 2φ(m)^2 ≤ 2(c-1)^2'. For c up to 24 (when a=24, ℓ=1 gives c=24), this gives m ≤ 2*23^2 = 1058, which is manageable but still large.
more of objection 2
The bound m ≤ 2φ(m)^2 is not standard; the standard bound is φ(m) ≥ √(m/2) for m>6, which gives m ≤ 2φ(m)^2. But this is not stated. The paper should either provide a reference or a short proof. More importantly, the enumeration of all products of cyclotomic polynomials with degree ≤ c-1 and value at 1 = c is nontrivial because the exponents e_m can be large. The description 'the degree bound also limits the exponents' is insufficient. For example, Φ_2(t) has degree 1 and value 2, so to achieve c=24, one could have up to 24 factors of Φ_2, giving degree 24, which exceeds c-1=23. So the degree bound does limit exponents, but the enumeration of all combinations of cyclotomic polynomials with degree ≤ c-1 and product value c is a finite but nontrivial combinatorial search. The paper does not describe how this search was implemented or how exhaustiveness was ensured. This is a critical gap.
The paper says, at §4.4, Lemma 4.8
The review did not quote this passage.
Pith says: Objection 3 of 4 · major
The proof of Lemma 4.8 for p=17,19,23 contains a step that I find unclear. The authors write: 'If 2s > R, then minimality of s implies h_i ≥ i+1 for 0 ≤ i ≤ ⌊R/2⌋. Since A(t)Φ_p(t) is palindromic, R ≥ p+23, and p+23 is even, we have 24p = ∑ h_i ≥ (⌊R/2⌋+1)^2 ≥ ((p+25)/2)^2 > 24p, a contradiction.'
more of objection 3
The inequality ∑ h_i ≥ (⌊R/2⌋+1)^2 assumes that h_i ≥ i+1 for all i up to ⌊R/2⌋, and then uses palindromicity to double the sum? Actually, the sum from 0 to R is at least 2∑_{i=0}^{⌊R/2⌋} (i+1) - (if R even, the middle term counted once). The expression (⌊R/2⌋+1)^2 is the sum of the first (⌊R/2⌋+1) odd numbers? Let's check: ∑_{i=0}^{m} (i+1) = (m+1)(m+2)/2. Twice that minus the middle gives roughly (m+1)(m+2) - something. The claimed bound (⌊R/2⌋+1)^2 is not obviously correct. For R=40, ⌊R/2⌋=20, (21)^2=441, while 2∑_{i=0}^{20} (i+1)=2*231=462. So the bound is actually weaker, so the inequality might still hold, but the derivation is sloppy. More importantly, the authors then claim 'R ≥ p+23, and p+23 is even, we have ... ≥ ((p+25)/2)^2 > 24p'. For p=17, p+23=40, (p+25)/2=21, 21^2=441, 24p=408, so 441>408, contradiction. For p=19, p+23=42, (p+25)/2=22, 22^2=484, 24p=456, 484>456. For p=23, p+23=46, (p+25)/2=24, 24^2=576, 24p=552, 576>552. So the numerical check works, but the derivation of the bound should be clarified. This is a minor issue in a major comment because the lemma is load-bearing for the p=17,19,23 cases, but the argument can be fixed with a clearer inequality.
The paper says, at §4.4, Lemma 4.8
The review did not quote this passage.
Pith says: Objection 4 of 4 · major
In the same proof, the authors write: 'Suppose otherwise, and put P_j = ∑_{i=0}^j a_i, with P_j = 0 for j<0. For 0≤j≤d, the coefficient formula for h_j implies P_j = h_j + P_{j-p}. Since h_j ≥ 0, induction on j shows that P_j ≥ h_j ≥ 0.
more of objection 4
Splitting the coefficients of A(t) into three consecutive blocks and using palindromicity, we obtain 24 = A(1) = ∑_{i=0}^{s-p-1} a_i + ∑_{i=s-p}^{s-1} a_i + ∑_{i=s}^d a_i = P_{s-p-1} + h_{s-1} + P_{d-s} ≥ s + h_{d-s}.' The step 'P_{d-s} ≥ h_{d-s}' is claimed but not justified. The induction argument gives P_j ≥ h_j for all j, but here we have P_{d-s} where d-s could be less than p? Actually, the induction works for all j, so P_{d-s} ≥ h_{d-s} is valid. Then the authors claim 'h_{d-s} ≥ min{d-s+1, s}'. This is because if d-s ≤ s, then by minimality of s, h_{d-s} ≥ d-s+1; if d-s > s, then h_{d-s} ≥ h_s = s (since the sequence is nonincreasing after s). This is plausible but should be stated explicitly. The overall argument is sound but the presentation is compressed. This is a minor clarity issue, not a fatal error.
16 minor objections
The paper says, at §1, Introduction
Pith says: minor objection 1 of 16
The definition of N in (1) uses 'p: p≥7 prime' and '3p: p≥17 prime'. For clarity, note that 3p for p=17,19,23 are included, but these are also covered by the separate treatment in §4.4. This is fine.
The paper says, at §2.1, Lemma 2.2
Pith says: minor objection 2 of 16
The definition of b_n(f(t)) uses e_{nr}. It might be helpful to note that the sum is over r≥1 such that nr is an index where e_{nr} is defined (i.e., e_m=0 for m not in the support).
show 14 more
The paper says, at §2.2, Lemma 2.5
Pith says: minor objection 3 of 16
The reference [7, Proposition 3.2] is cited for the bound deg f(t) ≤ f(1)-1. The paper also notes that this follows from the absence of internal zeros for CM-realizable polynomials. This is fine.
The paper says, at §3, Lemma 3.2
Pith says: minor objection 4 of 16
The proof says 'If d=0, then A(t)=1; if d=1, then A(t)=1+t. The assertion follows in both cases.' It would be clearer to explicitly state that for d=0, deg=0 ≤ a-1 holds because a≥1; for d=1, deg=1 ≤ a-1 requires a≥2, which holds because A(1)=a and A(t) is a product of cyclotomic polynomials with degree 1, so a=2. This is fine.
The paper says, at §3, Lemma 3.3
Pith says: minor objection 5 of 16
The proof uses the inequality 2∑_{i=0}^{p-1} (i+1) = p(p+1) > ap. This requires a < p+1, which holds because p > a. Good.
The paper says, at §3, Lemma 3.4
Pith says: minor objection 6 of 16
The notation 'α = p+r-s' appears. It might be helpful to note that α is the smallest exponent in W(t) when W(t) ≠ 0.
The paper says, at §3, Lemma 3.5
Pith says: minor objection 7 of 16
The final inequality 'a = qs + C(1) > qs + α = p + r + (q-1)s ≥ p > a' uses that α = p+r-s, so qs+α = qs + p + r - s = p + r + (q-1)s. The last inequality uses (q-1)s ≥ 0 and r ≥ 0, so p+r+(q-1)s ≥ p. This is correct.
The paper says, at §4.1, Proposition 4.1
Pith says: minor objection 8 of 16
The coefficient sequence of S_0(t) is given as (1,4,6,5,5,6,4,1). It would be helpful to note that this is palindromic and has length 8, so degree 7. The check of Macaulay's inequalities is described briefly. This is acceptable.
The paper says, at §4.2, Theorem 4.3
Pith says: minor objection 9 of 16
The proof for k≥7 says 'the only new increases are from 12 to 15 and from 15 to 16'. It would be clearer to state the coefficient sequence explicitly for general k. The description is sufficient.
The paper says, at §4.3, Proposition 4.4
Pith says: minor objection 10 of 16
The verification of Macaulay's inequalities for F_{p,q}(t) is quite involved. The paper provides a table for h_7, h_8 and then uses Lemma 2.6 for 8 ≤ i ≤ p-2. The bounds for the remaining indices p-1 to p+5 are given in a table. This is thorough but dense. A reader might benefit from a brief explanation of how the coefficient formula leads to the bounds. However, the level of detail is acceptable for a research paper.
The paper says, at §4.5, Proposition 4.11
Pith says: minor objection 11 of 16
The three polynomials Q_7, Q_11, Q_13 are given. It might be helpful to note that these correspond to k=21,33,39 respectively, as used in the proof of Theorem 1.3.
The paper says, at §5.4, Gorenstein realizability
Pith says: minor objection 12 of 16
The paper states 'In this subsection, the ground field is Q.' This is important because the g-theorem and Adiprasito's result are over Q. The paper should clarify that the Gorenstein realizability results are over Q, while the CM realizability results are over any field (as per Theorem 2.4). This is stated but could be emphasized.
The paper says, at Appendix A, Lemma A.1
Pith says: minor objection 13 of 16
The description of the finite verification for (i) says 'Enumerate these finite sequences, retain those satisfying Macaulay's inequalities, and factor the corresponding polynomials over Q.' Factoring polynomials over Q from coefficient sequences is not straightforward: given a coefficient sequence, one must construct a polynomial and factor it.
more of objection 13
The paper does not explain how this is done or how one ensures that all irreducible factors are cyclotomic. This is a gap, but since the main result does not depend on the n≤99 enumeration (except for small k), it is not load-bearing for the main theorem. However, for completeness, the authors should provide more detail or code.
The paper says, at General
Pith says: minor objection 14 of 16
The paper uses the term 'CM-realizable' to mean 'is the h-polynomial of a standard graded Cohen-Macaulay algebra'. This is defined in the introduction. The equivalence with M-sequences is given in Theorem 2.4. This is clear.
The paper says, at General
Pith says: minor objection 15 of 16
The paper uses 'type CI' to mean a product of Ψ_m(t) polynomials. This is defined in Definition 2.1. The characterization via b_n in Lemma 2.2 is useful.
The paper says, at References
Pith says: minor objection 16 of 16
Reference [7] is listed as 'arXiv:2511.07937, 2025'. This is a preprint. The paper cites it for the degree bound in Lemma 2.5 and for the non-Cohen-Macaulay classification. This is acceptable as long as the preprint is publicly available. However, the paper should note that [7] is a preprint, not yet published.
What would settle it
Independently reimplement the Appendix A enumeration, e.g. in SageMath: for each a in {8,24} and each divisor ell of a with c = a/ell, enumerate all exponent vectors (e_m) such that sum e_m*phi(m) <= c-1 and prod Phi_m(1)^{e_m} = c, using m <= 2*phi(m)^2 for the finite factor range. For a=8, test C(t)*Psi_11(t); for a=24, test C(t)*Psi_29(t); and for Lemma A.1(iii), test C(t)*Psi_p(t) for p=17,19,23. Verify that no candidate has an M-sequence coefficient sequence and a negative b_n under Lemma 2.2. Publishing the full candidate list, or a certificate for the empty intersection, would settle whether the concern lands.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 13 Nov 2026
- Reader holds up, with conditions
- Skeptic agrees
- Editor wrote the verdict above
- Referee major revision: 4 major objections, 16 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
The honest headline: Theorem 1.3 is a genuine classification and Theorem 1.2 is a genuinely reusable structural result, but the only-if direction rests at its terminal step on a finite search that is described, not shipped. Treat the classification as conditional until that computation is reproducible.
What is actually new: Higashitani-Ueyama handled multiplicities 1,4,6 and primes, and gave non-CM realizations for composites. The Cohen-Macaulay version changes the answer, and the full characterization at 8k (forbidden set {1,2,3,6} plus primes at least 7 plus 3p for primes p at least 17) is not in the literature. Theorem 1.2 is the core: for fixed a, nonexistence at multiplicity ap over all sufficiently large primes reduces to finitely many pairs (ell, C(t)). That is a reusable tool.
The existence side is explicit and checkable. Theorems 4.2, 4.3, 4.6 and Proposition 4.11 give concrete products, and Lemma 2.7 provides a clean non-type-CI certificate that gets reused honestly throughout. I walked the Section 3 chain, including the flat-interval argument in Lemma 3.3 and the W(t)=0 elimination in Lemma 3.5, and found no false step. Section 5 scopes the 2k/4k situation honestly; the authors state those limitations themselves, and I do not read them as hidden defects.
Where it is soft: the only-if half of Theorem 1.3 collapses at its last step onto Lemma A.1(ii)-(iii), the assertion that "no candidate meets both required conditions" for a in {8,24} and for p = 17,19,23. The appendix gives the enumeration bounds (phi(m) <= c-1, m <= 2(c-1)2, degree limit on exponents), so a determined reader could reimplement the search. But no code, no logs, no candidate lists are shipped. A single missed or misclassified candidate overturns the result: for a=8, ell=1, a surviving C(t) would produce multiplicity 88, contradicting the theorem for k=11. Lesser points: several per-example Macaulay checks (Propositions 4.1, 4.11, the Section 5 tables) are given as "direct computation" without intermediates, and the exact cutoff for the Lemma 2.2 bn checks is undocumented. These are minor; the shipping of the search is the substantive gap.
For whom: anyone tracking the cyclotomic Hilbert-series thread (Borzi-D'Alì, Braun-Liu, Higashitani-Ueyama). It deserves a serious referee, yes, sent to review with the requirement that a revision ship the search code or machine-checked certificates, or at minimum the complete excluded candidate lists. My own verdict: accept conditionally on exactly that.
The strongest objection
The only-if direction of Theorem 1.3 is not established by a closed-form argument. For k=p with p>=11, the sole exclusion is Theorem 1.2 with a=8 together with Lemma A.1(ii); for k=3p with p>=29, the sole exclusion is Theorem 1.2 with a=24 together with Lemma A.1(ii); and the cases p=17,19,23 rest on Lemma 4.8 plus Lemma A.1(iii). The reduction chain itself appears coherent, but the terminal step in each case is the Appendix A assertion 'No candidate meets both required conditions.' The appendix states the enumeration bounds (deg C(t) <= a/ell - 1, phi(m) <= c-1, and m <= 2*phi(m)^2) but ships no code, no logs, and no candidate lists, and it does not document the exact cutoff used for the Lemma 2.2 b_n checks or the implementation of Macaulay's inequalities. Since the infinite nonexistence families of Theorem 1.3 collapse onto this finite search, a single missed or misclassified candidate would falsify the classification: for example, a surviving C(t) for a=8, ell=1 would produce a CM-realizable non-type-CI product of multiplicity 88, directly contradicting the theorem for k=11. I found no internal inconsistency in the reduction chain; the vulnerable premise is precisely the exhaustiveness and correctness of the Appendix A computation.
The reader's weakest assumption and mine coincide. The existence direction of Theorem 1.3 is supported by explicit constructions whose coefficient sequences can be checked directly, and the reduction lemmas in Sections 3 and 4 appear internally consistent. However, the only-if direction has no independent argument for the infinite excluded families: every family of the form 8p for p>=11, 24p for p>=29, and the exceptional 24p cases reduces to a finite search that is asserted but not shipped. This is a genuine correctness risk rather than a mere style issue, because Theorem 1.3 is a complete classification and the nonexistence claims are precisely the unverified part. If the independent reimplementation reproduces the empty intersection, the central claim becomes as secure as the rest of the proof and the paper could be accepted; until then, the conditional verdict is appropriate. I therefore recommend no change to the reader's verdict.
The referee's report
If correct, the paper provides a complete classification for a nontrivial infinite family of multiplicities, which is a significant advance over the previous work [7] that handled the non-Cohen-Macaulay case. The reduction theorem (Theorem 1.2) is a clever technique that may be applicable to other values of a. The constructions are explicit and the nonexistence arguments are systematic. The paper also gives partial results for other multiplicities and discusses Gorenstein realizability.
Pith's reading of the paper (a machine's summary, not the authors')
Every standard graded ring has a Hilbert series that records the dimensions of its graded pieces. For a Cohen-Macaulay ring the series is a rational function whose numerator is the h-polynomial, and the value of that polynomial at t=1 is the multiplicity. This paper studies h-polynomials whose roots all lie on the unit circle. Kronecker's theorem says such polynomials are products of cyclotomic polynomials, the factors that encode roots of unity.
Some products are called complete intersections because they factor into geometric series factors. The paper asks when a non-complete-intersection product can still be the h-polynomial of a Cohen-Macaulay ring with a given multiplicity. By Macaulay's theorem, this happens exactly when the coefficient sequence satisfies a finite list of inequalities known as an M-sequence.
The main theorem settles all multiplicities of the form 8k. A non-complete-intersection Cohen-Macaulay realization exists exactly when k is not 1, 2, 3, or 6, not a prime at least 7, and not 3 times a prime at least 17. The proof combines a reduction and constructions. The reduction shows that for any fixed a and all sufficiently large primes p, any example of multiplicity ap forces a small finite list of candidate polynomials. The constructions provide explicit products for every allowed value, with Macaulay's inequalities checked either directly or through a described finite search. An appendix records the finite checks that exclude the remaining exceptional cases.
Core claim. Theorem 1.3: 'Then there exists a product f(t) of cyclotomic polynomials which is CM-realizable and non-type-CI and satisfies f(1)=8k if and only if k not in N', where N = {1,2,3,6} union {p : p >= 7 prime} union {3p : p >= 17 prime}. If correct, the paper completely determines for every k whether a Cohen-Macaulay realization exists.
The premise it rests on. The load-bearing premise is the correctness and exhaustiveness of the finite computations reported in Appendix A, especially Lemma A.1(ii)-(iii). These searches eliminate the infinite families with a=8 (p >= 11) and a=24 (p >= 29), and the exceptional cases p=17,19,23; the main classification collapses if any candidate was missed or misclassified. The paper describes the enumeration, including the degree bound m <= 2*phi(m)^2, but ships no code, logs, or complete candidate lists, so the nonexistence claim cannot be checked by a reader without reimplementing the search. The most fragile spot is the Appendix claim 'No candidate meets both required conditions'.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
We say that a standard graded algebra is cyclotomic if all roots of its h-polynomial lie on the complex unit circle. We study which products of cyclotomic polynomials can occur as h-polynomials of standard graded Cohen–Macaulay algebras without being of complete intersection type. For each fixed positive integer a, we reduce the nonexistence problem for multiplicities ap over all sufficiently large primes p to finitely many cases. Combining this reduction with explicit constructions, we completely characterize the positive integers k for which such a polynomial of multiplicity 8k exists: precisely those satisfying \[k\notin\{1,2,3,6\}u̧p\{p:p\ge7\text is prime\}u̧p\{3p:p\ge17\text is prime\}.\]
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-11-13
The authors' main claim, as the classifier picked it out 1.00
“Combining this reduction with explicit constructions, we completely characterize the positive integers $k$ for which such a polynomial of multiplicity $8k$ exists: precisely those satisfying \[k\notin\{1,2,3,6\}\cup\{p:p\ge7\text{ is prime}\}\cup\{3p:p\ge17\text{ is prime}\}.\]”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.33 · human participants 0.01 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.84 · compares with prior results 0.15 · mentions code or data availability 0.02
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| We say that a standard graded algebra is cyclotomic if all roots of its $h$-polynomial lie on the complex unit circle. | background 1.00 | 0.36 | 0.02 | asserted 0.99 |
| We study which products of cyclotomic polynomials can occur as $h$-polynomials of standard graded Cohen--Macaulay algebras without being of complete intersection type. | contribution 0.98 | 0.88 | 0.06 | asserted 0.68 |
| For each fixed positive integer $a$, we reduce the nonexistence problem for multiplicities $ap$ over all sufficiently large primes $p$ to finitely many cases. | method 0.89 | 0.94 | 0.05 | asserted 1.00 |
| Combining this reduction with explicit constructions, we completely characterize the positive integers $k$ for which such a polynomial of multiplicity $8k$ exists: precisely those satisfying \[k\notin\{1,2,3,6\}\cup\{p:p\ge7\text{ is prime}\}\cup\{3p:p\ge17\text{ is prime}\}.\] | result 0.99 | 0.95 | 0.80 | asserted 1.00 |
What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 3,825 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
References (9)
- [7] A. Higashitani and K. Ueyama, On theh-polynomials of cyclotomic standard graded commutative algebras, arXiv:2511.07937, 2025 on PitharXiv
- [1] K. Adiprasito, Combinatorial Lefschetz theorems beyond positivity, arXiv:1812.10454, 2018 on PithPith's reviewarXiv
- [2] L. J. Billera and C. W. Lee, A proof of the sufficiency of McMullen’s conditions forf-vectors of simplicial convex polytopes,J. Combin. Theory Ser. A31(1981), 237–255 on Pith
- [3] A. Borzì and A. D’Alì, Graded algebras with cyclotomic Hilbert series,J. Pure Appl. Algebra225 (2021), no. 12, 106764 on Pith
- [4] B. Braun and F. Liu,h ∗-polynomials with roots on the unit circle,Exp. Math.30(2021), no. 3, 332–348 on Pith
- [5] W. Bruns and J. Herzog,Cohen–Macaulay Rings, revised ed., Cambridge Studies in Advanced Math- ematics, vol. 39, Cambridge University Press, Cambridge, 1998 on Pith
- [6] E.-A.Ciolan, P.A.García-Sánchez, andP.Moree, Cyclotomicnumericalsemigroups,SIAM J. Discrete Math.30(2016), no. 2, 650–668 on Pith
- [8] C. Sanna, A survey on coefficients of cyclotomic polynomials,Expo. Math.40(2022), no. 3, 469–494 on Pith
- [9] R. P. Stanley, The number of faces of a simplicial convex polytope,Adv. Math.35(1980), 236–238. Department of Pure and Applied Mathematics, Graduate School of Information Science and Technology, Osaka University, Suita, Osaka 565-0871, Japan Email address:higashitani@ist.osaka... on Pith
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment