Integrable open boundary conditions for the Bariev model of three coupled X Y spin chains

The integrable open-boundary conditions for the Bariev model of three coupled one-dimensional XY spin chains are studied in the framework of the boundary quantum inverse scattering method. Three kinds of diagonal boundary K-matrices leading to nine classes of possible choices of boundary fields are found and the corresponding integrable boundary terms are presented explicitly. The boundary Hamiltonian is solved by using the coordinate Bethe ansatz technique and the Bethe ansatz equations are derived. (C) 2001 Elsevier Science B.V. All rights reserved.

Integrable variant of the one-dimensional Hubbard model

A new integrable model which is a variant of the one-dimensional Hubbard model is proposed. The integrability of the model is verified by presenting the associated quantum R-matrix which satisfies the Yang-Baxter equation. We argue that the new model possesses the SO(4) algebra symmetry, which contains a representation of the eta-pairing SU(2) algebra and a spin SU(2) algebra. Additionally, the algebraic Bethe ansatz is studied by means of the quantum inverse scattering method. The spectrum of the Hamiltonian, eigenvectors, as well as the Bethe ansatz equations, are discussed. (C) 2002 American Institute of Physics.

R-matrices and the tensor product graph method

A systematic method for constructing trigonometric R-matrices corresponding to the (multiplicity-free) tensor product of any two affinizable representations of a quantum algebra or superalgebra has been developed by the Brisbane group and its collaborators. This method has been referred to as the Tensor Product Graph Method. Here we describe applications of this method to untwisted and twisted quantum affine superalgebras.

Integrable generalized spin ladder models based on the SU(1|3) and SU(3|1) algebras

We present two integrable spin ladder models which possess a general free parameter besides the rung coupling J. The models are exactly solvable by means of the Bethe ansatz method and we present the Bethe ansatz equations. We analyze the elementary excitations of the models which reveal the existence of a gap for both models that depends on the free parameter. (C) 2003 American Institute of Physics.

Bases de Gröbner e geração de exercícios matemáticos com estrutura não determinada

Definido um enredo concreto, há, frequentemente, uma grande quantidade e variedade de exercícios que sobre ele podemos escrever. Neste artigo, apresenta-se um algoritmo que permite automatizar este processo. Para gerar exercícios matemáticos, parte-se das relações entre as variáveis presentes no enredo, calcula-se os possíveis exercícios, analisa-se a complexidade do seu processo de resolução e a sua viabilidade. O algoritmo recorre a bases de Gröbner para determinar se o exercício é resolúvel e um possível caminho de resolução. Com base na análise dos resultados obtidos, torna-se possível criar uma base de exercícios ligada a esse enredo.

O uso dos meios tecnológicos no ensino da trompa

Relatório de estágio de mestrado em Ensino de Música

Polynomial-time complexity for instances of the endomorphism problem in free groups

We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U. This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two- generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U. This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side.

The simultaneous conjugacy problem in groups of piecewise linear functions

Guba and Sapir asked, in their joint paper [8], if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give an elementary proof for the solution of the latter question. This relies purely on the description of F as the group of piecewise linear orientation-preserving homeomorphisms of the unit. The techniques we develop allow us also to solve the ordinary conjugacy problem as well, and we can compute roots and centralizers. Moreover, these techniques can be generalized to solve the same questions in larger groups of piecewise-linear homeomorphisms.

Gestor d'entorns virtuals per a l'execució de tasques d'altes prestacions

Amb l'evolució de la tecnologia les capacitats de còmput es van incrementant i problemes irresolubles del passat deixen de ser-ho amb els recursos actuals. La majoria d'aplicacions que s'enfronten a aquests problemes són complexes, ja que per aconseguir taxes elevades de rendiment es fa necessari utilitzar el major nombre de recursos possibles, i això les dota d'una arquitectura inherentment distribuïda. Seguint la tendència de la comunitat investigadora, en aquest treball de recerca es proposa una arquitectura per a entorns grids basada en la virtualització de recursos que possibilita la gestió eficient d'aquests recursos. L'experimentació duta a terme ha permès comprovar la viabilitat d'aquesta arquitectura i la millora en la gestió que la utilització de màquines virtuals proporciona.

Consistency and optimality

Assume that the problem Qo is not solvable in polynomial time. For theories T containing a sufficiently rich part of true arithmetic we characterize T U {ConT} as the minimal extension of T proving for some algorithm that it decides Qo as fast as any algorithm B with the property that T proves that B decides Qo. Here, ConT claims the consistency of T. Moreover, we characterize problems with an optimal algorithm in terms of arithmetical theories.

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Consistency and population sensitivity properties in marriage and Rrommate markets

We consider one-to-one matching markets in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. Klaus (Games Econ Behav 72:172-186, 2011) introduced two new "population sensitivity" properties that capture the effect newcomers have on incumbent agents: competition sensitivity and resource sensitivity. On various roommate market domains (marriage markets, no-odd-rings roommate markets, solvable roommate markets),we characterize the core using either of the population sensitivity properties in addition to weak unanimity and consistency. On the domain of all roommate markets, we obtain two associated impossibility results.

Issue of time in generally covariant theories and the Komar-Bergmann approach to observables in general relativity

Diffeomorphism-induced symmetry transformations and time evolution are distinct operations in generally covariant theories formulated in phase space. Time is not frozen. Diffeomorphism invariants are consequently not necessarily constants of the motion. Time-dependent invariants arise through the choice of an intrinsic time, or equivalently through the imposition of time-dependent gauge fixation conditions. One example of such a time-dependent gauge fixing is the Komar-Bergmann use of Weyl curvature scalars in general relativity. An analogous gauge fixing is also imposed for the relativistic free particle and the resulting complete set time-dependent invariants for this exactly solvable model are displayed. In contrast with the free particle case, we show that gauge invariants that are simultaneously constants of motion cannot exist in general relativity. They vary with intrinsic time.

Noise-induced scenario for inverted phase diagrams

We introduce a class of exactly solvable models exhibiting an ordering noise-induced phase transition in which order arises as a result of a balance between the relaxing deterministic dynamics and the randomizing character of the fluctuations. A finite-size scaling analysis of the phase transition reveals that it belongs to the universality class of the equilibrium Ising model. All these results are analyzed in the light of the nonequilibrium probability distribution of the system, which can be obtained analytically. Our results could constitute a possible scenario of inverted phase diagrams in the so-called lower critical solution temperature transitions.

Disordered backgammon model

In this paper we consider an exactly solvable model that displays glassy behavior at zero temperature due to entropic barriers. The new ingredient of the model is the existence of different energy scales or modes associated with different relaxational time scales. Low-temperature relaxation takes place by partial equilibration of successive lower-energy modes. An adiabatic scaling solution, defined in terms of a threshold energy scale e*, is proposed. For such a solution, modes with energy ee* are equilibrated at the bath temperature, modes with ee* remain out of equilibrium, and relaxation occurs in the neighborhood of the threshold e~e*. The model is presented as a toy example to investigate the conditions related to the existence of an effective temperature in glassy systems and its possible dependence on the energy sector is probed by the corresponding observable.