Related papers: An infinite natural product
A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…
Increasingly in recent years, probabilistic computation has been investigated through the lenses of categorical algebra, especially via string diagrammatic calculi. Whereas categories of discrete and Gaussian probabilistic processes have…
Two results on product of compact filters are shown to be the common principle behind a surprisingly large number of theorems.
Tensor products of ultrafilters have special combinatorial features closely related to Ramsey's Theorem, making them useful tools in applications. Here we first review their fundamental properties and isolate some new ones, including a…
We consider the product of infinitely many copies of a spin-$1\over 2$ system. We construct projection operators on the corresponding nonseparable Hilbert space which measure whether the outcome of an infinite sequence of $\sigma^x$…
It was proved that for any finite set of elements of a free product of residually finite groups such that no two of them belong to conjugate cyclic subgroups and each of them do not belong to a subgroup which is conjugate a to free factor…
We consider a notion of "numerosity" for sets of tuples of natural numbers, that satisfies the five common notions of Euclid's Elements, so it can agree with cardinality only for finite sets. By suitably axiomatizing such a notion, we show…
We find an explicit general formula for the iterated local monodromy of singularities of the Hadamard product of functions with integrable singularities. The formula implies the invariance by Hadamard product of the class of functions with…
Infinitary operations, such as products indexed by countably infinite linear orders, arise naturally in the context of fundamental groups and groupoids. Despite the fact that the usual binary operation of the fundamental group determines…
Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…
We prove that the product of any two infinite countable groups has fixed price one. This resolves a longstanding problem posed by Gaboriau. The proof uses the propagation method to construct a Poisson horoball process as a weak limit of a…
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…
A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…
We give sufficient conditions on planar domains for polynomials to be dense in the algebras A and A-infinity of the product of these domains, endowed with their natural topologies. We also characterize the uniform limits, with respect to…
We give a new proof of the Brawley-Carlitz theorem on irreducibility of the composed products of irreducible polynomials. Our proof shows that associativity of the binary operation for the composed product is not necessary. We then…
This paper provides some counterexamples to Cantor's contributions to the foundations of Set Theory. The first counterexample forces Cantor's Diagonal Method (DM) to yield one of the numbers in the target list. To study this anomaly, and…
We study the space of ends of groups. For a finitely generated group, this is a Cantor space as soon as it is infinite. In contrast, we show that for infinitely generated countable groups, it exhibits several behaviors. For instance, we…
We define a product of algebraic probability spaces equipped with two states. This product is called a conditionally monotone product. This product is a new example of independence in non-commutative probability theory and unifies the…
We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…
We show that a tensor product of irreducible, finite dimensional representations of a simple Lie algebra over a field of characteristic zero, determines the individual constituents uniquely. This is analogous to the uniqueness of prime…