Cyclotomic numerical semigroup polynomials with at most two irreducible factors
نویسندگان
چکیده
A numerical semigroup $S$ is cyclotomic if its polynomial $P_S$ a product of polynomials. The number irreducible factors (with multiplicity) the length $\ell(S)$ $S.$ We show that complete intersection $\ell(S)\le 2$. This establishes particular case conjecture Ciolan, Garc\'{i}a-S\'{a}nchez and Moree (2016) claiming every intersection. In addition, we investigate relation between embedding dimension
منابع مشابه
Classes of Polynomials Having Only One Non{cyclotomic Irreducible Factor
He noted then that the conjecture is true if n = p 1 2 or if n = p where p is a prime and r a positive integer. Calculations showed the conjecture also held for n 100. Recently, in a study of more general polynomials, the rst author [2] obtained further irreducibility results for f(x); in particular, he established irreducibility in the case that n+ 1 is a squarefree number 3 and in the case th...
متن کاملNumerical Semigroups, Cyclotomic Polynomials, and Bernoulli Numbers
We give two proofs of a folkore result relating numerical semigroups of embedding dimension two and binary cyclotomic polynomials and explore some consequences. In particular, we give a more conceptual reproof of a result of Hong et al. (2012) on gaps between the exponents of non-zero monomials in a binary cyclotomic polynomial. The intent of the author with this paper is to popularise cyclotom...
متن کاملThe Irreducibility of Weighted Sums of Polynomials Whose Irreducible Factors Are Cyclotomic
For any positive integer n, we define the polynomial γn(x) := ∑n i=0 x . For any integer k ≥ 2, let S = {n1, n2, . . . , nk} be a set of integers such that 0 < n1 < n2 < · · · < nk, and define the polynomial Γw(S)(x) := ∑k i=1 2ix γni(x), where each wi is a nonnegative integer and 2i ∈ {−1, 1}. Based solely on the integers wi and ni, we give sufficient conditions in all cases for the reducibili...
متن کاملOn computing factors of cyclotomic polynomials
For odd square-free n > 1 the cyclotomic polynomial Φn(x) satisfies the identity of Gauss 4Φn(x) = An − (−1)(n−1)/2nB2 n. A similar identity of Aurifeuille, Le Lasseur and Lucas is Φn((−1)x) = C n − nxD n or, in the case that n is even and square-free, ±Φn/2(−x) = C n − nxD n. Here An(x), . . . , Dn(x) are polynomials with integer coefficients. We show how these coefficients can be computed by ...
متن کاملCyclotomic Polynomials
If n is a positive integer, then the n cyclotomic polynomial is defined as the unique monic polynomial having exactly the primitive n roots of unity as its zeros. In this paper we start off by examining some of the properties of cyclotomic polynomials; specifically focusing on their irreducibility and how they relate to primes. After that we explore some applications of these polynomials, inclu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2021
ISSN: ['0037-1912', '1432-2137']
DOI: https://doi.org/10.1007/s00233-021-10197-8