On the maximum values of the additive representation functions

Let $A$ and $B$ be sets of nonnegative integers. For a positive integer $n$ let $R_{A}(n)$ denote the number of representations of $n$ as the sum of two terms from $A$. Let $\displaystyle s_{A}(x) = \max_{n \le x}R_{A}(n)$ and \displaystyle d_{A,B}(x) = \max_{\hbox{t: a_{t} \le x$or$b_{t} \le x}}|a_{t} - b_{t}|. In this paper we study the connection between $s_{A}(x)$, $s_{B}(x)$ and $d_{A,B}(x)$. We improve a result of Haddad and Helou about the Erd\H{o}s - Tur\'an conjecture

Generalization of a theorem of Erdos and Renyi on Sidon Sequences

Erd\H os and R\'{e}nyi claimed and Vu proved that for all $h \ge 2$ and for all $\epsilon > 0$, there exists $g = g_h(\epsilon)$ and a sequence of integers $A$ such that the number of ordered representations of any number as a sum of $h$ elements of $A$ is bounded by $g$, and such that $|A \cap [1,x]| \gg x^{1/h - \epsilon}$. We give two new proofs of this result. The first one consists of an explicit construction of such a sequence. The second one is probabilistic and shows the existence of such a $g$ that satisfies $g_h(\epsilon) \ll \epsilon^{-1}$, improving the bound $g_h(\epsilon) \ll \epsilon^{-h+1}$ obtained by Vu. Finally we use the "alteration method" to get a better bound for $g_3(\epsilon)$, obtaining a more precise estimate for the growth of $B_3[g]$ sequences.Comment: 12 pages, no figure

Complex Rotating Waves and Long Transients in a Ring-Network of Electrochemical Oscillators with Sparse Random Cross-Connections

We perform experiments and phase model simulations with a ring network of oscillatory electrochemical reactions to explore the effect of random connections and non-isochronocity of the interactions on the pattern formation. A few additional links facilitate the emergence of the fully synchronized state. With larger non-isochronicity, complex rotating waves or persistent irregular phase dynamics can derail the convergence to global synchronization. The observed long transients of irregular phase dynamics exemplify the possibility of a sudden onset of hyper synchronous behavior without any external stimulus or network reorganization.Comment: 4 pages main text and 4 pages supplemental materia

Analysis of an epidemic model with awareness decay on regular random networks

The existence of a die-out threshold (different from the classic disease-invasion one) defining a region of slow extinction of an epidemic has been proved elsewhere for susceptible-aware-infectious-susceptible models without awareness decay, through bifurcation analysis. By means of an equivalent mean-field model defined on regular random networks, we interpret the dynamics of the system in this region and prove that the existence of bifurcation for of this second epidemic threshold crucially depends on the absence of awareness decay. We show that the continuum of equilibria that characterizes the slow die-out dynamics collapses into a unique equilibrium when a constant rate of awareness decay is assumed, no matter how small, and that the resulting bifurcation from the disease-free equilibrium is equivalent to that of standard epidemic models. We illustrate these findings with continuous-time stochastic simulations on regular random networks with different degrees. Finally, the behaviour of solutions with and without decay in awareness is compared around the second epidemic threshold for a small rate of awareness decay