In this series of lectures the basic ideas of the 1/mQ expansion in QCD (mQ is the mass of a heavy quark) are outlined. Applications to exclusive and inclusive decays are given.

Inequality: why governance matters " For further information, please contact [email protected]

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive...

We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...

First we show that the cosets of a fuzzy ideal μ in a BCK-algebraX form another BCK-algebra  X/μ (called the fuzzy quotient BCK-algebra of X by μ). Also we show thatX/μ is a fuzzy partition of X and we prove several some isomorphism theorems. Moreover we prove that if the associated fuzzy similarity relation of a fuzzy partition P of a commutative BCK-algebra iscompatible, then P is a fuzzy quo...

We consider evaluation strategies for database queries expressed in three functional query languages: the complex value algebra, the simply typed lambda calculus, and method schemas. Each of these query languages derives its expressive power from a diierent primitive: the complex value algebra from the powerset operator, the simply typed lambda calculus from list iteration, and method schemas f...

We survey recent results about ordering constraints on trees and discuss their applications. Our main interest lies in the family of recursive path orderings which enjoy the properties of being total, well-founded and compatible with the tree constructors. The paper includes some new results, in particular the undecidability of the theory of lexicographic path orderings in case of a non-unary s...

Let G be a connected graph of order n with domination number γ ( ) . Wang, Yan, Fang, Geng and Tian [Linear Algebra Appl. 607 (2020), 307-318] showed that for any Laplacian eigenvalue λ multiplicity m , it holds ≤ − Using techniques from the theory star sets, in this work we prove same bound when is an arbitrary adjacency non-regular graph, characterize cases equality. Moreover, show result giv...

In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...