Related papers: Box polynomials and the excedance matrix

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

The vector space of all polynomial functions of degree $k$ on a box of dimension $n$ is of dimension ${n \choose k}$. A consequence of this fact is that a function can be approximated on vertices of the box using other vertices to higher…

Let us denote ${\cal V}$, the finite dimensional vector spaces of functions of the form $\psi(x) = p_n(x) + f(x) p_m(x)$ where $p_n(x)$ and $p_m(x)$ are arbitrary polynomials of degree at most $n$ and $m$ in the variable $x$ while $f(x)$…

Using ideas from automata theory we design a new efficient (deterministic) identity test for the \emph{noncommutative} polynomial identity testing problem (first introduced and studied in \cite{RS05,BW05}). We also apply this idea to the…

Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by…

It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…

Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…

Our companion work \cite{Stojnicl1BnBxasymldp} considers random under-determined linear systems with box-constrained sparse solutions and provides an asymptotic analysis of a couple of modified $\ell_1$ heuristics adjusted to handle such…

In this paper, we give some results on closed polynomials and factorially closed polynomial in $n$ variables. In particular, we give a characterization of factorially closed polynomials in $n$ variables over an algebraically closed field…

The type III Hermite $X_m$ exceptional orthogonal polynomial family is generalized to a double-indexed one $X_{m_1,m_2}$ (with $m_1$ even and $m_2$ odd such that $m_2 > m_1$) and the corresponding rational extensions of the harmonic…

The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…

We show that subsets of $\mathbb{R}^n$ of large enough Hausdorff and Fourier dimension contain polynomial patterns of the form \begin{align*} ( x ,\, x + A_1 y ,\, \dots,\, x + A_{k-1} y ,\, x + A_k y + Q(y) e_n ), \quad x \in…

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…

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…

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors…

We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…