Cryptographic protocols depend on the hardness of some computational problems for their security. Joux briefly summarized known relations between assumptions related bilinear map in a sense that if one problem can be solved easily, then another problem can be solved within a polynomial time [6]. In this paper, we investigate additional relations between them. Firstly, we show that the computati...

This paper considers an extended recursive least squares (RLS) adaptive bilinear predictor. It is shown that the extended RLS adaptive bilinear predictor is guaranteed to be stable in the sense that the time average of the squared a-posteriori prediction error signal is bounded whenever the input signal is bounded in the same sense. It also shows that the a-priori prediction error itself is bou...

In this work we prove Hardy space estimates for bilinear Littlewood-Paley-Stein square function and Calderón-Zygmund operators. Sufficient Carleson measure type conditions are given for square functions to be bounded from H p1 ×H p2 into Lp for indices smaller than 1, and sufficient BMO type conditions are given for a bilinear Calderón-Zygmund operator to be bounded from H p1 ×H p2 into H p for...

This article is concerned with the question of whether Marcinkiewicz multipliers on R2n give rise to bilinear multipliers on R×R. We show that this is not always the case. Moreover, we find necessary and sufficient conditions for such bilinear multipliers to be bounded. These conditions in particular imply that a slight logarithmic modification of the Marcinkiewicz condition gives multipliers f...

Given three Banach spaces X, Y and Z and a bounded bilinear map B : X×Y → Z, a sequence x = (xn)n ⊆ X is called B-absolutely summable if ∑∞ n=1 ‖B(xn, y)‖Z < ∞ for any y ∈ Y . Connections of this space with `weak(X) are presented. A sequence x = (xn)n ⊆ X is called B-unconditionally summable if ∑∞ n=1 |〈B(xn, y), z∗〉| < ∞ Preprint submitted to Elsevier 21 December 2007 for any y ∈ Y and z∗ ∈ Z∗...

In this paper we present a finite dimensional iterative algorithm for optimal maximum a posteriori (MAP) state estimation of bilinear systems. Bilinear models are appealing in their ability to represent or approximate a broad class of nonlinear systems. We show that several bilinear models previously considered in the literature are special cases of the general bilinear model we propose. Our it...

A notion of compactness in the bilinear setting is explored. Moreover, commutators of bilinear Calderón-Zygmund operators and multiplication by functions in a certain subspace of the space of functions of bounded mean oscillations are shown to be compact.