Related papers: Multiple polylogarithm values at roots of unity

We investigate several families of multiple orthogonal polynomials associated with weights for which the moment generating functions are hypergeometric series with slightly varying parameters. The weights are supported on the unit interval,…

This paper consists of three parts: (I) To develop general theory of a (large) class of central simple finite dimensional algebras and answering some natural questions about them (that in general situation it is not even clear how to…

In this paper we consider iterated integrals of multiple polylogarithm functions and prove some explicit relations of multiple polylogarithm functions. Then we apply the relations obtained to find numerous formulas of alternating multiple…

Fourier series in orthogonal polynomials with respect to a measure $\nu$ on $[-1,1]$ are studied when $\nu$ is a linear combination of a generalized Jacobi weight and finitely many Dirac deltas in $[-1,1]$. We prove some weighted norm…

We consider the set of monic real univariate polynomials of a given degree $d$ with non-vanishing coefficients, with given signs of the coefficients and with given quantities $pos$ of their positive and $neg$ of their negative roots (all…

For each positive integer n this paper considers a one-parameter family of complex-valued measures on the symmetric group S_n, depending on a complex parameter z. For parameter values z=p^f a prime power, this measure describes splitting…

Let $k\leq n$. Each polynomial $p\in\oR[x_1,...,x_n]$ can be uniquely written as $p=\sum_{\mu}\mu p_{\mu}$, where $\mu$ ranges over the set $M$ of all monomials in $\oR[x_1,...,x_k]$ and where $p_{\mu}\in\oR[x_{k+1},...,x_n]$. If $p$ is…

Determining the weight distribution of a linear code is a classical and fundamental topic in coding theory that has been extensively investigated. Repeated-root cyclic codes, which form a significant subclass of error-correcting codes, have…

Newton's identities provide a way to express elementary symmetric polynomials in terms of power polynomials over fields of characteristic zero. In this article, we study the failure of this relation in positive characteristic and what can…

Almost nothing is known about the parity of the partition function $p(n)$, which is conjectured to be random. Despite this expectation, Ono surprisingly proved the existence of infinitely many linear dependence congruence relations modulo 4…

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

Polynomial relations for generators of $su(2)$ Lie algebra in arbitrary representations are found. They generalize usual relation for Pauli operators in spin 1/2 case and permit to construct modified Holstein-Primakoff transformations in…

It is shown that there are infinitely many formulas to calculate multiplicities of weights participating in irreducible representations of $A_N$ Lie algebras. On contrary to recursive character of Kostant and Freudenthal multiplicity…

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…

We investigate the asymptotic behavior of a family of multiple orthogonal polynomials that is naturally linked with the normal matrix model with a monomial potential of arbitrary degree $d+1$. The polynomials that we investigate are…

This paper investigates the expected number of complex roots of nonlinear equations. Those equations are assumed to be analytic, and to belong to certain inner product spaces. Those spaces are then endowed with the Gaussian probability…

We present a new algorithm for computing $m$-th roots over the finite field $\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\M(n)\log (p)…

One of the generalizations of multiple zeta values is the $q$-version, and in the case of finite sums, they may be expressed explicitly in polynomial form. Several results have been found when the powers of the factors in the denominator…