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 20 of 29 for “"Symmetric polynomials"”.
-
The Zero Locus of Symmetric Polynomials
Homogeneous polynomials $f_1, f_2, \dots, f_n$ form a regular sequence in the polynomial ring $\mathbb{C}[x_1, x_2, \dots, x_n]$ when the reduced affine variety of these polynomials only contains the origin. In this report, we will be particularly interested in regular sequences of power sum …
-
Non-negative symmetric polynomials and entangled Bosons
… cone is the dual of the cone of non-negative symmetric polynomials. Together with a characterization of this cone, we also develop an entanglement criterion that is asymptotically tight, for large atom numbers.
-
Waring Rank and Apolarity of Some Symmetric Polynomials
… bounds for the Waring rank for certain types of symmetric polynomials. The first are Schur polynomials, a symmetric polynomial indexed by integer partitions. We prove some results about the Waring rank of certain types of Schur polynomials, based on their integer partition. We also make some …
-
Eliminating Harmonics in a Cascaded H-Bridges Multilevel Inverter Using Resultant Theory, Symmetric Polynomials, and Power Sums
… equations. Furthermore, using the ideas of Symmetric Polynomials and Power Sums, these polynomials were reduced further to form smaller degree polynomials, which are much easier to solve. This approach will find all solutions. Numerical techniques, such as Newton-Raphson, will only find one …
-
Abacus-Tournament Models of Hall-Littlewood Polynomials
… for three types of HallLittlewood polynomials (denoted Rλ, Pλ, and Qλ) by using weighted combinatorial objects called abacus-tournaments. We then apply these models to give combinatorial proofs of properties of Hall-Littlewood polynomials. For example, we show why various …
-
Cubic Symmetric Laminations
To study the \emph{parameter space of all polynomials of degree $d$} with connected Julia sets, Thurston proposed studying the space of all \emph{$\sigma_d$-invariant laminations}, where $\sigma_d:\mathbb S\to\mathbb S$ is the degree $d$ covering map of the unit circle defined by $\sigma_d(z)=z^d$. …
-
Spectral Representation for Matching and Recognition
… matching problem; (2) We use coefficients of symmetric polynomials to cluster similar human poses using the skeletal representation acquired from Microsoft Kinect; (3) We use coefficients of the elementary symmetric polynomials to make the direction of the eigenvectors of the proximity …
-
Partially-Symmetric Macdonald Polynomials
Nonsymmetric Macdonald polynomials can be symmetrized in all their variables to obtain the (symmetric) Macdonald polynomials. We generalize this process, symmetrizing the nonsymmetric Macdonald polynomials in only the first k out of n variables. The resulting partially-symmetric Macdonald …
-
Combinatorial Unification of Binomial-Like Arrays
… cycle numbers, and Lah numbers, by employing symmetric polynomials and related words with specialized alphabets as well as a balls-and-urns counting approach. Using the method of statistical generating functions, q- and p; q-generalizations of the binomial coefficients, Stirling numbers, cycle …
-
The multiplicative complexity of symmetric functions over a field with characteristic p
In this thesis we consider the boolean elementary symmetric functions over a field with characteristic p, with p an odd, large enough prime.We will determine the coefficients of the symmetric functions. Also we will prove that it is possible to determine the coefficients with a recurrence relation …
-
Schaper numbers, palindrome partitions, and symmetric functions, with applications to characters of the symmetric group
Finding the decomposition numbers for the symmetric group is a difficult problem and has led to many different research directions. For a given Specht module, the Schaper sum formula can be refined with knowledge of the Schaper number for the particular partition to give more precise information …
-
Orbit Chern classes in invariant theory
… The orbit Chern classes are the elementary symmetric polynomials in the elements of an orbit of G acting on the space of linear forms V^* regarded as elements of F[V]^G. In many cases, the orbit Chern classes are sufficient to generate the ring of invariants as an algebra. In this paper I …
-
COMBINATORIAL EXPANSIONS OF MACDONALD AND LLT POLYNOMIALS
… Ian Macdonald introduced a special family of symmetric polynomials $H_{\mu}(X;q,t)$. These are now known as Macdonald polynomials, written as $H_{\mu}(X;q,t)$ $=\sum_{\lambda\vdash n}K_{\lambda,\mu}(q,t)s_{\lambda}(X)$, a sum over Schur functions $s_{\lambda}(X)$, a basis for the ring of …
-
Exponential B-Splines: Scale-Space and Wavelet Representations
… B-splines. First, the concept of elementary symmetric polynomials is introduced in order to express derivatives of exponential B-spline in terms of lower order ones. An exponential B-spline is known to satisfy a refinement equation. This property is utilized to formulate the exponential …
-
A split-Levison approach to autoregressive modeling
… A brief introduction to the theory of symmetric polynomials is presented to form the basis of the new algorithms. Computer simulations are used to test and compare the computational accuracy of the new algorithms for AR filter coefficient estimation, parameter estimation for a moving …
-
Commutative n-ary Arithmetic
… study of their expression in terms of elementary symmetric polynomials, and connections are made to results from the theory of polyadic (n-ary) groups. Higher order operations yield wider factorization and representation possibilities which correspond to reductions in the set of primes as well as …
-
A Cornucopia Of Labeled Diagrams And Their Generating Polynomials
… the focus of this dissertation. In the world of symmetric polynomials and their corresponding objects, we prove some partial results for the Schur expansion of Jack polynomials in certain binomial coefficient bases. As a result, we conjecture a bijection between tableaux and rook boards, which …
-
Bicharacter Construction of Quantum Vertex Algebras
… quantum vertex operators describing classes of symmetric polynomials as considered by N. Jing ([Jin94b]). The bicharacter construction is a tool which hasn't been explored in this context. We develop this construction further and based on our theory we propose the notion of HD-quantum vertex …
-
Computing with Polynomials over Composites
… seems to require a better understanding of polynomials over composites. In this thesis, we address some such "prime vs. composite" problems from algorithms, complexity and combinatorics, and the surprising connections between them. We consider the complexity-theoretic problem of computing …
-
Symmetric nonnegative forms and sums of squares: mean roads to infinity
We compare the cones of symmetric nonnegative polynomials and symmetric sums of squares when the number of variables goes to infinity. We focus on the case of homogeneous polynomials (forms) of fixed even degree in an increasing number of variables. There are different ways of going to infinity but …
Page 1 of 2