Mathematics Commons^™

Bounded, Asymptotically Stable, And L^1 Solutions Of Caputo Fractional Differential Equations, Muhammad Islam

Mathematics Faculty Publications

The existence of bounded solutions, asymptotically stable solutions, and L¹ solutions of a Caputo fractional differential equation has been studied in this paper. The results are obtained from an equivalent Volterra integral equation which is derived by inverting the fractional differential equation. The kernel function of this integral equation is weakly singular and hence the standard techniques that are normally applied on Volterra integral equations do not apply here. This hurdle is overcomed using a resolvent equation and then applying some known properties of the resolvent. In the analysis Schauder's fixed point theorem and Liapunov's method have been employed. …

Maximizing The Impact Of Digital Supports In Mathematics Learning Support In Higher Education – An Overview Of The 9th Annual Imlsn Workshop, Cormac Breen, Anthony Cronin

Articles

In this article we give a short description of the 9th Annual Workshop of the Irish Mathematics Learning Support Network (IMLSN). The workshop theme was ‘Maximizing the impact of digital supports in Mathematics Learning Support in Higher Education’. We briefly describe the Irish Mathematics Learning Support Network (IMLSN) and outline the factors that motivated this workshop theme. We will also discuss the presentations, some of the issues that were raised during the workshop and we close with some brief conclusions on this very successful event.

Efficient Computational Strategies For Doubly Intractable Problems With Applications To Bayesian Social Networks, Alberto Caimo, Antonietta Mira

Articles

Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This …

Permutation Invariant Lattices, Lenny Fukshansky, Stephan Ramon Garcia, Xun Sun

Pomona Faculty Publications and Research

We say that a Euclidean lattice in Rⁿ is permutation invariant if its automorphism group has non-trivial intersection with the symmetric group S_n, i.e., if the lattice is closed under the action of some non-identity elements of S_n. Given a fixed element T E S_n, we study properties of the set of all lattices closed under the action of T: we call such lattices T-invariant. These lattices naturally generalize cyclic lattices introduced by Micciancio in [7,8], which we previously studied in [1]. Continuing our investigation, we discuss some basic properties of …

Derivatives Pricing With Accelerated Trinomial Trees, Conall O'Sullivan, Stephen O'Sullivan

Articles

Accelerated Trinomial Trees (ATTs) are a derivatives pricing lattice method that circumvent the restrictive time step condition inherent in standard trinomial trees and explicit finite difference methods (FDMs) in which the time step must scale with the square of the spatial step. ATTs consist of L uniform supersteps each of which contains an inner lattice/trinomial tree with N non-uniform subtime steps. Similarly to implicit FDMs, the size of the superstep in ATTs, a function of N, are constrained primarily by accuracy demands. ATTs can price options up to N times faster than standard trinomial trees (explicit FDMs). ATTs can be …

Polynomials Occuring In Generating Function Identities For B-Ary Partitions, David Dakota Blair

Graduate Student Publications and Research

Let p_b(n) be the number of integer partitions of n whose parts are powers of b. For each m there is a generating function identity:

f_m(b,q)\sum_{n} p_b(n) q^n = (1-q)^m \sum_{n} p_b(b^m n q)q^n

where n ranges over all integer values. The proof of this identity appears in the doctoral thesis of the author. For more information see http://dakota.tensen.net/2015/rp/.

This dataset is a JSON object with keys m from 1 to 23 whose values are f_m(b,q).

Why Right-Brain Cultures Are More Flexible: A Possible Explanation Of Yu. Manin's Observation, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Yuri Manin, a renowned mathematician, observed that it is much easier for a person raised in a right-brain culture to adjust to the left-brain environment than vice versa. In this paper, we provide a possible explanation for this phenomenon.

When An Idea Comes, Write It Down Right Away: Mathematical Justification Of Vladimir Smirnov's Advice, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Among several advices to students, Vladimir Smirnov, a renowned Russian mathematician, suggested that when an idea comes, it is better to write it down right away. In this paper, we provide a quantitative justification for this advice.

Model Spaces: A Survey, Stephan Ramon Garcia, William T. Ross

Pomona Faculty Publications and Research

This is a brief and gentle introduction, aimed at graduate students, to the subject of model subspaces of the Hardy space.

Stability Of Ideal Lattices From Quadratic Number Fields, Lenny Fukshansky

CMC Faculty Publications and Research

We study semi-stable ideal lattices coming from real quadratic number fields. Specifically, we demonstrate infinite families of semi-stable and unstable ideal lattices of trace type, establishing explicit conditions on the canonical basis of an ideal that ensure stability; in particular, our result implies that an ideal lattice of trace type coming from a real quadratic field is semi-stable with positive probability. We also briefly discuss the connection between stability and well-roundedness of Euclidean lattices.

The Finite Embeddability Property For Some Noncommutative Knotted Varieties Of Rl And Drl, Riquelmi Salvador Cardona Fuentes

Electronic Theses and Dissertations

Residuated lattices, although originally considered in the realm of algebra providing a general setting for studying ideals in ring theory, were later shown to form algebraic models for substructural logics. The latter are non-classical logics that include intuitionistic, relevance, many-valued, and linear logic, among others. Most of the important examples of substructural logics are obtained by adding structural rules to the basic logical calculus FL. We denote by ������ � the varieties of knotted residuated lattices. Examples of these knotted rules include integrality and contraction. The extension of �� by the rules corresponding to these two equations is …

Ring Patterns And Their Bifurcations In A Nonlocal Model Of Biological Swarms, Andrea L. Bertozzi, T Kolokolnikov, Hui Sun, David Uminsky, J Von Brecht

Mathematics

In this paper we study the pattern formation of a kinematic aggregation model for biological swarming in two dimensions. The swarm is represented by particles and the dynamics are driven by a gradient flow of a non-local interaction potential which has a local repulsion long range attraction structure. We leverage a co-dimension one formulation of the continuum gradient flow to characterize the stability of ring solutions for general interaction kernels. In the regime of long-wave instability we show that the resulting ground state is as a low mode bifurcation away from the ring and use weakly nonlinear analysis to provide …

Scrambled Squares, Jeremiah Farrell, Karen Farrell

Scholarship and Professional Work - LAS

Jeremiah's puzzle "Scrambled Squares", which was exchanged at the 2015 Ottawa International Puzzle Party. 100 puzzle designers create 100 copies of their puzzle and pass it out at the party and exchange them. This puzzle is also manufactured by Kate Jones as "Scrambled Squares".

Ua66 Ogden College Of Science & Engineering Newsletter, Cheryl Stevens, Dean

Ogden College of Science & Engineering Publications

No abstract provided.

Sophie Germain Primes And Involutions Of Znx, Karenna Genzlinger, Keir H. Lockridge

Math Faculty Publications

In the paper “What is special about the divisors of 24?”, Sunil Chebolu proved an interesting result about the multiplication tables of Zn from several different number theoretic points of view: all of the 1s in the multiplication table for Zn are located on the main diagonal if and only if n is a divisor of 24. Put another way, this theorem characterizes the positive integers n with the property that the proportion of 1s on the diagonal is precisely 1. The present work is concerned with finding the positive integers n for which there is a given fixed proportion …

A Mapping Theorem For Topological Complexity, Mark Grant, Gregory Lupton, John Oprea

Mathematics and Statistics Faculty Publications

We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and more generally for the rational sectional category of a map, in terms of the rational category of a certain auxiliary space. We use our results to deduce consequences for the global (rational) homotopy structure of simply connected, hyperbolic finite complexes.

Solutions Of A Logistic Equation On Varying Time Scales: A Quantitative And Qualitative Analysis, Alexandria Amity Amorim

Theses, Dissertations and Capstones

Time Scale Calculus, introduced by Dr. Stefan Hilger in 1988, combines the study of differential and difference equations into a single topic. We begin with an introduction of sets used in this field, time scales, and build up to the definition of the exponential function on a time scale. The main focus of this work is a study of the solutions of a particular logistic dynamic equation on varying time scales. We study both the analytical and graphical solutions of this equation. Analytical solutions are worked out using theorems from Time Scale Calculus, including properties of the exponential function. Graphical …

Architectural Acoustical Oddities, Zev C. Woodstock, Caroline P. Lubert

Department of Mathematics and Statistics - Faculty Scholarship

This paper offers a review of two types of acoustic oddity caused by periodic architecture. These periodic structures of interest are brick plazas and staircases with special dimensions. When an observer stands by one of these periodic structures and produces a percussive white noise, a high-pitched sound can be heard. The frequency of the returned sound is unrelated to the initial sound, and completely determined by the architecture of the structures themselves. This phenomenon is called repetition pitch. Comparative work done at James Madison University is offered to show the relationship between brick plazas at JMU and the repetition pitch …

Symmetry Groups Associated With Tilings On A Flat Torus, Ma. Louise Antonette N. De Las Peñas, Mark L. Loyola, Grace M. Estrada, Eko Budi Santoso

Mathematics Faculty Publications

This work investigates symmetry and color symmetry properties of Kepler, Heesch and Laves tilings embedded on a flat torus and their geometric realizations as tilings on a round torus in Euclidean 3-space. The symmetry group of the tiling on the round torus is determined by analyzing relevant symmetries of the planar tiling that are transformed to axial symmetries of the three-dimensional tiling. The focus on studying tilings on a round torus is motivated by applications in the geometric modeling of nanotori and the determination of their symmetry groups.

A Plausibly Deniable Encryption Scheme For Personal Data Storage, Andrew Brockmann

HMC Senior Theses

Even if an encryption algorithm is mathematically strong, humans inevitably make for a weak link in most security protocols. A sufficiently threatening adversary will typically be able to force people to reveal their encrypted data. Methods of deniable encryption seek to mend this vulnerability by allowing for decryption to alternate data which is plausible but not sensitive. Existing schemes which allow for deniable encryption are best suited for use by parties who wish to communicate with one another. They are not, however, ideal for personal data storage. This paper develops a plausibly-deniable encryption system for use with personal data storage, …