No abstract uploaded!

No abstract uploaded!

Let$f:V$→$R$be a function defined on a subset$V$of$R$^{$n$}×$R$^{$d$}let$⃜:x→$inf{$f(x t)$;$t$such that$(x t)∈V}$denote the$shadow$of$f$and let$Φ$=${(x t)∈V; f(x t)=⃜(x)}$This paper deals with the characterization of some properties of ⃜ in terms of the infinitesimal behavior of$f$near points ζ∈$Φ$proving in particular a conjecture of J M Trépreau concerning the case$d$=1 Characterizations of this type are provided for the convexity the subharmonicity or the$C$^{1 1}regularity of ⃜ in the interior of$I={x∈$$R$^{n};ε$R$^{d}$(x t)∈V}$and in the$C$^{1 1}case an expression for$D$^{2}⃜ is given To some extent an answer is given to the following question: which convex function ⃜:$I$→$R$$I$interval ϒ$R$(resp which function √:$I$→$R$of class$C$^{1 1}) is the shadow of a$C$^{2}function$f:I$×$R→R$?

We study the relation between different spaces of vector-valued polynomials and analytic functions over dual-isomorphic Banach spaces. Under conditions of regularity on$E$and$F$, we show that the spaces of$X$-valued$n$-homogeneous polynomials and analytic functions of bounded type on$E$and$F$are isomorphic whenever$X$is a dual space. Also, we prove that many of the usual subspaces of polynomials and analytic functions on$E$and$F$are isomorphic without conditions on the involved spaces.

In this paper, we present an experimental analysis of HFE Challenge 2 (144 bit) type systems. We generate scaled versions of the full challenge fixing and guessing some unknowns. We use the MXL_3 algorithm, an efficient algorithm for computing Gröbner basis, to solve these scaled versions. We review the MXL_3 strategy and introduce our experimental results.