ResearchWorks Archive

Browsing Mathematics by Title

Browsing Mathematics by Title

Sort by: Order: Results:

  • Ward, Matthew J
    This thesis develops a theory of arithmetic Fourier-Mukai transforms in order to obtain results about equivalences between the derived category of Calabi-Yau varieties over non-algebraically closed fields. We obtain answers ...
  • Lou, Shuwen
    In this thesis we introduce and study Brownian motion with or without drift on state spaces with varying dimension. Starting with a concrete such state space that is the plane with an infinite pole on it, we construct a ...
  • Wang, Xingting
    We classify all connected Hopf algebras up to p^3 dimension over an algebraically closed field of characteristic p>0 under the mild restriction such that in dimension p^3, we only work over odd primes p when the primitive ...
  • Taylor, Jair Patrick (2014-02-24)
    We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of weighted sums of Laguerre polynomials. We describe how such a series can be computed by ...
  • Barnes, Joel
    A conformally balanced tree is an embedding of a given planar map into the plane with constraints on the harmonic measure of its edges such that the resulting set is unique up to scale and rotation. Bishop (2013) showed ...
  • Green, Christopher (2010-01-10)
    In this thesis we examine the connections between orthogonal polynomials and the Lanczos algorithm for tridiagonalizing a Hermitian matrix. The Lanczos algorithm provides an easy way to calculate and to estimate the ...
  • Wright, Stephen E., 1962- (1990)
    Large-scale problems in convex optimization often can be reformulated in primal-dual (minimax) representations having special decomposition properties. Approximation of the resulting high-dimensional problems by restriction ...
  • Goebel, Rafal, 1971- (2000)
    The results of this thesis are oriented towards the study of convex problems of optimal control in the extended piecewise linear-quadratic format. Such format greatly extends the classical linear-quadratic regulator problem ...
  • Erickson, Lindsay
    Rational pairs, recently introduced by Kollár and Kovács, generalize rational singularities to pairs (X,D). Here X is a normal variety and D is a reduced divisor on X. Integral to the definition of a rational pair is the ...
  • Grigg, Nathan (2013-07-25)
    In modern algebraic geometry, an algebraic variety is often studied by way of its category of coherent sheaves or derived category. Recent work by Toda has shown that infinitesimal deformations of the category of coherent ...
  • Roberts, Austin
    In 2007 Sami Assaf introduced dual equivalence graphs as a method for demonstrating that a quasisymmetric function is Schur positive. The method involves the creation of a graph whose vertices are weighted by Ira Gessel's ...
  • Johnson, Tobias Lee
    One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are <italic>universal</italic>. We probe the edges of universality by studying ...
  • Paquette, Elliot (2013-11-14)
    The goal of this thesis is to develop one of the threads of what is known in random matrix theory as universality, which essentially is that a large class of matrices generalizing the Gaussian matrices (certain Wigner ...
  • McDowall, Stephen R., 1969- (1998)
    We consider the inverse problem of determining the electromagnetic material parameters of a body from information obtainable only at the boundary of the body; such information comes in the form of a boundary map which we ...
  • Yang, Yang
    Inverse problems arise in various areas of science and engineering including medical imaging, computer vision, geophysics, solid mechanics, astronomy, and so forth. A wide range of these problems involve elliptic operators. ...
  • Solomyak, Margarita (1997)
    Let $\Gamma$ be a Cayley graph of a finitely generated group G. Subgraphs which contain all vertices of $\Gamma ,$ have no cycles, and no finite connected components are called essential spanning forests. The set ${\cal ...
  • Choi, Daeshik (2013-11-14)
    We study Crouzeix's conjecture: for any polynomial p and any square matrix A, the spectral norm of the matrix p(A) is at most double of the supremum norm of the polynomial p on the numerical range of the matrix A.
  • An, Yajun (2013-04-17)
    A new methodology was proposed in Finkelstein and Kastner (2007,2008) to derive finite-difference (FD) schemes in the joint time-space domain to reduce dispersion error. The key idea is that the true dispersion relation ...
  • Pfeiffer, James (2014-02-24)
    This thesis studies bootstrap percolation, a problem in probability, as well as several topics in the application of sums of squares to combinatorial optimization. In the chapter on percolation, we bound the critical ...
  • Blair-Stahn, Nathaniel Deveroux (2013-04-17)
    We study the macroscopic geometry of first-passage competition on the integer lattice <bold>Z</bold><super>d</super>, with a particular interest in describing the behavior when one species initially occupies the exterior ...

Search ResearchWorks


Advanced Search

Browse

My Account