Related papers: Power sum polynomials in a discrete tomography per…

We consider the set of monic degree $d$ real univariate polynomials $Q_d=x^d+\sum_{j=0}^{d-1}a_jx^j$ and its {\em hyperbolicity domain} $\Pi_d$, i.e. the subset of values of the coefficients $a_j$ for which the polynomial $Q_d$ has all…

Using $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, which was the subject of an earlier paper, $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, can be…

We say a power series $a_0+a_1q+a_2q^2+\cdots$ is \emph{multiplicative} if $n\mapsto a_n/a_1$ for positive integers $n$ is a multiplicative function. Given the Eisenstein series $E_{2k}(q)$, we consider formal multiplicative power series…

This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…

Let $(X,\Gamma)$ be a topological system, where $\Gamma$ is a nilpotent group generated by $T_1,\ldots, T_d$ such that for each $T\in \Gamma$, $T\neq e_\Gamma$, $(X,T)$ is weakly mixing and minimal. For $d,k\in \mathbb{N}$, let $p_{i,j}(n),…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

In this paper, we consider sums of three generalized $m$-gonal numbers whose parameters are restricted to integers with a bounded number of prime divisors. With some restrictions on $m$ modulo $30$, we show that a density one set of…

Let $F$ be a field of prime characteristic $p$ and let $q$ be a power of $p$. We assume that $F$ contains the finite field of order $q$. A $q$-polynomial $L$ over $F$ is an element of the polynomial ring $F[x]$ with the property that those…

Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…

For integer $m, p,$ we study tangent power sum $\sum^m_{k=1}\tan^{2p}\frac{\pi k}{2m+1}.$ We prove that, for every $m, p,$ it is integer, and, for a fixed p, it is a polynomial in $m$ of degree $2p.$ We give recurrent, asymptotical and…

We study the problem of recovering a collection of $n$ numbers from the evaluation of $m$ power sums. This yields a system of polynomial equations, which can be underconstrained ($m < n$), square ($m = n$), or overconstrained ($m > n$).…

We denote by $\mathcal{P}_q$ the vector space of functions from a finite field $\mathbb{F}_q$ to itself, which can be represented as the space $\mathcal{P}_q := \mathbb{F}_q[x]/(x^q-x)$ of polynomial functions. We denote by $\mathcal{O}_n…

We propose an iterative algorithm for the numerical computation of sums of squares of polynomials approximating given data at prescribed interpolation points. The method is based on the definition of a convex functional $G$ arising from the…

We define spatial CPD-semigroup and construct their Powers sum. We construct the Powers sum for general spatial CP-semigroups. In both cases, we show that the product system of that Powers sum is the product of the spatial product systems…

We introduce a certain discrete probability distribution $P_{n,m,k,l;q}$ having non-negative integer parameters $n,m,k,l$ and quantum parameter $q$ which arises from a zonal spherical function of the Grassmannian over the finite field…

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…

To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

We introduce Q-space, the tensor product of an index space with a primary space, to achieve a more general mathematical description of correlations in terms of q-tuples. Topics discussed include the decomposition of Q-space into a…