Other Mathematics Commons^™

Emergence And Complexity In Music, Zoe Tucker

HMC Senior Theses

How can we apply mathematical notions of complexity and emergence to music, and how can these mathematical ideas then inspire new musical works? Using Steve Reich's Clapping Music as a starting point, we look for emergent patterns in music by considering cases where a piece's complexity is significantly different from the total complexity of each of the individual parts. Definitions of complexity inspired by information theory, data compression, and musical practice are considered. We also consider the number of distinct musical pieces that could be composed in the same manner as Clapping Music. Finally, we present a new musical …

Platonismes, Marco Panza

MPP Published Research

Selon la vulgata philosophique, le platonisme concernant un certain domaine de recherche est la thèse affirmant que ce domaine concerne des objets qui lui sont propres, dont l’existence est indépendante de l’activité cognitive humaine. Souvent, dans la même vulgata on parle aussi de platonisme pour se référer à une thèse un peu différente, d’après laquelle ce qu’on dit concernant ce domaine est vrai ou faux indépendamment de toute justification ou réfutation que l’on puisse apporter. Naturellement, si parmi les énoncées ayant trait à ce demain, il y en a qu’on peut prendre comme particulièrement surs du fait d’en avoir une …

Foreword: Special Issue On Coalgebraic Logic, Alexander Kurz

Engineering Faculty Articles and Research

The second Dagstuhl seminar on coalgebraic logics took place from October 7-12, 2012, in the Leibniz Forschungszentrum Schloss Dagstuhl, following a successful earlier one in December 2009. From the 44 researchers who attended and the 30 talks presented, this collection highlights some of the progress that has been made in the field. We are grateful to Giuseppe Longo and his interest in a special issue in Mathematical Structures in Computer Science.

The Positivication Of Coalgebraic Logics, Fredrik Dahlqvist, Alexander Kurz

Engineering Faculty Articles and Research

We present positive coalgebraic logic in full generality, and show how to obtain a positive coalgebraic logic from a boolean one. On the model side this involves canonically computing a endofunctor T': Pos->Pos from an endofunctor T: Set->Set, in a procedure previously defined by the second author et alii called posetification. On the syntax side, it involves canonically computing a syntax-building functor L': DL->DL from a syntax-building functor L: BA->BA, in a dual procedure which we call positivication. These operations are interesting in their own right and we explicitly compute posetifications and positivications in the case …

Features Of Agent-Based Models, Reiko Heckel, Alexander Kurz, Edmund Chattoe-Brown

Engineering Faculty Articles and Research

The design of agent-based models (ABMs) is often ad-hoc when it comes to defining their scope. In order for the inclusion of features such as network structure, location, or dynamic change to be justified, their role in a model should be systematically analysed. We propose a mechanism to compare and assess the impact of such features. In particular we are using techniques from software engineering and semantics to support the development and assessment of ABMs, such as graph transformations as semantic representations for agent-based models, feature diagrams to identify ingredients under consideration, and extension relations between graph transformation systems to …

Optimization Methods For Tabular Data Protection, Iryna Petrenko

College of Graduate Studies: Theses & Dissertations

In this thesis we consider a minimum distance Controlled Tabular Adjustment (CTA) model for statistical disclosure limitation (control) of tabular data. The goal of the CTA model is to find the closest safe table to some original tabular data set that contains sensitive information. The measure of closeness is usually measured using l₁ or l₂ norm; with each measure having its advantages and disadvantages. According to the given norm CTA can be formulated as an optimization problem: Liner Programing (LP) for l₁, Quadratic Programing (QP) for l₂. In this thesis we present an alternative …

Arithmetic | Algebra, Samar Elhitti, Marianna Bonanome, Holly Carley, Thomas Tradler, Lin Zhou

Open Educational Resources

Arithmetic | Algebra provides a customized open-source textbook for the math developmental students at New York City College of Technology. The book consists of short chapters, addressing essential concepts necessary to successfully proceed to credit-level math courses. Each chapter provides several solved examples and one unsolved “Exit Problem”. Each chapter is also supplemented by its own WeBWork online homework assignment. The book can be used in conjunction with WeBWork for homework (online) or with the Arithmetic | Algebra Homework handbook (traditional). The content in the book, WeBWork and the homework handbook are also aligned to prepare students for the CUNY …

Quasivarieties And Varieties Of Ordered Algebras: Regularity And Exactness, Alexander Kurz

Engineering Faculty Articles and Research

We characterise quasivarieties and varieties of ordered algebras categorically in terms of regularity, exactness and the existence of a suitable generator. The notions of regularity and exactness need to be understood in the sense of category theory enriched over posets.

We also prove that finitary varieties of ordered algebras are cocompletions of their theories under sifted colimits (again, in the enriched sense).

Neural Network Predictions Of A Simulation-Based Statistical And Graph Theoretic Study Of The Board Game Risk, Jacob Munson

Murray State Theses and Dissertations

We translate the RISK board into a graph which undergoes updates as the game advances. The dissection of the game into a network model in discrete time is a novel approach to examining RISK. A review of the existing statistical findings of skirmishes in RISK is provided. The graphical changes are accompanied by an examination of the statistical properties of RISK. The game is modeled as a discrete time dynamic network graph, with the various features of the game modeled as properties of the network at a given time. As the network is computationally intensive to implement, results are produced …

On A Class Of Quaternionic Positive Definite Functions And Their Derivatives, Daniel Alpay, Fabrizio Colombo, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper, we start the study of stochastic processes over the skew field of quaternions. We discuss the relation between positive definite functions and the covariance of centered Gaussian processes and the construction of stochastic processes and their derivatives. The use of perfect spaces and strong algebras and the notion of Fock space are crucial in this framework.

Characterizations Of Families Of Rectangular, Finite Impulse Response, Para-Unitary Systems, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz

Mathematics, Physics, and Computer Science Faculty Articles and Research

We here study Finite Impulse Response (FIR) rectangular, not necessarily causal, systems which are (para)-unitary on the unit circle (=the class U). First, we offer three characterizations of these systems. Then, introduce a description of all FIRs in U, as copies of a real polytope, parametrized by the dimensions and the McMillan degree of the FIRs.

Finally, we present six simple ways (along with their combinations) to construct, from any FIR, a large family of FIRs, of various dimensions and McMillan degrees, so that whenever the original system is in U, so is the whole family.

A key role is …

Functions Of The Infinitesimal Generator Of A Strongly Continuous Quaternionic Group, Daniel Alpay, Fabrizio Colombo, Jonathan Gantner, David P. Kimsey

Mathematics, Physics, and Computer Science Faculty Articles and Research

The analogue of the Riesz-Dunford functional calculus has been introduced and studied recently as well as the theory of semigroups and groups of linear quaternionic operators. In this paper we suppose that T is the infinitesimal generator of a strongly continuous group of operators (ZT (t))t2R and we show how we can define bounded operators f(T ), where f belongs to a class of functions which is larger than the class of slice regular functions, using the quaternionic Laplace-Stieltjes transform. This class will include functions that are slice regular on the S-spectrum of T but not necessarily at infinity. Moreover, …

A Bipolar Single Valued Neutrosophic Isolated Graphs: Revisited, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Mohsin Khan

Branch Mathematics and Statistics Faculty and Staff Publications

In this research paper, the graph of the bipolar single-valued neutrosophic set model (BSVNS) is proposed. The graphs of single valued neutrosophic set models is generalized by this graph. For the BSVNS model, several results have been proved on complete and isolated graphs. Adding, an important and suitable condition for the graphs of the BSVNS model to become an isolated graph of the BSVNS model has been demonstrated.

Computation Of Shortest Path Problem In A Network With Sv-Triangular Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.

Curiozităţi Ale Funcţiilor Supermatematice, Florentin Smarandache, Mircea Eugen Selariu

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

Numbers In Base B That Generate Primes With Help The Luhn Function Of Order Ω, Florentin Smarandache, Octavian Cira

Branch Mathematics and Statistics Faculty and Staff Publications

We put the problem to determine the sets of integers in base b ≥ 2 that generate primes with using a function.

The Use Of The Pivot Pairwise Relative Criteria Importance Assessment Method For Determining The Weights Of Criteria, Florentin Smarandache, Dragisa Stanujkic, Edmundas Kazimieras Zavadskas, Darjan Karabasevic, Zenonas Turskis

Branch Mathematics and Statistics Faculty and Staff Publications

The weights of evaluation criteria could have a significant impact on the results obtained by applying multiple criteria decision-making methods. Therefore, the two extensions of the SWARA method that can be used in cases when it is not easy, or even is impossible to reach a consensus on the expected importance of the evaluation criteria are proposed in this paper. The primary objective of the proposed extensions is to provide an understandable and easy-to-use approach to the collecting of respondents’ real attitudes towards the significance of evaluation criteria and to also provide an approach to the checking of the reliability …

Hyperuncertain, Superuncertain, And Superhyperuncertain Sets/Logics/Probabilities/Statistics, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we define for the first time the HyperUncertain, SuperUncertain, and SuperHyperUncertain Sets/Logics/Probabilities/Statistics, the classical case (when the appurtenance degree of a generic element belongs to the unit interval [0, 1]), and the non-classical case (when the appurtenance degree of a generic element is outside on the interval [0, 1]; such theories are called Over/Under/Off-Sets/Logics/Probabilities/Statistics). We prove that the Unary SuperHyperFunction is a generalization of all Uncertain Sets/Logics/Probabilities.

Complex Valued Graphs For Soft Computing, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce in a systematic way the notion of complex valued graphs, strong complex valued graphs and complex neutrosophic valued graphs. Several interesting properties are defined, described and developed. Most of the conjectures which are open in case of usual graphs continue to be open problems in case of both complex valued graphs and strong complex valued graphs. We also give some applications of them in soft computing and social networks. At this juncture it is pertinent to keep on record that Dr. Tohru Nitta was the pioneer to use complex valued graphs …

The Creation Of A Video Review Guide For The Free-Response Section Of The Advanced Placement Calculus Exam, Jeffrey Brown

Honors Theses

The Creation of a Video Review Guide for the Free-Response Section of the Advanced Placement Calculus Exam follows the creation of a resource to help students prepare for the College Board’s Advanced Placement Calculus Exam. This project originated out of the authors personal experiences in preparing for this exam. The goal of the project was to create an accessible resource that reviews content, provides insights into the Advanced Placement exam, and creates successful habits in student responses. This paper, chronologically, details the development of the resource and a reflection on the final product and future uses.