Matching Items (14)
Description
Over the last several centuries, mathematicians have developed sophisticated symbol systems to represent ideas often imperceptible to their five senses. Although conventional definitions exist for these notations, individuals attribute their personalized meanings to these symbols during their mathematical activities. In some instances, students might (1) attribute a non-normative meaning to a conventional symbol or (2) attribute viable meanings for a mathematical topic to a novel symbol. This dissertation aims to investigate the relationships between students’ meanings and personal algebraic expressions in the context of one topic: infinite series convergence. To this end, I report the results of two individual constructivist teaching experiments in which first-time second-semester university calculus students constructed symbols (called personal expressions) to organize their thinking about various topics related to infinite series. My results comprise three distinct sections. First, I describe the intuitive meanings that the two students, Monica and Sylvia, exhibited for infinite series convergence before experiencing formal instruction on the topic. Second, I categorize the meanings these students attributed to their personal expressions for series topics and propose symbol categories corresponding to various instantiations of each meaning. Finally, I describe two situations in which students modified their personal expressions throughout several interviews to either (1) distinguish between examples they initially perceived as similar or (2) modify a previous personal expression to symbolize two ideas they initially perceived as distinct. To conclude, I discuss the research and teaching implications of my explanatory frameworks for students’ symbolization. I also provide an initial theoretical framing of the cognitive mechanisms by which students create, maintain, and modify their personal algebraic representations.
ContributorsEckman, Derek (Author) / Roh, Kyeong Hah (Thesis advisor) / Carlson, Marilyn (Committee member) / Martin, Jason (Committee member) / Spielberg, John (Committee member) / Zazkis, Dov (Committee member) / Arizona State University (Publisher)
Created2023
Description
C*-algebras of categories of paths were introduced by Spielberg in 2014 and generalize C*-algebras of higher rank graphs. An approximately finite dimensional (AF) C*-algebra is one which is isomorphic to an inductive limit of finite dimensional C*-algebras. In 2012, D.G. Evans and A. Sims proposed an analogue of a cycle for higher rank graphs and show that the lack of such an object is necessary for the associated C*-algebra to be AF. Here, I give a class of examples of categories of paths whose associated C*-algebras are Morita equivalent to a large number of periodic continued fraction AF algebras, first described by Effros and Shen in 1980. I then provide two examples which show that the analogue of cycles proposed by Evans and Sims is neither a necessary nor a sufficient condition for the C*-algebra of a category of paths to be AF.
ContributorsMitscher, Ian (Author) / Spielberg, John (Thesis advisor) / Bremner, Andrew (Committee member) / Kalizsewski, Steven (Committee member) / Kawski, Matthias (Committee member) / Quigg, John (Committee member) / Arizona State University (Publisher)
Created2020
Description
A $k$-list assignment for a graph $G=(V, E)$ is a function $L$ that assigns a $k$-set $L(v)$ of "available colors" to each vertex $v \in V$. A $d$-defective, $m$-fold, $L$-coloring is a function $\phi$ that assigns an $m$-subset $\phi(v) \subseteq L(v)$ to each vertex $v$ so that each color class $V_{i}=\{v \in V:$ $i \in \phi(v)\}$ induces a subgraph of $G$ with maximum degree at most $d$. An edge $xy$ is an $i$-flaw of $\phi$ if $i\in \phi(x) \cap \phi(y)$. An online list-coloring algorithm $\mathcal{A}$ works on a known graph $G$ and an unknown $k$-list assignment $L$ to produce a coloring $\phi$ as follows. At step $r$ the set of vertices $v$ with $r \in L(v)$ is revealed to $\mathcal{A}$. For each vertex $v$, $\mathcal{A}$ must decide irrevocably whether to add $r$ to $\phi(v)$. The online choice number $\pt_{m}^{d}(G)$ of $G$ is the least $k$ for which some such algorithm produces a $d$-defective, $m$-fold, $L$-coloring $\phi$ of $G$ for all $k$-list assignments $L$. Online list coloring was introduced independently by Uwe Schauz and Xuding Zhu. It was known that if $G$ is planar then $\pt_{1}^{0}(G) \leq 5$ and $\pt_{1}^{1}(G) \leq 4$ are sharp bounds; here it is proved that $\pt_{1}^{3}(G) \leq 3$ is sharp, but there is a planar graph $H$ with $\pt_{1}^{2}(H)\ge 4$. Zhu conjectured that for some integer $m$, every planar graph $G$ satisfies $\pt_{m}^{0}(G) \leq 5 m-1$, and even that this is true for $m=2$. This dissertation proves that $\pt_{2}^{1}(G) \leq 9$, so the conjecture is "nearly" true, and the proof extends to $\pt_{m}^{1}(G) \leq\left\lceil\frac{9}{2} m\right\rceil$. Using Alon's Combinatorial Nullstellensatz, this is strengthened by showing that $G$ contains a linear forest $(V, F)$ such that there is an online algorithm that witnesses $\mathrm{pt}_{2}^{1}(G) \leq 9$ while producing a coloring whose flaws are in $F$, and such that no edge is an $i$-flaw and a $j$-flaw for distinct colors $i$ and $j$.
Contributorshan, ming (Author) / Kierstead, Henry A. (Thesis advisor) / Czygrinow, Andrzej (Committee member) / Sen, Arunabha (Committee member) / Spielberg, John (Committee member) / Fishel, Susanna (Committee member) / Arizona State University (Publisher)
Created2021
Description
In this paper we describe a new method of defining C*-algebras from oriented combinatorial data, thereby generalizing the construction of algebras from directed graphs, higher-rank graphs, and ordered groups. We show that only the most elementary notions of concatenation and cancellation of paths are required to define versions of Cuntz-Krieger and Toeplitz-Cuntz-Krieger algebras, and the presentation by generators and relations follows naturally. We give sufficient conditions for the existence of an AF core, hence of the nuclearity of the C*-algebras, and for aperiodicity, which is used to prove the standard uniqueness theorems.
ContributorsSpielberg, John (Author) / College of Liberal Arts and Sciences (Contributor)
Created2014-11-01