Results 11 to 20 of about 586,193 (290)
Flow Equations and Normal Ordering [PDF]
In this paper we consider flow-equations where we allow a normal ordering which is adjusted to the one-particle energy of the Hamiltonian. We show that this flow converges nearly always to the stable phase. Starting out from the symmetric Hamiltonian and
Elmar Körding +5 more
core +2 more sources
Normal Order: Combinatorial Graphs [PDF]
A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators.
Blasiak, Pawel +4 more
core +3 more sources
Strongly-Normalizing Higher-Order Relational Queries [PDF]
Language-integrated query is a powerful programming construct allowing database queries and ordinary program code to interoperate seamlessly and safely. Language-integrated query techniques rely on classical results about the nested relational calculus, stating that its queries can be algorithmically translated to SQL, as long as their result type is a
Ricciotti, Wilmer, Cheney, James
openaire +6 more sources
Normal Higher-Order Termination [PDF]
We extend the termination proof methods based on reduction orderings to higher-order rewriting systems based on higher-order pattern matching. We accommodate, on the one hand, a weakly polymorphic, algebraic extension of Church’s simply typed λ-calculus and, on the other hand, any use of eta, as a reduction, as an expansion, or as an equation. The user’
Jouannaud, Jean Pierre +1 more
openaire +5 more sources
Order-cushioned refinements and normality [PDF]
The authors use the notions of order-cushioned covers and weak 0-covers to obtain the following result. THEOREM. A space X is collectionwise normal iff every weak 6-cover of X has an order-cushioned open refinement. Similar characterizations are obtained for normal, countably paracompact spaces and analogous embedding theorems are shown.
Smith, J. C., Telgársky, Rastislav
openaire +2 more sources
Walks, Partitions, and Normal Ordering [PDF]
We describe the relation between graph decompositions into walks and the normal ordering of differential operators in the $n$-th Weyl algebra. Under several specifications, we study new types of restricted set partitions, and a generalization of Stirling numbers, which we call the $\lambda$-Stirling numbers.
Dzhumadil'daev, Askar +1 more
openaire +2 more sources
NORMALLY ORDERED SEMIGROUPS [PDF]
AbstractIn this paper we introduce the notion of normally ordered block-group as a natural extension of the notion of normally ordered inverse semigroup considered previously by the author. We prove that the classNOSof all normally ordered block-groups forms a pseudovariety of semigroups and, by using the Munn representation of a block-group, we deduce
openaire +2 more sources
Crucial Dependence of ``Precarious'' and ``Autonomous'' phi^4s Upon the Normal-ordering Mass [PDF]
Using the Gaussian wave-functional approach with the normal-ordering renormalization prescription, we show that for the (3+1)-dimensional massive lambda phi^4 theory, ``precarious'' and ``autonomous'' phi^4s can exist if and only if the normal-ordering ...
Chang S. J. +10 more
core +2 more sources
2020 global reassessment of the neutrino oscillation picture
We present an updated global fit of neutrino oscillation data in the simplest three-neutrino framework. In the present study we include up-to-date analyses from a number of experiments.
P. F. de Salas +7 more
doaj +1 more source
Constraining visible neutrino decay at KamLAND and JUNO
We study visible neutrino decay at the reactor neutrino experiments KamLAND and, JUNO. Assuming the Majoron model of neutrino decay, we obtain constraints on the couplings between Majoron and neutrino as well as on the lifetime/mass of the most massive ...
Yago P. Porto-Silva +4 more
doaj +1 more source

