HADWIGER INTEGRATION OF DEFINABLE FUNCTIONS Matthew L. Wright Robert Ghrist, Advisor This thesis defines and classifies valuations on definable functionals. The intrinsic volumes are valuations on “tame” subsets of R, and by easy extension, valuations on functionals on R with finitely many level sets, each a “tame” subset of R. We extend these valuations, which we call Hadwiger integrals, to de...

The theme of this paper is the extension of continuous valuations on the lattice of open sets of a T0-space to Borel measures. A general extension principle is derived that provides a unified approach to a variety of extension theorems including valuations that are directed suprema of simple valuations, continuous valuations on locally compact sober spaces, and regular valuations on coherent so...

In this Letter, we describe how a spectrum of entropic perturbations generated during period slow contraction can source nearly scale-invariant curvature on length scales larger than the Hubble radius transition from to classical non-singular bounce (the `graceful exit' phase). The sourcing occurs naturally through higher-order scalar field kinetic terms common (non-singular) mechanisms. We pre...

A difference vertex labeling of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy the weight |f(x)− f(y)| . A difference vertex labeling f of a graph G of size n is odd-graceful if f is an injection from V (G) to {0, 1, ..., 2n − 1} such that the induced weights are {1, 3, ..., 2n − 1}. We show here that any forest whose components are caterpillars is odd...

Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper, first a new approach based on the mathematical programming technique is presented to model the graceful labeling problem. Then a “branching me...

A digraph D with p vertices and q arcs is labeled by assigning a distinct integer value g(v) from {0, 1, ..., q} to each vertex v. The vertex values, in turn, induce a value g(u, v) on each arc (u, v) where g(u, v) = (g(v)− g(u))(mod q + 1). If the arc values are all distinct then the labeling is called a graceful labeling of a digraph. In this paper, we prove a general result on graceful digra...