Related papers: Minimal polynomial dynamics on the set of 3-adic i…

In this paper I consider all possible properties from commutative algebra for polynomial composites and monoid domains. The aim is full characterization of these structures. I start with the examination of group, ring, modules properties,…

We compute the compactly supported Euler characteristic of the space of degree $d$ irreducible polynomials in $n$ variables with real coefficients and show that the values are given by the digits in the so-called balanced binary expansion…

Bosse et al. conjectured that for every natural number $d \ge 2$ and every $d$-dimensional polytope $P$ in $\real^d$ there exist $d$ polynomials $p_0(x),...,p_{d-1}(x)$ satisfying $P=\{x \in \mathbb{R}^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge…

For $A\subseteq \{1, 2, \ldots\}$, we consider $R(A)=\{a/b: a, b\in A\}$. It is an open problem to study the denseness of $R(A)$ in the $p$-adic numbers when $A$ is the set of nonzero values assumed by a cubic form. We study this problem…

We give an elementary proof of an analogue of Fej\'er's theorem in weighted Dirichlet spaces with superharmonic weights. This provides a simple way of seeing that polynomials are dense in such spaces.

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…

We study polynomials with integer coefficients which become Eisenstein polynomials after the additive shift of a variable. We call such polynomials shifted Eisenstein polynomials. We determine an upper bound on the maximum shift that is…

A characterization is given of those sequences of quasi-orthogonal polynomials which form also $q$-Appell sets.

Let $(x_n)_{n\geq0}$ be a linear recurrence sequence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In 2017,…

We present a practical algorithm to compute models of rational functions with minimal resultant under conjugation by fractional linear transformations. We also report on a search for rational functions of degrees 2 and 3 with rational…

For orthogonal polynomials defined by compact Jacobi matrix with exponential decay of the coefficients, precise properties of orthogonality measure is determined. This allows showing uniform boundedness of partial sums of orthogonal…

This paper is devoted to several new results concerning (standard) octonion polynomials. The first is the determination of the roots of all right scalar multiples of octonion polynomials. The roots of left multiples are also discussed,…

In this paper we obtain some properties of orthogonal polynomials given by a weight function which is a limit density of a rescaled discrete-time quantum walk on the line.

In dynamical systems of few degrees of freedom, periodic solutions consist the backbone of the phase space and the determination and computation of their stability is crucial for understanding the global dynamics. In this paper we study the…

The sub-Bergman Hilbert spaces are analogues of de BrangesRovnyak spaces in the Bergman space setting. We prove that the polynomials are dense in sub-Bergman Hilbert spaces. This answers the question posted by Zhu in the affirmative.

We study partially hyperbolic sets of C1-diffeomorphisms. For these sets there are defined the strong stable and strong unstable laminations. A lamination is called dynamically minimal when the orbit of each leaf intersects the set densely.…

We will study p-adic invariant integerals involving trigonometric functions

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

We give a short discussion about a weaker form of minimality (called quasi-minimality). We call a system quasi-minimal if all dense orbits form an open set. It is hard to find examples which are not already minimal. Since elliptic behaviour…