Results 1  10
of
707,628
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 507 (2 self)
 Add to MetaCart
; for abelian varieties. This result was first proved independently in char. o by Grothendieck, using methods of etale cohomology (private correspondence with J. Tate), and by Mumford, applying the easy half of Theorem (2.5), to go from curves to abelian varieties (cf. [M2]). Grothendieck has recently
Nonlinear Image Recovery with HalfQuadratic Regularization
, 1993
"... One popular method for the recovery of an ideal intensity image from corrupted or indirect measurements is regularization: minimize an objective function which enforces a roughness penalty in addition to coherence with the data. Linear estimates are relatively easy to compute but generally introduce ..."
Abstract

Cited by 209 (0 self)
 Add to MetaCart
One popular method for the recovery of an ideal intensity image from corrupted or indirect measurements is regularization: minimize an objective function which enforces a roughness penalty in addition to coherence with the data. Linear estimates are relatively easy to compute but generally
Half
"... The transition towards renewable energies: physical limits and temporal conditions ..."
Abstract
 Add to MetaCart
The transition towards renewable energies: physical limits and temporal conditions
EasyConnect:
, 2006
"... The contents of this report reflect the views of the authors who are responsible for the facts and the accuracy of the data presented herein. The contents do not necessarily reflect the official views or policies of the State of California. This report does not constitute a standard, specification, ..."
Abstract
 Add to MetaCart
The contents of this report reflect the views of the authors who are responsible for the facts and the accuracy of the data presented herein. The contents do not necessarily reflect the official views or policies of the State of California. This report does not constitute a standard, specification, or regulation. ISSN 10551417
Counting Is Easy
, 1988
"... For any fixed k, a remarkably simple singletape Turing machine can simulate k independent counters in real time. ..."
Abstract
 Add to MetaCart
For any fixed k, a remarkably simple singletape Turing machine can simulate k independent counters in real time.
The HalfHalf Problem
, 1999
"... Consider the minimum number f(m, n) of zeroes in a 2m×2n (0, 1)matrix M that contains no m×n submatrix of ones. This special case of the wellknown Zarankiewicz problem was studied by Griggs and Ouyang, who showed, for m ≤ n, that 2n+m+1 ≤ f(m, n) ≤ 2n + 2m − gcd(m, n) + 1. The lower bound is shar ..."
Abstract
 Add to MetaCart
Consider the minimum number f(m, n) of zeroes in a 2m×2n (0, 1)matrix M that contains no m×n submatrix of ones. This special case of the wellknown Zarankiewicz problem was studied by Griggs and Ouyang, who showed, for m ≤ n, that 2n+m+1 ≤ f(m, n) ≤ 2n + 2m − gcd(m, n) + 1. The lower bound is sharp when m is fixed for all large n. They proposed determining limm→∞{f(m, m + 1)/m}. In this paper, we show that this limit is 3. Indeed, we determine the actual value of f(m, km + 1) for all k, m. For general m, n, we derive a new upper bound on f(m, n). We also give the actual value of f(m, n) for all m ≤ 7 and n ≤ 20.
On The HalfHalf Case of the . . .
, 1998
"... Consider the minimum number f(m, n) of zeroes in a 2m2n (0, 1)matrix M that contains no mn submatrix of ones. This special case of the wellknown Zarankiewicz problem was studied by Griggs and Ouyang, who showed, for m # n, that 2n+m+1 # f(m, n) # 2n + 2m  gcd(m, n) + 1. The lower bound is ..."
Abstract
 Add to MetaCart
Consider the minimum number f(m, n) of zeroes in a 2m2n (0, 1)matrix M that contains no mn submatrix of ones. This special case of the wellknown Zarankiewicz problem was studied by Griggs and Ouyang, who showed, for m # n, that 2n+m+1 # f(m, n) # 2n + 2m  gcd(m, n) + 1. The lower bound is sharp when m is fixed for all large n. They proposed determining lim m## {f(m, m + 1)/m}. In this paper, we show that this limit is 3. Indeed, we determine the actual value of f(m, km + 1) for all k, m. For general m, n, we derive a new upper bound on f(m, n). We also give the actual value of f(m, n) for all m # 7 and n # 20.
Half Full or Half Empty?
, 2000
"... SchleswigHolstein. ECMI was established in Flensburg, at the heart of the DanishGerman border region, in order to draw from the encouraging example of peaceful coexistence between minorities and majorities achieved here. ECMI’s aim is to promote interdisciplinary research on issues related to mino ..."
Abstract
 Add to MetaCart
SchleswigHolstein. ECMI was established in Flensburg, at the heart of the DanishGerman border region, in order to draw from the encouraging example of peaceful coexistence between minorities and majorities achieved here. ECMI’s aim is to promote interdisciplinary research on issues related to minorities and majorities in a European perspective and to contribute to the improvement of interethnic relations in those parts of Western and Eastern Europe where ethnopolitical tension and conflict prevail. ECMI Working Papers are written either by the staff of ECMI or by
Results 1  10
of
707,628