Related papers: A Generalization of the Digital Binomial Theorem

We establish an analogue of the fundamental theorem of algebra for polynomial matrix equations, in which the matrices-coefficients and unknown matrix are assumed to be circulant matrices.

In this paper, we prove analogues of the Dirichlet theorem on arithmetic progressions and the Siegel--Walfisz theorem for the digital reverses of primes for arbitrary bases, which the authors obtained in the previous paper but only for…

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

We consider a number of generalizations of the $\beta$-extended MacMahon Master Theorem for a matrix. The generalizations are based on replacing permutations on multisets formed from matrix indices by partial permutations or derangements…

We develop a fractional extension of the classical binomial distribution and the associated Bernstein operator, formulated within the framework of the generalized binomial theorem (Hara and Hino [Bull.\ London Math.\ Soc. \textbf{42}…

Using the quantum double method, we construct a universal R-matrix for the quantization of the Lie superalgebra D(2,1,x). We use this result to construct a link invariant and show it coincides with a specialization of Kauffman's Dubrovnik…

The famous Drinfeld-Kohno theorem for simple Lie algebras states that the monodromy representation of the Knizhnik-Zamolodchikov equations for these Lie algebras expresses explicitly via R-matrices of the corresponding Drinfeld-Jimbo…

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

In this paper, we prove that an uncountable quantity of real numbers generated by digital pattern sequences gives the transcendental number. This result gives a generalization of Main theorem in Morton and Mourant [MortM], which state that…

The main object of this paper is to investigate a new class of the generalized Hurwitz type poly-Bernoulli numbers and polynomials from which we derive some algorithms for evaluating the Hurwitz type poly-Bernoulli numbers and polynomials.…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

We construct an algorithm that reduces the complexity for computing generalized Dedekind sums from exponential to polynomial time. We do so by using an efficient word rewriting process in group theory.

We present a new and simple proof of a theorem due to Kaplansky which unifies theorems of Kolchin and Levitzki on triangularizability of semigroups of matrices. We also give two different extensions of the theorem. As a consequence, we…

In this sequel to arxiv:arXiv:1012.0835 we develop Bezout type theorems for semidegrees (including an explicit formula for {\em iterated semidegrees}) and an inequality for subdegrees. In addition we prove (in case of surfaces) a Bernstein…

In this paper, we establish some formulas for the noncentral Tanny-Dowling polynomials including sums of products and explicit formulas which are shown to be generalizations of known identities. Other important results and consequences are…

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

Using a sums of squares formula for two variable polynomials with no zeros on the bidisk, we are able to give a new proof of a representation for distinguished varieties. For distinguished varieties with no singularities on the two-torus,…

This article discusses a more general and numerically stable Rybicki Press algorithm, which enables inverting and computing determinants of covariance matrices, whose elements are sums of exponentials. The algorithm is true in exact…

In the theory of generalized cluster algebras, we build the so-called cluster formula and $D$-matrix pattern. Then as applications, some fundamental conjectures of generalized cluster algebras are solved affirmatively.

A generalization of the generating function for Gegenbauer polynomials is introduced whose coefficients are given in terms of associated Legendre functions of the second kind. We discuss how our expansion represents a generalization of…