No abstract uploaded!

No abstract uploaded!

We derive an asymptotic formula which counts the number of abelian extensions of prime degrees over rational function fields. Specifically, let l be a rational prime and K a rational function field F_q(t) with l\nmid q. Let Discf (F/K) denote the finite discriminant of F over K. Denote the number of abelian l-extensions F/K with deg (Discf (F/K)) = (l − 1)αn by a_l(n), where α = α(q, l) is the order of q in the multiplicative group (Z/lZ)^\times. We give a explicit asymptotic formula for a_l(n). In the case of cubic extensions with q ≡ 2 (mod 3), our formula gives an exact analogue of Cohn’s classical formula.

No abstract uploaded!

We propose an efficient threshold dynamics method for topology optimization for fluids modeled with the Stokes equation. The proposed algorithm is based on minimization of an objective energy function that consists of the dissipation power in the fluid and the perimeter approximated by nonlocal energy, subject to a fluid volume constraint and the incompressibility condition. We show that the minimization problem can be solved with an iterative scheme in which the Stokes equation is approximated by a Brinkman equation. The indicator functions of the fluid-solid regions are then updated according to simple convolutions followed by a thresholding step. We demonstrate mathematically that the iterative algorithm has the total energy decaying property. The proposed algorithm is simple and easy to implement. A simple adaptive time strategy is also used to accelerate the convergence of the iteration. Extensive numerical experiments in both two and three dimensions show that the proposed iteration algorithm is quite robust and converges in much fewer iterations and is more efficient than many existing methods.