Search results for "Lattice"
showing 10 items of 3278 documents
Λb and Λc baryon decays at finite values of heavy quark masses
2000
Semileptonic decays of Lambda_b and Lambda_c baryons are studied within the Relativistic Three-Quark Model using finite heavy quark mass values. Employing the same parameters as have been used previously for the description of exclusive decays of heavy baryons in the heavy quark limit we calculate the six form factors of the process and the corresponding decay rates. Our calculation shows that the ``finite mass'' corrections are important in heavy-to-light transitions and are not negligible in heavy-to-heavy transitions.
Equations-of-motion approach to the spin-12Ising model on the Bethe lattice
2006
We exactly solve the ferromagnetic spin- 1/2 Ising model on the Bethe lattice in the presence of an external magnetic field by means of the equations of motion method within the Green's function formalism. In particular, such an approach is applied to an isomorphic model of localized Fermi particles interacting via an intersite Coulomb interaction. A complete set of eigenoperators is found together with the corresponding eigenvalues. The Green's functions and the correlation functions are written in terms of a finite set of parameters to be self-consistently determined. A procedure is developed that allows us to exactly fix the unknown parameters in the case of a Bethe lattice with any coor…
A distance metric on binary trees using lattice-theoretic measures
1990
A so called height function which is a strictly antitone supervaluation is defined on binary trees. Via lattice-theoretic results and using the height function, we can define a distance metric on binary trees of size n which can be computed in expected time O(n 3/2 )
An efficient upper bound of the rotation distance of binary trees
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.
Phase separation of symmetrical polymer mixtures in thin-film geometry
1995
Monte Carlo simulations of the bond fluctuation model of symmetrical polymer blends confined between two “neutral” repulsive walls are presented for chain lengthNA=NB=32 and a wide range of film thicknessD (fromD=8 toD=48 in units of the lattice spacing). The critical temperaturesTc(D) of unmixing are located by finite-size scaling methods, and it is shown that\(T_c (\infty ) - T_c (D) \propto D^{ - {1 \mathord{\left/ {\vphantom {1 {v_3 }}} \right. \kern-\nulldelimiterspace} {v_3 }}} \), wherev3≈0.63 is the correlation length exponent of the three-dimensional Ising model universality class. Contrary to this result, it is argued that the critical behavior of the films is ruled by two-dimensi…
Titanium Lattice Structures Produced via Additive Manufacturing for a Bone Scaffold: A Review
2023
The progress in additive manufacturing has remarkably increased the application of lattice materials in the biomedical field for the fabrication of scaffolds used as bone substitutes. Ti6Al4V alloy is widely adopted for bone implant application as it combines both biological and mechanical properties. Recent breakthroughs in biomaterials and tissue engineering have allowed the regeneration of massive bone defects, which require external intervention to be bridged. However, the repair of such critical bone defects remains a challenge. The present review collected the most significant findings in the literature of the last ten years on Ti6Al4V porous scaffolds to provide a comprehensive summa…
The [Fe(etz)6](BF4)2 Spin-Crossover System - Part Two: Hysteresis in the LIESST Regime
1996
In the [Fe(etz)6](BF4)2 spincrossover system the iron(II) complexes occupy two nonequivalent lattice sites, sites A and B. Complexes on site A show a thermal high-spin (HS) low-spin (LS) transition at 105 K, whereas complexes on site B remain in the HS state down to 10 K. Complexes on both sites exhibit light-induced spin state conversions (LIESST) at 20 K: LS HS on site A with = 514.5 nm, and HS LS on site B with = 820 nm. The relaxation processes subsequent to the HS LS conversion on site B reveal a light-induced HSLS bistability for the complexes on site B at 70 K. The bistability as well as the absence of a thermal spin transition on site B are attributed to a thermal hysteresis for the…
Research of Complex Forms in Cellular Automata by Evolutionary Algorithms
2004
This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms
2004
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms. This paper includes a demonstration that consists in showing that the presented R automaton can both implement any logic circuit (logic universality) and a simulation of Life (universality in the Turing sense).
On the lattice of prefix codes
2002
AbstractThe natural correspondence between prefix codes and trees is explored, generalizing the results obtained in Giammarresi et al. (Theoret. Comput. Sci. 205 (1998) 1459) for the lattice of finite trees under division and the lattice of finite maximal prefix codes. Joins and meets of prefix codes are studied in this light in connection with such concepts as finiteness, maximality and varieties of rational languages. Decidability results are obtained for several problems involving rational prefix codes, including the solution to the primeness problem.