USING THE ATTACHMENT LENS AND THE DYADIC EXPANSION OF CONSCIOUSNESS APPROACH TO INCREASE SCHOOL ADJUSTMENT

When in danger, either we refer to menaces or just novel situations, the brain needs firstly to connect to another human brain in order to coregulate; only after, can that brain continue process/ learn, regulate behaviors and thus adjust to the environment. The purpose of this study was to explore the connection between the quality of the pupil-teacher relationship, assessed from the attachment perspective and different school adjustment aspects. A sample of 40 educators were invited to evaluate their attachment strategies and then assess at least 3children from their current classes(primary school); results for a total of 121pupils were collected. First of all, educators assessed the pupil’s attachment needs using the Student-Teacher Relationship Scale; then, they were asked to assess social competencies using the Social Competence Scaleand the Engagementversus Disaffection with Learning Scale, as facets of school adjustment. Results show that the strength of the pupil-teacher relationship is influenced by the particularities of the attachment strategies of both parties, and, in turn, this relationship, with its 3 dimensions (closeness, conflict and dependence)impacts adjustment. Results are discussed in the light of the Dyadic Expansion of Consciousnesshypothesis–in a safe relationship, both the teacherand the pupil significantly expand the learning possibilities.

A NOTE ON THE INTERSECTIONS OF THE BESICOVITCH SETS AND ERDŐS–RÉNYI SETS

For $x\in (0,1]$ and a positive integer $n,$ let $S_{\!n}(x)$ denote the summation of the first $n$ digits in the dyadic expansion of $x$ and let $r_{n}(x)$ denote the run-length function. In this paper, we obtain the Hausdorff dimensions of the following sets: $$\begin{eqnarray}\bigg\{x\in (0,1]:\liminf _{n\rightarrow \infty }\frac{S_{\!n}(x)}{n}=\unicode[STIX]{x1D6FC},\limsup _{n\rightarrow \infty }\frac{S_{\!n}(x)}{n}=\unicode[STIX]{x1D6FD},\lim _{n\rightarrow \infty }\frac{r_{n}(x)}{\log _{2}n}=\unicode[STIX]{x1D6FE}\bigg\},\end{eqnarray}$$ where $0\leq \unicode[STIX]{x1D6FC}\leq \unicode[STIX]{x1D6FD}\leq 1$, $0\leq \unicode[STIX]{x1D6FE}\leq +\infty$.

EXCEPTIONAL SETS RELATED TO THE RUN-LENGTH FUNCTION OF BETA-EXPANSIONS

Let [Formula: see text] and [Formula: see text] be real numbers. The run-length function of [Formula: see text]-expansions denoted by [Formula: see text] is defined as the maximal length of consecutive zeros in the first [Formula: see text] digits of the [Formula: see text]-expansion of [Formula: see text]. It is known that for Lebesgue almost all [Formula: see text], [Formula: see text] increases to infinity with the logarithmic speed [Formula: see text] as [Formula: see text] goes to infinity. In this paper, we calculate the Hausdorff dimension of the subtle set for which [Formula: see text] grows to infinity with other speeds. More precisely, we prove that for any [Formula: see text], the set [Formula: see text] has full Hausdorff dimension, where [Formula: see text] is a strictly increasing function satisfying that [Formula: see text] is non-increasing, [Formula: see text] and [Formula: see text] as [Formula: see text]. This result significantly extends the existing results in this topic, such as the results in [J.-H. Ma, S.-Y. Wen and Z.-Y. Wen, Egoroff’s theorem and maximal run length, Monatsh. Math. 151(4) (2007) 287–292; R.-B. Zou, Hausdorff dimension of the maximal run-length in dyadic expansion, Czechoslovak Math. J. 61(4) (2011) 881–888; J.-J. Li and M. Wu, On exceptional sets in Erdős–Rényi limit theorem, J. Math. Anal. Appl. 436(1) (2016) 355–365; J.-J. Li and M. Wu, On exceptional sets in Erdős–Rényi limit theorem revisited, Monatsh. Math. 182(4) (2017) 865–875; Y. Sun and J. Xu, A remark on exceptional sets in Erdős–Rényi limit theorem, Monatsh. Math. 184(2) (2017) 291–296; X. Tong, Y.-L. Yu and Y.-F. Zhao, On the maximal length of consecutive zero digits of [Formula: see text]-expansions, Int. J. Number Theory 12(3) (2016) 625–633; J. Liu, and M.-Y. Lü, Hausdorff dimension of some sets arising by the run-length function of [Formula: see text]-expansions, J. Math. Anal. Appl. 455(1) (2017) 832–841; L.-X. Zheng, M. Wu and B. Li, The exceptional sets on the run-length function of [Formula: see text]-expansions, Fractals 25(6) (2017) 1750060; X. Gao, H. Hu and Z.-H. Li, A result on the maximal length of consecutive 0 digits in [Formula: see text]-expansions, Turkish J. Math. 42(2) (2018) 656–665, doi: 10.3906/mat-1704-119].

Pattern Occurrence in the Dyadic Expansion of Square Root of Two and an Analysis of Pseudorandom Number Generators

Recently, designs of pseudorandom number generators (PRNGs) using integer-valued variants of logistic maps and their applications to certain cryptographic schemes have been studied, due mostly to their ease of implementation and performance. However, it has been noted that this ease is reduced for some choices of the PRNGs accuracy parameters. In this article, we show that the distribution of such undesirable accuracy parameters is closely related to the occurrence of some patterns in the dyadic expansion of the square root of 2. We prove that for an arbitrary infinite binary word, the asymptotic occurrence rate of these patterns is bounded in terms of the asymptotic occurrence rate of zeroes. As a consequence, a classical conjecture on asymptotic evenness of occurrence of zeroes and ones in the dyadic expansion of the square root of 2 implies that the asymptotic rate of the undesirable accuracy parameters for the PRNGs is at least 1/6.