Results 1 to 10 of about 6,858,530 (350)
A countable set of directions is sufficient for Steiner symmetrization [PDF]
A countable dense set of directions is sufficient for Steiner symmetrization, but the order of directions matters.
Gabriele Bianchi +4 more
semanticscholar +4 more sources
A HC model with countable set of spin values: uncountable set of Gibbs measures [PDF]
We consider a hard core (HC) model with a countable set $\mathbb{Z}$ of spin values on the Cayley tree. This model is defined by a countable set of parameters $\lambda_{i}>0, i \in \mathbb{Z}\setminus\{0\}$. For all possible values of parameters, we give
U. Rozikov, F. Haydarov
semanticscholar +3 more sources
The Cardinality of an Oracle in Blum-Shub-Smale Computation [PDF]
We examine the relation of BSS-reducibility on subsets of the real numbers. The question was asked recently (and anonymously) whether it is possible for the halting problem H in BSS-computation to be BSS-reducible to a countable set.
Wesley Calvert +2 more
doaj +4 more sources
Abstract The paper introduces the notion of size of countable sets, which preserves the Part-Whole Principle. The sizes of the natural and the rational numbers, their subsets, unions, and Cartesian products are algorithmically enumerable as sequences of natural numbers.
Katevrina Trlifajov'a
openaire +4 more sources
Countable sets versus sets that are countable in reverse mathematics [PDF]
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic [Formula: see text]. A major theme in RM is therefore the study of structures that are countable or can be approximated by countable sets.
Sam Sanders
openaire +5 more sources
Identifying interacting pairs of sites in Ising models on a countable set [PDF]
This paper address the problem of identifying pairs of interacting sites from a finite sample of independent realizations of the Ising model. We consider Ising models in a infinite countable set of sites under Dobrushin uniqueness condition. The observed
A. Galves, E. Orlandi, D. Takahashi
semanticscholar +2 more sources
Every countable model of set theory embeds into its own constructible universe [PDF]
The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe.
Aczel P. +3 more
core +3 more sources
The ordered set of principal congruences of a countable lattice [PDF]
For a lattice L, let Princ(L) denote the ordered set of principal congruences of L. In a pioneering paper, G. Grätzer characterized the ordered set Princ(L) of a finite lattice L; here we do the same for a countable lattice.
G. Czédli
semanticscholar +3 more sources
Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology [PDF]
We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential.
Ville Salo, Ilkka Törmä
doaj +4 more sources
Product set phenomena for countable groups [PDF]
We develop in this paper general techniques to analyze local combinatorial structures in product sets of two subsets of a countable group which are "large" with respect to certain classes of (not necessarily invariant) means on the group. As applications
Björklund, MIchael, Fish, Alexander
core +2 more sources

