Related papers: Polynomial quotient rings and Kronecker substituti…

We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…

In the classical theory, a famous by-product of the continued fraction expansion of quadratic irrational numbers $\sqrt{D}$ is the solution to Pell's equation for $D$. It is well-known that, once an integer solution to Pell's equation…

Using an elementary approach involving the Euler Beta function and the binomial theorem, we derive two polynomial identities; one of which is a generalization of a known polynomial identity. Two well-known combinatorial identities, namely…

For non-negative integers $k\leq n$, we prove a combinatorial identity for the $p$-binomial coefficient $\binom{n}{k}_p$ based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for…

Leopardi introduced the notion of a Kronecker quotient in [Paul Leopardi. A generalized FFT for Clifford algebras. Bulletin of the Belgian Mathematical Society, 11:663--688, 2005.]. This article considers the basic properties that a…

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 begin by introducing an extension of the traditional abundancy index to imaginary quadratic rings with unique factorization. After showing that many of the properties of the traditional abundancy index continue to hold in our extended…

We obtain new combinatorial identities for integral values of binary Krawtchouk polynomials $K^{2m}_p(x)$, $0\le p\le 2m$, by computing the characters of the $p$-exterior representations on certain elements of order 2 of $\mathrm{SO}(2m)$.…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

We introduce an expansion formula for elements in quantum cluster algebras associated to type A and Kronecker quivers with principal quantization. Our formula is parametrized by perfect matchings of snake graphs as in the classical case. In…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

Given an arbitrary sequence $(\alpha_1, \ldots, \alpha_n) \in \mathbb{C}^n$, we show that the degree-$n$ truncation of the formal exponential $\exp\bigl(-\sum_{k=1}^{\infty} \frac{\alpha_k}{k} x^k\bigr)$ produces a polynomial whose roots…

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…

In this paper, by using some families of special numbers and polynomials with their generating functions, we give various properties of these numbers and polynomials. These numbers are related to the well-known numbers and polynomials,…

In the paper, with the aid of the series expansions of the square or cubic of the arcsine function, the authors establish several possibly new combinatorial identities containing the ratio of two central binomial coefficients which are…

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

We develop an effective version of Kronecker's Theorem on the splitting of polynomials, based on asymptotic arguments proposed by the Chudnovsky brothers, coming from Hermite-Pad\'e approximation. In conjunction with Honda's proof of the…

This note is motivated by an old result of Kronecker on monic polynomials with integer coefficients having all their roots in the unit disc. We call such polynomials Kronecker polynomials for short. Let $k(n)$ denote the number of Kronecker…

We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…