Related papers: Infinite Computations and the Generic Finite
In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…
Magnitude is a numerical invariant of finite metric spaces, recently introduced by T. Leinster, which is analogous in precise senses to the cardinality of finite sets or the Euler characteristic of topological spaces. It has been extended…
Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible…
The goal of this note is to provide yet another proof of the following theorem of Golod: there exists an infinite finitely generated group $G$ such that every element of $G$ has finite order. Our proof is based on the Nielsen-Schreier index…
Using a genealogically ordered infinite regular language, we know how to represent an interval of R. Numbers having an ultimately periodic representation play a special role in classical numeration systems. The aim of this paper is to…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…
Assume that A is a purely infinite simple C*-algebra whose K_0 is a torsion group, namely, contains no free element. Then a positive element a in A can be written as a finite sum of projections in A if and only if either a is a projection…
Prisoner's Dilemma (PD) is a widely studied game that plays an important role in Game Theory. This paper aims at extending PD Tournaments to the case of infinite, finite or infinitesimal payoffs using Sergeyev's Infinity Computing (IC). By…
In this paper we present a new concept called generalized neutrosophic soft set. This concept incorporates the beneficial properties of both generalized neutrosophic set introduced by A.A. Salama [7]and soft set techniques proposed by…
The cumulative hierarchy conception of set, which is based on the conception that sets are inductively generated from "former" sets, is generally considered a good way to create a set conception that seems safe from contradictions. This…
Several structural properties of a universal algebra can be seen from the higher commutators of its congruences. Even on a finite algebra, the sequence of higher commutator operations is an infinite object. In the present paper, we exhibit…
The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…
In a previous paper, we showed nonvaninishing of the universal index elements in the K-theory of the maximal C*-algebras of the fundamental groups of enlargeable spin manifolds. The underlying notion of enlargeability was the one from the…
In a game of incomplete information, an infinite state space can create problems. When the space is uncountably large, the strategy spaces of the players may be unwieldly, resulting in a lack of measurable equilibria. When the knowledge of…
Relying on recent generalizations of the Fra\"iss\'e theory to a broader category-theoretic context, we study the class of abstract finite games played between two players and show the existence of an infinitetly countable game which is…
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…
This paper provides a short introduction to the notion of regular category and its use in categorical algebra. We first prove some of its basic properties, and consider some fundamental algebraic examples. We then analyse the algebraic…