from the early 1950s, estimating the autocorrelations of polynomials with coefficients on the unit circle has found applications in ising spin systems and in surface acoustic wave designs. in this paper, a technique is introduced that not only estimates the autocorrelations, but for some special types of such polynomials, it locates the frequencies at which maximum autocorrelation occurs.

this paper is concerned with the best proximity pair problem in hilbert spaces. given two subsets $a$ and $b$ of a hilbert space $h$ and the set-valued maps $f:a o 2^ b$ and $g:a_0 o 2^{a_0}$, where $a_0={xin a: |x-y|=d(a,b)~~~mbox{for some}~~~ yin b}$, best proximity pair theorems provide sufficient conditions that ensure the existence of an $x_0in a$ such that $$d(g(x_0),f(x_0))=d(a,b).$$

‎let $g$ be a finite $p$-group and $n$ be a normal subgroup of $g$ with‎ ‎$|n|=p^n$ and $|g/n|=p^m$‎. ‎a result of ellis (1998) shows‎ ‎that the order of the schur multiplier of such a pair $(g,n)$ of finite $p$-groups is bounded‎ ‎by $ p^{frac{1}{2}n(2m+n-1)}$ and hence it is equal to $‎ ‎p^{frac{1}{2}n(2m+n-1)-t}$ for some non-negative integer $t$‎. ‎recently‎, ‎the authors have characterized...

L’article examine le cas d’une plateforme en pair-à-pair permettant l’échange de données privées entre opérateurs bases données. Il soutient que possède sur plan sa conception certaines propriétés associées aux communs et démontre particulier comment une structure gouvernance s’inscrit dans l’architecture technique. Cette observation plaide faveur spécificité des numériques.