Related papers: On the Number of Distinct Multinomial Coefficients
In this paper, we study the distribution of difference of multiplicative and additive characters modulo $p$ at consecutive polynomial values. More precisely, for an interval $I$ over finite field and $0<m<1$, we investigate the following…
A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…
We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.
Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…
Below we discuss the partition of the space of real univariate polynomials according to the number of positive and negative roots and signs of the coefficients. We present several series of non-realizable combinations of signs together with…
In this paper we consider the computational complexity of the following problem. Let $f$ be a Boolean polynomial. What value of $f$, 0 or 1, is taken more frequently? The problem is solved in polynomial time for polynomials of degrees 1,2.…
In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…
We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…
We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…
We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…
We study polynomial identities of algebras with adjoined external unit. For a wide class of algebras we prove that adjoining external unit element leads to increasing of PI-exponent precisely to 1. We also show that any real number from the…
An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…
In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…
Much is known about binomial coefficients where primes are concerned, but considerably less is known regarding prime powers and composites. This paper provides two conjectures in these directions, one about counting binomial coefficients…
Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…
The projective degrees of strict partitions of n were computed for all n < 101 and the partitions with maximal projective degree were found for each n. It was observed that maximizing partitions for successive values of n "lie close to each…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
Polynomials known as Multiple Orthogonal Polynomials in a single variable are polynomials that satisfy orthogonality conditions concerning multiple measures and play a significant role in several applications such as Hermite-Pad\'e…
We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.