Related papers: On polynomial growth functions of D0L-systems
In this paper, we show that various kinds of integer polynomials with prescribed properties of their roots have positive density. For example, we prove that almost all integer polynomials have exactly one or two roots with maximal modulus.…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
Spaces of harmonic functions in upper half-space with controlled growth near the boundary are described in terms of multiresolution approximations. The results are applied to prove the law of the iterated logarithm for the oscillation of…
In this paper we deal with composite rational functions having zeros and poles forming consecutive elements of an arithmetic progression. We also correct a result published earlier related to composite rational functions having a fixed…
We introduce the notion of composite growth function and provide examples that illustrate the primary properties of these growth functions. There are provided examples of Mealy automata that have composite non-monotonic growth functions of…
We provide a characterization of the set of real-valued functions that can be the value function of some polynomial game. Specifically, we prove that a function $u : \dR \to \dR$ is the value function of some polynomial game if and only if…
We prove that all groups of exponential growth support non-constant positive harmonic functions. In fact, out results hold in the more general case of strongly connected, finitely supported Markov chains invariant under some transitive…
We study how a single value of the shatter function of a set system restricts its asymptotic growth. Along the way, we refute a conjecture of Bondy and Hajnal which generalizes Sauer's Lemma.
By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…
Using polynomial interpolation, along with structural properties of the family of positive real rational functions, we here show that a set of m nodes in the open left half of the complex plane, can always be mapped to anywhere in the…
For any infinite field k and any positive integer r, we show constructively that the map sending each polynomial P $\in$ k[x] to its r-th iterate is dominant in various inductive limit topologies on the space of all polynomials.
A space of entire functions of several complex variables rapidly decreasing on ${\mathbb R}^n$ and such that their growth along $i{\mathbb R}^n$ is majorized with the help of a family of weight functions is considered in this paper. For…
For an ideal $I$ in a local ring $(R, \fm)$, we prove that the integer-valued function $\ell_R(H^0_\fm(R/I^{n+1}))$ is a polynomial for $n$ big enough if either $I$ is a principle ideal or $I$ is generated by part of an almost p-standard…
In context of the Wolfram Physics Project, a certain class of abstract rewrite systems known as "multiway systems" have played an important role in discrete models of spacetime and quantum mechanics. However, as abstract mathematical…
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…
Let $R$ be a commutative Noetherian ring, $I$ an ideal, $M$ and $N$ finitely generated $R$-modules. Assume $V(I)\cap Supp(M)\cap Supp(N)$ consists of finitely many maximal ideals and let ${\l}(\e^i(N/I^nN,M))$ denote the length of…
Any nonsingular function of spin j matrices always reduces to a matrix polynomial of order 2j. The challenge is to find a convenient form for the coefficients of the matrix polynomial. The theory of biorthogonal systems is a useful…
Obtained a new property of superposition of the generating functions ln(1/(1-F(x))), where F(x) - generating function with integer coefficients, which allows the construction a primality tests. The theorem which is based on compositions of…
We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…
We introduce a class of multiplicative functions in which each function satisfies some statistic conditions, and then prove that above functions are not correlated with finite degree polynomial nilsequences. Besides, we give two…