Theta-point polymers in the plane and Schramm-Loewner evolution

We study the connection between polymers at the theta temperature on the lattice and Schramm-Loewner chains with constant step length in the continuum. The latter realize a useful algorithm for the exact sampling of tricritical polymers, where finite-chain effects are excluded. The driving function computed from the lattice model via a radial implementation of the zipper method is shown to converge to Brownian motion of diffusivity kappa=6 for large times. The distribution function of an internal portion of walk is well approximated by that obtained from Schramm-Loewner chains. The exponent of the correlation length nu and the leading correction-to scaling exponent Delta_1 measured in the continuum are compatible with nu=4/7 (predicted for the theta point) and Delta_1=72/91 (predicted for percolation). Finally, we compute the shape factor and the asphericity of the chains, finding surprising accord with the theta-point end-to-end values.Comment: 8 pages, 6 figure

Completion of Choice

We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the Weihrauch lattice. On the other hand, choice problems also characterize several natural classes of computable problems, such as finite mind change computable problems, non-deterministically computable problems, Las Vegas computable problems and effectively Borel measurable functions. The closure operator of completion generates the concept of total Weihrauch reducibility, which is a variant of Weihrauch reducibility with total realizers. Logically speaking, the completion of a problem is a version of the problem that is independent of its premise. Hence, studying the completion of choice problems allows us to study simultaneously choice problems in the total Weihrauch lattice, as well as the question which choice problems can be made independent of their premises in the usual Weihrauch lattice. The outcome shows that many important choice problems that are related to compact spaces are complete, whereas choice problems for unbounded spaces or closed sets of positive measure are typically not complete.Comment: 30 page

A Parafermionic Generalization of the Jaynes Cummings Model

We introduce a parafermionic version of the Jaynes Cummings Hamiltonian, by coupling $k$ Fock parafermions (nilpotent of order $F$) to a 1D harmonic oscillator, representing the interaction with a single mode of the electromagnetic field. We argue that for $k=1$ and $F\leq 3$ there is no difference between Fock parafermions and quantum spins $s=\frac{F-1}{2}$. We also derive a semiclassical approximation of the canonical partition function of the model by assuming $\hbar$ to be small in the regime of large enough total number of excitations $n$, where the dimension of the Hilbert space of the problem becomes constant as a function of $n$. We observe in this case an interesting behaviour of the average of the bosonic number operator showing a single crossover between regimes with different integer values of this observable. These features persist when we generalize the parafermionic Hamiltonian by deforming the bosonic oscillator with a generic function $\Phi(x)$; the $q-$deformed bosonic oscillator corresponds to a specific choice of the deformation function $\Phi$. In this particular case, we observe at most $k(F-1)$ crossovers in the behavior of the mean bosonic number operator, suggesting a phenomenology of superradiance similar to the $k-$atoms Jaynes Cummings model.Comment: to appear on J.Phys.

Weihrauch goes Brouwerian

We prove that the Weihrauch lattice can be transformed into a Brouwer algebra by the consecutive application of two closure operators in the appropriate order: first completion and then parallelization. The closure operator of completion is a new closure operator that we introduce. It transforms any problem into a total problem on the completion of the respective types, where we allow any value outside of the original domain of the problem. This closure operator is of interest by itself, as it generates a total version of Weihrauch reducibility that is defined like the usual version of Weihrauch reducibility, but in terms of total realizers. From a logical perspective completion can be seen as a way to make problems independent of their premises. Alongside with the completion operator and total Weihrauch reducibility we need to study precomplete representations that are required to describe these concepts. In order to show that the parallelized total Weihrauch lattice forms a Brouwer algebra, we introduce a new multiplicative version of an implication. While the parallelized total Weihrauch lattice forms a Brouwer algebra with this implication, the total Weihrauch lattice fails to be a model of intuitionistic linear logic in two different ways. In order to pinpoint the algebraic reasons for this failure, we introduce the concept of a Weihrauch algebra that allows us to formulate the failure in precise and neat terms. Finally, we show that the Medvedev Brouwer algebra can be embedded into our Brouwer algebra, which also implies that the theory of our Brouwer algebra is Jankov logic.Comment: 36 page

Probabilistic Computability and Choice

We study the computational power of randomized computations on infinite objects, such as real numbers. In particular, we introduce the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a probabilistic Turing machine that receives a random binary sequence as auxiliary input. The machine can take advantage of this random sequence, but it always has to produce a correct result or to stop the computation after finite time if the random advice is not successful. With positive probability the random advice has to be successful. We characterize the class of Las Vegas computable functions in the Weihrauch lattice with the help of probabilistic choice principles and Weak Weak K\H{o}nig's Lemma. Among other things we prove an Independent Choice Theorem that implies that Las Vegas computable functions are closed under composition. In a case study we show that Nash equilibria are Las Vegas computable, while zeros of continuous functions with sign changes cannot be computed on Las Vegas machines. However, we show that the latter problem admits randomized algorithms with weaker failure recognition mechanisms. The last mentioned results can be interpreted such that the Intermediate Value Theorem is reducible to the jump of Weak Weak K\H{o}nig's Lemma, but not to Weak Weak K\H{o}nig's Lemma itself. These examples also demonstrate that Las Vegas computable functions form a proper superclass of the class of computable functions and a proper subclass of the class of non-deterministically computable functions. We also study the impact of specific lower bounds on the success probabilities, which leads to a strict hierarchy of classes. In particular, the classical technique of probability amplification fails for computations on infinite objects. We also investigate the dependency on the underlying probability space.Comment: Information and Computation (accepted for publication

Balancing building and maintenance costs in growing transport networks

The costs associated to the length of links impose unavoidable constraints to the growth of natural and artificial transport networks. When future network developments can not be predicted, building and maintenance costs require competing minimization mechanisms, and can not be optimized simultaneously. Hereby, we study the interplay of building and maintenance costs and its impact on the growth of transportation networks through a non-equilibrium model of network growth. We show cost balance is a sufficient ingredient for the emergence of tradeoffs between the network's total length and transport effciency, of optimal strategies of construction, and of power-law temporal correlations in the growth history of the network. Analysis of empirical ant transport networks in the framework of this model suggests different ant species may adopt similar optimization strategies.Comment: 4 pages main text, 2 pages references, 4 figure

Beyond the storage capacity: data driven satisfiability transition

Data structure has a dramatic impact on the properties of neural networks, yet its significance in the established theoretical frameworks is poorly understood. Here we compute the Vapnik-Chervonenkis entropy of a kernel machine operating on data grouped into equally labelled subsets. At variance with the unstructured scenario, entropy is non-monotonic in the size of the training set, and displays an additional critical point besides the storage capacity. Remarkably, the same behavior occurs in margin classifiers even with randomly labelled data, as is elucidated by identifying the synaptic volume encoding the transition. These findings reveal aspects of expressivity lying beyond the condensed description provided by the storage capacity, and they indicate the path towards more realistic bounds for the generalization error of neural networks.Comment: 5 pages, 2 figure