Related papers: Is the function 1/x continuous at 0?
In program semantics and verification, reasoning about loops is complicated by the need to produce two separate mathematical arguments: an invariant, for functional properties (ignoring termination); and a variant, for termination (ignoring…
Although Bolzano's concept of the continuum has gradually evolved, the basis remained the same: the continuum as an infinite class of points arranged in such a way that the so-called \emph{Bolzano completeness} holds. Bolzano realized over…
The concept of measurement is discussed. It is argued that counting process in mathematics is also measurement which requires a basic unit. The idea of scale is put forward. The basic unit itself, which are composed of the infinitesimal of…
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
The main purpose of this note is to pose a couple of problems which are easily formulated thought some seem to be not yet solved. These problems are of general interest for discrete mathematics including a new twig of a bough of theory of…
The goal of this work is to introduce and study fuzzy limits of functions. Two approaches to fuzzy limits of a function are considered. One is based on the concept of a fuzzy limit of a sequence, while another generalizes the conventional…
The idea of meaning as use in language is explored in a mathematical and physical context. Two possible scenarios of further analysis are presented: Ordinal arithmetic and String theory.
Continuous models used in physics and other areas of mathematics applications become discrete when they are computerized, e.g., utilized for computations. Besides, computers are controlling processes in discrete spaces, such as films and…
0-dimensional persistent homology is known, from a computational point of view, as the easy case. Indeed, given a list of $n$ edges in non-decreasing order of filtration value, one only needs a union-find data structure to keep track of the…
We introduce the concepts of perpetual points and periodic perpetual loci in discrete--time systems (maps). The occurrence and analysis of these points/loci are shown and basic examples are considered. We discuss the potential usage and…
In an earlier paper, "Omega-inconsistency in Goedel's formal system: a constructive proof of the Entscheidungsproblem" (math/0206302), I argued that a constructive interpretation of Goedel's reasoning establishes any formal system of…
A new class of critical points, termed as perpetual points, where acceleration becomes zero but the velocity remains non-zero, are observed in dynamical systems. The velocity at these points is either maximum or minimum or of inflection…
Graphlet counting is an important problem as it has numerous applications in several fields, including social network analysis, biological network analysis, transaction network analysis, etc. Most of the practical networks are dynamic. A…
The notion of continuation is ubiquitous in many different areas of computer science, including systems programming, programming languages, algorithmics, semantics, logic, and constructive mathematics. In fact the concept of continuation…
We start with the well-known game below: Two players hold a sheet of paper to their forehead on which a positive integer is written. The numbers are consecutive and each player can only see the number of the other one. In each time step,…
The theory of multidimensional persistent homology was initially developed in the discrete setting, and involved the study of simplicial complexes filtered through an ordering of the simplices. Later, stability properties of…
Limit can be defined by two axioms: 1. Strict inequality between limits implies, ultimately, strict inequality between functions. 2. For constant functions limit is trivial. How can basic results on convergence be derived from these axioms?…
Monotonicity and recursivity are central assumptions in intertemporal consumption problems under ambiguity. We show that monotone recursive preferences admit both a recursive and an ex-ante representation, and that the certainty equivalent…
We say that a plane set $A$ is {\it graph-null,} if there is a function $g\colon [0,1] \to \mathbb{R}$ such that $\lambda_2 (A+{\rm graph}\, g)=0$. A plane set $A$ has the {\it translational Kakeya property} if, for every translated copy…
Several mathematicians, including myself, have studied some unifications in general topological spaces as well as in fuzzy topological spaces. For instance in our earlier works, using operations on topological spaces, we have tried to unify…