Smart Search
Cari koleksi dengan cepat sesuai kebutuhan Anda.We show that it is impossible to algorithmically decide if the l2-cohomology of the universal cover of a finite CW-complex is trivial, even if we only consider complexes whose fundamental group is equal to the elementary amenable group (Z2 Z)3. A corollary of the proof is that there is no algorithm which decides if an element of the integral group ring of the group (Z2 Z)4 is a zero-divisor. …
Let F be an n-point set in Kd with K ∈ {R, Z} and d >= 2. A (discrete) X-ray of F in direction s gives the number of points of F on each line parallel to s. We define ψKd (m) as the minimum number n for which there exist m directions s1, . . . , sm (pairwise linearly independent and spanning Rd) such that two n-point sets in Kd exist that have the same X-rays in these directions. Th…
Results are obtained for two minimization problems: Ik(c) = inf{λk(Ω) : Ω open, convex in Rm, T (Ω) = c} and Jk(c) = inf{λk(Ω) : Ω quasi-open in Rm, |Ω| <= 1, P(Ω) <= c}, where c > 0, λk(Ω) is the kth eigenvalue of the Dirichlet Laplacian acting in L2(Ω), |Ω| denotes the Lebesgue measure of Ω, P(Ω) denotes the perime…
We produce new explicit examples of genus-2 curves over the rational numbers whose Jacobian varieties have rational torsion points of large order. In particular, we produce a family of genus-2 curves over Q whose Jacobians have a rational point of order 48, parameterized by a rank-2 elliptic curve over Q, and we exhibit a single genus-2 curve over Q whose Jacobian has a rational point of order …
Proteins are biomolecules responsible for a vast range of functions within living cells and tissues. Over 150 different proteins are present in the fluid of the oviduct, where mammalian oocytes are fertilized and zygotes start to develop. Although fertilization can be achieved in vitro without any contributions from the oviduct or oviductal proteins, some of these proteins play crucial or yet u…
It is proved that N k,=1 gcd√(nk, n) nkn N exp C logN log log logN log logN holds for arbitrary integers 1 <= n1 < · · · < nN. This bound is essentially better than that found in a recent paper of Aistleitner, Berkes, and Seip and can be improved by no more than removal of the triple logarithm. A certain completeness property of extremal sets of square-free numb…