Mathematics Commons^™

Integral Points Of Small Height Outside Of A Hypersurface, Lenny Fukshansky

CMC Faculty Publications and Research

Let F be a non-zero polynomial with integer coefficients in N variables of degree M. We prove the existence of an integral point of small height at which F does not vanish. Our basic bound depends on N and M only. We separately investigate the case when F is decomposable into a product of linear forms, and provide a more sophisticated bound. We also relate this problem to a certain extension of Siegel’s Lemma as well as to Faltings’ version of it. Finally we exhibit an application of our results to a discrete version of the Tarski plank problem.

On Cauchy's Bound For Zeros Of A Polynomial, V. K. Jain

Turkish Journal of Mathematics

In this note, we improve upon Cauchy's classical bound, and upon some recent bounds for the moduli of the zeros of a polynomial.

On Some Generalized Transforms For Signal Decomposition And Reconstruction., Yumnam Singh Dr.

Doctoral Theses

In this thesis, we propose two new subband transforms entitled ISITRA and YKSK transforms and their possible applications in image compression and encryption. Both these transforms are developed based on a common model of multiplication known as Bino’s model of multiplication. ISITRA is a convolution based transforms i.e., that both forward and inverse transform of ISITRA is based on convolution as in DWT or 2-channel filter bank. However, it is much more general than the existing DWT or 2-channel filter bank scheme in the sense that it we can get different kinds of filters in addition to the filters specified …

Valuations Of Polynomials, Sorasak Leeratanavalee

Turkish Journal of Mathematics

A tree is a connected (undirected) graph that contains no cycles. Trees play an important role in Computer Science. There are many applications in this field. Ordered binary decision diagrams are trees in the language of Boolean algebras. For the applications, it is important to measure the complexity of a tree or of a polynomial. The complexity of a polynomial over an arbitrary algebra can be regarded as a valuation. The concept of the valuations of terms was introduced by K. Denecke and S. L. Wismath in [5]. In [6], the author defined the depth of a polynomial which is …

The Solvability Of Polynomials By Radicals: A Search For Unsolvable And Solvable Quintic Examples, Robert Lewis Beyronneau

Theses Digitization Project

This project centers around finding specific examples of quintic polynomials that were and were not solvable. This helped to devise a method for finding examples of solvable and unsolvable quintics.

Incompressible Finite Elements Via Hybridization. Part Ii: The Stokes System In Three Space Dimensions, Bernardo Cockburn, Jay Gopalakrishnan

Mathematics and Statistics Faculty Publications and Presentations

We introduce a method that gives exactly incompressible velocity approximations to Stokes ow in three space dimensions. The method is designed by extending the ideas in Part I (http://archives.pdx.edu/ds/psu/10914) of this series, where the Stokes system in two space dimensions was considered. Thus we hybridize a vorticity-velocity formulation to obtain a new mixed method coupling approximations of tangential velocity and pressure on mesh faces. Once this relatively small tangential velocity-pressure system is solved, it is possible to recover a globally divergence-free numerical approximation of the fluid velocity, an approximation of the vorticity whose tangential component is continuous across …

Incompressible Finite Elements Via Hybridization. Part I: The Stokes System In Two Space Dimensions, Bernardo Cockburn, Jay Gopalakrishnan

Mathematics and Statistics Faculty Publications and Presentations

In this paper, we introduce a new and efficient way to compute exactly divergence-free velocity approximations for the Stokes equations in two space dimensions. We begin by considering a mixed method that provides an exactly divergence-free approximation of the velocity and a continuous approximation of the vorticity. We then rewrite this method solely in terms of the tangential fluid velocity and the pressure on mesh edges by means of a new hybridization technique. This novel formulation bypasses the difficult task of constructing an exactly divergence-free basis for velocity approximations. Moreover, the discrete system resulting from our method has fewer degrees …

Factorization Of Polynomials And Real Analytic Function, Radoslaw L. Stefanski

Honors Theses

In this project, we address the question: When can a polynomial p(x, y) of two variables be factored as p(x, y) = f(x)g(y), where f and g are polynomials of one variable. We answer this question, using linear algebra, and create a Mathematica program which carries out this factorization. For example,

3+3x-5x^3+y+xy-5/3x^3y+y^2+xy^2-5/3x^3y^2 = (1+x-5/3x^3)(3+y+y^2)

We then generalize this concept and ask: When can p(x,y) can be written as

p(x,y) = f1(x)g2(y)+f2(x)g2(y)+...+fr(x)gr(y)

where fj,gj are polynomials. This can certainly be done (for large enough r). Which is the minimum such r? Again, we have a Mathematica program which carries out this …

Fermat's Last Theorem For Rational Exponents, Curtis D. Bennett, A. M. W. Glass, Gábor J. Székely

Mathematics, Statistics and Data Science Faculty Works

No abstract provided.

Quasioptimality Of Some Spectral Mixed Methods, Jay Gopalakrishnan, Leszek Demkowicz

Mathematics and Statistics Faculty Publications and Presentations

In this paper, we construct a sequence of projectors into certain polynomial spaces satisfying a commuting diagram property with norm bounds independent of the polynomial degree. Using the projectors, we obtain quasioptimality of some spectralmixed methods, including the Raviart–Thomas method and mixed formulations of Maxwell equations. We also prove some discrete Friedrichs type inequalities involving curl.

Studies On Finite Linear Cellular Automata., Palash Sarkar Dr.

Doctoral Theses

Cellular Automata were originally proposed by John von Neumann as formal models of self reproducing organisms. The structure studied was mostly an ane and two dimensional infinite grida, though higher dimensions were also considered. Computation universality and other computation theoretic questions were considered important. See Burks [24] for a collection of essays on important problems on cellular automata during this period. Later physicists and biologists began to study cellular automsta for the purpose of modelling in their respective domains. In the present era, cellalar automata is being atudied from many widely different angles, and the relationship of these structurea to …

Affine Varieties, Groebner Basis, And Applications, Eui Won James Byun

Theses Digitization Project

No abstract provided.

Time-Space Harmonic Polynomials For Stochastic Processes., Arindam Sengupta Dr.

Doctoral Theses

The sequence of polynomials of a single variable known as the Hermite polynomialshala) = ), k21, (-1)* ha(z) =has many close links with the Normal distribution. Their association goes very doep, and extends to several connections bet ween the two-variable Hermite polynomialsHll, 2) = the(z/t), . k21.and the prime example of Gaussian processes, that is Brownian motion, as well. Much of this connection stems from what we term the time-space harmonic property of these polynomials for the Brownian motion process. An exact definition of this property follows later. A natural question that arises is, for stochastic processes in general, when …

Finding Cyclic Redundancy Check Polynomials For Multilevel Systems, James A. Davis, Miranda Mowbray, Simon Crouch

Department of Math & Statistics Faculty Publications

This letter describes a technique for finding cyclic redundancy check polynomials for systems for transmission over symmetric channels which encode information in multiple voltage levels, so that the resulting redundancy check gives good error protection and is efficient to implement. The codes which we construct have a Hamming distance of 3 or 4. We discuss a way to reduce burst error in parallel transmissions and some tricks for efficient implementation of the shift register for these polynomials. We illustrate our techniques by discussing a particular example where the number of levels is 9, but they are applicable in general.

Some Problems In Joint Spectral Theory., Tirthankar Bhattacharya Dr.

Doctoral Theses

No abstract provided.

Polynomial Equations And Solvability: A Historical Perspective, Laurie Jan Riggs

Theses Digitization Project

No abstract provided.

Study Of Moduli Of Bundles., Indranil Biswas Dr.

Doctoral Theses

Hitchin (Hi2) realized the importance of studying pairs (E,∅) where E is a vector bundle and ∅ is a homomorphism of E into EOL for a fixed line bundle L. When C is a smooth pro jective algebraic curve this has since been studied quite extensively. One can construct a covering of C in this situation and the given data can be completely recovered by this covering map and a line bundle on the covering curve (see Beauville, Narasimhan and Ramanan (BNR]). When L is the canonical bundle this procedure gives a completely integrable system on the cotangent bundle of …

Combinatorics And Diagonals Of Matrices., K. Balasubramanian Dr.

Doctoral Theses

This theale maindy desie with conbinatoriel aspocte of diayonale of natelees. or enurne, there are aleo eosulte which are nat sunbinatorial in naturos but thase ara neroly by-producta. Chapter-0 gives e very short nary ot the cnntenta of the theete. The raeulte aro ofr tuo kinde. (1) complately rev and (2) old results through rew rethude.Thịa thasle, wholly or pertly, has not baon subnittad to any othor Univerdity or Inatitute for e degree.I exprees hoceby ry doopost sonse of grotitude to br. KA. PARTHASARATHY, Haed of the Doparteant af Mathemties, Indian Inatituta of Tochmlogy, Redras, under uhana bonign guidance thie …

An Estimate For The Roots Of Random Algebraic Polynomial With Application, M. Sambandham, G. S. Ladde

Mathematics Technical Papers - Archive

An algebraic polynomial with dependent random coefficients is considered. The difference between the sample roots of random algebraic equation and the roots of the mean equation is estimated. As an application the difference between the sample solution of a random difference equation and the solution of the mean difference equation is also obtained.

Estimation Of Spectral Variation., Rajendra Bhatia Dr.

Doctoral Theses

The study of spectra occupies a central place in the theory of linear operators. One part of this study consists of obtaining a detailed and complete knowledge of the spectrum of a given lincar operator. The other part - perturbation theory - consists of using this knowledge to obtain information about the spectra of nearby operators.Apart from the intrinsic mathematical interest it has, perturbation theory is of great importance in the study of several physical problems. In fact, the theory came into existence with the work of Rayleigh on sound waves and that of Schrodinger on quantum mechanics. Later, their …

Theory Of Estimation In Algebraic And Analytic Exponential Families With Applications To Variance Components Models., Krishnan Unni Dr.

Doctoral Theses

There are many important statistical problems of the following kind. The family of probability measures O is parametrized by a vector parame ter n varying in a q-dimen- sional domain. P can be represented as an exponential family of probability distributions with k canonical para- me ters where k is greater than q. The canonical parameters do not vary in a domain in R, but are restricted by polyno- mial or analytic equations. They vary on a curved surface defined by the polynomial or analytic equations within the natural parame ter space of the exponential family. The present work is …

Non-Splitting Unitary Perfect Polynomials Over Gf(Q)T, Mickie Sue Harbin, Jacob T. B. Beard Jr.

Mathematics Technical Papers - Archive

It has been conjectured that there are infinitely many distinct pd-equivalence classes of non-splitting unitary perfect polynomials over GF(pd) for each prime p and each odd integer d > 1. The conjecture is proved in the affirmative in the cases i) p < 97, ii) 2 ^ GF(p) is not a square, iii) 2 ^ GF(p) is a square and all of the positive integer intervals determined by distinct odd powers of ^t contain a square, where GF*(p) = (^). In addition, it has been determined that iii) is satisfied by 314 primes p > 97.2

Non-Splitting Unitary Perfect Polynomials Over Gf(P), 7≤P≤19, Mickie Sue Harbin

Mathematics Technical Papers - Archive

Examples are given of non-splitting unitary perfect polynomials over [see pdf for notation] for [see pdf for notation]. These, together with previous results, establish the existence of infinitely many such polynomials over [see pdf for notation] for each [see pdf for notation]. The given result further supports the conjecture that non-splitting unitary perfect polynomials exist over [see pdf for notation] for each, [see pdf for notation].

Sums Of Kth Powers In The Ring Of Polynomials With Integer Coefficients, Ted Chinburg, Melvin Henriksen

All HMC Faculty Publications and Research

A working through of two theorems.

Suppose R is a ring with identity element and k is a positive integer. Let J(k, R) denote the subring of R generated by its kth powers. If Z denotes the ring of integers, then G(k, R) = {a ∈ Z: aR ⊂ J(k, R)} is an ideal of Z.

A Polynomial Dual Of Partitions, Jacob T. B. Beard, Ann D. Dorris

Mathematics Technical Papers - Archive

Let [see pdf for notation] be a non-negative integral polynomial. The polynomial P(x) is m-graphical, and a multi-graph G a realization of P(x), provided there exists a multi-graph G containing exactly P(1) points where [see pdf for notation] of these points have degree i for [see pdf for notation]. For multi-graphs G,H having polynomials P(x), Q(x) and number-theoretic partitions (degree sequences) [see pdf for notation], the usual product P(x)Q(x) is shown to be the polynomial of the Cartesian product [see pdf for notation], thus inducing a natural product [see pdf for notation] which extends that of juxtaposing integral multiple copies …