The lambda-dimension of commutative arithmetic rings

It is shown that every commutative arithmetic ring $R$ has $lambda$-dimension $leq 3$. An example of a commutative Kaplansky ring with $lambda$-dimension 3 is given. If $R$ satisfies an additional condition then $lambda$-dim($R$

Vortex motion around a circular cylinder

The motion of a pair of counter-rotating point vortices placed in a uniform flow around a circular cylinder forms a rich nonlinear system that is often used to model vortex shedding. The phase portrait of the Hamiltonian governing the dynamics of a vortex pair that moves symmetrically with respect to the centerline---a case that can be realized experimentally by placing a splitter plate in the center plane---is presented. The analysis provides new insights and reveals novel dynamical features of the system, such as a nilpotent saddle point at infinity whose homoclinic orbits define the region of nonlinear stability of the so-called F\"oppl equilibrium. It is pointed out that a vortex pair properly placed downstream can overcome the cylinder and move off to infinity upstream. In addition, the nonlinear dynamics resulting from antisymmetric perturbations of the F\"oppl equilibrium is studied and its relevance to vortex shedding discussed.Comment: 21 pages, 6 figure

Long time not been seen...

info:eu-repo/semantics/publishedVersio

Four-vortex motion around a circular cylinder

The motion of two pairs of counter-rotating point vortices placed in a uniform flow past a circular cylinder is studied analytically and numerically. When the dynamics is restricted to the symmetric subspace---a case that can be realized experimentally by placing a splitter plate in the center plane---, it is found that there is a family of linearly stable equilibria for same-signed vortex pairs. The nonlinear dynamics in the symmetric subspace is investigated and several types of orbits are presented. The analysis reported here provides new insights and reveals novel features of this four-vortex system, such as the fact that there is no equilibrium for two pairs of vortices of opposite signs on the opposite sides of the cylinder. (It is argued that such equilibria might exist for vortex flows past a cylinder confined in a channel.) In addition, a new family of opposite-signed equilibria on the normal line is reported. The stability analysis for antisymmetric perturbations is also carried out and it shows that all equilibria are unstable in this case.Comment: 27 pages, 13 figures, to be published in Physics of Fluid

Deterministically Computing Reduction Numbers of Polynomial Ideals

We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation in a polynomial ring with (n-dim(I))dim(I) parameters and n-dim(I) variables. The second one computes via a Grobner system the set of all reduction numbers of the ideal I and thus in particular also its big reduction number. However,it requires computations in a ring with n.dim(I) parameters and n variables.Comment: This new version replaces the earlier version arXiv:1404.1721 and it has been accepted for publication in the proceedings of CASC 2014, Warsaw, Polna

Protocol-based verification of message-passing parallel programs

© 2015 ACM.We present ParTypes, a type-based methodology for the verification of Message Passing Interface (MPI) programs written in the C programming language. The aim is to statically verify programs against protocol specifications, enforcing properties such as fidelity and absence of deadlocks. We develop a protocol language based on a dependent type system for message-passing parallel programs, which includes various communication operators, such as point-to-point messages, broadcast, reduce, array scatter and gather. For the verification of a program against a given protocol, the protocol is first translated into a representation read by VCC, a software verifier for C. We successfully verified several MPI programs in a running time that is independent of the number of processes or other input parameters. This contrasts with alternative techniques, notably model checking and runtime verification, that suffer from the state-explosion problem or that otherwise depend on parameters to the program itself. We experimentally evaluated our approach against state-of-the-art tools for MPI to conclude that our approach offers a scalable solution