Related papers: Divisibility criteria and coefficient formulas for…
Ramanujan sums have attracted significant attention in both mathematical and engineering disciplines due to their diverse applications. In this paper, we introduce an algebraic generalization of Ramanujan sums, derived through polynomial…
We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we had introduced the distinction between periodic and…
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
Given a numerical semigroup $S$, we let $\mathrm P_S(x)=(1-x)\sum_{s\in S}x^s$ be its semigroup polynomial. We study cyclotomic numerical semigroups; these are numerical semigroups $S$ such that $\mathrm P_S(x)$ has all its roots in the…
We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…
In the present paper a new mean value theorem for polynomials of special form is obtained. The case of sums on vertices of a regular polygon is studied. A criterion for a certain equation to be satisfied is obtained.
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
We introduce and study the generalized cyclotomic polynomials $\Phi_{A,S,n}(x)$ associated with a regular system $A$ of divisors and an arbitrary set $S$ of positive integers. We show that all of these polynomials have integer coefficients,…
For odd square-free n > 1 the n-th cyclotomic polynomial satisfies an identity of Gauss. There are similar identity of Aurifeuille, Le Lasseur and Lucas. These identities all involve certain polynomials with integer coefficients. We show…
Ismail et al. (Constr. Approx. {\bf 15} (1999) 69--81) proved the positivity of some trigonometric polynomials with single binomial coefficients. In this paper, we prove some similar results by replacing the binomial coefficients with…
In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…
The $n^{th}$ cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Its coefficients are the subject of intensive study and some formulas are known for them. Here we are interested in formulas…
The problem of finding superintegrable Hamiltonians and their integrals of motion can be reduced to solving a series of compatibility equations that result from the overdetermination of the commutator or Poisson bracket relations. The…
We describe the $p$-divisibility transposition for the Fourier coefficients of Siegel modular forms. This provides a supplement to the result by Wilton for $p$-divisibility satisfied by the Ramanujan $\tau$-function.
We classify the polynomials with integral coefficients that, when evaluated on a group element of finite order $n$, define a unit in the integral group ring for infinitely many positive integers $n$. We show that this happens if and only if…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
How to handle division in systems that compute with logical formulas involving what would otherwise be polynomial constraints over the real numbers is a surprisingly difficult question. This paper argues that existing approaches from both…
The algebraic characterization of dual univariate interpolating subdivision schemes is investigated. Specifically, we provide a constructive approach for finding dual univariate interpolating subdivision schemes based on the solutions of…
We show that every monic polynomial of degree three with complex coefficients and no repeated roots is either a (vertical and horizontal) translation of $y=x^3$ or can be composed with a linear function to obtain a Ramanujan cubic. As a…