Subharmonic Almost Periodic Functions of Slow Growth

We obtain a complete description of the Riesz measures of almost periodic subharmonic functions with at most of linear growth on the complex plane; as a consequence we get a complete description of zero sets for the class of entire functions of exponential type with almost periodic modulus

Almost complete and equable heteroclinic networks

Heteroclinic connections are trajectories that link invariant sets for an autonomous dynamical flow: these connections can robustly form networks between equilibria, for systems with flow-invariant spaces. In this paper we examine the relation between the heteroclinic network as a flow-invariant set and directed graphs of possible connections between nodes. We consider realizations of a large class of transitive digraphs as robust heteroclinic networks and show that although robust realizations are typically not complete (i.e. not all unstable manifolds of nodes are part of the network), they can be almost complete (i.e. complete up to a set of zero measure within the unstable manifold) and equable (i.e. all sets of connections from a node have the same dimension). We show there are almost complete and equable realizations that can be closed by adding a number of extra nodes and connections. We discuss some examples and describe a sense in which an equable almost complete network embedding is an optimal description of stochastically perturbed motion on the network

Generalized Potentials and Robust Sets of Equilibria

This paper introduces generalized potential functions of complete information games and studies the robustness of sets of equilibria to incomplete information. A set of equilibria of a complete information game is robust if every incomplete information game where payoffs are almost always given by the complete information game has an equilibrium which generates behavior close to some equilibrium in the set. This paper provides sufficient conditions for the robustness of sets of equilibria in terms of argmax sets of generalized potential functions and shows that the sufficient conditions generalize the existing sufficient conditions for the robustness of equilibria.Incomplete information, Potential, Refinements, Robustness

Complexity of equivalence relations and preorders from computability theory

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by R\le S \iff \ex f \, \forall x, y \, [xRy \lra f(x) Sf(y)]. Here $f$ is taken from a suitable class of effective functions. For us the relations will be on natural numbers, and $f$ must be computable. We show that there is a $\Pi_1$-complete equivalence relation, but no $\Pi k$-complete for $k \ge 2$. We show that $\Sigma k$ preorders arising naturally in the above-mentioned areas are $\Sigma k$-complete. This includes polynomial time $m$-reducibility on exponential time sets, which is $\Sigma 2$, almost inclusion on r.e.\ sets, which is $\Sigma 3$, and Turing reducibility on r.e.\ sets, which is $\Sigma 4$.Comment: To appear in J. Symb. Logi

Limiting modular symbols and their fractal geometry

In this paper we use fractal geometry to investigate boundary aspects of the first homology group for finite coverings of the modular surface. We obtain a complete description of algebraically invisible parts of this homology group. More precisely, we first show that for any modular subgroup the geodesic forward dynamic on the associated surface admits a canonical symbolic representation by a finitely irreducible shift space. We then use this representation to derive an `almost complete' multifractal description of the higher--dimensional level sets arising from Manin--Marcolli's limiting modular symbols.Comment: 20 pages, 1 figur