Nathalie Veyrat1, Christelle Aurélie Maud Robert2, Ted Christiaan Johannes Turlings1 & Matthias 3 Erb2,* 4 1 Laboratory for Fundamental and Applied Research in Chemical Ecology, University of Neuchâtel, Rue 5 Emile-Argand 11, 2009 Neuchatel, Switzerland 6 2 Institute of Plant Sciences, University of Bern, Altenbergain 21, 3013 Bern, Switzerland 7 *Correspondence author: Email: matthias.erb@ips....

Introduction This package provides functions for discoverying linear recurrence equations with polynomial coefficients satisfied by the entries of a given array. It extends the functionality of existing packages like Mallinger's GeneratingFunctions.m or Salvy and Zimmermann's gfun in two directions: (1) it is more general in that, e.g., multivariate recurrences, or recurrences of a particular s...

This paper delineates the simultaneous impact of non-anticipated information on mean and variance of the intraday return process by including appropriate variables accounting for the news flow into both the mean and the variance function. This allows us to differentiate between the consistent price reaction to surprising news and the traders’ uncertainty about the precise price impact of this i...

This paper defends the view, put roughly, that to think p is guess answer question at hand, and rationally for one’s be (in a certain sense) non-arbitrary. Some theses will argued along way include: thinking question-sensitive and, correspondingly, ‘thinks’ context-sensitive; it can rational while having arbitrarily low credence p; that, nonetheless, closed under entailment; does ...

Some interesting results on a guessing wiretapper’s performance on a Shannon cipher system are summarized. The performance metrics are exponents of guessing moments and probability of large deviations. Connections with compression and the game of twenty questions are discussed. Asymptotic optimality of guessing attacks based on Lempel-Ziv coding lengths is highlighted.

The problem of guessing a random string is revisited. The relationship between guessing without distortion and compression is extended to the case when source alphabet size is countably infinite. Further, similar relationship is established for the case when distortion allowed by establishing a tight relationship between rate distortion codes and guessing strategies.