Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 13 of 13 for “"Random polynomials"”.
-
Random Polynomials Over Finite Fields
… of this thesis is to take some questions about polynomials over finite fields and 'answer' them using probability theory; that is, we give the average behaviour of certain properties of polynomials. We tend to deal with multivariate polynomials, so questions about factorisation are not …
-
On Random Polynomials Spanned by OPUC
We consider the behavior of zeros of random polynomials of the from \begin{equation*} P_{n,m}(z) := \eta_0\varphi_m^{(m)}(z) + \eta_1 \varphi_{m+1}^{(m)}(z) + \cdots + \eta_n \varphi_{n+m}^{(m)}(z) \end{equation*} as \( n\to\infty \), where \( m \) is a non-negative integer (most of the work deal …
-
Hole Probabilities of SU(m+1) Gaussian Random Polynomials
… probabilities P_{0,m}(r,N) of SU(m+1) Gaussian random polynomials of degree N over a polydisk (D(0,r))^m. When r>=1, we derive asymptotic formulas and decay rate of log P_{0,m}(r,N). In one dimensional case, we also consider hole probabilities over some general open sets and compute asymptotic …
-
Random Sorting Networks, the Directed Landscape, and Random Polynomials
The first part of this thesis concerns random sorting networks. A sorting network is a shortest path from 12···n to n···21 in the Cayley graph of the symmetric group Sn generated by adjacent transpositions. We prove that in a uniform random n-element sorting network σn, all particle trajectories …
-
Zeros, Critical Points, and Coefficients of Random Functions
Traditional approaches to the study of random polynomials and random analytic functions have focussed on answering questions regarding the behavior and/or location of zeros of these functions, where the randomness in these functions arises from the choice of coefficients. In this thesis, we shall …
-
Random Multiplicative Functions
For X(n) a Steinhaus random multiplicative function, and f(n) an integer poly-<br/>nomial, we consider the random polynomials<br/>P_{N,f}(θ) = (1/√N) ∑_{n≤N} X(n)e(f(n)θ)<br/>and show that 2k-th moments on the unit circle tend to Gaussian moments in the<br/>sense of mean-square convergence, …
-
Lower Tail Probabilties and Gaussian Process
… second emerges from the study of real zeros of random polynomials and the third example results from the first passage time for the Slepian process. Some numerical analysis of the second two examples will conclude.
-
The density of complex zeros of random sums
A random polynomial is a polynomial whose coefficients follow some probability distribution. The fundamental questions that need to be studied are the distribution and correlations between zeros, pairing between zeros and critical points, distribution values, and nodal surfaces. The computation of …
-
Continuity of the asymptotics of expected zeros of fewnomials
In "Random complex fewnomials, I,'' the limiting formula of the (normalized) expected distribution of complex zeros of a system of $k$ random $m$-variate fewnomials where the coefficients are taken from the $\mathrm{SU}(m+1)$ ensemble and the spectra are chosen uniformly at random is determined. We …
-
Polynomial zerofinding matrix algorithms.
… polynomial. Determining the zeros of polynomials by the computation of the eigenvalues of a corresponding companion matrix turns the table on the usual definition. In this dissertation, the work of Newbery has been expanded and a (complex) symmetric or nonsymmetric companion matrix …
-
Sparsity, Randomness and Convexity in Applied Algebraic Geometry
… problem is to study the ratio of sums of squares polynomials inside the set of nonnegative polynomials. Our focus is on the effect of fixed monomial structure to the ratio of these two sets. We study this problem quantitatively by combining convex geometry and algebra. Some of our methods work for …
-
Constructing polynomials over finite fields
In this paper we present an algorithm for constructing a polynomial system corresponding to a given directed labeled graph. Three specific classes of polynomial systems are considered in detail. Then we briefly consider some desirable properties for output sequences and we show how to construct a …
-
Secure Hardware Implementation of Post Quantum Cryptosystems
… In particular, we split the ciphertext into two randomly generated shares. This guarantees that during the first step of the decryption process, the inputs to the convolution modules, which are convoluted with the secret key polynomial, are uniformly chosen random polynomials which are freshly …