In this thesis, we characterize and enumerate the permutations which are realized by the orbits of signed shifts, a family of discrete dynamical systems on words. The permutations, which are called patterns of the signed shifts, are given by the...
Siegel domains. Modular groups. Hecke algebras. Forms
In the 1960s Satake proved the existence of an isomorphism between the local Hecke algebra and the ring of polynomials invariant under the action of the signed permutation group W n (the Weyl group associated to Sp n over a local field)....
In this thesis we look at several problems that lie in the intersection between combinatorial and multiplicative number theory. A common theme of many of these problems are estimates for and properties of the smooth numbers, those integers not...
In this thesis we develop a theory of Fourier analysis and fast Fourier transforms (FFTs) for finite inverse semigroups. Our results generalize results in the theory of Fourier analysis for finite groups. There is a general method for generating...
Let K be the function field over a finite field of odd order, and let H be a definite quaternion algebra over K. If Α is an order of level M in H , we define theta series for each ideal I of Α using the reduced norm on H. Using harmonic analysis...
This thesis investigates the embedding theory of orders in central simple algebras, placing a particular emphasis on the role that the phenomenon known as selectivity plays in the theory. Although the notion of selectivity is completely algebraic,...
In this thesis, we consider several problems relating to cyclic subgroups of the group [mathematical equation]. Each element of [mathematical equation] has a unique representative in one of the two intervals [mathematical equation] and...
For many scientific applications, the data set cannot entirely fit in main memory. The data must reside out-of-core, i.e., on parallel disks. For many basic data-movement operations such as permuting, if the programmer does not design efficient...
Information retrieval -- Mathematical models. ; Electronic information resource searching. ; Computer algorithms. ; Decision making -- Data processing. ; Mathematical optimization.
This thesis presents a unified method for simultaneous solution of three problems in Information Retrieval--metasearch (the fusion of ranked lists returned by retrieval systems to elicit improved performance), efficient system evaluation (the...
We prove the existence of nontrivial multiparameter isospectral deformations of metrics on the classical compact simple Lie groups SO (n) (n = 9, n ≥11), Spin(n) (n = 9, n ≥11), SU (n) (n ≥7), and Sp (n) (n ≥5). The proof breaks into three...
Polynomials. Finite fields (Algebra). Algebraic functions. Number theory.
The ring of univariate polynomials over a finite field shares many foundational arithmetic properties with the ring of rational integers. This similarity makes it possible for many problems in elementary number theory to be translated 'through the...
This thesis centers around a generalization of the classical discrete Fourier transform. We first present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite...
'Orthogonal modular forms are algebraic modular forms arising from lattices in quadratic spaces. In this thesis, we define orthogonal modular forms, establish their basic properties, and then apply them to a case of ternary quadratic spaces to...
We associate, to each positive integer n , a Cayley graph to the group PSL(2.Ζ[subscript n]). We then consider the isoperimetric numbers of these graphs. In chapter three we determine upper bounds for the isoperimetric number by a detailed...
For a local field K, we study the affine buildings Ξ n and Δ n naturally associated to SL n ( K ) and Sp n ( K ), respectively. Since Sp n ( K ) is a subgroup of SL 2 n ( K ), we investigate properties of a natural embedding of Δ n in Ξ 2 n ....