Related papers: Natural numbers from integers
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
Using homogeneous dynamical approach, we obtain a complete description of the forms with discrete set of values at the integer points and not representing zero non-trivially over the rational numbers. As a consequence, we obtain a general…
We investigate inductive types in type theory, using the insights provided by homotopy type theory and univalent foundations of mathematics. We do so by introducing the new notion of a homotopy-initial algebra. This notion is defined by a…
We give a formulation of the Nielsen-Schreier theorem (subgroups of free groups are free) in homotopy type theory using the presentation of groups as pointed connected 1-truncated types. We show the special case of finite index subgroups…
We prove that for every nonempty set $\Sigma$ of integers bigger than $1$, which has at most three elements, there exists a numerical semigroup $T$ and an element $x$ of $T$ such that a natural number $n$ is the number of atoms in a…
It is shown that the set of decimal palindromes is an additive basis for the natural numbers. Specifically, we prove that every natural number can be expressed as the sum of forty-nine (possibly zero) decimal palindromes.
Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as…
We present an infinite family of recursive formulas that count binary integer partitions satisfying natural divisibility conditions and show that these counts are interrelated via partial sums. Moreover, we interpret the partitions we study…
We show how to efficiently count and generate uniformly at random finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. The method to achieve these results relies on a natural map of…
Free theorems are a popular tool in reasoning about parametrically polymorphic code. They are also of instructive use in teaching. Their derivation, though, can be tedious, as it involves unfolding a lot of definitions, then hoping to be…
We construct a model category (in the sense of Quillen) for set theory, starting from two arbitrary, but natural, conventions. It is the simplest category satisfying our conventions and modelling the notions of finiteness, countability and…
Natural linear and coalgebra transformations of tensor algebras are studied. The representations of certain combinatorial groups are given. These representations are connected to natural transformations of tensor algebras and to the groups…
We show that a $\mathbb{P}$-object and simple configurations of $\mathbb{P}$-objects have a formal derived endomorphism algebra. Hence the triangulated category (classically) generated by such objects is independent of the ambient…
We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…
A construction of polytopes is given based on integers. These geometries are constructed through a mapping to pure numbers and have multiple applications, including statistical mechanics and computer science. The number form is useful in…
We combine Homotopy Type Theory with axiomatic cohesion, expressing the latter internally with a version of "adjoint logic" in which the discretization and codiscretization modalities are characterized using a judgmental formalism of "crisp…
A characterization is provided for each natural number except one (1) by means of an ordered pair of elements. The first element is a natural number called the type of the natural number characterized, and the second is a natural number…
It is known that the number of homomorphisms from a group $F$ to a group $G$ is divisible by the greatest common divisor of the order of $G$ and the exponent of $F/[F,F]$. We investigate the number of homomorphisms satisfying some natural…
Let R be a ring, M a nonzero left R-module, X an infinite set, and E the endomorphism ring of the direct sum of copies of M indexed by X. Given two subrings S and S' of E, we will say that S is equivalent to S' if there exists a finite…
Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…