On the \lq \lq Galois closure\rq \rq for torsors
نویسندگان
چکیده
منابع مشابه
On the “galois Closure” for Torsors
We show that a tower of torsors under affine group schemes can be dominated by a torsor. Moreover, if the base is the spectrum of a field and the structure group schemes are finite, the tower can be dominated by a finite torsor. As an application, we show that if X is a torsor under a finite group scheme G over a scheme S which has a fundamental group scheme, then X has a fundamental group sche...
متن کامل5hgxqgdqf\ Lq %orfn &rghg 0rgxodwlrqv Iru &kdqqho (txdol]dwlrq %dvhg Rq 6sdwldo Dqg 7hpsrudo 'lyhuvlw\
$%675$&7 Linear block codes in the complex field can be applied in spatial and/or temporal diversity receivers in order to develop high performance schemes for (almost-) blind equalization in mobile communications. The proposed technique uses the structure of the encoded transmitted information (with redundancy) to achieve equalization schemes based on a deterministic criterion. Simulations sho...
متن کاملShulphqw Rq Wkh + \ Srwkhvlv Ri , Qyroxqwdu \ 7 Uxwk 6 Ljqdoolqj Lq % Dujdlqlqj
The paper examines face-to-face interaction in a simple two-person bargaining game with incomplete information about the division of a fixed sum of money in which each bargainer can either have costs to be subtracted from her bargaining agreement payoff or not. The bargaining events are observed by onlookers who make guesses of the cost situations of the participants. The work of Gauthier (1978...
متن کاملLq Matrix Completion
Rank minimization problems, which consist of finding a matrix of minimum rank subject to linear constraints, have been proposed in many areas of engineering and science. A specific problem is the matrix completion problem in which a low rank data matrix is recovered from incomplete samples of its entries by solving a rank penalized least squares problem. The rank penalty is in fact the l0 norm ...
متن کاملOn the l1-lq Regularized Regression
In this paper we consider the problem of grouped variable selection in high-dimensional regression using `1-`q regularization (1 ≤ q ≤ ∞), which can be viewed as a natural generalization of the `1-`2 regularization (the group Lasso). The key condition is that the dimensionality pn can increase much faster than the sample size n, i.e. pn À n (in our case pn is the number of groups), but the numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2009
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-09-09997-3