Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Coloring Graphs With Forbidden Minors, Martin Rolek
Coloring Graphs With Forbidden Minors, Martin Rolek
Electronic Theses and Dissertations
A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting edges. My research is motivated by the famous Hadwiger's Conjecture from 1943 which states that every graph with no Kt-minor is (t − 1)-colorable. This conjecture has been proved true for t ≤ 6, but remains open for all t ≥ 7. For t = 7, it is not even yet known if a graph with no K7-minor is 7-colorable. We begin by showing that every graph with no Kt-minor is (2t − 6)- colorable for t = …
Filtering Problems In Stochastic Tomography, Tyler Gomez
Filtering Problems In Stochastic Tomography, Tyler Gomez
Electronic Theses and Dissertations
Distinguishing signal from noise has always been a major goal in probabilistic analysis of data. Such is no less the case in the field of medical imaging, where both the processes of photon emission and their rate of absorption by the body behave as random variables. We explore methods by which to extricate solid conclusions from noisy data involving an X-ray transform, long the mathematical mainstay of such tools as computed axial tomography (CAT scans). Working on the assumption of having some prior probabilities assigned to various states a body can be found in, we introduce and make rigorous an …
Gallai-Ramsey Numbers For C7 With Multiple Colors, Dylan Bruce
Gallai-Ramsey Numbers For C7 With Multiple Colors, Dylan Bruce
Honors Undergraduate Theses
The core idea of Ramsey theory is that complete disorder is impossible. Given a large structure, no matter how complex it is, we can always find a smaller substructure that has some sort of order. One view of this problem is in edge-colorings of complete graphs. For any graphs G, H1, ..., Hk, we write G → (H1, ..., Hk), or G → (H)k when H1 = ··· = Hk = H, if every k-edge-coloring of G contains a monochromatic Hi in color i for some i ∈ …
Sampling And Reconstruction Of Spatial Signals, Cheng Cheng
Sampling And Reconstruction Of Spatial Signals, Cheng Cheng
Electronic Theses and Dissertations
Digital processing of signals f may start from sampling on a discrete set Γ, f →(f(ϒη))ϒηεΓ. The sampling theory is one of the most basic and fascinating topics in applied mathematics and in engineering sciences. The most well known form is the uniform sampling theorem for band-limited/wavelet signals, that gives a framework for converting analog signals into sequences of numbers. Over the past decade, the sampling theory has undergone a strong revival and the standard sampling paradigm is extended to non-bandlimited signals including signals in reproducing kernel spaces (RKSs), signals with finite rate of innovation (FRI) and sparse signals, and …
Scaling Of Spectra Of Cantor-Type Measures And Some Number Theoretic Considerations, Isabelle Kraus
Scaling Of Spectra Of Cantor-Type Measures And Some Number Theoretic Considerations, Isabelle Kraus
Honors Undergraduate Theses
We investigate some relations between number theory and spectral measures related to the harmonic analysis of a Cantor set. Specifically, we explore ways to determine when an odd natural number m generates a complete or incomplete Fourier basis for a Cantor-type measure with scale g.