The present study examined the hemodynamic response to recreational hockey (n= 22) in middle-aged men (53±6 yrs). Study participants were equipped with ambulatory blood pressure and heart rate monitoring equipment prior to a weekly hockey games. Participants were monitored throughout the duration of their hockey game for “On-Ice” responses and during seated bench time (“Bench”), and for a brief period afterwards. On-Ice HR’s and blood pressures were significantly higher than values obtained during maximal cycle exercise (HR 174±8.9 vs. 163±11.0 bpm) (SBP 17%; DBP 15%) (p<0.05), Blood pressures decreased throughout the duration of the game while HR increased significantly. The On-Ice endocardial viability ratio (EVR), an index of myocardial oxygen supply and demand, did not change from early (1.56±0.05) to late (1.44± 0.06) in the game. In conclusion, recreational hockey is an extremely vigorous form of interval exercise that produces cardiovascular responses exceeding intensities commonly recommended for continuous training.

To develop reference standards for cardiorespiratory fitness (CRF) from directly measured maximum oxygen consumption using the Ball State University Adult Physical Fitness Program (APFP) cohort. The APFP cohort is an open cohort of self-referred participants since 1971. From 3,212 individual participants, 2,642 male and 1,741 female (18-79 years) test files remained after exclusion criteria was met. Gender-specific age, physical activity (PA), body mass index (BMI), and smoking status CRF reference standards were developed. Men had greater mean CRF (35%) than women and consistently had greater mean CRF according to age, PA, BMI, and smoking status (p<.05). CRF was approximately 10% lower across each decade of age, and was greater with increasing PA compared to the sedentary group. Greater classes of BMI had lower CRF, and CRF was 5% greater in non-smokers compared to current smokers. A pooled CRF registry is recommended for a larger and more diverse cohort. / School of Physical Education, Sport, and Exercise Science

Our aim in this research was to study monotone operators in Banach spaces. In particular, the most important concept in this theory, the maximal monotone operators. Here we make an attempt to describe most of the important results and concepts on maximal monotone operators and how they all tie together. We will take a brief look at subdifferentials, which generalize the notion of a derivative. The subdifferential is a maximal monotone operator and it has proved to be of fundamental importance for the study of maximal monotone operators. The theory of maximal monotone operators is somewhat complete in reflexive Banach spaces. However, in nonreflexive Banach spaces it is still to be developed fully. As such, here we will describe most of the important results about maximal monotone operators in Banach spaces and we will distinguish between the reflexive Banach spaces and nonreflexive Banach spaces when a property is known to hold only in reflexive Banach spaces. In the latter case, we will state what the corresponding situation is in nonreflexive Banach spaces and we will give counter examples whenever such a result is known to fail in nonreflexive Banach spaces. The representations of monotone operators by convex functions have found to be extremely useful for the study of maximal monotone operators and it has generated a lot of interest of late. We will discuss some of those key representations and their properties. We will also demonstrate how these representations could be utilized to obtain results about maximal monotone operators. We have included a discussion about the very important Rockafellar sum theorem and some its generalizations. This key result and its generalizations have only been proved in reflexive Banach spaces. We will also discuss several special cases where the Rockafellar sum theorem is known to be true in nonreflexive Banach spaces. The subclasses which provide a basis for the study of monotone operators in nonreflexive Banach spaces are also discussed here

Thesis (Ph.D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2008. / Committee Chair: Ozlem Ergun; Committee Member: Dana Randall; Committee Member: Joel Sokol; Committee Member: Shabbir Ahmed; Committee Member: William Cook.

Thesis (Ph. D.)--University of Chicago, Dept. of Mathematics, August 2000. / Includes bibliographical references. Also available on the Internet.

Thesis (Ph. D.)--Oregon State University, 1994. / Typescript (photocopy). Includes bibliographical references (leaves 41-45). Also available on the World Wide Web.

A graph G is maximal nontraceable (MNT) (maximal nonhamiltonian (MNH)) if G is not traceable (hamiltonian), i.e. does not contain a hamiltonian path (cycle), but G+xy is traceable (hamiltonian) for all nonadjacent vertices x and y in G. A graph G is hypohamiltonian if G is not hamiltonian, but every vertex deleted subgraph G -u of G is hamiltonian. A graph which is maximal nonhamiltonian and hypohamiltonian is called maximal hypohamiltonian (MHH). Until recently, not much has appeared in the literature about MNT graphs, although there is an extensive literature on MNH graphs. In 1998 Zelinka constructed two classes of MNT graphs and made the conjecture, which he later retracted, that every MNT graph belongs to one of these classes. We show that there are many different types of MNT graphs that cannot be constructed by Zelinka's methods. Although we have not been able to characterize MNT graphs in general, our attempt at characterizing MNT graphs with a specified number of blocks and cut-vertices enabled us to construct infinite families of non-Zelinka MNT graphs which have either two or three blocks. We consider MNT graphs with toughness less than one, obtaining results leading to interesting constructions of MNT graphs, some based on MHH graphs. One result led us to discover a non-Zelinka MNT graph of smallest order, namely of order 8. We also present examples of MNTgraphs with toughness at least one, including an infinite family of 2-connected, claw-free graphs. We find a lower bound for the size of 2-connected MNT graphs of order n. We construct an infinite family of 2-connected cubic MNT graphs of order n, using MHH graphs as building blocks. We thus find the minimum size of 2-connected MNT graphs for infinitely many values of n. We also present a construction, based on MHH graphs, of an infinite family of MNT graphs that are almost cubic. We establish the minimum size of MNT graphs of order n, for all except 26 values of n, and we present a table of MNT graphs of possible smallest size for the excluded 26 values of n. / Mathematical Sciences / PHD (MATHEMATICS)

abstract: The Tamari lattices have been intensely studied since they first appeared in Dov Tamari’s thesis around 1952. He defined the n-th Tamari lattice T(n) on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Despite their interesting aspects and the attention they have received, a formula for the number of maximal chains in the Tamari lattices is still unknown. The purpose of this thesis is to convey my results on progress toward the solution of this problem and to discuss future work. A few years ago, Bergeron and Préville-Ratelle generalized the Tamari lattices to the m-Tamari lattices. The original Tamari lattices T(n) are the case m=1. I establish a bijection between maximum length chains in the m-Tamari lattices and standard m-shifted Young tableaux. Using Thrall’s formula, I thus derive the formula for the number of maximum length chains in T(n). For each i greater or equal to -1 and for all n greater or equal to 1, I define C(i,n) to be the set of maximal chains of length n+i in T(n). I establish several properties of maximal chains (treated as tableaux) and identify a particularly special property: each maximal chain may or may not possess a plus-full-set. I show, surprisingly, that for all n greater or equal to 2i+4, each member of C(i,n) contains a plus-full-set. Utilizing this fact and a collection of maps, I obtain a recursion for the number of elements in C(i,n) and an explicit formula based on predetermined initial values. The formula is a polynomial in n of degree 3i+3. For example, the number of maximal chains of length n in T(n) is n choose 3. I discuss current work and future plans involving certain equivalence classes of maximal chains in the Tamari lattices. If a maximal chain may be obtained from another by swapping a pair of consecutive edges with another pair in the Hasse diagram, the two maximal chains are said to differ by a square move. Two maximal chains are said to be in the same equivalence class if one may be obtained from the other by making a set of square moves. / Dissertation/Thesis / Doctoral Dissertation Mathematics 2016

In 2004, Fisher constructed a map on a 2-disc that admitted a hyperbolic set not contained in any locally maximal hyperbolic set. Furthermore, it was shown that this was an open property, and that it was embeddable into any smooth manifold of dimension greater than one. In the present work we show that analogous results hold for flows. Specifically, on any smooth manifold with dimension greater than or equal to three there exists an open set of flows such that each flow in the open set contains a hyperbolic set that is not contained in a locally maximal one.

Maximal unramified extensions of quadratic number fields have been well studied. This thesis focuses on maximal unramified extensions of cyclic cubic fields. We use the unconditional discriminant bounds of Moreno to determine cyclic cubic fields having no non-solvable unramified extensions. We also use a theorem of Roquette, developed from the method of Golod-Shafarevich, and some results by Cohen to construct cyclic cubic fields in which the unramified extension is of infinite degree.