We define a symmetric monodical pairing G ◦ H among simply connected co-H spaces G and H with the property that S(G◦H) is equivalent to the smash product G∧H as co-H spaces. We further generalize the Whitehead product map to a map G ◦ H → G ∨ H whose mapping cone is the cartesian product. Whitehead products have played an important role in unstable homotopy. They were originally introduced [Whi...

The bilinear Generalized predictive controller is modified to account for unmodelled plant uncertainties and bounded disturbances. First, a generalized predictive control law is derived by means of minimizing a quadratic cost function and then modified by introducing an estimate of the modeling error as a feedback. The robustness results are derived by neither requiring a prior knowledge of the...

In this paper we prove an abstract homomorphism theorem for bilinear multipliers in the setting of locally compact Abelian (LCA) groups. We also provide some applications. In particular, we obtain a bilinear abstract version of K. de Leeuw’s theorem for bilinear multipliers of strong and weak type. We also obtain necessary conditions on bilinear multipliers on non-compact LCA groups, yielding b...

The paper presents an algebraic characterization of observability and span-reachability of bilinear hybrid systems without guards, i.e. hybrid systems whose continuous dynamics is determined by bilinear control systems, and whose discrete transitions are triggered externally. The proposed characterization provides necessary and sufficient conditions for observability and spanreachability in ter...

In his remarkable article “Quadratic division algebras” (Trans. Amer. Math. Soc. 105 (1962), 202–221), J. M. Osborn claims to solve ‘the problem of determining all quadratic division algebras of order 4 over an arbitrary field F of characteristic not two . . . modulo the theory of quadratic forms over F ’ (cf. p. 206). While we shall explain in which respect he has not achieved this goal, we sh...

In many pairing-based cryptosystems, the secret keys are elements of bilinear groups. For safeguarding such secret keys or decrypting or signing in a threshold manner, Verifiable Secret Sharing (VSS) in bilinear groups is required. In this paper, we show a method of verifiably sharing a random secret in a bilinear group. Our method is simple and practical. It can be regarded as a generalisation...

L p estimates for non smooth bilinear Littlewood-Paley square functions on R. Abstract In this work, some non smooth bilinear analogues of linear Littlewood-Paley square functions on the real line are studied. Mainly we prove boundedness-properties in Lebesgue spaces for them. Let us consider the function φn satisfying c φn(ξ) = 1 [n,n+1] (ξ) and consider the bilinear operator Sn(f, g)(x) := R ...

Bilinear operators are investigated in the context of Sobolev spaces and various techniques useful in the study of their boundedness properties are developed. In particular, several classes of symbols for bilinear operators beyond the so called CoifmanMeyer class are considered. Some of the Sobolev space estimates obtained apply to both the bilinear Hilbert transform and its singular multiplier...

At Eurocrypt 2010, Freeman proposed a transformation from pairing-based schemes in composite-order bilinear groups to equivalent ones in prime-order bilinear groups. His transformation can be applied to pairing-based cryptosystems exploiting only one of two properties of composite-order bilinear groups: cancelling and projecting. At Asiacrypt 2010, Meiklejohn, Shacham, and Freeman showed that p...

f(x, y) = a x + x Qy + b y, where a, x ∈ R, b, y ∈ R, and Q is a matrix of dimension n ×m. It is easy to see that bilinear functions compose a subclass of quadratic functions. We refer to optimization problems with bilinear objective and/or constraints as bilinear problems, and they can be viewed as a subclass of quadratic programming. Bilinear programming has various applications in constraine...