Mathematics Commons^™

Space-Time Discretizations Using Constrained First-Order System Least Squares (Cfosls), Kirill Voronin, Chak Shing Lee, Martin Neumüller, Paulina Sepulveda, Panayot S. Vassilevski

Portland Institute for Computational Science Publications

This paper studies finite element discretizations for three types of time-dependent PDEs, namely heat equation, scalar conservation law and wave equation, which we reformulate as first order systems in a least-squares setting subject to a space-time conservation constraint (coming from the original PDE). Available piece- wise polynomial finite element spaces in (n + 1)-dimensions for functional spaces from the (n + 1)-dimensional de Rham sequence for n = 3, 4 are used for the implementation of the method. Computational results illustrating the error behavior, iteration counts and performance of block-diagonal and monolithic geometric multi- grid preconditioners are …

Double Lie Algebroids And Representations Up To Homotopy, A. Gracia-Saz, M. Jotz Lean, K. C. H. Mackenzie, Rajan Amit Mehta

Mathematics Sciences: Faculty Publications

We show that a double Lie algebroid, together with a chosen decomposition, is equivalent to a pair of 2-term representations up to homotopy satisfying compatibility conditions which extend the notion of matched pair of Lie algebroids. We discuss in detail the double Lie algebroids arising from the tangent bundle of a Lie algebroid and the cotangent bundle of a Lie bialgebroid.

Simulating The Electrical Properties Of Random Carbon Nanotube Networks Using A Simple Model Based On Percolation Theory, Roberto Abril Valenzuela

Physics

Carbon nanotubes (CNTs) have been subject to extensive research towards their possible applications in the world of nanoelectronics. The interest in carbon nanotubes originates from their unique variety of properties useful in nanoelectronic devices. One key feature of carbon nanotubes is that the chiral angle at which they are rolled determines whether the tube is metallic or semiconducting. Of main interest to this project are devices containing a thin film of randomly arranged carbon nanotubes, known as carbon nanotube networks. The presence of semiconducting tubes in a CNT network can lead to a switching effect when the film is electro-statically …

On Maxwell-Dirac Isomorphism, Florentin Smarandache, Victor Christianto

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

The Bellringer Sequence: Investigating What And How Preservice Mathematics Teachers Learn Through Pedagogies Of Enactment, Mary A. Ochieng

Dissertations

This study examines preservice teacher learning through pedagogies of enactment—approaches to teacher education that allow preservice teachers to learn by doing what teachers do. Preservice teacher (PST) learning is examined through the implementation of the Bellringer Sequence (BRS), a pedagogy of enactment conceptualized in the study. The BRS is centered around bellringers—brief mathematical tasks implemented as students arrive for class. The BRS is a sequence of four activities centered on a bellringer: preparation (for teaching a bellringer) implementation (of the bellringer with peers), debriefing (discussing the implementation as colleagues), and written reflection (about the effectiveness of the bellringer).

Practice-based approaches …

Induced Graph Colorings, Ian Hart

Dissertations

An edge coloring of a nonempty graph G is an assignment of colors to the edges of G. In an unrestricted edge coloring, adjacent edges of G may be colored the same. If every two adjacent edges of G are colored differently, then this edge coloring is proper and the minimum number of colors in a proper edge coloring of G is the chromatic index χ^/(G) of G. A proper vertex coloring of a nontrivial graph G is an assignment of colors to the vertices of G such that every two adjacent vertices of …

The Method Of Particular Solutions Using Trigonometric Basis Functions, Zhaolu Tian, Xinxiang Li, C.M. Fan, Ching-Shyang Chen

Faculty Publications

In this paper, the method of particular solutions (MPS) using trigonometric functions as the basis functions is proposed to solve two-dimensional elliptic partial differential equations. The inhomogeneous term of the governing equation is approximated by Fourier series and the closed-form particular solutions of trigonometric functions are derived using the method of undetermined coefficients. Once the particular solutions for the trigonometric basis functions are derived, the standard MPS can be applied for solving partial differential equations. In comparing with the use of radial basis functions and polynomials in the MPS, our proposed approach provides another simple approach to effectively solving two-dimensional …

Study Of Pseudo Bl–Algebras In View Of Left Boolean Lifting Property, B. Barani Nia, A. B. Saeid

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we define left Boolean lifting property (right Boolean lifting property) LBLP (RBLP) for pseudo BL–algebra which is the property that all Boolean elements can be lifted modulo every left filter (right filter) and next, we study pseudo BL-algebra with LBLP (RBLP). We show that Quasi local, local and hyper Archimedean pseudo BL–algebra that have LBLP (RBLP) has an interesting behavior in direct products. LBLP (RBLP) provides an important representation theorem for semi local and maximal pseudo BL–algebra.

On Refinements Of Hermite-Hadamard-Fejér Type Inequalities For Fractional Integral Operators, Fatma Ertuğral, Mehmet Z. Sarikaya, Hüseyin Budak

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, utilizing convex functions, we first establish new refinements of Hermite- Hadamard-Fejer type inequalities via Riemann-Liouville fractional integral operators. A generalized refinements of Hermite-Hadamard-Fejer type inequalities for fractional integral operators with exponential kernel is also obtained. The results given in this paper would provide extensions of those presented in earlier studies.

A Concise Workbook For College Algebra, Fei Ye

Open Educational Resources

This workbook is mainly based on the author’s worksheets for the college algebra course (MAD-119) at QCC of CUNY. It is intended as a concise introduction to college algebra at the intermediate level.

It contains 25 lessons. Each lesson, corresponding to roughly one class meeting, starts with a page on concepts, formulas and examples, and ends with a list of practice problems that students are expected to be able to solve and complete in class.

Distance Product Of Graphs, H. S. Mehta, U. P. Acharya

Applications and Applied Mathematics: An International Journal (AAM)

In graph theory, different types of product of two graphs have been studied, e.g. Cartesian product, Tensor product, Strong product, etc. Later on, Cartesian product and Tensor product have been generalized by 2-Cartesian product and 2-Tensor product. In this paper, we give one more generalize form, distance product of two graphs. Mainly we discuss the connectedness, bipartiteness and Eulerian property in this product.

On B-Chromatic Number Of Prism Graph Families, Nadeem Ansari, R. S. Chandel, Rizwana Jamal

Applications and Applied Mathematics: An International Journal (AAM)

A b-coloring of graph 𝐺 is a proper 𝑘-coloring 𝐶 that verifies the following property: for every color class 𝑐𝑖, 1≤𝑖≤𝑘, there exists a vertex 𝑥𝑖, with color 𝑐𝑖, such that all the other colors in 𝐶 are utilized in 𝑥𝑖 neighbors. The b-chromatic number of a graph 𝐺, denoted by 𝜑(𝐺), is the largest integer 𝑘 such that 𝐺 may have a b-coloring by 𝑘 colors. In this paper we discuss the b-coloring of prism graph 𝑌𝑛, central graph of prism graph 𝐶(𝑌𝑛), middle graph of prism graph 𝑀(𝑌𝑛) and the total graph of prism graph 𝑇(𝑌𝑛) and we …

Network Specializations, Symmetries, And Spectral Properties, Dallas C. Smith

Theses and Dissertations

In this dissertation, we introduce three techniques for network sciences. The first of these techniques is a series of new models for describing network growth. These models, called network specialization models, are built with the idea that networks grow by specializing the function of subnetworks. Using these models we create theoretical networks which exhibit well-known properties of real networks. We also demonstrate how the spectral properties are preserved as the models grow. The second technique we describe is a method for decomposing networks that contain automorphisms in a way that preserves the spectrum of the original graph. This method …

Symmetric Presentations, Representations, And Related Topics, Adam Manriquez

Electronic Theses, Projects, and Dissertations

The purpose of this thesis is to develop original symmetric presentations of finite non-abelian simple groups, particularly the sporadic simple groups. We have found original symmetric presentations for the Janko group J₁, the Mathieu group M₁₂, the Symplectic groups S(3,4) and S(4,5), a Lie type group Suz(8), and the automorphism group of the Unitary group U(3,5) as homomorphic images of the progenitors 2^*60 : (2 x A₅), 2^{*60 :} A₅, 2^*56 : (2³ : 7), and 2^*28 : (PGL(2,7):2), respectively. We have also discovered the groups 2 …

Modern Cryptography, Samuel Lopez

Electronic Theses, Projects, and Dissertations

We live in an age where we willingly provide our social security number, credit card information, home address and countless other sensitive information over the Internet. Whether you are buying a phone case from Amazon, sending in an on-line job application, or logging into your on-line bank account, you trust that the sensitive data you enter is secure. As our technology and computing power become more sophisticated, so do the tools used by potential hackers to our information. In this paper, the underlying mathematics within ciphers will be looked at to understand the security of modern ciphers.

An extremely important …

Identifying Prevalent Mathematical Pathways To Engineering In South Carolina, Eliza Gallagher, Christy Brown, D. Andrew Brown, Kristin Kelly Frady, Patrick Bass, Michael A. Matthews, Thomas T. Peters, Robert J. Rabb, Ikhalfani Solan, Ronald W. Welch, Anand K. Gramopadhye

Faculty Publications

National data indicate that initial mathematics course placement in college is a strong predictor of persistence to degree in engineering, with students placed in calculus persisting at nearly twice the rate of those placed below calculus. Within the state of South Carolina, approximately 95% of engineering-intending students who initially place below calculus are from in-state. In order to make systemic change, we are first analyzing system-wide data to identify prevalent educational pathways within the state, and the mathematical milestones along those pathways taken by students in engineering and engineering-related fields. This paper reports preliminary analysis of that data to understand …

Toroidal Embeddings And Desingularization, Leon Nguyen

Electronic Theses, Projects, and Dissertations

Algebraic geometry is the study of solutions in polynomial equations using objects and shapes. Differential geometry is based on surfaces, curves, and dimensions of shapes and applying calculus and algebra. Desingularizing the singularities of a variety plays an important role in research in algebraic and differential geometry. Toroidal Embedding is one of the tools used in desingularization. Therefore, Toroidal Embedding and desingularization will be the main focus of my project. In this paper, we first provide a brief introduction on Toroidal Embedding, then show an explicit construction on how to smooth a variety with singularity through Toroidal Embeddings.

Simple Groups, Progenitors, And Related Topics, Angelica Baccari

Electronic Theses, Projects, and Dissertations

The foundation of the work of this thesis is based around the involutory progenitor and the finite homomorphic images found therein. This process is developed by Robert T. Curtis and he defines it as 2^{*n} :N {pi w | pi in N, w} where 2^{*n} denotes a free product of n copies of the cyclic group of order 2 generated by involutions. We repeat this process with different control groups and a different array of possible relations to discover interesting groups, such as sporadic, linear, or unitary groups, to name a few. Predominantly this work was produced from transitive groups …

Graceful Colorings And Connection In Graphs, Alexis D. Byers

Dissertations

For a graph G of size m, a graceful labeling of G is an injective function f : V (G) → {0, 1, . . . , m} that gives rise to a bijective function f ¹ : E(G) → {1, 2, . . . , m} defined by f ¹(uv) = |f (u) − f (v)|. A graph is graceful if it has a graceful labeling. Over the years, a number of variations of graceful …

Gaussian Processes With Context-Supported Priors For Active Object Localization, Bruno Jedynak

Portland Institute for Computational Science Publications

We devise an algorithm using a Bayesian optimization framework in conjunction with contextual visual data for the efficient localization of objects in still images. Recent research has demonstrated substantial progress in object localization and related tasks for computer vision. However, many current state-of-the-art object localization procedures still suffer from inaccuracy and inefficiency, in addition to failing to provide a principled and interpretable system amenable to high-level vision tasks. We address these issues with the current research.

Our method encompasses an active search procedure that uses contextual data to generate initial bounding-box proposals for a target object. We train a convolutional …