Mathematics Commons^™

Zero-Bounded Limits As A Special Case Of The Squeeze Theorem For Evaluating Single-Variable And Multivariable Limits, Eleftherios Gkioulekas

School of Mathematical & Statistical Sciences Faculty Publications

Many limits, typically taught as examples of applying the ‘squeeze’ theorem, can be evaluated more easily using the proposed zero-bounded limit theorem. The theorem applies to functions defined as a product of a factor going to zero and a factor that remains bounded in some neighborhood of the limit. This technique is immensely useful for both single-variable limits and multidimensional limits. A comprehensive treatment of multidimensional limits and continuity is also outlined.

Schroder Matrix As Inverse Of Delannoy Matrix, Tian-Xiao He, Sheng-Liang Yang, Sai-Nan Zheng, Shao-Peng Yuan

Scholarship

Using Riordan arrays, we introduce a generalized Delannoy matrix by weighted Delannoy numbers. It turn out that Delannoy matrix, Pascal matrix, and Fibonaccimatrix are all special cases of the generalized Delannoy matrices, meanwhile Schroder matrix and Catalan matrix also arise in involving inverses of the generalized Delannoy matrices. These connections are the focus of our paper. The half of generalized Delannoy matrix is also considered. In addition, we obtain a combinatorial interpretation for the generalized Fibonacci numbers.

Mass Transfer From A Vertical Flat Plate Due To A Constant Upward Flow, David Mcdonnell, Brendan Redmond, Lawrence J. Crane

Articles

This paper examines the mass transfer from a vertical flat surface of a soluble material due to a constant upward flow. The mass transfer rate due to this upward flow is calculated and used to obtain the distance along the surface at which the boundary layer separates. For relatively large velocities no separation will occur and the solution approaches that of forced convection on a horizontal surface.

Numerical Studies Of The Generalized L₁ Greedy Algorithm For Sparse Signals, Fangjun Arroyo, Edward Arroyo, Xiezhang Li, Jiehua Zhu

Mathematical Sciences: Faculty Publications

The generalized l₁ greedy algorithm was recently introduced and used to reconstruct medical images in computerized tomography in the compressed sensing framework via total variation minimization. Experimental results showed that this algorithm is superior to the reweighted l₁-minimization and l₁ greedy algorithms in reconstructing these medical images. In this paper the effectiveness of the generalized l₁ greedy algorithm in finding random sparse signals from underdetermined linear systems is investigated. A series of numerical experiments demonstrate that the generalized l₁ greedy algorithm is superior to the reweighted l₁-minimization and l₁ greedy algorithms …

Rademacher's Infinite Partial Fractions Conjecture Is (Almost Certainly) False, Andrew Sills, Doron Zeilberger

Mathematical Sciences: Faculty Publications

In his book Topics in Analytic Number Theory, Hans Rademacher conjectured that the limits of certain sequences of coefficients that arise in the ordinary partial fraction decomposition of the generating function for partitions of integers into at most N parts exist and equal particular values that he specified. Despite being open for nearly four decades, little progress has been made towards proving or disproving the conjecture, perhaps in part due to the difficulty in actually computing the coefficients in question. In this paper, we present a recurrence (alias difference equation) which provides a fast algorithm for calculating the Rademacher …

Distance-Based Graph Invariants Of Trees And The Harary Index, Stephan G. Wagner, Hua Wang, Xiao-Dong Zhang

Mathematical Sciences: Faculty Publications

Introduced in 1947, the Wiener index W(T) = ∑{u,v}⊆V(T) d(u, v) is one of the most thoroughly studied chemical indices. The extremal structures (in particular, trees with various constraints) that maximize or minimize the Wiener index have been extensively investigated. The Harary index H(T) = ∑{u,v}⊆V(T) , introduced in 1993, can be considered as the 'reciprocal analogue' of the Wiener index. From recent studies, it is known that the extremal structures of the Harary index and the Wiener index coincide in many instances, i.e., the graphs that maximize the Wiener index minimize the Harary index and vice versa. In this …

Greedy Trees, Subtrees And Antichains, Eric Ould Dadah Andriantiana, Stephan G. Wagner, Hua Wang

Mathematical Sciences: Faculty Publications

Greedy trees are constructed from a given degree sequence by a simple greedy algorithm that assigns the highest degree to the root, the second-, third-, ... highest degrees to the root's neighbors, and so on.

They have been shown to maximize or minimize a number of different graph invariants among trees with a given degree sequence. In particular, the total number of subtrees of a tree is maximized by the greedy tree. In this work, we show that in fact a much stronger statement holds true: greedy trees maximize the number of subtrees of any given order. This parallels recent …

Exponential Kleisli Monoids As Eilenberg-Moore Algebras, Dirk Hofmann, Frédéric Mynard, Gavin J. Seal

Mathematical Sciences: Faculty Publications

Lax monoidal powerset-enriched monads yield a monoidal structure on the category of monoids in the Kleisli category of a monad. Exponentiable objects in this category are identified as those Kleisli monoids with algebraic structure. This result generalizes the classical identification of exponentiable topological spaces as those whose lattice of open subsets forms a continuous lattice.

On Q-Analogs Of Wostenholme Type Congruences For Multiple Harmonic Sums, Jianqiang Zhao

Mathematical Sciences: Faculty Publications

Multiple harmonic sums are iterated generalizations of harmonic sums. Recently Dilcher has considered congruences involving q-analogs of these sums in depth one. In this paper we shall study the homogeneous case for arbitrary depth by using generating functions and shuffle relations of the q-analog of multiple harmonic sums. At the end, we also consider some non-homogeneous cases.

Proceedings Of The Seventh Annual Meeting Of The Georgia Association Of Mathematics Teacher Educators Introductory Texts

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

Contents of 7th Annual GAMTE Proceedings Front Matter:

• Proceedings Committee
• Officers of GAMTE
• Purposes and Goals of GAMTE
• Table of Contents
• Letter from President

How Differing Interpretations Of Making Mathematics Fun Influence Teaching Practice, Amanda Sawyer

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

I investigated an experienced teacher and a beginning teacher who held similar beliefs about making mathematics learning fun yet held different interpretations of implementation. I found when a teacher equated fun with problem solving, her classroom practice included activities with higher-level thinking skills. In contrast, a teacher who defined fun as students’ enjoyment layered manipulatives and group work on top of procedures. Therefore, teachers need opportunities to reflect on the nature of student understanding as a precursor to shaping their views of fun.

Negative phrases and attitudes toward mathematics have become commonplace in popular culture. Perhaps in response to this …

The Mathematics Teacher Educator’S Reflection On Edtpa: The Basics And The Complexity Of Georgia’S Implementation, Lynn Stallings, Woong Lim

Proceedings of the Annual Meeting of the Georgia Association of Mathematics Teacher Educators

Beginning in fall 2015, Georgia will require that all teacher candidates pass the edTPA, a performance-based assessment, as a requirement for initial certification. With the potential to impact teacher preparation programs in a profound way, the questions and issues related to the implementation of edTPA merit some critical reflection. In this article, we introduce the brief history of the instrument and review the basics of edTPA with a particular interest in middle grades mathematics. Furthermore, drawing upon our experience with edTPA during a pilot program and the extensive knowledge base of edTPA rubrics and scoring process, we present issues related …

Rna Profiles Of Porcine Embryos During Genome Activation Reveal Complex Metabolic Switch Sensitive To In Vitro Conditions, Olga Østrup, Gayla R. Olbricht, Esben Østrup, Poul Hyttel, Philippe Collas, Ryan A. Cabot

Mathematics and Statistics Faculty Research & Creative Works

Fertilization is followed by complex changes in cytoplasmic composition and extensive chromatin reprogramming which results in the abundant activation of totipotent embryonic genome at embryonic genome activation (EGA). While chromatin reprogramming has been widely studied in several species, only a handful of reports characterize changing transcriptome profiles and resulting metabolic changes in cleavage stage embryos. The aims of the current study were to investigate RNA profiles of in vivo developed (ivv) and in vitro produced (ivt) porcine embryos before (2-cell stage) and after (late 4-cell stage) EGA and determine major metabolic changes that regulate totipotency. The period before EGA was …

Convergence Analysis Of Markov Chain Monte Carlo Linear Solvers Using Ulam--Von Neumann Algorithm, Hao Ji, Michael Mascagni, Yaohang Li

Computer Science Faculty Publications

The convergence of Markov chain--based Monte Carlo linear solvers using the Ulam--von Neumann algorithm for a linear system of the form x = Hx + b is investigated in this paper. We analyze the convergence of the Monte Carlo solver based on the original Ulam--von Neumann algorithm under the conditions that ||H|| < 1 as well as ρ(H) < 1, where ρ(H) is the spectral radius of H. We find that although the Monte Carlo solver is based on sampling the Neumann series, the convergence of Neumann series is not a sufficient condition for the convergence of the Monte Carlo solver. Actually, properties of H are not the only factors determining the convergence of the Monte Carlo solver; the underlying transition probability matrix plays an important role. An improper selection of the transition matrix may result in divergence even though the condition ||H|| <1 holds. However, if the condition ||H|| < 1 is satisfied, we show that there always exist certain transition matrices that guarantee convergence of the Monte Carlo solver. On the other hand, if ρ(H) <1 but ||H|| ≥ 1, the Monte Carlo linear solver may or may not converge. In particular, if the row sum ∑ n/j= 1|H_ij > 1 for every row in H or, more generally, ρ(H⁺) >1, where H⁺ is the nonnegative matrix where H+_ij = |H_ij|, we show that transition matrices leading to convergence of the Monte Carlo solver do not exist. Finally, given …

Developing Crochet Patterns For Surfaces Of Non-Constant Curvature, Katherine Lea Pearce

Honors Program Theses

The purpose of this project is to develop an algorithm to create crochet patterns for a variety of surfaces. I start with surfaces of constant curvature: the Euclidean surface and the sphere. Then, I generate patterns for surfaces of revolution by calculating the change in circumference for each row of stitches. My methods suggest an approach to crochet more surfaces such as surfaces whose cross section is not a circle. This research demonstrates how crochet can act as a discrete model of differential geometry. Producing these patterns allows for further research into the surfaces themselves by providing accurate models as …

Equivalences Of Dessins D'Enfants, Rachel M. Volkert

Honors Program Theses

Dessins d'enfants are bipartite graphs with a cyclic ordering given to the set of edges that meet at each vertex. Merling and Perlis presented a method by which to construct pairs of dessins d'enfants using the permutations induced by the action of a finite group on the cosets of two locally conjugate subgroups of that group. They called these pairs of dessins Gassmann equivalent and investigated some of their properties. First, we discuss several properties of pairs of dessins that imply Gassmann equivalence. Then, using elementwise conjugate subgroups, we introduce and investigate a weaker type of equivalence of dessins, which …

Intensity-Based Skeletonization Of Cryoem Gray-Scale Images Using A True Segmentation-Free Algorithm, Kamal Al Nasr, Chunmei Liu, Mugizi Rwebangira, Legand Burge, Jing He

Computer Science Faculty Publications

Cryo-electron microscopy is an experimental technique that is able to produce 3D gray-scale images of protein molecules. In contrast to other experimental techniques, cryo-electron microscopy is capable of visualizing large molecular complexes such as viruses and ribosomes. At medium resolution, the positions of the atoms are not visible and the process cannot proceed. The medium-resolution images produced by cryo-electron microscopy are used to derive the atomic structure of the proteins in de novo modeling. The skeletons of the 3D gray-scale images are used to interpret important information that is helpful in de novo modeling. Unfortunately, not all features of the …

Nominal Coalgebraic Data Types With Applications To Lambda Calculus, Alexander Kurz, Daniela Petrişan, Paula Severi, Fer-Jan De Vries

Engineering Faculty Articles and Research

We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.

Nominal Computation Theory (Dagstuhl Seminar 13422), Mikołaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts

Engineering Faculty Articles and Research

This report documents the program and the outcomes of Dagstuhl Seminar 13422 “Nominal Computation Theory”. The underlying theme of the seminar was nominal sets (also known as sets with atoms or Fraenkel-Mostowski sets) and they role and applications in three distinct research areas: automata over infinite alphabets, program semantics using nominal sets and nominal calculi of concurrent processes.

Full Newton Step Interior Point Method For Linear Complementarity Problem Over Symmetric Cones, Andrii Berdnikov

College of Graduate Studies: Theses & Dissertations

In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global convergence of iterates which always stay in the the central path neighborhood. A global convergence of the method is proved and an upper bound for the number of iterations necessary to find ε-approximate solution of the problem is presented.

Generalized Analytic Fourier-Feynman Transform Of Functionals In A Banach Algebra F_(A1,A2)^(A,B), Jae Gil Choi, David Skough, Seung Jun Chang

Department of Mathematics: Faculty Publications

We introduce the Fresnel type class F_(A1,A2)^(a,b).We also establish the existence of the generalized analytic Fourier-Feynman transform for functionals in the Banach algebra F_(A1,A2)^(a,b).

Topological Convolution Algebras, Daniel Alpay, Guy Salomon

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we introduce a new family of topological convolution algebras of the form ⋃p∈NL2(S,μp), where S is a Borel semi-group in a locally compact group G, which carries an inequality of the type ∥f∗g∥p≤Ap,q∥f∥q∥g∥p for p>q+d where d pre-assigned, and Ap,q is a constant. We give a sufficient condition on the measures μp for such an inequality to hold. We study the functional calculus and the spectrum of the elements of these algebras, and present two examples, one in the setting of non commutative stochastic distributions, and the other related to Dirichlet series.

Pontryagin De Branges-Rovnyak Spaces Of Slice Hyperholomorphic Functions, Daniel Alpay, Fabrizio Colombo, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

We study reproducing kernel Hilbert and Pontryagin spaces of slice hyperholomorphic functions which are analogs of the Hilbert spaces of analytic functions introduced by de Branges and Rovnyak. In the first part of the paper we focus on the case of Hilbert spaces, and introduce in particular a version of the Hardy space. Then we define Blaschke factors and Blaschke products and we consider an interpolation problem. In the second part of the paper we turn to the case of Pontryagin spaces. We first prove some results from the theory of Pontryagin spaces in the quaternionic setting and, in particular, …

Clan Capitalism, Graph Distance, And Other Issues, Florentin Smarandache, Victor Christianto

Branch Mathematics and Statistics Faculty and Staff Publications

This book consists of 6 papers focusing on social and economic issues. The topics covered include graph distance and optimal communication, migration in Jaipur, urbanization, clan capitalism, world population growth rate, and scientific inquiry. These papers were written in the period between 20092010. Hopefully the readers will find some new insights in this collection of papers.

Neutrosophic Emergencies And Incidences, Florentin Smarandache, Stefan Vladutescu

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

Oblique-Length Contraction Factor In The Special Theory Of Relativity, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper one generalizes the Lorentz Contraction Factor for the case when the lengths are moving at an oblique angle with respect to the motion direction. One shows that the angles of the moving relativistic objects are distorted.

The Hyperbolic Menelaus Theorem In The Poincare Disc Model Of Hyperbolic Geometry, Florentin Smarandache, Catalin Barbu

Branch Mathematics and Statistics Faculty and Staff Publications

In this note, we present the hyperbolic Menelaus theorem in the Poincar´e disc of hyperbolic geometry.

Filters Via Neutrosophic Crisp Sets, A. A. Salama, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we introduce the notion of filter on the neutrosophic crisp set, then we consider a generalization of the filter’s studies. Afterwards, we present the important neutrosophic crisp filters. We also study several relations between different neutrosophic crisp filters and neutrosophic topologies. Possible applications to database systems are touched upon.

Correlation Coefficient Of Interval Neutrosophic Set, Said Broumi, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we introduce for the first time the concept of correlation coefficients of interval valued neutrosophic set (INS for short). Respective numerical examples are presented.

Intuitionistic Neutrosophic Soft Set, Said Broumi, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we study the concept of intuitionistic neutrosophic set of Bhowmik and Pal. We have introduced this concept in soft sets and defined intuitionistic neutrosophic soft set. Some definitions and operations have been introduced on intuitionistic neutrosophic soft set. Some properties of this concept have been established.