Related papers: Natural numbers from integers
We first give a combinatorial interpretation of coefficients of Chebyshev polynomials, which allows us to connect them with compositions of natural numbers. Then we describe a relationship between the number of compositions of a natural…
Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models.…
We develop the theory of limits and colimits in $\infty$-categories within the synthetic framework of simplicial Homotopy Type Theory developed by Riehl and Shulman. We also show that in this setting, the limit of a family of spaces can be…
A topologically-invariant and additive homology class is mostly not a natural transformation as it is. In this paper we discuss turning such a homology class into a natural transformation; i.e., a "categorification" of it. In a general…
The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by discrete tomography. In this paper we approach the problem…
The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…
Let $G$ be a finitely generated group with an automorphism $\varphi\in{\rm Aut}(G)$, or an outer automorphism $\phi\in{\rm Out}(G)$. Suppose that $G$ decomposes into simpler pieces on which the growth behaviour of $\varphi$ and $\phi$ is…
Complex natural and technological systems can be considered, on a coarse-grained level, as assemblies of elementary components: for example, genomes as sets of genes, or texts as sets of words. On one hand, the joint occurrence of…
We use the group $(\Z^2,+)$ and two associated homomorphisms, $\tau_0, \tau_1$, to generate all distinct, non-zero pairs of coprime, positive integers which we describe within the context of a binary tree which we denote $T$. While this…
Hilbert's Foundations of Geometry was perhaps one of the most influential works of geometry in the 20th century and its axiomatics was the first systematic attempt to clear up the logical gaps of the Elements. But does it have gaps of its…
Let $D$ be a large category which is cocomplete. We construct a model structure (in the sense of Quillen) on the category of small functors from $D$ to simplicial sets. As an application we construct homotopy localization functors on the…
In this work we construct from ground up a homotopy theory of C*-algebras. This is achieved in parallel with the development of classical homotopy theory by first introducing an unstable model structure and second a stable model structure.…
We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill-Nerode…
In this note we develop some properties of those algebras (called here locally simple) which can be generated by a single element after, if need be, a faithfully flat extension. For finite algebras, this is shown to be in fact a property of…
In the classical probability in continuous random variables there is no distinguishing between the probability involving strict inequality and non strict inequality. Moreover a probability involves equality collapse to zero without…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
Let A and B be $C^*$-algebras, A separable, and B $\sigma$-unital and stable. It is shown that there are natural isomorphisms $E(A,B)=KK(SA,Q(B))=[SA,Q(B)\otimes K]$, where $SA=C_0(0,1)\otimes A$, $[\cdot,\cdot]$ denotes the set of homotopy…
We introduce several classes of pseudorandom sequences which represent a natural extension of classical methods in random number generation. The sequences are obtained from constructions on labeled binary trees, generalizing the well-known…
A set of natural numbers will be called \emph{harmonic} if the reciprocals of its elements form a divergent series. An ultrafilter of the natural numbers will he called \emph{harmonic} if all each members are harmonic sets. The harmonic…
We show that pure monomorphisms are cofibrantly generated---generated from a set of morphisms by pushouts, transfinite composition, and retracts---in any locally finitely presentable additive category. In particular, this is true in any…