Related papers: A property of cyclotomic polynomials

Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…

Two infinite sequences of minimal surfaces in space are constructed using symmetry analysis. In particular, explicit formulas are obtained for the self-intersecting minimal surface that fills the trefoil knot.

For a polytope we define the {\em flag polynomial}, a polynomial in commuting variables related to the well-known flag vector and describe how to express the the flag polynomial of the Minkowski sum of $k$ standard simplices in a direct and…

For any irreducible quadratic polynomial f(x) in Z[x] we obtain the estimate log l.c.m.(f(1),...,f(n))= n log n + Bn + o(n) where B is a constant depending on f.

We explore some interesting features of the characteristic polynomial of the Cartan matrix of a simple Lie algebra. The characteristic polynomial is closely related with the Chebyshev polynomials of first and second kind. In addition, we…

We present a primality criterium based on congruences for cyclotomic polynomials, and point out a way to generalize our result in order to obtain a family of similar criteria. No practical use is aimed however.

We study arithmetic and asymptotic properties of polynomials provided by $Q_n(x):= x \sum_{k=1}^n k \, Q_{n-k}(x)$ with initial value $Q_0(x)=1$. The coefficients satisfy a central limit theorem and a local limit theorem involving Fibonacci…

Let $F$ be an $n$-point set in $\mathbb{K}^d$ with $\mathbb{K}\in\{\mathbb{R},\mathbb{Z}\}$ and $d\geq 2$. A (discrete) X-ray of $F$ in direction $s$ gives the number of points of $F$ on each line parallel to $s$. We define…

We study a class of monic-palindromic polynomials that we call staircase palindromic polynomials. Specifically, suppose $S(x, n, h)$ is a polynomial of degree n with the special form: $S(x; n; h) = x^n + 2x^{n-1} + 3x^{n-2} + \dots + (h -…

The algebra of holomorphic polynomial Sp_{2n}-invariants of k complex 2n by 2n matrices (under diagonal conjugation action) is generated by the traces of words in these matrices and their symplectic adjoints. No concrete minimal generating…

We prove that for every $\varepsilon>0$ and a nonnegative integer $\omega$ there exist primes $p_1,p_2,\ldots,p_\omega$ such that for $n=p_1p_2\ldots p_\omega$ the height of the cyclotomic polynomial $\Phi_n$ is at least…

A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…

A numerical semigroup $S$ is cyclotomic if its semigroup polynomial $P_S$ is a product of cyclotomic polynomials. The number of irreducible factors of $P_S$ (with multiplicity) is the polynomial length $\ell(S)$ of $S.$ We show that a…

In this paper, we investigate the $p$-rank of Jacobian of cyclotomic function field $K_m$. Our goal in this paper is to give the necessary and sufficient condition $m$ such that $K_m$ is ordinary.

In this paper one extends the binomial and trinomial coefficients to the concept of 'k-nomial' coefficients, and one obtains some properties of these. As an application one generalizes Pascal's triangle.

We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.

Let $m$ and $k \geq 2$ be positive integers. We show that polynomial $P = (1+x)^m(1+x^k)$ is strongly unimodal (frequently known as {\it log concave\/}) if and only if $m \geq k^2 -3$; this is also the criterion for $P$ to be merely…

We study several polynomial Hamiltonian systems of PIV-type (including the mixed case quasi-PIV), and show that via the iterative process of polynomial regularisation, it is possible to identify the "minimal" Hamiltonian system. The…

It is shown that the set of decimal palindromes is an additive basis for the natural numbers. Specifically, we prove that every natural number can be expressed as the sum of forty-nine (possibly zero) decimal palindromes.

A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…