Gravimetric study of a potential mineral deposit in the Itapororoca region, Brazil

A semi-detailed gravity survey was carried out over an area of 650 km(2) localized in the Eo-Neoproterozoic coastal zone of Paraiba State where 548 new gravity stations were added to the existing database. Gravity measurements were made with a LaCoste and Romberg model G meter with a precision of 0.04 mGal. The altitude was determined by barometric levelling with a fixed base achieving a 1.2 m measure of uncertainty, corresponding to an overall accuracy of 0.24 mGal for the Bouguer anomaly. The residual Bouguer map for a 7th degree regional polynomial showed a circumscribed negative anomaly coincident with a localized aero-magnetic anomaly and with hydro-thermally altered outcrops, near the city of Itapororoca. The 3D gravity modelling, constrained by geologic mapping was interpreted as a low density, fractured and/or altered material with a most probable volume of approximately 23 km(3), extending to about 8,500 m depth. This result is in accordance with a volcanic body associated with hydrothermal processes accompanied by surface mineralization evidence, which may be of interest to the mining industry.

Exact Search Directions for Optimization of Linear and Nonlinear Models Based on Generalized Orthonormal Functions

A novel technique for selecting the poles of orthonormal basis functions (OBF) in Volterra models of any order is presented. It is well-known that the usual large number of parameters required to describe the Volterra kernels can be significantly reduced by representing each kernel using an appropriate basis of orthonormal functions. Such a representation results in the so-called OBF Volterra model, which has a Wiener structure consisting of a linear dynamic generated by the orthonormal basis followed by a nonlinear static mapping given by the Volterra polynomial series. Aiming at optimizing the poles that fully parameterize the orthonormal bases, the exact gradients of the outputs of the orthonormal filters with respect to their poles are computed analytically by using a back-propagation-through-time technique. The expressions relative to the Kautz basis and to generalized orthonormal bases of functions (GOBF) are addressed; the ones related to the Laguerre basis follow straightforwardly as a particular case. The main innovation here is that the dynamic nature of the OBF filters is fully considered in the gradient computations. These gradients provide exact search directions for optimizing the poles of a given orthonormal basis. Such search directions can, in turn, be used as part of an optimization procedure to locate the minimum of a cost-function that takes into account the error of estimation of the system output. The Levenberg-Marquardt algorithm is adopted here as the optimization procedure. Unlike previous related work, the proposed approach relies solely on input-output data measured from the system to be modeled, i.e., no information about the Volterra kernels is required. Examples are presented to illustrate the application of this approach to the modeling of dynamic systems, including a real magnetic levitation system with nonlinear oscillatory behavior.

Cyclic Maximal Ideals of Rings of Differential Operators over Power Series Rings

In [3], Bratti and Takagi conjectured that a first order differential operator S=11 +...+ nn+ with 1,..., n, {x1,..., xn} does not generate a cyclic maximal left (or right) ideal of the ring of differential operators. This is contrary to the case of the Weyl algebra, i.e., the ring of differential operators over the polynomial ring [x1,..., xn]. In this case, we know that such cyclic maximal ideals do exist. In this article, we prove several special cases of the conjecture of Bratti and Takagi.

Invariant theory and reversible-equivariant vector fields

In this paper we present results for the systematic study of reversible-equivariant vector fields - namely, in the simultaneous presence of symmetries and reversing symmetries - by employing algebraic techniques from invariant theory for compact Lie groups. The Hilbert-Poincare series and their associated Molien formulae are introduced,and we prove the character formulae for the computation of dimensions of spaces of homogeneous anti-invariant polynomial functions and reversible-equivariant polynomial mappings. A symbolic algorithm is obtained for the computation of generators for the module of reversible-equivariant polynomial mappings over the ring of invariant polynomials. We show that this computation can be obtained directly from a well-known situation, namely from the generators of the ring of invariants and the module of the equivariants. (C) 2008 Elsevier B.V, All rights reserved.

Twofold adaptive partition of unity implicits

Partition of Unity Implicits (PUI) has been recently introduced for surface reconstruction from point clouds. In this work, we propose a PUI method that employs a set of well-observed solutions in order to produce geometrically pleasant results without requiring time consuming or mathematically overloaded computations. One feature of our technique is the use of multivariate orthogonal polynomials in the least-squares approximation, which allows the recursive refinement of the local fittings in terms of the degree of the polynomial. However, since the use of high-order approximations based only on the number of available points is not reliable, we introduce the concept of coverage domain. In addition, the method relies on the use of an algebraically defined triangulation to handle two important tasks in PUI: the spatial decomposition and an adaptive polygonization. As the spatial subdivision is based on tetrahedra, the generated mesh may present poorly-shaped triangles that are improved in this work by means a specific vertex displacement technique. Furthermore, we also address sharp features and raw data treatment. A further contribution is based on the PUI locality property that leads to an intuitive scheme for improving or repairing the surface by means of editing local functions.

Conformal deformation of equilibrium measures in normal random ensembles

We investigate the eigenvalue statistics of ensembles of normal random matrices when their order N tends to infinite. In the model, the eigenvalues have uniform density within a region determined by a simple analytic polynomial curve. We study the conformal deformations of equilibrium measures of normal random ensembles to the real line and give sufficient conditions for it to weakly converge to a Wigner measure.

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

Let M = (V, E, A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C = {C(1), ... , C(k)} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is Sigma(k)(i=1) vertical bar C(i)vertical bar. The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small as possible. The Chinese postman problem is: given a strongly connected mixed graph M, find a minimum length closed walk using all edges and arcs of M. These problems are NP-hard. We show that they can be solved in polynomial time if M has bounded tree-width. (C) 2008 Elsevier B.V. All rights reserved.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

Packing triangles in low degree graphs and indifference graphs

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

Skew-symmetric identities of octonions

Quadratic alternative superalgebras are introduced and their super-identities and central functions on one odd generator are described. As a corollary, all multilinear skew-symmetric identities and central polynomials of octonions are classified. (C) 2008 Elsevier B.V. All rights reserved.

Examples of Self-Iterating Lie Algebras, 2

We study properties of self-iterating Lie algebras in positive characteristic. Let R = K[t(i)vertical bar i is an element of N]/(t(i)(p)vertical bar i is an element of N) be the truncated polynomial ring. Let partial derivative(i) = partial derivative/partial derivative t(i), i is an element of N, denote the respective derivations. Consider the operators v(1) = partial derivative(1) + t(0)(partial derivative(2) + t(1)(partial derivative(3) + t(2)(partial derivative(4) + t(3)(partial derivative(5) + t(4)(partial derivative(6) + ...))))); v(2) = partial derivative(2) + t(1)(partial derivative(3) + t(2)(partial derivative(4) + t(3)(partial derivative(5) + t(4)(partial derivative(6) + ...)))). Let L = Lie(p)(v(1), v(2)) subset of Der R be the restricted Lie algebra generated by these derivations. We establish the following properties of this algebra in case p = 2, 3. a) L has a polynomial growth with Gelfand-Kirillov dimension lnp/ln((1+root 5)/2). b) the associative envelope A = Alg(v(1), v(2)) of L has Gelfand-Kirillov dimension 2 lnp/ln((1+root 5)/2). c) L has a nil-p-mapping. d) L, A and the augmentation ideal of the restricted enveloping algebra u = u(0)(L) are direct sums of two locally nilpotent subalgebras. The question whether u is a nil-algebra remains open. e) the restricted enveloping algebra u(L) is of intermediate growth. These properties resemble those of Grigorchuk and Gupta-Sidki groups.

Lie properties of crossed products

Let F-sigma(lambda)vertical bar G vertical bar be a crossed product of a group G and the field F. We study the Lie properties of F-sigma(lambda)vertical bar G vertical bar in order to obtain a characterization of those crossed products which are upper (lower) Lie nilpotent and Lie (n, m)-Engel. (C) 2008 Elsevier Inc. All rights reserved.

Extensions of homogeneous polynomials ON c(0)(l(2)(i))

We show that a 2-homogeneous polynomial on the complex Banach space c(0)(l(2)(i)) is norm attaining if and only if it is finite (i.e, depends only on finite coordinates). As the consequence, we show that there exists a unique norm-preserving extension for norm-attaining 2-homogeneous polynomials on c(0)(l(2)(i)).

Nuclear elements of degree 6 in the free alternative algebra

We construct five new elements of degree 6 in the nucleus of the free alternative algebra. We use the representation theory of the symmetric group to locate the elements. We use the computer algebra system ALBERT and an extension of ALBERT to express the elements in compact form and to show that these new elements are not a consequence of the known clegree-5 elements in the nucleus. We prove that these five new elements and four known elements form a basis for the subspace of nuclear elements of degree 6. Our calculations are done using modular arithmetic to save memory and time. The calculations can be done in characteristic zero or any prime greater than 6, and similar results are expected. We generated the nuclear elements using prime 103. We check our answer using five other primes.

Finite-dimensional non-associative algebras and codimension growth

Let A be a (non-necessarily associative) finite-dimensional algebra over a field of characteristic zero. A quantitative estimate of the polynomial identities satisfied by A is achieved through the study of the asymptotics of the sequence of codimensions of A. It is well known that for such an algebra this sequence is exponentially bounded. Here we capture the exponential rate of growth of the sequence of codimensions for several classes of algebras including simple algebras with a special non-degenerate form, finite-dimensional Jordan or alternative algebras and many more. In all cases such rate of growth is integer and is explicitly related to the dimension of a subalgebra of A. One of the main tools of independent interest is the construction in the free non-associative algebra of multialternating polynomials satisfying special properties. (C) 2010 Elsevier Inc. All rights reserved.