Applying Ramseyfication to Infrared Spectroscopy

The so-called Ramsey–Carnap approach, or Ramseyfication, has gone out of fashion in the philosophy of science. Advocates have tried to argue for a revival by writing methodological and metatheoretical studies of Ramseyfication. For this paper I have chosen a different approach; I will apply Ramseyfication to infrared spectroscopy—a method used in analytical chemistry—in order to logically analyse the relation between measurements and mathematical structures. My aim in doing so is to contribute to the debate about the Application Problem of Mathematics, thereby making a case for Ramseyfication as a method of study for scientific theories.

Duals of Feynman integrals. Part I. Differential equations

We elucidate the vector space (twisted relative cohomology) that is Poincaré dual to the vector space of Feynman integrals (twisted cohomology) in general spacetime dimension. The pairing between these spaces — an algebraic invariant called the intersection number — extracts integral coefficients for a minimal basis, bypassing the generation of integration-by-parts identities. Dual forms turn out to be much simpler than their Feynman counterparts: they are supported on maximal cuts of various sub-topologies (boundaries). Thus, they provide a systematic approach to generalized unitarity, the reconstruction of amplitudes from on-shell data. In this paper, we introduce the idea of dual forms and study their mathematical structures. As an application, we derive compact differential equations satisfied by arbitrary one-loop integrals in non-integer spacetime dimension. A second paper of this series will detail intersection pairings and their use to extract integral coefficients.

Categorical properties of intuitionistic fuzzy groups

The category theory deals with mathematical structures and relationships between them. Categories now appear in most branches of mathematics and in some areas of theoretical computer science and mathematical physics, and acting as a unifying notion. In this paper, we study the relationship between the category of groups and the category of intuitionistic fuzzy groups. We prove that the category of groups is a subcategory of category of intuitionistic fuzzy groups and that it is not an Abelian category. We establish a function β : Hom(A, B) → [0; 1] × [0; 1] on the set of all intuitionistic fuzzy homomorphisms between intuitionistic fuzzy groups A and B of groups G and H, respectively. We prove that β is a covariant functor from the category of groups to the category of intuitionistic fuzzy groups. Further, we show that the category of intuitionistic fuzzy groups is a top category by establishing a contravariant functor from the category of intuitionistic fuzzy groups to the lattices of all intuitionistic fuzzy groups.

Universes as big data

In this paper, we briefly overview how, historically, string theory led theoretical physics first to precise problems in algebraic and differential geometry, and thence to computational geometry in the last decade or so, and now, in the last few years, to data science. Using the Calabi–Yau landscape — accumulated by the collaboration of physicists, mathematicians and computer scientists over the last four decades — as a starting-point and concrete playground, we review some recent progress in machine-learning applied to the sifting through of possible universes from compactification, as well as wider problems in geometrical engineering of quantum field theories. In parallel, we discuss the program in machine-learning mathematical structures and address the tantalizing question of how it helps doing mathematics, ranging from mathematical physics, to geometry, to representation theory, to combinatorics and to number theory.

A Modal Proof Theory for Polynomial Coalgebras

<p>The abstract mathematical structures known as coalgebras are of increasing interest in computer science for their use in modelling certain types of data structures and programs. Traditional algebraic methods describe objects in terms of their construction, whilst coalgebraic methods describe objects in terms of their decomposition, or observational behaviour. The latter techniques are particularly useful for modelling infinite data structures and providing semantics for object-oriented programming languages, such as Java. There have been many different logics developed for reasoning about coalgebras of particular functors, most involving modal logic. We define a modal logic for coalgebras of polynomial functors, extending Rößiger’s logic [33], whose proof theory was limited to using finite constant sets, by adding an operator from Goldblatt [11]. From the semantics we define a canonical coalgebra that provides a natural construction of a final coalgebra for the relevant functor. We then give an infinitary axiomatization and syntactic proof relation that is sound and complete for functors constructed from countable constant sets.</p>

A Modal Proof Theory for Polynomial Coalgebras

<p>The abstract mathematical structures known as coalgebras are of increasing interest in computer science for their use in modelling certain types of data structures and programs. Traditional algebraic methods describe objects in terms of their construction, whilst coalgebraic methods describe objects in terms of their decomposition, or observational behaviour. The latter techniques are particularly useful for modelling infinite data structures and providing semantics for object-oriented programming languages, such as Java. There have been many different logics developed for reasoning about coalgebras of particular functors, most involving modal logic. We define a modal logic for coalgebras of polynomial functors, extending Rößiger’s logic [33], whose proof theory was limited to using finite constant sets, by adding an operator from Goldblatt [11]. From the semantics we define a canonical coalgebra that provides a natural construction of a final coalgebra for the relevant functor. We then give an infinitary axiomatization and syntactic proof relation that is sound and complete for functors constructed from countable constant sets.</p>

Aggregation of Weak Fuzzy Norms

Aggregation is a mathematical process consisting in the fusion of a set of values into a unique one and representing them in some sense. Aggregation functions have demonstrated to be very important in many problems related to the fusion of information. This has resulted in the extended use of these functions not only to combine a family of numbers but also a family of certain mathematical structures such as metrics or norms, in the classical context, or indistinguishability operators or fuzzy metrics in the fuzzy context. In this paper, we study and characterize the functions through which we can obtain a single weak fuzzy (quasi-)norm from an arbitrary family of weak fuzzy (quasi-)norms in two different senses: when each weak fuzzy (quasi-)norm is defined on a possibly different vector space or when all of them are defined on the same vector space. We will show that, contrary to the crisp case, weak fuzzy (quasi-)norm aggregation functions are equivalent to fuzzy (quasi-)metric aggregation functions.

Recognition Methods of Geometrical Images of Automata Models of Systems in Control Problem

The laws of functioning of discrete deterministic dynamical systems are investigated, presented in the form of automata models defined by geometric images. Due to the use of the apparatus of geometric images of automata, developed by V.A. Tverdokhlebov, the analysis of automata models is carried out on the basis of the analysis of mathematical structures represented by geometric curves and numerical sequences. The purpose of present research is to further develop the mathematical apparatus of geometric images of automaton models of systems, including the development of new methods for recognizing automata by their geometric images, given both geometric curves and numerical sequences.

An exploratory study to improve reading and comprehending mathematical expressions in braille

Braille readers read and comprehend mathematical expressions while moving their fingertips over braille characters. The aim of this exploratory study was to investigate the effect of an intervention that teaches braille readers who use a braille display to use finger movements with a focus on the expression’s mathematical structure. The finger movements involved movements where the two index fingers are about one or two braille cells apart and movements where the index fingers explore different parts of the expression. We investigated to what extent the intervention supports an interplay between finger movements and the expression’s mathematical structure to make the process of calculating the value of an expression easier and to make braille readers more aware of the expression’s structure. Three braille readers, respectively in Grades 7, 8, and 11, received the intervention consisting of five individual lessons. During the pre-, post-, and retention test, the braille readers’ finger movements were video recorded, as well as the time needed to read and process the mathematical tasks. Four expressions were selected for further analysis. The results show that during the posttest, each braille reader required at least 29% less time to read and process the expressions. The retention test results were even better. Scanpaths indicated that braille readers picked up features of mathematical structures more easily after the intervention. Based on our findings, we recommend that braille readers receive lessons in tactile reading strategies that support the reading and processing of mathematical expressions and equations.

A Fixed Point Approach to the Hyers-Ulam-Rassias Stability Problem of Pexiderized Functional Equation in Modular Spaces

In this paper, we consider pexiderized functional equations for studying their Hyers-Ulam-Rassias stability. This stability has been studied for a variety of mathematical structures. Our framework of discussion is a modular space. We adopt a fixed-point approach to the problem in which we use a generalized contraction mapping principle in modular spaces. The result is illustrated with an example.