Let$X$and$Y$be smooth varieties of dimensions$n$−1 and$n$over an arbitrary algebraically closed field,$f: X→Y$a finite map that is birational onto its image. Suppose that$f$is curvilinear; that is, for all$xεX$, the Jacobian ϱ$f(x)$has rank at least$n$−2. For$r$≥1, consider the subscheme$N$_{$r$}of$Y$defined by the ($r$−1)th Fitting ideal of the $$\mathcal{O}_Y $$ -module $$f_ * \mathcal{O}_X $$ , and set$M$_{$r$}∶=$f$^{−1}$N$_{$r$}. In this setting—in fact, in a more general setting—we prove the following statements, which show that$M$_{$r$}and$N$_{$r$}behave like reasonable schemes of source and target$r$-fold points of$f$.

No abstract uploaded!

No abstract uploaded!

In this paper, we consider the L p dual Minkowski problem by geometric variational method. Using anisotropic Gauss–Kronecker curvature flows, we establish the existence of smooth solutions of the L p dual Minkowski problem when pq ≥ 0 and the given data is even. If f ≡ 1, we show under some restrictions on p and q that the only even, smooth, uniformly convex solution is the unit ball.

Gaseous fluids may move slowly, as smoke does, or at high speed, such as occurs with explosions. High-speed gas flow is always accompanied by low-speed gas flow, which produces rich visual details in the fluid motion. Realistic visualization involves a complex dynamic flow field with both low and high speed fluid behavior. In computer graphics, algorithms to simulate gaseous fluids address either the low speed case or the high speed case, but no algorithm handles both efficiently. With the aim of providing visually pleasing results, we present a hybrid algorithm that efficiently captures the essential physics of both low- and high-speed gaseous fluids. We model the low speed gaseous fluids by a grid approach and use a particle approach for the high speed gaseous fluids. In addition, we propose a physically sound method to connect the particle model to the grid model. By exploiting complementary strengths and avoiding weaknesses of the grid and particle approaches, we produce some animation examples and analyze their computational performance to demonstrate the effectiveness of the new hybrid method.