If f(x1, ..., xn) ∈ Z[x1, ..., xn] has the property that every integer specialization gives an integral square value, then f is itself the square of a polynomial. We also give an effective version of this result by using an effective version of a classical theorem of E. Noether along with a theorem of Lang and Weil.

The three-dimensional structures of noncoding RNA molecules reveal recurring architectural motifs that have been exploited for the design of artificial RNA nanomaterials. Programmed assembly of RNA nanoobjects from autonomously folding tetraloop-receptor complexes as well as junction motifs has been achieved previously through sequence-directed hybridization of complex sets of long oligonucleot...

In this paper we present a new 128-bit block cipher called Square. The original design of Square concentrates on the resistance against differential and linear cryptanalysis. However, after the initial design a dedicated attack was mounted that forced us to augment the number of rounds. The goal of this paper is the publication of the resulting cipher for public scrutiny. A C implementation of ...

© Annales de l’institut Fourier, 1986, tous droits réservés. L’accès aux archives de la revue « Annales de l’institut Fourier » (http://annalif.ujf-grenoble.fr/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier...

We say that a partial word w over an alphabet A is square-free if every factor xx of w such that x and x are compatible is either of the form ⋄a or a⋄ where ⋄ is a hole and a ∈ A. We prove that there exist uncountably many square-free partial words over a ternary alphabet with an infinite number of holes.

The problem of parameter estimation in linear model is pervasive in signal processing and communication applications. It is often common to restrict attention to linear estimators, which simplifies the implementation as well as the mathematical derivations. The simplest design scenario is when the second order statistics of the parameters to be estimated are known and it is desirable to minimiz...

In the article the formal characterization of square-free numbers is shown; in this manner the paper is the continuation of [19]. Essentially, we prepared some lemmas for convenient work with numbers (including the proof that the sequence of prime reciprocals diverges [1]) according to [18] which were absent in the Mizar Mathematical Library. Some of them were expressed in terms of clusters’ re...

Given a set P of n points in the plane, we seek two squares whose center points belong to P , their union contains P , and the area of the larger square is minimal. We present eecient algorithms for three variants of this problem: In the rst the squares are axis parallel, in the second they are free to rotate but must remain parallel to each other, and in the third they are free to rotate indep...

The Least Mean Square (LMS) algorithm, introduced by Widrow and Hoff in 1959 [12] is an adaptive algorithm, which uses a gradient-based method of steepest decent [10]. LMS algorithm uses the estimates of the gradient vector from the available data. LMS incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vect...