Related papers: Computing polynomial conformal models for low-degr…
Answering a question of A.Zygmund in \cite{MR} G.MacLane and L.Rubel described boundedness of $L_2$-norm w.r.t. the argument of $\log |B|$, where $B$ is a Blaschke product. We generalize their results in several directions. We describe…
We propose a novel way of computing surface folding maps via solving a linear PDE. This framework is a generalization to the existing quasiconformal methods and allows manipulation of the geometry of folding. Moreover, the crucial quantity…
It is proven that for any representation over a field of characteristic 0 of the non-abelian semidirect product of a cyclic group of prime order p and the group of order 3 the corresponding algebra of polynomial invariants is generated by…
The computation of the numerical index of a Banach space is an intriguing problem, even in case of two-dimensional real polyhedral Banach spaces. In this article we present a general method to estimate the numerical index of any…
We design quasi-interpolation operators based on piecewise polynomial weight functions of degree less than or equal to $p$ that map into the space of continuous piecewise polynomials of degree less than or equal to $p+1$. We show that the…
In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…
The polynomial ring $B$ in infinitely many indeterminates $(x_1,x_2,\ldots)$, with rational coefficients, has a vector space basis of Schur polynomials, parametrized by partitions. The goal of this note is to provide an explanation of the…
In this technical report, certain interesting classification of arithmetical functions is proposed. The notion of additively decomposable and multiplicatively decomposable arithmetical functions is proposed. The concepts of arithmetical…
This note provides truncated formulae with explicit error terms to compute Euler products over primes in arithmetic progressions of rational fractions. It further provides such a formula for the product of terms of the shape $F(1/p, 1/p^s)$…
We introduce a problem class we call Polynomial Constraint Satisfaction Problems, or PCSP. Where the usual CSPs from computer science and optimization have real-valued score functions, and partition functions from physics have monomials,…
Let $\rho$ be a metric on the set $X=\{1,2,\dots,n+1\}$. Consider the $n$-dimensional polytope of functions $f:X\rightarrow \mathbb{R}$, which satisfy the conditions $f(n+1)=0$, $|f(x)-f(y)|\leq \rho(x,y)$. The question on classifying…
We propose a sufficient condition for invertibility of a polynomial mapping function defined on a cube or simplex. This condition is applicable to finite element analysis using curved meshes. The sufficient condition is based on an analysis…
We present a method for constructing superoscillatory functions the superoscillatory part of which approximates a given polynomial with arbitrarily small error in a fixed interval. These functions are obtained as the product of the…
Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead employ the technique of adaptive analysis to give an improvement…
A study of products of factorials modulo p and complete residues.
A bilinear quadrature numerically evaluates a continuous bilinear map, such as the $L^2$ inner product, on continuous $f$ and $g$ belonging to known finite-dimensional function spaces. Such maps arise in Galerkin methods for differential…
We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…
The binary primitive triple-error-correcting BCH code is a cyclic code of minimum distance 7 with generator polynomial having zeros $\alpha$, $\alpha^3$ and $\alpha^5$ where $\alpha$ is a primitive root of unity. The zero set of the code is…
In this paper, we mainly study geometric constructions of thin Blaschke products $B$ and reducing subspace problem of multiplication operators induced by such symbols $B$ on the Bergman space. Considering such multiplication operators…