On the Barnes double zeta and Gamma functions

We present a complete description of the analytic properties of the Barnes double zeta and Gamma functions. (C) 2009 Elsevier Inc. All rights reserved.

Foliations and polynomial diffeomorphisms of R(3)

Let Y = (f, g, h): R(3) -> R(3) be a C(2) map and let Spec(Y) denote the set of eigenvalues of the derivative DY(p), when p varies in R(3). We begin proving that if, for some epsilon > 0, Spec(Y) boolean AND (-epsilon, epsilon) = empty set, then the foliation F(k), with k is an element of {f, g, h}, made up by the level surfaces {k = constant}, consists just of planes. As a consequence, we prove a bijectivity result related to the three-dimensional case of Jelonek`s Jacobian Conjecture for polynomial maps of R(n).

Phase portraits of quadratic polynomial vector fields having a rational first integral of degree 3

In this paper, we classify all the global phase portraits of the quadratic polynomial vector fields having a rational first integral of degree 3. (C) 2008 Elsevier Ltd. All rights reserved.

THE IMPLICIT FUNCTION THEOREM FOR CONTINUOUS FUNCTIONS

In the present paper we obtain a new homological version of the implicit function theorem and some versions of the Darboux theorem. Such results are proved for continuous maps on topological manifolds. As a consequence. some versions of these classic theorems are proved when we consider differenciable (not necessarily C-1) maps.

The univalent polynomial of Suffridge as a summability kernel

A positive summability trigonometric kernel {K(n)(theta)}(infinity)(n=1) is generated through a sequence of univalent polynomials constructed by Suffridge. We prove that the convolution {K(n) * f} approximates every continuous 2 pi-periodic function f with the rate omega(f, 1/n), where omega(f, delta) denotes the modulus of continuity, and this provides a new proof of the classical Jackson`s theorem. Despite that it turns out that K(n)(theta) coincide with positive cosine polynomials generated by Fejer, our proof differs from others known in the literature.

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.

Reaction functions for weakly bound systems

We propose a new technique to analyze total reaction cross sections. In this technique, which has been previously applied to fusion reactions, the experimental data are used to build a dimensionless reaction function, which does not depend oil the system size or details of the optical potential. In this way, total reaction cross sections for different systems can be directly compared. We employ this technique to perform a systematic study of reaction cross sections of weakly bound systems in different mass ranges, and compare their reaction functions with the ones of tightly bound systems with similar masses. We show that breakup reactions and neutron transfers in halo systems lead to large reaction functions, well above the ones of typical tightly or weakly bound stable systems. (C) 2009 Elsevier B.V. All rights reserved.

Dependence of Response Functions and Orbital Functionals on Occupation Numbers

Explicitly orbital-dependent approximations to the exchange-correlation energy functional of density functional theory typically not only depend on the single-particle Kohn-Sham orbitals but also on their occupation numbers in the ground-state Slater determinant. The variational calculation of the corresponding exchange-correlation potentials with the optimized effective potential (OEP) method therefore also requires a variation of the occupation numbers with respect to a variation in the effective single-particle potential, which is usually not taken into account. Here it is shown under which circumstances this procedure is justified.

The defensive functions of plant inhibitors are not restricted to insect enzyme inhibition

Three plant proteinase inhibitors BbKI (kallikrein inhibitor) and BbCI (cruzipain inhibitor) from Bauhinia bouhinioides, and a BrTI (trypsin inhibitor) from B. rufa, were examined for other effects in Callosobruchus maculatus development; of these only BrTI affected bruchid emergence. BrTI and BbKI share 81% identities in their primary sequences and the major differences between them are the regions comprising the RGD and RGE motifs in BrTI. These sequences were shown to be essential for BrTI insecticidal activity, since a modified BbKI [that is a recombinant form (BbKIm) with some amino acid residues replaced by those found in BrTI sequence] also strongly inhibited insect development. By using synthetic peptides related to the BrTI sequence, YLEAPVARGDGGLA-NH(2) (RGE) and IVYYPDRGETGL-NH(2) (RGE), it was found that the peptide with an RGE sequence was able to block normal development of C. maculatus larvae (ED(50) 0.16% and LD(50) 0.09%), this being even more effective than the native protein. (C) 2009 Elsevier Ltd. All rights reserved.

A note on a practical relationship between filter coefficients and scaling and wavelet functions of Discrete Wavelet Transforms

In this paper, the relationship between the filter coefficients and the scaling and wavelet functions of the Discrete Wavelet Transform is presented and exemplified from a practical point-of-view. The explanations complement the wavelet theory, that is well documented in the literature, being important for researchers who work with this tool for time-frequency analysis. (c) 2011 Elsevier Ltd. All rights reserved.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

On the Hamilton-Jacobi equation in the framework of generalized functions

In this work we study, in the framework of Colombeau`s generalized functions, the Hamilton-Jacobi equation with a given initial condition. We have obtained theorems on existence of solutions and in some cases uniqueness. Our technique is adapted from the classical method of characteristics with a wide use of generalized functions. We were led also to obtain some general results on invertibility and also on ordinary differential equations of such generalized functions. (C) 2011 Elsevier Inc. All rights reserved.

An application of lattice basis reduction to polynomial identities for algebraic structures

The authors` recent classification of trilinear operations includes, among other cases, a fourth family of operations with parameter q epsilon Q boolean OR {infinity}, and weakly commutative and weakly anticommutative operations. These operations satisfy polynomial identities in degree 3 and further identities in degree 5. For each operation, using the row canonical form of the expansion matrix E to find the identities in degree 5 gives extremely complicated results. We use lattice basis reduction to simplify these identities: we compute the Hermite normal form H of E(t), obtain a basis of the nullspace lattice from the last rows of a matrix U for which UE(t) = H, and then use the LLL algorithm to reduce the basis. (C) 2008 Elsevier Inc. All rights reserved.

A NOTE ON FREE GROUPS IN THE RING OF FRACTIONS OF SKEW POLYNOMIAL RINGS

Let L be a function field over the rationals and let D denote the skew field of fractions of L[t; sigma], the skew polynomial ring in t, over L, with automorphism sigma. We prove that the multiplicative group D(x) of D contains a free noncyclic subgroup.

Polynomial identities for the ternary cyclic sum

We simplify the results of Bremner and Hentzel [J. Algebra 231 (2000) 387-405] on polynomial identities of degree 9 in two variables satisfied by the ternary cyclic sum [a, b, c] abc + bca + cab in every totally associative ternary algebra. We also obtain new identities of degree 9 in three variables which do not follow from the identities in two variables. Our results depend on (i) the LLL algorithm for lattice basis reduction, and (ii) linearization operators in the group algebra of the symmetric group which permit efficient computation of the representation matrices for a non-linear identity. Our computational methods can be applied to polynomial identities for other algebraic structures.