相关论文: A Variant of Probabilistic Topology
We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…
This paper covers two topics: first an introduction to Algorithmic Complexity Theory: how it defines probability, some of its characteristic properties and past successful applications. Second, we apply it to problems in A.I. - where it…
Statistical Topology emerged since topological aspects continue to gain importance in many areas of physics. It is most desirable to study topological invariants and their statistics in schematic models that facilitate the identification of…
Given two real algebraic varieties X and Y, we denote by R(X,Y) the set of all regular maps from X to Y. The set R(X,Y) is regarded as a topological subspace of the space C(X,Y) of all continuous maps from X to Y endowed with the…
For a variety over certain topological rings $R$, like $\mathbb{Z}_p$ or $\mathbb{C}$, there is a well-studied way to topologize the $R$-points on the variety. In this paper, we generalize this definition to algebraic stacks. For an…
Let $G$ be a finite group, and let $H$ be a subgroup of $G$. We compute the probability, denoted by $P_G(H)$, that a left transversal of $H$ in $G$ is also a right transversal, thus a two-sided one. Moreover, we define, and denote by…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
Hurewicz found connections between some topological notions and the combinatorial cardinals b and d. Reclaw gave topological meaning to the definition of the cardinal p. We extend the picture with a topological interpretation of the…
A method for computing probabilistic propositions is presented. It assumes the availability of a single external routine for computing the probability of one instantiated variable, given a conjunction of other instantiated variables. In…
A topological dynamical system induces two natural systems, one is on the hyperspace and the other one is on the probability space. The connection among some dynamical properties on the original space and on the induced spaces are…
Let $(X,T)$ be a topological dynamical system. We define the measure-theoretical lower and upper entropies $\underline{h}_\mu(T)$, $\bar{h}_\mu(T)$ for any $\mu\in M(X)$, where $M(X)$ denotes the collection of all Borel probability measures…
This paper is devoted to studying the multiple recurrent property of topologically mildly mixing systems along generalized polynomials. We show that if a minimal system is topologically mildly mixing, then it is mild mixing of higher orders…
Alternative set theory (AST) may be suitable for the ones who try to capture objects or phenomenons with some kind of indefiniteness of a border. While AST provides various notions for advanced mathematical studies, correspondence of them…
We give a selection of major open problems involving selective properties, diagonalizations, and covering properties for sets of real numbers. This is a revision of the version published as a chapter in the book \textbf{Open Problems in…
The idea of slicing divergences has been proven to be successful when comparing two probability measures in various machine learning applications including generative modeling, and consists in computing the expected value of a `base…
This is the first of two papers that introduce a deformation theoretic framework to explain and broaden a link between homotopy algebra and probability theory. In this paper, cumulants are proved to coincide with morphisms of homotopy…
A distinction is sometimes made between "statistical" and "subjective" probabilities. This is based on a distinction between "unique" events and "repeatable" events. We argue that this distinction is untenable, since all events are "unique"…
The relationship between three probability distributions and their maximizable entropy forms is discussed without postulating entropy property. For this purpose, the entropy I is defined as a measure of uncertainty of the probability…
Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…
Given a hypergraph $\Gamma=(\Omega,\mathcal{X})$ and a sequence $\mathbf{p} = (p_\omega)_{\omega\in \Omega}$ of values in $(0,1)$, let $\Omega_{\mathbf{p}}$ be the random subset of $\Omega$ obtained by keeping every vertex $\omega$…