Infinite Secret Sharing -- Examples

The motivation for extending secret sharing schemes to cases when either the set of players is infinite or the domain from which the secret and/or the shares are drawn is infinite or both, is similar to the case when switching to abstract probability spaces from classical combinatorial probability. It might shed new light on old problems, could connect seemingly unrelated problems, and unify diverse phenomena. Definitions equivalent in the finitary case could be very much different when switching to infinity, signifying their difference. The standard requirement that qualified subsets should be able to determine the secret has different interpretations in spite of the fact that, by assumption, all participants have infinite computing power. The requirement that unqualified subsets should have no, or limited information on the secret suggests that we also need some probability distribution. In the infinite case events with zero probability are not necessarily impossible, and we should decide whether bad events with zero probability are allowed or not. In this paper, rather than giving precise definitions, we enlist an abundance of hopefully interesting infinite secret sharing schemes. These schemes touch quite diverse areas of mathematics such as projective geometry, stochastic processes and Hilbert spaces. Nevertheless our main tools are from probability theory. The examples discussed here serve as foundation and illustration to the more theory oriented companion paper

A mathematical analysis of edas with distance-based exponential models

Estimation of Distribution Algorithms have been successfully used for solving many combinatorial optimization problems. One type of problems in which Estimation of Distribution Algorithms have presented strong competitive results are permutation-based combinatorial optimization problems. In this case, the algorithms use probabilistic models specifically designed for codifying probability distributions over permutation spaces. One class of these probability models is distance-based exponential models, and one example of this class is the Mallows model. In spite of the practical success, the theoretical analysis of Estimation of Distribution Algorithms for permutation-based combinatorial optimization problems has not been extensively developed. With this motivation, this paper presents a first mathematical analysis of the convergence behavior of Estimation of Distribution Algorithms based on the Mallows model by using an infinite population to associate a dynamical system to the algorithm. Several scenarios, with different fitness functions and initial probability distributions of increasing complexity, are analyzed obtaining unexpected results in some cases

Some new directions in infinite-combinatorial topology

We give a light introduction to selection principles in topology, a young subfield of infinite-combinatorial topology. Emphasis is put on the modern approach to the problems it deals with. Recent results are described, and open problems are stated. Some results which do not appear elsewhere are also included, with proofs.Comment: Small update

Generalized Sums over Histories for Quantum Gravity II. Simplicial Conifolds

This paper examines the issues involved with concretely implementing a sum over conifolds in the formulation of Euclidean sums over histories for gravity. The first step in precisely formulating any sum over topological spaces is that one must have an algorithmically implementable method of generating a list of all spaces in the set to be summed over. This requirement causes well known problems in the formulation of sums over manifolds in four or more dimensions; there is no algorithmic method of determining whether or not a topological space is an n-manifold in five or more dimensions and the issue of whether or not such an algorithm exists is open in four. However, as this paper shows, conifolds are algorithmically decidable in four dimensions. Thus the set of 4-conifolds provides a starting point for a concrete implementation of Euclidean sums over histories in four dimensions. Explicit algorithms for summing over various sets of 4-conifolds are presented in the context of Regge calculus. Postscript figures available via anonymous ftp at black-hole.physics.ubc.ca (137.82.43.40) in file gen2.ps.Comment: 82pp., plain TeX, To appear in Nucl. Phys. B,FF-92-

Banach spaces and Ramsey Theory: some open problems

We discuss some open problems in the Geometry of Banach spaces having Ramsey-theoretic flavor. The problems are exposed together with well known results related to them.Comment: 17 pages, no figures; RACSAM, to appea