Friedel oscillations in one-dimensional metals: From Luttinger`s theorem to the Luttinger liquid

Charge density and magnetization density profiles of one-dimensional metals are investigated by two complementary many-body methods: numerically exact (Lanczos) diagonalization, and the Bethe-Ansatz local-density approximation with and without a simple self-interaction correction. Depending on the magnetization of the system, local approximations reproduce different Fourier components of the exact Friedel oscillations. (C) 2008 Elsevier B.V. All rights reserved.

Two- and three-dimensional shape fabric analysis by the intercept method in grey levels

The count intercept is a robust method for the numerical analysis of fabrics Launeau and Robin (1996). It counts the number of intersections between a set of parallel scan lines and a mineral phase, which must be identified on a digital image. However, the method is only sensitive to boundaries and therefore supposes the user has some knowledge about their significance. The aim of this paper is to show that a proper grey level detection of boundaries along scan lines is sufficient to calculate the two-dimensional anisotropy of grain or crystal distributions without any particular image processing. Populations of grains and crystals usually display elliptical anisotropies in rocks. When confirmed by the intercept analysis, a combination of a minimum of 3 mean length intercept roses, taken on 3 more or less perpendicular sections, allows the calculation of 3-dimensional ellipsoids and the determination of their standard deviation with direction and intensity in 3 dimensions as well. The feasibility of this quick method is attested by numerous examples on theoretical objects deformed by active and passive deformation, on BSE images of synthetic magma flow, on drawing or direct analysis of thin section pictures of sandstones and on digital images of granites directly taken and measured in the field. (C) 2010 Elsevier B.V. All rights reserved.

Three-dimensional packings with rotations

We present approximation algorithms for the three-dimensional strip packing problem, and the three-dimensional bin packing problem. We consider orthogonal packings where 90 degrees rotations are allowed. The algorithms we show for these problems have asymptotic performance bounds 2.64, and 4.89, respectively. These algorithms are for the more general case in which the bounded dimensions of the bin given in the input are not necessarily equal (that is, we consider bins for which the length. the width and the height are not necessarily equal). Moreover, we show that these problems-in the general version-are as hard to approximate as the corresponding oriented version. (C) 2009 Elsevier Ltd. 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.

STABILITY ANALYSIS WITH APPLICATIONS OF A TWO-DIMENSIONAL DYNAMICAL SYSTEM ARISING FROM A STOCHASTIC MODEL FOR AN ASSET MARKET

We analyze the stability properties of equilibrium solutions and periodicity of orbits in a two-dimensional dynamical system whose orbits mimic the evolution of the price of an asset and the excess demand for that asset. The construction of the system is grounded upon a heterogeneous interacting agent model for a single risky asset market. An advantage of this construction procedure is that the resulting dynamical system becomes a macroscopic market model which mirrors the market quantities and qualities that would typically be taken into account solely at the microscopic level of modeling. The system`s parameters correspond to: (a) the proportion of speculators in a market; (b) the traders` speculative trend; (c) the degree of heterogeneity of idiosyncratic evaluations of the market agents with respect to the asset`s fundamental value; and (d) the strength of the feedback of the population excess demand on the asset price update increment. This correspondence allows us to employ our results in order to infer plausible causes for the emergence of price and demand fluctuations in a real asset market. The employment of dynamical systems for studying evolution of stochastic models of socio-economic phenomena is quite usual in the area of heterogeneous interacting agent models. However, in the vast majority of the cases present in the literature, these dynamical systems are one-dimensional. Our work is among the few in the area that construct and study analytically a two-dimensional dynamical system and apply it for explanation of socio-economic phenomena.

Perfect Simulation of a Coupling Achieving the (d)over-bar-distance Between Ordered Pairs of Binary Chains of Infinite Order

We explicitly construct a stationary coupling attaining Ornstein`s (d) over bar -distance between ordered pairs of binary chains of infinite order. Our main tool is a representation of the transition probabilities of the coupled bivariate chain of infinite order as a countable mixture of Markov transition probabilities of increasing order. Under suitable conditions on the loss of memory of the chains, this representation implies that the coupled chain can be represented as a concatenation of i.i.d. sequences of bivariate finite random strings of symbols. The perfect simulation algorithm is based on the fact that we can identify the first regeneration point to the left of the origin almost surely.

ENO adaptive method for solving one-dimensional conservation laws

In this work an efficient third order non-linear finite difference scheme for solving adaptively hyperbolic systems of one-dimensional conservation laws is developed. The method is based oil applying to the solution of the differential equation an interpolating wavelet transform at each time step, generating a multilevel representation for the solution, which is thresholded and a sparse point representation is generated. The numerical fluxes obtained by a Lax-Friedrichs flux splitting are evaluated oil the sparse grid by an essentially non-oscillatory (ENO) approximation, which chooses the locally smoothest stencil among all the possibilities for each point of the sparse grid. The time evolution of the differential operator is done on this sparse representation by a total variation diminishing (TVD) Runge-Kutta method. Four classical examples of initial value problems for the Euler equations of gas dynamics are accurately solved and their sparse solutions are analyzed with respect to the threshold parameters, confirming the efficiency of the wavelet transform as an adaptive grid generation technique. (C) 2008 IMACS. Published by Elsevier B.V. All rights reserved.

A DISCRETIZATION SCHEME FOR AN ONE-DIMENSIONAL REACTION-DIFFUSION EQUATION WITH DELAY AND ITS DYNAMICS

The goal of this paper is to present an approximation scheme for a reaction-diffusion equation with finite delay, which has been used as a model to study the evolution of a population with density distribution u, in such a way that the resulting finite dimensional ordinary differential system contains the same asymptotic dynamics as the reaction-diffusion equation.

Three-dimensional, fully adaptive simulations of phase-field fluid models

We present an efficient numerical methodology for the 31) computation of incompressible multi-phase flows described by conservative phase-field models We focus here on the case of density matched fluids with different viscosity (Model H) The numerical method employs adaptive mesh refinements (AMR) in concert with an efficient semi-implicit time discretization strategy and a linear, multi-level multigrid to relax high order stability constraints and to capture the flow`s disparate scales at optimal cost. Only five linear solvers are needed per time-step. Moreover, all the adaptive methodology is constructed from scratch to allow a systematic investigation of the key aspects of AMR in a conservative, phase-field setting. We validate the method and demonstrate its capabilities and efficacy with important examples of drop deformation, Kelvin-Helmholtz instability, and flow-induced drop coalescence (C) 2010 Elsevier Inc. All rights reserved

Twisted conjugacy classes in nilpotent groups

A group is said to have the R(infinity) property if every automorphism has an infinite number of twisted conjugacy classes. We study the question whether G has the R(infinity) property when G is a finitely generated torsion-free nilpotent group. As a consequence, we show that for every positive integer n >= 5, there is a compact nilmanifold of dimension n on which every homeomorphism is isotopic to a fixed point free homeomorphism. As a by-product, we give a purely group theoretic proof that the free group on two generators has the R(infinity) property. The R(infinity) property for virtually abelian and for C-nilpotent groups are also discussed.

EQUIVARIANT PATH FIELDS ON TOPOLOGICAL MANIFOLDS

A classical theorem of H. Hopf asserts that a closed connected smooth manifold admits a nowhere vanishing vector field if and only if its Euler characteristic is zero. R. Brown generalized Hopf`s result to topological manifolds, replacing vector fields with path fields. In this note, we give an equivariant analog of Brown`s theorem for locally smooth G-manifolds where G is a finite group.

COMMUTATIVE FINITE-DIMENSIONAL ALGEBRAS SATISFYING x(x(xy))=0 ARE NILPOTENT

We investigate the structure of commutative non-associative algebras satisfying the identity x(x(xy)) = 0. Recently, Correa and Hentzel proved that every commutative algebra satisfying above identity over a field of characteristic not equal 2 is solvable. We prove that every commutative finite-dimensional algebra u over a field F of characteristic not equal 2, 3 which satisfies the identity x(x(xy)) = 0 is nilpotent. Furthermore, we obtain new identities and properties for this class of algebras.

Iteration of closed geodesics in stationary Lorentzian manifolds

Following the lines of Bott in (Commun Pure Appl Math 9:171-206, 1956), we study the Morse index of the iterates of a closed geodesic in stationary Lorentzian manifolds, or, more generally, of a closed Lorentzian geodesic that admits a timelike periodic Jacobi field. Given one such closed geodesic gamma, we prove the existence of a locally constant integer valued map Lambda(gamma) on the unit circle with the property that the Morse index of the iterated gamma(N) is equal, up to a correction term epsilon(gamma) is an element of {0,1}, to the sum of the values of Lambda(gamma) at the N-th roots of unity. The discontinuities of Lambda(gamma) occur at a finite number of points of the unit circle, that are special eigenvalues of the linearized Poincare map of gamma. We discuss some applications of the theory.

Reaction-diffusion systems coupled at the boundary and the Morse-Smale property

We study an one-dimensional nonlinear reaction-diffusion system coupled on the boundary. Such system comes from modeling problems of temperature distribution on two bars of same length, jointed together, with different diffusion coefficients. We prove the transversality property of unstable and stable manifolds assuming all equilibrium points are hyperbolic. To this end, we write the system as an equation with noncontinuous diffusion coefficient. We then study the nonincreasing property of the number of zeros of a linearized nonautonomous equation as well as the Sturm-Liouville properties of the solutions of a linear elliptic problem. (C) 2008 Elsevier Inc. All rights reserved.

ENERGY OF GLOBAL FRAMES

The energy of a unit vector field X on a closed Riemannian manifold M is defined as the energy of the section into T(1) M determined by X. For odd-dimensional spheres, the energy functional has an infimum for each dimension 2k + 1 which is not attained by any non-singular vector field for k > 1. For k = 1, Hopf vector fields are the unique minima. In this paper we show that for any closed Riemannian manifold, the energy of a frame defined on the manifold, possibly except on a finite subset, admits a lower bound in terms of the total scalar curvature of the manifold. In particular, for odd-dimensional spheres this lower bound is attained by a family of frames defined on the sphere minus one point and consisting of vector fields parallel along geodesics.