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 1184 for “"A-polynomial"”.
-
A polynomial computer
A computer for solving polynomial equations, performing Fourier synthesis, and displaying system functions is a valuable asset to an electrical laboratory. A number of successful computers have been built for such purposes but each has its limitations. The design of a versatile and precise …
-
Rings with a polynomial identity
… entirely, but by reducing our demand on polynomial identities slightly, many remarkably fine results have been proved.
-
The Boundaries of a Polynomial
This paper defines the boundaries of a polynomial as a related problem to finding the minimum distance from a point to a curve. The boundaries of the general nth degree polynomial are discussed, and the general 2nd and 3rd degree polynomials are explored as illustrations.
-
The A-Polynomial and Knot Volume
… and the logarithmic Mahler measure of the A-polynomial would be a major breakthrough in 3-manifold topology and knot theory. We show that if any knot in S^3 has an exterior with zero hyperbolic volume, then it will have an A-polynomial with zero logarithmic Mahler measure. The converse is …
-
A Polynomial Invariant of Partial Orders
… hyperplane arrangement. In chapter 5, we study a polynomial invariant which is defined for any poset p, and whose value at 1 is the number of linear extensions of the poset. We prove that the polynomial invariant studied in [9] is a reparameterization of our polynomial invariant whenever p is …
-
Almost Primes Generated by a Polynomial
Made available in DSpace on 2014-12-05T21:50:25Z (GMT). No. of bitstreams: 1 6402927.pdf: 1055669 bytes, checksum: 34402c3cb83b70229758c77540bf0b8d (MD5) Previous issue date: 1963
-
A Polynomial Chaos Approach to Control Design
… H2 control concepts and the numerical method of Polynomial Chaos was developed in order to create a novel robust probabilistically optimal control approach. This method was created for the practical reason that uncertainty in parameters tends to be inherent in system models. As such, the …
-
Isogeny Based Cryptosystems and a Polynomial-Time Break
The development of quantum computing poses a significant challenge to many widely deployed public key cryptographic systems, motivating the search for quantum-resistant alternatives. Among the proposed ap-proaches, isogeny-based cryptography attracted considerable attention due to its strong …
-
Two-dimensional linear discrete systems: a polynomial fractional approach
… This approach based on the two-dimensional polynomial fractional representation is further extended to two-dimensional, linear, time-varying discrete systems. This algebraic framework is established with use of the division process in K[z1,z2] which is defined and investigated. Also, a ring …
-
A polynomial approximation to the inverse of a matrix.
We develop a surprisingly accurate polynomial approximation to the inverse of a large matrix, i.e. p(A) ⇡ A1. This polynomial is implemented using the roots of the GMRES polynomial, or harmonic Ritz values, and can be used to solve multiple right-hand sides as well as trace estimates to the inverse …
-
A New Perspective on a Polynomial Time Knot Polynomial
In this work we consider the Z1(K) polynomial time knot polynomial defined anddescribed by Dror Bar-Natan and Roland van der Veen in their 2018 paper ”A polynomial time knot polynomial”. We first look at some of the basic properties of Z1(K), and develop an invariant of diagrams Ψm(D) related to …
-
A Polynomial Based Iterative Method for Linear Parabolic Equations
A new polynomial based method (PBM) is developed to integrate multi-dimensional linear parabolic initial-boundary-value problems. It is based on $L\sb2$-approximations to $f(z) = (1 - exp(-z))/z,f(0) = 1,$ over ellipses in the complex plane using expansions of f in Chebychev polynomials. The …
-
Equivalent definitions for Block Elimination Distance and a polynomial kernel
Η δισυνεκτική απόσταση εξάλειψης είναι μία παράμετρος σε γραφήματα που μετράει την "απόσταση" των δισυνεκτικών συνιστωσών ενός γραφήματος από μία δεδομένη κλάση γραφημάτων. Όταν η υποδεικνούμενη κλάση γραφημάτων είναι η κλάση των γραφημάτων χωρίς ακμές, χρησιμοποιούμε τον όρο δισυνεκτικό …
-
A Polynomial Algorithm for a NP-hard to solve Optimization Problem
Since Markowitz in 1952 described an efficient and practical way of finding the optimal portfolio allocation in the normal distributed case, a lot of progress in several directions has been made. The main objective of this thesis is to replace the original risk measure of the Markowitz setting by a …
-
A polynomial LYM inequality and an association scheme on a lattice
… poset 2 [n]: In this dissertation, we present a polynomial LYM inequality for certain ranked posets derived from association schemes. To do this we establish a new class of association schemes of finite, complemented, modular lattices. We also present examples using this general polynomial LYM …
Page 1 of 60