When series of computable functions with varying domains are computable

In this paper we study the behavior of computable series of computable partial functions with varying domains (but each domain containing all computable points), and prove that the sum of the series exists and is computable exactly on the intersection of the domains when a certain computable Cauchyness criterion is met. In our point‐free approach, we name points via nested sequences of basic open sets, and thus our functions from a topological space into the reals are generated by functions from basic open sets to basic open sets. The construction of a function that produces the sum of a series requires working with an infinite array of pairs of basic open sets, and reconciling the varying domains. We introduce a general technique for using such an array to produce a set function that generates a well‐defined point function and apply the technique to a series to establish our main result. Finally, we use the main finding to construct a computable, and thus continuous, function whose domain is of Lebesgue measure zero and which is nonextendible to a continuous function whose domain properly includes the original domain. (We had established existence of such functions with domains of measure less than ε for any , in an earlier paper.)     

The complexity of central series in nilpotent computable groups

The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are independent even when restricted to groups which admit computable orders.     

Reduction of computable and potentially computable numerations

Among the numerations of classes of countable sets there can be distinguished those in which the number contains information about the set having the number-these are computable and potentially computable numerations—and those in which the set contains information about its number-these are covering and fully covering numerations. The conditions are established which are necessary and sufficient in order that all numerations of the given class should be covering. As a corollary it is established that there exist covering numerations which are not fully covering.Translated from Matematicheskie Zametki, Vol. 6, No. 1, pp. 3–9, July, 1969.     

On the convergence of Fourier series of computable Lebesgue integrable functions

This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of L^p‐computable functions (computable Lebesgue integrable functions) with a size notion, by introducing L^p‐computable Baire categories. We show that L^p‐computable Baire categories satisfy the following three basic properties. Singleton sets {f } (where f is L^p‐computable) are meager, suitable infinite unions of meager sets are meager, and the whole space of L^p‐computable functions is not meager. We give an alternative characterization of meager sets via Banach‐Mazur games. We study the convergence of Fourier series for L^p‐computable functions and show that whereas for every p > 1, the Fourier series of every L^p‐computable function f converges to f in the L^p norm, the set of L¹‐computable functions whose Fourier series does not diverge almost everywhere is meager (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On computable formal concepts in computable formal contexts

We introduce and study the notions of computable formal context and computable formal concept. We give some examples of computable formal contexts in which the computable formal concepts fail to form a lattice and study the complexity aspects of formal concepts in computable contexts. In particular, we give some sufficient conditions under which the computability or noncomputability of a formal concept could be recognized from its lattice-theoretic properties. We prove the density theorem showing that in a Cantor-like topology every formal concept can be approximated by computable ones. We also show that not all formal concepts have lattice-theoretic approximations as suprema or infima of families of computable formal concepts.     

Functionals strictly subjected to convergent series and search for singularities of mappings

This paper is a continuation of the author’s previous works where the concepts of search functionals were introduced and used to develop methods of cascade search for singularities of mappings between metric spaces. Such singularities of mappings were considered as coincidences, common preimages, common fixed points and common roots of finite sets of mappings. In this paper, a new class of functionals strictly subjected to convergent series is introduced. With the help of such functionals the problems of local search for the above-mentioned singularities of mappings between metric spaces are investigated. Some new iteration schemes are suggested. Generalizations of several known results are obtained.     

Drawing series parallel digraphs symmetrically

In this paper we present algorithms for drawing series parallel digraphs with as much symmetry as possible. The first step is to compute a certain kind of automorphism, called an “upward planar automorphism” for an input series parallel digraph. The next step uses these automorphisms to construct a symmetric drawing of the graph. We present several variations of the second step, with visibility drawings, “bus-orthogonal” drawings, and polyline drawings. All algorithms run in linear time.     

On greedy algorithms for series parallel graphs

This note describes some sufficient conditions for the maximum or minimum of a weighted flow (the weights are on paths, and are derived from weights on the edges of the path), of given volume in a series parallel graph to be found by a greedy algorithm.     

Initial segments of computable linear orders with computable natural relations

We study the algorithmic complexity of natural relations on initial segments of computable linear orders. We prove that there exists a computable linear order with computable density relation such that its Π₁⁰-initial segment has no computable presentation with a computable density relation. We also prove that the same holds for a right limit and a left limit relations.     

Linkless symmetric drawings of series parallel digraphs

In this paper, we present a linear time algorithm for constructing linkless drawings of series parallel digraphs with maximum number of symmetries. Linkless drawing in three dimensions is a natural extension to planar drawing in two dimensions. Symmetry is one of the most important aesthetic criteria in graph drawing. More specifically, we present two algorithms: a symmetry finding algorithm which finds maximum number of three dimensional symmetries, and a drawing algorithm which constructs linkless symmetric drawings of series parallel digraphs in three dimensions.     

Initial segments of computable linear orders with additional computable predicates

We study computable linear orders with computable neighborhood and block predicates. In particular, it is proved that there exists a computable linear order with a computable neighborhood predicate, having a Π₁⁰ -initial segment which is isomorphic to no computable order with a computable neighborhood predicate. On the other hand, every Σ₁⁰ -initial segment of such an order has a computable copy enjoying a computable neighborhood predicate. Similar results are stated for computable linear orders with a computable block predicate replacing a neighborhood relation. Moreover, using the results obtained, we give a simpler proof for the Coles–Downey–Khoussainov theorem on the existence of a computable linear order with Π₂⁰ -initial segment, not having a computable copy.     

Strategic defense and attack for series and parallel reliability systems

A system of independent components is defended by a strategic defender and attacked by a strategic attacker. The reliability of each component depends on how strongly it is defended and attacked, and on the intensity of the contest. In a series system, the attacker benefits from a substitution effect since attacker benefits flow from attacking any of the components, while the defender needs to defend all components. Even for a series system, when the attacker is sufficiently disadvantaged with high attack inefficiencies, and the intensity of the contest is sufficiently high, the defender earns maximum utility and the attacker earns zero utility. The results for the defender (attacker) in a parallel system are equivalent to the results for the attacker (defender) in a series system. Hence, the defender benefits from the substitution effect in parallel systems. With budget constraints the ratio of the investments for each component, and the contest success function for each component, are the same as without budget constraints when replacing the system values for the defender and attacker with their respective budget constraints.     

Reliability and non-reliability studies of Poisson variables in series and parallel systems

In this paper, we have derived the distribution of the minimum and maximum of two independent Poisson random variables. A useful procedure for computing the probabilities is given and a total of four numerical examples are presented. Of these four examples, the first two are on the generated data and the other two are on the Champion League Soccer data in order to illustrate the model which is considered here. The hazard rate and the reversed hazard rate, of the minimum and maximum of two independent discrete random variables, are also obtained and their monotonicity is investigated. The results for the Poisson-distributed variables are obtained as special cases.     

Postman problems on series–parallel mixed graphs

Given a strongly connected, mixed graph with costs on its edges and arcs, the mixed postman problem is to find a minimum cost closed walk traversing its edges and arcs at least once. This problem is NP-hard even on planar graphs but is solvable in polynomial time on series–parallel graphs. We give $O\left(n{m}^2\right)$ dynamic programming algorithms for the mixed postman problem and other similar problems on series–parallel graphs with $n$ vertices and $m$ edges and arcs.