![]() THE NYWIMN CONFERENCENew York Women in Mathematics Network |
ABSTRACTS Cristina Abreu-Suzuki Let Pi: M -> B be an onto maximal rank map or a Riemannian submersion between Riemannian manifolds M and B. Initially, we prove necessary and sufficient conditions for any fiber F to be roughly isometric to M. Then, we prove necessary and sufficient conditions for Pi to be a rough isometry. As a corollary M is roughly isometric to FxB. Marianna Bonanome An Introduction to Quantum Computation In 1982 Richard Feynman and Paul Benioff independently observed that a quantum system can perform a computation. In a quantum computer, the fundamental unit of information is called a quantum bit or qubit. I will give a basic introduction to quantum computation, reversible logic gates, quantum logic gates and end with an overview of Shor’s quantum algorithm for factoring. Barbara Csima Computability Theory and Applications I will introduce/review the notions of computability, relative computability and the halting problem. I will then describe areas of research where computability theory is used, such as studying the structure of the Turing degrees, computable structure theory, reverse mathematics, and algorithmic randomness. Faranak Pahlevani Parametric Sensitivity and Uncertainty Analysis for Fluid Models In recent years, Parametric Sensitivity Analysis has become a very important tool in analyzing fluid behavior. In this presentation we introduce the sensitivity of the computed flow solution using Large Eddy Simulation (LES) models with respect to the variation of the selected cut-off length scale. We demonstrate the analysis by using the Sensitivity Equation Method and provide numerical assessments to illustrate applications of the parametric sensitivity computations. Margaret Dean The study of the many different structures and varieties of groups is incredibly rich. A simple change in the rules, or relations, governing a particular group can create a new group with profound differences from the original, while two groups that appear to have totally different sets of relations can turn out to be isomorphic. Comparisons between groups can be made in myriad different ways; by laying two groups next to each other, we can study them based on all kinds of properties. My research involves the study of parafree groups in the variety of center extended by metabelian groups. Maria Psarelli Geometric Methods for Wave Equations I will describe geometric methods for wave equations in Minkowski spacetime. I will focus on global existence and asymptotic behavior of solutions to nonlinear systems that arise in the electrodynamics of continuous media. Evangelia Antonakos Modal Logics from an Epistemic Viewpoint Modal logics are built on propositional logical systems by the addition of modal operators, traditionally "Box" and "Diamond", so that logical sentences in a given model a can be evaluated to not only be True or False but "Necessary" or "Possible" as well. First-order and higher-order systems have also been developed. In the case of epistemic logics the "Box" operator is interpreted as "Known" or "Knowable" so that Kp can be read as "proposition p is knowable." I will discuss the standard Kripke models for the logics T, S4, and S5 and the phenomenon of common knowledge. Modal logics, epistemic logics in particular are an active area of research with applications in machine learning, proof theory, artificial intelligence, and formal epistemology. |