Add to ORKGThe average frequency of 1 occurring as the kth digit in the binary expansion of squares, cubes, and generally the values of a polynomial is studied. In particular, it turns out that the generating function of these frequencies is rational for the important special cases of powers, linear and quadratic polynomials. For higher degree polynomials, the behaviour seems to be in general much more chaotic, which is exhibited by two examples of cubic polynomials
Fix an odd prime p. If r is a positive integer and f is a polynomial with coefficients in Fpr, let P...
AbstractA method is given for computing the generating function for a sequence of polynomials repres...
This paper investigates the fundamental nature of the polynomial chaos (PC) response of dynamic syst...
In this report, we present a simple geometric generation principle for the fractal that is obtained ...
AbstractWe study a redundant binary number system that was recently introduced by Székely and Wang. ...
In this paper we present some results related to the problem of finding periodic representations for...
The goal of this talk is to present the state-of-the-art construction of pseudorandom number generat...
Abstract. We examine the behavior of the coefficients of powers of polynomials over a finite field o...
Let r, g ≥ 2 be integers such that log g/log r is irrational. We show that under r-digitwise random ...
Abstract. For 2 < < 4, we analyze the behavior, near the rational points x = p=q, of P1 n=1 n...
We propose a theory to explain random behavior for the digits in the expansions of fundamental mathe...
We propose a thorough comparison of polynomial chaos expansion (PCE) for indicator functions of the ...
In this paper, we discuss sums of powers 1p + 2p + + np and compute both the exponential and ordinar...
This research centers on discriminants and how discriminants and their q-analogues relate to the roo...
With computers, we are able to construct complicated fractal im-ages that describe the dynamics of c...
Fix an odd prime p. If r is a positive integer and f is a polynomial with coefficients in Fpr, let P...
AbstractA method is given for computing the generating function for a sequence of polynomials repres...
This paper investigates the fundamental nature of the polynomial chaos (PC) response of dynamic syst...
In this report, we present a simple geometric generation principle for the fractal that is obtained ...
AbstractWe study a redundant binary number system that was recently introduced by Székely and Wang. ...
In this paper we present some results related to the problem of finding periodic representations for...
The goal of this talk is to present the state-of-the-art construction of pseudorandom number generat...
Abstract. We examine the behavior of the coefficients of powers of polynomials over a finite field o...
Let r, g ≥ 2 be integers such that log g/log r is irrational. We show that under r-digitwise random ...
Abstract. For 2 < < 4, we analyze the behavior, near the rational points x = p=q, of P1 n=1 n...
We propose a theory to explain random behavior for the digits in the expansions of fundamental mathe...
We propose a thorough comparison of polynomial chaos expansion (PCE) for indicator functions of the ...
In this paper, we discuss sums of powers 1p + 2p + + np and compute both the exponential and ordinar...
This research centers on discriminants and how discriminants and their q-analogues relate to the roo...
With computers, we are able to construct complicated fractal im-ages that describe the dynamics of c...
Fix an odd prime p. If r is a positive integer and f is a polynomial with coefficients in Fpr, let P...
AbstractA method is given for computing the generating function for a sequence of polynomials repres...
This paper investigates the fundamental nature of the polynomial chaos (PC) response of dynamic syst...