On accuracy of mathematical languages used to deal with the Riemann zeta function and the Dirichlet eta function

The Riemann Hypothesis has been of central interest to mathematicians for a long time and many unsuccessful attempts have been made to either prove or disprove it. Since the Riemann zeta function is defined as a sum of the infinite number of items, in this paper, we look at the Riemann Hypothesis using a new applied approach to infinity allowing one to easily execute numerical computations with various infinite and infinitesimal numbers in accordance with the principle ‘The part is less than the whole’ observed in the physical world around us. The new approach allows one to work with functions and derivatives that can assume not only finite but also infinite and infinitesimal values and this possibility is used to study properties of the Riemann zeta function and the Dirichlet eta function. A new computational approach allowing one to evaluate these functions at certain points is proposed. Numerical examples are given. It is emphasized that different mathematical languages can be used to describe mathematical objects with different accuracies. The traditional and the new approaches are compared with respect to their application to the Riemann zeta function and the Dirichlet eta function. The accuracy of the obtained results is discussed in detail.     

Numerical computations and mathematical modelling with infinite and infinitesimal numbers

Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not related to the non-standard analysis) is used to work with finite, infinite, and infinitesimal numbers numerically. This can be done on a new kind of a computer—the Infinity Computer—able to work with all these types of numbers. The new computational tools both give possibilities to execute computations of a new type and open new horizons for creating new mathematical models where a computational usage of infinite and/or infinitesimal numbers can be useful. A number of numerical examples showing the potential of the new approach and dealing with divergent series, limits, probability theory, linear algebra, and calculation of volumes of objects consisting of parts of different dimensions are given.     

On the integration of data and mathematical modeling languages

This paper examines ways in which the addition of data modeling features can enhance the capabilities of mathematical modeling languages. It demonstrates how such integration is achieved as an application of the embedded languages technique proposed by Bhargava and Kimbrough [4]. Decision-making, and decision support systems, require the representation and manipulation of both data and mathematical models. Several data modeling languages as well as several mathematical modeling languages exist, but they have different sets of these capabilities. We motivate with a detailed example the need for the integration of these capabilities. We describe the benefits that might result, and claim that this could lead to a significant improvement in the functionality of model management systems. Then we present our approach for the integration of these languages, and specify how the claimed benefits can be realized.The author's work on this paper was performed in conjunction with research funded by the Naval Postgraduate School.     

Index Sets in Modeling Languages

Index sets are an integral and fundamental part of every mathematical modeling language. They assist the modeler in grouping various objects and entities. Index sets are also used extensively in the mathematical notation to write an expression in a concise way. An example is the sigma notation for formulating the summation of an unknown number n of terms. In this paper, the concept of index set is introduced in the context of modeling languages. The main objective is to propose an extension and generalization of the concept of index sets, which is the concept of hierarchical index sets. The paper concludes with an application, which clearly shows the usefulness of this concept.     

On possible growths of Toeplitz languages

We consider a new family of factorial languages whose subword complexity grows as Φ(n ^α ), where α is the only positive root of some transcendental equation. The asymptotic growth of the complexity function of these languages is studied by discrete and analytical methods, a corollary of the Wiener-Pitt theorem inclusive. The factorial languages considered are also languages of arithmetical factors of infinite words; so, we describe a new family of infinite words with an unusual growth of arithmetical complexity.     

External Difference Families from Finite Fields

External difference families (EDFs) are a type of combinatorial designs that originated from cryptography. Many combinatorial objects are closely related to EDFs, such as difference sets, difference families, almost difference sets, and difference systems of sets. Constructing EDFs is thus of significance in theory and practice. In this paper, earlier ideas of constructing EDFs proposed by Chang and Ding (2006), and Huang and Wu (2009), are further explored. Consequently, new infinite classes of EDFs are obtained and some previously known results are extended.     

Lipschitzian stability of parametric variational inequalities over generalized polyhedra in Banach spaces

This paper concerns the study of solution maps to parameterized variational inequalities over generalized polyhedra in reflexive Banach spaces. It has been recognized that generalized polyhedral sets are significantly different from the usual convex polyhedra in infinite dimensions and play an important role in various applications to optimization, particularly to generalized linear programming. Our main goal is to fully characterize robust Lipschitzian stability of the aforementioned solution maps entirely via their initial data. This is done on the basis of the coderivative criterion in variational analysis via efficient calculations of the coderivative and related objects for the systems under consideration. The case of generalized polyhedra is essentially more involved in comparison with usual convex polyhedral sets and requires developing elaborated techniques and new proofs of variational analysis.     

Weighted external difference families and R-optimal AMD codes

In this paper, we provide a mathematical framework for characterizing AMD codes that are R-optimal. We introduce a new combinatorial object, the reciprocally-weighted external difference family (RWEDF), which corresponds precisely to an R-optimal weak AMD code. This definition subsumes known examples of existing optimal codes, and also encompasses combinatorial objects not covered by previous definitions in the literature. By developing structural group-theoretic characterizations, we exhibit infinite families of new RWEDFs, and new construction methods for known objects such as near-complete EDFs. Examples of RWEDFs in non-abelian groups are also discussed.     

Sequences—Basic elements for discrete mathematics

Sequences are fundamental mathematical objects with a long history in mathematics. Sequences are also tools for the development of other concepts (e. g. the limit concept), as well as tools for the mathematization of real-life situations (e. g. growth processes). But, sequences are also interesting objects in themselves, with lots of surprising properties (e. g. Fibonacci sequence, sequence of prime numbers, sequences of polygonal numbers). Nowadays, new technologies provide the possibility to generate sequences, to create symbolic, numerical and graphical representations, to change between these different representations. Examples of some empirical investigation are given, how students worked with sequences in a computer-supported environment.     

On infinite real trace rational languages of maximum topological complexity

We consider the set ℝ^ω(Γ, D) of infinite real traces, over a dependence alphabet (Γ,D) with no isolated letter, equipped with the topology induced by the prefix metric. We prove that all rational languages of infinite real traces are analytic sets. We also reprove that there exist some rational languages of infinite real traces that are analytic but non-Borel sets; in fact, these sets are even Σ ₁ ¹ -complete, hence have maximum possible topological complexity. For this purpose, we give an example of a Σ ₁ ¹ -complete language that is fundamentally different from the known example of a Σ ₁ ¹ -complete infinitary rational relation given by Finkel (2003). Bibliography: 35 titles. Published in Zapiski Nauchnykh Seminarov POMI, Vol. 316, 2004, pp. 205–223.     

Discrete unbounded sets in a finite dimensional space and beyond

Discrete infinite sets in a finite dimensional space, i.e., infinite sets without finite limit points appear in various branches of analysis (zero and pole sets of meromorphic functions, various models in the mathematical theory of quasicrystals, and so on). Here we introduce some notions and present some new theorems connected with such sets.     

Colored operads,series on colored operads,and combinatorial generating systems

We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous grammars, allowing us to work with all these generating systems in a unified way. The theory of bud generating systems uses colored operads. Indeed, an object is generated by a bud generating system if it satisfies a certain equation in a colored operad. To compute the generating series of the languages of bud generating systems, we introduce formal power series on colored operads and several operations on these. Series on colored operads are crucial to express the languages specified by bud generating systems and allow us to enumerate combinatorial objects with respect to some statistics. Some examples of bud generating systems are constructed; in particular to specify some sorts of balanced trees and to obtain recursive formulas enumerating these.     

Non-Archimedean extensive measurement with incomparability

Standard theories of extensive measurement require that all objects to be measured are comparable, and that no object is infinitely or infinitesimally greater than another. The present paper develops a theory that leaves room for infinite and infinitesimal differences, as well as incomparable objects. Our result is analogous to the standard representation and uniqueness theorem of extensive measurement, and only simple and familiar mathematical concepts are assumed.     

Definability and textures

This paper aims to give a new perspective for definability in rough set theory. First, a counterpart of definability is introduced in textural approximation spaces. Then a complete field of sets for texture spaces is defined and using textural arguments, some new results are obtained for rough sets. It is shown that definability can be also discussed in terms of a complete field of fuzzy sets on a fuzzy lattice for the various fuzzy approximation spaces. It is also given a partial affirmative answer to an open problem posed by Wei-Zhi Wu in On some mathematical structures of T-fuzzy rough set algebras in infinite universes of discourse in Fundamenta Informaticae 108 (3–4) 2011 337–369.     

Some mathematical tools for linguistic probabilities

We propose and develop, in this paper, some concepts and techniques useful for the theory of linguistic probabilisies introduced by L.A. Zadeh. These probabilities are expressed in linguistic rather than numerical terms. The mathematical framework for this study is based upon the possibility theory.We formulate first the problem of optimization under elastic constraints which is not only important for mathematical programming but will be served to justify the extension of possibility measure to linguistic variables. Next, in connection with translation rules in natural languages we study some transformations of fuzzy sets using a relation between random sets and fuzzy sets. Finally, we point out some differences between random variables and fuzzy variables, and present the mathematical notion of possibility, in the setting of set-functions, as a special case of Choquet capacities.     

Index sets for ω‐languages

An ω‐language is a set of infinite sequences (words) on a countable language, and corresponds to a set of real numbers in a natural way. Languages may be described by logical formulas in the arithmetical hierarchy and also may be described as the set of words accepted by some type of automata or Turing machine. Certain families of languages, such as the languages, may enumerated as P₀, P₁, … and then an index set associated to a given property R (such as finiteness) of languages is just the set of e such that P_e has the property. The complexity of index sets for 7 types of languages is determined for various properties related to the size of the language.     

Reconstructing infinite objects

We generalize an algebraic tool due to Alon et al. (J. Combin. Theory B 47 (1989) 153–161) for the reconstruction of finite objects to infinite objects. We apply our result to the reconstruction of infinite sets of points in the space Rⁿ with respect to two different groups of automorphisms of Rⁿ.     

Stability and extensibility results for abstract skew-product semiflows

In this paper we present new stability and extensibility results for skew-product semiflows with a minimal base flow. In particular, we describe the structure of uniformly stable and uniformly asymptotically stable sets admitting backwards orbits and the structure of omega-limit sets. As an application, the occurrence of almost periodic and almost automorphic dynamics for monotone non-autonomous infinite delay functional differential equations is analyzed.