Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Applied Mathematics (2854)
- Computer Sciences (2379)
- Education (2193)
- Statistics and Probability (2019)
- Other Mathematics (1912)
-
- Arts and Humanities (1643)
- Analysis (1618)
- Algebra (1406)
- Science and Mathematics Education (1332)
- Discrete Mathematics and Combinatorics (1313)
- Geometry and Topology (1060)
- Physics (812)
- Higher Education (770)
- Teacher Education and Professional Development (726)
- Engineering (710)
- Social and Behavioral Sciences (618)
- History (602)
- Life Sciences (565)
- Logic and Foundations (563)
- Number Theory (558)
- History of Science, Technology, and Medicine (501)
- Algebraic Geometry (465)
- Medicine and Health Sciences (395)
- Applied Statistics (340)
- Dynamical Systems (325)
- Curriculum and Instruction (291)
- Biology (269)
- Set Theory (255)
- Institution
-
- TÜBİTAK (2581)
- Claremont Colleges (1981)
- University of New Mexico (956)
- University of the Pacific (807)
- Louisiana State University (799)
-
- University of Texas Rio Grande Valley (779)
- University of Texas at El Paso (659)
- Missouri University of Science and Technology (626)
- University of Texas at Arlington (550)
- Utah State University (525)
- Georgia Southern University (486)
- Taylor University (480)
- Marquette University (478)
- Indian Statistical Institute (466)
- University of Montana (426)
- University of South Florida (425)
- University of Nebraska - Lincoln (395)
- City University of New York (CUNY) (380)
- Old Dominion University (371)
- Technological University Dublin (356)
- Prairie View A&M University (340)
- University of Dayton (323)
- Chapman University (319)
- Smith College (294)
- Portland State University (292)
- University of Richmond (274)
- Brigham Young University (255)
- Rose-Hulman Institute of Technology (254)
- California State University, San Bernardino (242)
- Wayne State University (238)
- Keyword
-
- Mathematics (1165)
- Technical Reports (367)
- UTEP Computer Science Department (367)
- Algebra (276)
- Geometry (246)
-
- Statistics (205)
- Mathematics Research (196)
- Calculus (193)
- Graph theory (180)
- Math (175)
- Algorithms (151)
- Combinatorics (148)
- Differential equations (126)
- Optimization (125)
- Computer science (122)
- Neutrosophic logic (116)
- Probability (106)
- Stability (106)
- Education (105)
- Pure sciences (105)
- Number theory (99)
- Topology (99)
- Number Theory (97)
- Machine learning (85)
- Polynomials (85)
- Mathematics education (81)
- Mathematical modeling (69)
- Teaching (69)
- Cryptography (67)
- Department of Mathematical Sciences (66)
- Publication Year
- Publication
-
- Turkish Journal of Mathematics (2581)
- Branch Mathematics and Statistics Faculty and Staff Publications (748)
- Journal of Humanistic Mathematics (708)
- All Works by Eneström Number (654)
- School of Mathematical & Statistical Sciences Faculty Publications (618)
-
- Mathematics Faculty Publications (562)
- Departmental Technical Reports (CS) (553)
- Theses and Dissertations (542)
- Doctoral Theses (460)
- Mathematics and Statistics Faculty Research & Creative Works (443)
- Communications on Stochastic Analysis (429)
- Mathematics and Statistics Faculty Publications (418)
- The Mathematics Enthusiast (411)
- Humanistic Mathematics Network Journal (409)
- Electronic Theses and Dissertations (371)
- All HMC Faculty Publications and Research (352)
- Mathematics Technical Papers - Archive (343)
- Applications and Applied Mathematics: An International Journal (AAM) (339)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (323)
- Articles (320)
- Dissertations (290)
- Faculty Publications (288)
- Department of Mathematics: Faculty Publications (223)
- Mathematics, Physics, and Computer Science Faculty Articles and Research (216)
- Mathematical Sciences: Faculty Publications (194)
- Mathematics Sciences: Faculty Publications (192)
- Mathematics (188)
- Honors Theses (187)
- Undergraduate Journal of Mathematical Modeling: One + Two (182)
- Mathematics and Statistics Faculty Publications and Presentations (171)
- Publication Type
- File Type
Articles 991 - 1020 of 26863
Full-Text Articles in Mathematics
Agent-Based Modeling: Introduction And Actuarial Applications, Rick Gorvett
Agent-Based Modeling: Introduction And Actuarial Applications, Rick Gorvett
Mathematics and Economics Faculty Working Papers
Agent-based modeling (ABM) has become an important and valued approach to modeling complex systems. In this paper, I advocate for actuaries to recognize the complex systems-nature of socioeconomic and risk processes and for ABM models to become a regular resource in our actuarial toolkits. These models allow for the observation of potential macro-behavior emerging from the underlying agent-level micro-activity and characteristics. Therefore, ABM models can provide significant insight into the quantification of risk and the identification of optimal strategies. This paper is an introduction and guide to ABM models, and it includes several case studies to illustrate their utility.
A Selective Discontinuous Galerkin Implicit Particle-In-Cell Method For Plasma Simulation With Improved Interpolation, Siyu Wu, Yang Li, Hongtao Liu, Xiaoming He, Yong Cao
A Selective Discontinuous Galerkin Implicit Particle-In-Cell Method For Plasma Simulation With Improved Interpolation, Siyu Wu, Yang Li, Hongtao Liu, Xiaoming He, Yong Cao
Mathematics and Statistics Faculty Research & Creative Works
This article dynamically incorporates multiple ideas into the existing direct implicit particle-in-cell (DIPIC) method for plasma simulation, in order to dramatically improve the DIPIC method for its local mesh refinement needs based on Cartesian meshes as well as its interpolation needs based on the locally refined meshes. One key tool is to utilize the selective discontinuous Galerkin method, which is based on the interior penalty discontinuous Galerkin formulation and the regular local finite element basis functions, as the electric field solver in the DIPIC simulation. This hybrid type finite element method combines the advantages of both continuous and discontinuous finite …
A Short Proof Of The Lemma Of The Logarithmic Derivative In Several Complex Variables, Qi Han, Jingbo Liu
A Short Proof Of The Lemma Of The Logarithmic Derivative In Several Complex Variables, Qi Han, Jingbo Liu
All Faculty Scholarship (Archived)
In this work, we provide a concise proof of the logarithmic derivative lemma in Cn. We start by giving a complete proof of a critical result by Biancofiore and Stoll (Ann. of Math. Stud., No. 100, 29–45, 1981) via matrix theory, which is central to this area of study. Then, we follow Li (Trans. Amer. Math. Soc. 363, 6257–6267, 2011) and Ye (Math. Z. 222, 81–95, 1996) to present the shortest proof to date.
Math 115: College Algebra Instructor Guide, Seth Lehman
Math 115: College Algebra Instructor Guide, Seth Lehman
Open Educational Resources
OER instructor guide for Math 115, College Algebra, Queens College
Conditional Quantization For Some Discrete Distributions, Edgar A. Gonzalez, Mrinal Kanti Roychowdhury, David A. Salinas, Vishal Veeramachaneni
Conditional Quantization For Some Discrete Distributions, Edgar A. Gonzalez, Mrinal Kanti Roychowdhury, David A. Salinas, Vishal Veeramachaneni
School of Mathematical & Statistical Sciences Faculty Publications
Quantization for a Borel probability measure refers to the idea of estimating a given probability by a discrete probability with support containing a finite number of elements. If in the quantization some of the elements in the finite support are preselected, then the quantization is called a conditional quantization. In this paper, we have determined the conditional quantization, first for two different finite discrete distributions with a same conditional set, and for a finite discrete distribution with two different conditional sets. Next, we have determined the conditional and unconditional quantization for an infinite discrete distribution with support {12𝑛:𝑛∈ℕ}. We have …
All Graphs Of Order N With Distinguishing Number N−1 Or N − 2, Andi Pujo Rahadi, Edy Tri Baskoro, Suhadi Wido Saputro
All Graphs Of Order N With Distinguishing Number N−1 Or N − 2, Andi Pujo Rahadi, Edy Tri Baskoro, Suhadi Wido Saputro
Theory & Applications of Graphs
Let G be a simple connected graph. The distinguishing number of G, denoted by D(G), is the least integer d such that G has a vertex d-labeling preserved only by the trivial automorphism. In this paper, we characterize all graphs of order n with distinguishing number n − 1, or n − 2.
Similarity Metrics, Metrics, And Conditionally Negative Definite Functions, Daniel Alpay, Liora Mayats-Alpay
Similarity Metrics, Metrics, And Conditionally Negative Definite Functions, Daniel Alpay, Liora Mayats-Alpay
Mathematics, Physics, and Computer Science Faculty Articles and Research
We give an example of a similarity metric which is not positive definite, and present a general theorem which provides a large family of similarity metrics which are positive definite.
Global Attractivity Of Positive Solutions Of Higher Order Nonlinear Difference Equations And Its Applications, Abdulaziz Almaslokh
Global Attractivity Of Positive Solutions Of Higher Order Nonlinear Difference Equations And Its Applications, Abdulaziz Almaslokh
Theses and Dissertations
Difference equations play an effective role in many mathematical models that represent some phenomena in different fields such as physics, economics, engineering and biology. From this perspective, studying and analyzing such equations are interesting issues for the advancement of scientific research. In particular, studying the asymptotic behavior of positive solutions of some population models that are a system of difference equations has become a necessity. In this dissertation, we examine the global attractivity of positive solutions of certain higher order nonlinear difference equations and apply these results to some population models.
Entanglement Distribution Of Universal Quantum Cloners, James B. Daughtry
Entanglement Distribution Of Universal Quantum Cloners, James B. Daughtry
Student Scholarship
Szab`o et al. [4] show that universal quantum cloning machines may be used to manipulate entanglement between bipartite states. Entanglement is measured with concurrence, C, and it is shown that as the fidelity of the cloner improves, more entanglement transfers from the reference to the cloned state. This thesis characterizes the nature of this entanglement transfer by analyzing the entanglement distribution of the cloner. In this analysis we will show that entanglement is generally destroyed after cloning except in cases where there is no cloning, two identical qubits are created, or there is complete qubit transfer. Along with …
On The Special Cases Of Carmichael’S Totient Conjecture, Christopher Saito
On The Special Cases Of Carmichael’S Totient Conjecture, Christopher Saito
UNLV Theses, Dissertations, Professional Papers, and Capstones
Euler’s totient function, φ(n), is the arithmetic function defined as the number of positive integers less than or equal to n that are relatively prime to n. In his 1922 paper [3], Professor R. D. Carmichael conjectured that for each positive integer n, there exists at least one positive integer m̸ = n such that φ(m) = φ(n).In this thesis, we consider some relevant literature and explore Carmichael’s totient conjecture for particular values of φ(n) = k. Our main consideration will be the set X_k = {n ∈ N : φ(n) = k}. In identifying X_k for k = 2^t, …
The Concept Of T-Basis And Vector-Valued Hardy Classes, Bilal Bilalov, Sabina Rahib Sadigova
The Concept Of T-Basis And Vector-Valued Hardy Classes, Bilal Bilalov, Sabina Rahib Sadigova
Turkish Journal of Mathematics
This paper introduces the concept of a t-basis generated by some bilinear mapping t(·;·). It is considered the vector-valued class Lp(X) := Lp(J; X), 1 ≤ p < +∞, where J = [−π, π] and X is a Banach space with the UMD property, and it is proven that the classical system of exponents {eint}n∈ℤ forms a t-basis for Lp(X), 1 < p < +∞. Using this fact, the Hardy vector classes nHp±(X), 1 < p < +∞, different from the classical ones, are defined, and an equivalent definition of these classes is given and some of their properties are studied. In addition, the concept of t-Riesz property of a system of exponentials is introduced in Lp(X), 1 < p < +∞, and it is proved that this system has the t-Riesz property. A new method is given for establishing the Plemelj–Sokhotski formulas for X-valued Cauchy type integrals when X has the UMD property. An abstract analogue of the “1/4-Kadets” theorem is obtained for …
Independent Vs. Signed Musicians: Does Thier Status Affect Their Success?, Zachary Vincent
Independent Vs. Signed Musicians: Does Thier Status Affect Their Success?, Zachary Vincent
Honors Projects in Mathematics and Economics
As technology has advanced and become more widely available, and as the public learns more about the recording industry and its workings, more musicians are choosing not to sign with record labels, becoming independent musicians. This now raises the question: does a musician’s status of independent or signed determine their level of success? It has been previously found that independent musicians have a more difficult time competing with signed musicians due to the resources provided by record labels and the way labels negotiate with large streaming platforms, giving signed labels more opportunities to be seen in the public eye, but …
Algorithms To Estimate Contours: Two Applications Of Analytical Tools In Differential Geometry And Topology, Mohammad Abirul Islam
Algorithms To Estimate Contours: Two Applications Of Analytical Tools In Differential Geometry And Topology, Mohammad Abirul Islam
Computer Science ETDs
We develop distributed robotics algorithms with analytical tools needed to define and analyze angle turned and distance traversed by robots executing geometric algorithms. We then use these analytical tools to obtain information, via sensor measurements, about an a priori unknown surface. Our contributions are threefold. First, we develop the Sketch Algorithm, which estimates the boundary of any unknown contour and is asymptotically optimal in terms of distance traversed and angle turned. Second, we present experimental field work that validates the Sketch Algorithm. Finally, we propose an approach to find multiple sources of a surface with potential applications to approximate that …
Analyticity, Superoscillations And Supershifts In Several Variables, Fabrizio Colombo, Irene Sabadini, Daniele C. Struppa, Alain Yger
Analyticity, Superoscillations And Supershifts In Several Variables, Fabrizio Colombo, Irene Sabadini, Daniele C. Struppa, Alain Yger
Mathematics, Physics, and Computer Science Faculty Articles and Research
Superoscillations have roots in various scientific disciplines, including optics, signal processing, radar theory, and quantum mechanics. This intriguing mathematical phenomenon permits specific functions to oscillate at a rate surpassing their highest Fourier component. A different way of thinking about superoscillations consists in realizing that it is possible to reproduce the exponential function far away from the origin by only knowing its value in a countable set of points near the origin. By using this perspective, one can extend the idea of superoscillations to functions that are not a sum of exponential functions, namely to the notion of supershift. The study …
Applications Of The Mathieu Groups And Information Theory In Dna Encoding Functions, Juan C. Nava Jr
Applications Of The Mathieu Groups And Information Theory In Dna Encoding Functions, Juan C. Nava Jr
Theses and Dissertations
A foundational idea in mathematics lies in breaking down existing components into their bare fundamentals. As evidenced by prime numbers and composites, we learn this idea at an early age. Categorizing these broken-down components into their simplest form allows mathematicians to construct proofs from emergent patterns. John Conway’s Atlas of Finite Groups in the 1990s was particularly concerned with the categorization of structures known as groups. There are certain axioms a group must adhere to, which amount to the retention of symmetry; ultimately a group helps us to better understand symmetric actions performed on a set with a binary operation. …
Pluricomplex Green Functions And Transform Methods For The Laplacian, Jesse Joel Hulse
Pluricomplex Green Functions And Transform Methods For The Laplacian, Jesse Joel Hulse
Dissertations - ALL
There are two research themes within complex analysis presented. The first is developing generalizations of the Unified Transform Method as a novel way to compute fluid flows and numerically solve boundary value problems for holomorphic functions and solutions to the Laplacian and complex Helmholtz equation. The second is finding a formula for the pluricomplex Green function with two poles of equal weights for the bidisk. The Unified Transform Method (also sometimes known as the Fokas Method) is a technique for numerically solving boundary value problems for linear and integrable nonlinear PDEs. Crowdy reformulated the Unified Transform Method in the complex …
Asymptotics Of Fubini-Study Currents For Sequences Of Line Bundles, Melody Ann Wolff
Asymptotics Of Fubini-Study Currents For Sequences Of Line Bundles, Melody Ann Wolff
Dissertations - ALL
Let $(X,\omega)$ be a Kähler manifold, and $L_p$ be a sequence of line bundles on $X$ equipped with continuous hermitian metrics $h_p$. Let $\gamma_p$ be the Fubini-Study current and $h_p^{eq}$ the equilibrium metric corresponding to the metric $h_p$. Our goal is to generalize a theorem of Tian in Complex Geometry to a setting using arbitrary line bundles equipped with metrics with non-positive curvature. This amounts to finding sufficient conditions for $\gamma_p-c_1(L_p,h_p^{eq})$, when appropriately scaled, to converge to $0$ in the sense of currents. To achieve this goal, we imply methods of Demailly and the Oshawa-Takegoshi Extension Theorem to bound a …
Encircling Chains Around 4- And 6-Clusters In Fullerenes, Hannah Melissa Kimbrell
Encircling Chains Around 4- And 6-Clusters In Fullerenes, Hannah Melissa Kimbrell
Dissertations - ALL
Fullerenes are purely carbon molecules which can be represented by a 3-regular planar graph consisting of only hexagonal and (exactly 12) pentagonal faces. Since carbon atoms have valence 4 but our graphs are trivalent we need to double the edges in a perfect matching to bring the valence up to 4. The edges in a perfect matching form a Kekulé structure and the hexagonal faces bound by three Kekulé edges are called benzene rings. A maximal independent set of benzene rings for a given Kekulé structure is called a Clar set, and the maximum possible size of a Clar set …
Maximal Simple Regular Matroids, Elana Joy Israel
Maximal Simple Regular Matroids, Elana Joy Israel
Dissertations - ALL
In 1980, Seymour completely classified regular matroids. In this thesis, we use this classification to provide a complete list of maximal simple regular matroids up through rank six. In each rank, exactly one of these is graphic. Additionally, there are one, two, and eight cographic, but not graphic, maximal simple regular matroids in ranks four, five, and six, respectively. In rank five, we also have the 10-element sporadic matroid, and in rank six we have a 12-element maximal simple regular matroid and 16-element maximal simple regular matroid, both of which are decomposable matroids that are not graphic, cographic, or sporadic. …
On The Embeddability Of Small Cubic Graphs Into The Torus, Marie Kramer
On The Embeddability Of Small Cubic Graphs Into The Torus, Marie Kramer
Dissertations - ALL
The embeddability of graphs into different surfaces has been studied for nearly a century. In 1930, Kuratowski famously proved that a graph is planar if and only if it does not contain the complete graph K5 or the complete bipartite graph K3,3 as a topological minor. In particular, K3,3 is the only cubic obstructions for the plane. This sparked interest in two different directions: What are analogous results for other surfaces, and what can be said about embeddings of K5 and K3,3 into other surfaces? Regarding the first question, it was shown in the 1970s and 80s by Glover, Huneke, …
Exploration Into Homotopy Equivalence And Vietoris-Rips Complexes, Alexander J. Mobley
Exploration Into Homotopy Equivalence And Vietoris-Rips Complexes, Alexander J. Mobley
Honors Theses
An important question in discrete topology and geometry is how to recover the structure and characteristics of a manifold when only given a finite set of points sampled from that manifold. Thus, if mathematicians have a point cloud of data which induces a discrete metric space, they look for some structure to these points. Understanding the structure of these points often gives needed insight to solve this problem. One such way to determine structure to these points is to use these points to construct a Vietoris-Rips complex. In abstract, Latschev shows that this allows us to recover the homotopy type …
Crystallization Of The Quantized Function Algebras Of Suq(N + 1), Manabendra Giri
Crystallization Of The Quantized Function Algebras Of Suq(N + 1), Manabendra Giri
Doctoral Theses
The $q$-deformation of a connected, simply connected Lie group $G$ is typically studied through two Hopf algebras associated with it: the quantized universal enveloping algebra $\mathcal{U}_q(\mathfrak{g})$ and the quantized function algebra $\mathcal{O}(G_q)$. If $G$ has a compact real form $K$, one can use the Cartan involution to give a $*$-structure on $\mathcal{O}(G_q)$. The QFA $\mathcal{O}(G_q)$ with this $*$ structure is denoted by $\mathcal{O}(K_q)$ and its $C^*$-completion by $C(K_q)$. Here we study the crystal limits of $\mathcal{O}(SU_q(n+1))$ and $C(SU_q(n+1))$ and classify all irreducible representations of the crystallized algebras. We also prove that the crystallized algebra carries a natural bialgebra structure.
Understanding Student And Teacher Perceptions Of A Checking For Accuracy Method In Algebra Class, Abigail A. Jameson
Understanding Student And Teacher Perceptions Of A Checking For Accuracy Method In Algebra Class, Abigail A. Jameson
Masters of Education in Teaching and Learning
Mathematics encompasses learning from one’s mistakes and developing accuracy with problem-solving. This action research study analyzed the classroom teacher’s and students' perceptions of a checking for accuracy math method that was implemented in an eighth-grade algebra classroom. Additionally, the researcher wanted to understand how the participants felt about the accuracy method and its influence on students’ attitudes toward math and mastery of math concepts. Student surveys, individual teacher (with student artifacts) and student interviews and focus groups (with individual artifacts) were the qualitative data collected using the constant comparative method. Descriptive statistics was used to collect quantitative data with calculated …
Derived $P$-Adic Heights And The Leading Coefficient Of The Bertolini–Darmon–Prasanna $P$-Adic $L$-Function, Francesc Castella, Chi-Yun Hsu, Debanjana Kundu, Yu-Sheng Lee, Zheng Liu
Derived $P$-Adic Heights And The Leading Coefficient Of The Bertolini–Darmon–Prasanna $P$-Adic $L$-Function, Francesc Castella, Chi-Yun Hsu, Debanjana Kundu, Yu-Sheng Lee, Zheng Liu
School of Mathematical & Statistical Sciences Faculty Publications
Let E/Q be an elliptic curve and let p be an odd prime of good reduction for E. Let K be an imaginary quadratic field satisfying the classical Heegner hypothesis and in which p splits. The goal of this paper is two-fold: (1) we formulate a p-adic BSD conjecture for the p-adic L-function LBDP p introduced by Bertolini–Darmon–Prasanna [Duke Math. J. 162 (2013), pp. 1033–1148]; and (2) for an algebraic analogue F BDP p of LBDP p , we show that the “leading coefficient” part of our conjecture holds, and that the “order of vanishing” part follows from the expected …
Statistics - What Does My Data Say About Me?, Taylor Gadsden-Deterville
Statistics - What Does My Data Say About Me?, Taylor Gadsden-Deterville
Student Scholar Symposium Abstracts and Posters
For my Introduction to Statistics Class, I have been tasked with collecting unique, personal data to give insight into my daily routine. I decided to record nine different outcomes (two qualitative and seven quantitative). On February 6, 2025, I began with a blank Excel sheet, and so far, I have 57 full days of data collected. I will continue monitoring my findings for the remainder of the Spring 2025 Semester. Per my project instructions, I must include tables and graphs for my qualitative and quantitative outcomes. So far, I have collected daily quantitative data on my screen time (Instagram and …
A Preliminary Study Of Hilbert–Kunz Functions: Coefficient Behavior In A Normal Affine Semigroup Ring, Jesus A. Mendiola Herrera
A Preliminary Study Of Hilbert–Kunz Functions: Coefficient Behavior In A Normal Affine Semigroup Ring, Jesus A. Mendiola Herrera
Theses and Dissertations
In 1890, David Hilbert published a set of notes on what now constitutes one of the bases of Commutative Algebra; his work would eventually influence the efforts of mathematicians like Ernst Kunz. In 1969, Ernst Kunz introduced a particular mapping regarding modules of regular local rings. His goal was to characterize Noetherian local rings of prime characteristic by computing the length of the composition series under Frobenius power transformations. In this thesis, the focus will be on stating the initial steps on finding the coefficients of the Hilbert-Kunz function of the normal affine semigroup ring of the form R = …
Adding Libraries To The Equation: Mathematical Sciences’ Underutilization Of Academic Librarians, Jennifer L.C. Burke, Elizabeth C. Novosel, Daniel G. Kipnis, Rasitha R. Jayesekere
Adding Libraries To The Equation: Mathematical Sciences’ Underutilization Of Academic Librarians, Jennifer L.C. Burke, Elizabeth C. Novosel, Daniel G. Kipnis, Rasitha R. Jayesekere
Libraries Scholarship
Academic librarians do not engage with all disciplinary departments equally. Despite equal or even greater efforts, some departments are less responsive to librarian outreach. One such department is mathematics. To understand mathematics departments’ relationships with their academic librarians, three mathematics librarians created a 20-question survey that was disseminated to mathematics faculty, instructors, and instructional staff in the United States and Canada. Of the 188 survey participants, more than a third reported that they never engage with their librarians, approximately half only do so occasionally, and a mere eight percent of participants collaborated with librarians to provide information literacy instruction (IL) …
A Zariski-Nagata Theorem For Smooth Toric Surfaces, Jordan Vincent Barrett
A Zariski-Nagata Theorem For Smooth Toric Surfaces, Jordan Vincent Barrett
Dissertations and Doctoral Documents, University of Nebraska-Lincoln, 2023–
The Affine Zariski-Nagata theorem is a classical result in commutative algebra that gives an expression for the nth symbolic power of a radical ideal I in a polynomial ring over a field in terms of the nth ordinary powers of the maximal ideals in [affine variety]max(I). In this thesis we discuss a well-known projective analog of Zariski-Nagata and provide the necessary background on toric varieties to present a generalization of this result to toric surfaces. We conclude with a brief discussion about work toward characterizing which abstract toric varieties have smooth point fibers with …
Oriented Matroid Circuit Polytopes, Jodi Mcwhirter
Oriented Matroid Circuit Polytopes, Jodi Mcwhirter
Arts & Sciences Graduate Student Theses and Dissertations
Matroids give rise to several natural constructions of polytopes. Inspired by this, we examine polytopes that arise from the signed circuits of an oriented matroid. We give the dimensions of these polytopes arising from graphical oriented matroids and their duals. Moreover, we consider polytopes constructed from cocircuits of oriented matroids generated by the positive roots in any type A root system. We give an explicit description of their face structure and determine the Ehrhart series. We also study an action of the symmetric group on these polytopes, giving a full description the subpolytopes fixed by each permutation. These type A …
Transformations Of Bound Quivers, Ari Pincus-Kazmar
Transformations Of Bound Quivers, Ari Pincus-Kazmar
Mathematics, Statistics, and Computer Science Honors Projects
A quiver Q is a directed multigraph. Representations of Q are assignments of vector spaces and linear maps to the vertices and arrows of Q; these are categorically equivalent to the modules over the path algebra kQ. The indecomposable representations of a given quiver and the irreducible morphisms between them are summarized combinatorially in the Auslander-Reiten quiver which, in the case of algebras of finite representation type, gives almost complete information about the category of representations. We introduce an intuitive transformation from a family of bound quivers to a family of A-type quivers which preserves properties of the Auslander-Reiten quiver.