Related papers: Factors of generalised polynomials and automatic s…
The Newton-Girard Formula allows one to write any elementary symmetric polynomial as a sum of products of power sum symmetric polynomials and elementary symmetric polynomials of lesser degree. It has numerous applications. We have…
As an extension of the classical irreducibility result of Dumas, a factorization result for polynomials over any valued field with a Krull valuation of arbitrary rank is proved. Further, a lower degree factor bound on factors of a given…
In a classical case, orthogonal polynomial sequences are in such a way that the $ n $th polynomial has the exact degree $n$. Such sequences are complete and form a basis of the space for any arbitrary polynomial. In this paper, we introduce…
We introduce generalizations of powers and factor complexity via orbits of group actions. These generalizations include concepts like abelian powers and abelian complexity. It is shown that this notion of factor complexity cannot be used to…
We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $\AA$. The monomial expansion of the symmetrized determinant is obtained from the standard…
In this paper, we study the summability properties of double sequences of real constants which map sequences of random variables to sequences of random variables that are defined on the same probability sample space. We show that a regular…
The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the…
In this short note, we reduce lower bounds on monotone projections of polynomials to lower bounds on extended formulations of polytopes. Applying our reduction to the seminal extended formulation lower bounds of Fiorini, Massar, Pokutta,…
We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be…
We begin with the observation that the signed generalized Stirling polynomials $P_k(m,x)$, which occur in a generalization of Malmsten's integral, reduce to the falling factorials when $k=m$. The structure of these generalized Stirling…
Let $Q$ be an acyclic quiver. We introduce the notion of generic variables for the coefficient-free acyclic cluster algebra $\mathcal A(Q)$. We prove that the set $\mathcal G(Q)$ of generic variables contains naturally the set $\mathcal…
An atomic monoid $M$ is called length-factorial if for every non-invertible element $x \in M$, no two distinct factorizations of $x$ into irreducibles have the same length (i.e., number of irreducible factors, counting repetitions). The…
A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…
We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…
For a stationary sequence that is regularly varying and associated we give conditions which guarantee that partial sums of this sequence, under normalization related to the exponent of regular variation, converge in distribution to a…
In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute…
We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…
In 2009, Grant, Shallit, and Stoll constructed a large family of pseudorandom sequences, called generalized Rudin--Shapiro sequences, for which they established some results about the average of discrete correlation coefficients of order 2…
In the asymptotic analysis of regular sequences as defined by Allouche and Shallit, it is usually advisable to study their summatory function because the original sequence has a too fluctuating behaviour. It might be that the process of…
Let $K$ be a number field, and $\varphi_{1},\ldots,\varphi_{g}\in K(t)$ be finitely many rational maps, each of degree at least $2$. We first show that for generic finite sets $\mathcal{A}_{1},\ldots,\mathcal{A}_{g}$ consisting entirely of…