ON THE SPACE Qp AND ITS DYADIC COUNTERPART
نویسنده
چکیده
We deene a dyadic counterpart Q d p of Q p , and study some relations between Q p and Q d p. For example, a function on T belongs to Q p if and only if (almost) all its translates belong to Q d p. Conversely, functions in Q p may be obtained by averaging translates of functions in Q d p .
منابع مشابه
On quasi $P$-spaces and their applications in submaximal and nodec spaces
A topological space is called submaximal if each of its dense subsets is open and is called nodec if each of its nowhere dense ea subsets is closed. Here, we study a variety of spaces some of which have already been studied in $C(X)$. Among them are, most importantly, quasi $P$-spaces and pointwise quasi $P$-spaces. We obtain some new useful topological characterizations of quasi $...
متن کاملThe construction of wavelet sets
Sets Ω in d-dimensional Euclidean space are constructed with the property that the inverse Fourier transform of the characteristic function 1Ω of the set Ω is a single dyadic orthonormal wavelet. The iterative construction is characterized by its generality, its computational implementation, and its simplicity. The construction is transported to the case of locally compact abelian groups G with...
متن کاملAnalytic vectors in continuous p-adic representations
Given a compact p-adic Lie group G over a finite unramified extension L/Qp let GL/Qp be the product over all Galois conjugates of G. We construct an exact and faithful functor from admissible G-Banach space representations to admissible locally L-analytic GL/Qp -representations that coincides with passage to analytic vectors in case L = Qp. On the other hand, we study the functor ”passage to an...
متن کاملAn Efficient Discriminative Training Method for Generative Models
We propose an efficient discriminative training method for generative models under supervised learning. In our setting, fully observed instances are given as training examples, together with a specification of variables of interest for prediction. We formulate the training as a convex programming problem, incorporating the SVM-type large margin constraints to favor parameters under which the ma...
متن کاملEfficient Discriminative Training Method for Structured Predictions
We propose an efficient discriminative training method for generative models under supervised learning. In our setting, fully observed instances are given as training examples, together with a specification of variables of interest for prediction. We formulate the training as a convex programming problem, incorporating the SVM-type large margin constraints to favor parameters under which the ma...
متن کامل