Related papers: Binary Cyclotomic Polynomials: Representation via …
For a prime p and nonnegative integers n,k, consider the set A_{n,k}^{(p)}={x is in [0,1,...,n]: p^k||binom {n} {x}}. Let the expansion of n+1 in base p be: n+1=alpha_{0} p^{\nu}+alpha_{1}p^{nu-1}+...+alpha_{nu}, where 0<=alpha_{i}<=…
Despite the relevance of the binomial distribution for probability theory and applied statistical inference, its higher-order moments are poorly understood. The existing formulas are either not general enough, or not structured and…
It is a remarkable fact that for many statistics on finite sets of combinatorial objects, the roots of the corresponding generating function are each either a complex root of unity or zero. These and related polynomials have been studied…
Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…
We classify the irreducible unitary modules in category O for the rational Cherednik algebras of type G(r,1,n) and give explicit combinatorial formulas for their graded characters. More precisely, we produce a combinatorial algorithm…
We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…
In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.
Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The classical algorithm to solve this problem is based on a time memory trade-off. We will present an…
This paper examines with elementary proofs some interesting properties of numbers in the binary quadratic form $a^2+ab+b^2$, where $a$ and $b$ are non-negative integers. Key findings of this paper are (i) a prime number $p$ can be…
We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…
The multivariate Meixner polynomials are shown to arise as matrix elements of unitary representations of the $SO(d,1)$ group on oscillator states. These polynomials depend on $d$ discrete variables and are orthogonal with respect to the…
The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important…
Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in simple situations. This paper concerns binary radix systems, i.e., positional number systems with digits…
Analytic combinatorics studies the asymptotic behaviour of sequences through the analytic properties of their generating functions. This article provides effective algorithms required for the study of analytic combinatorics in several…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
For odd prime numbers $p < q$, let $\Phi_{pq} \in \mathbb{Z}[X]$ be the binary cyclotomic polynomial of order $pq$. In this paper, we prove that the second gap of $\Phi_{pq}$ is the maximum of $r-1$ and $p-r-1$, where $r$ is the remainder…
The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.
Let A,B denote binary forms of order d, and let C_{2r-1} = (A,B)_{2r-1} be the sequence of their linear combinants for r between 1 and (d+1)/2. It is known that C_1 and C_3 together determine the pencil generated by A and B, and hence…
In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…