Displaying similar documents to “The sum-product algorithm: algebraic independence and computational aspects”

Chance constrained bottleneck transportation problem with preference of routes

Yue Ge, Minghao Chen, Hiroaki Ishii (2012)

Kybernetika

Similarity:

This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination...

Reverse mathematics of some topics from algorithmic graph theory

Peter Clote, Jeffry Hirst (1998)

Fundamenta Mathematicae

Similarity:

This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are considered.

Recursive expansions

C. Ash, J. Knight (1994)

Fundamenta Mathematicae

Similarity:

Let A be a recursive structure, and let ψ be a recursive infinitary Π 2 sentence involving a new relation symbol. The main result of the paper gives syntactical conditions which are necessary and sufficient for every recursive copy of A to have a recursive expansion to a model of ψ, provided A satisfies certain decidability conditions. The decidability conditions involve a notion of rank. The main result is applied to prove some earlier results of Metakides-Nerode and Goncharov. In these...

Hyperconvexity of ℝ-trees

W. Kirk (1998)

Fundamenta Mathematicae

Similarity:

It is shown that for a metric space (M,d) the following are equivalent: (i) M is a complete ℝ-tree; (ii) M is hyperconvex and has unique metric segments.

The sequential topology on complete Boolean algebras

Wiesław Główczyński, Bohuslav Balcar, Thomas Jech (1998)

Fundamenta Mathematicae

Similarity:

We investigate the sequential topology τ s on a complete Boolean algebra B determined by algebraically convergent sequences in B. We show the role of weak distributivity of B in separation axioms for the sequential topology. The main result is that a necessary and sufficient condition for B to carry a strictly positive Maharam submeasure is that B is ccc and that the space ( B , τ s ) is Hausdorff. We also characterize sequential cardinals.

Partition properties of ω1 compatible with CH

Uri Abraham, Stevo Todorčević (1997)

Fundamenta Mathematicae

Similarity:

A combinatorial statement concerning ideals of countable subsets of ω is introduced and proved to be consistent with the Continuum Hypothesis. This statement implies the Suslin Hypothesis, that all (ω, ω*)-gaps are Hausdorff, and that every coherent sequence on ω either almost includes or is orthogonal to some uncountable subset of ω.