A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J. Comput., 17 (1988), pp. 1193–1202] on P-printable sets, we present some simple properties of the L-printable sets. This definition of “L-printable” is robust and allows us to give alternate characterizations of the ...

Protein molecules adopt a specific global 3D structure in order to carry out their biological function. To achieve this native state a newly formed protein molecule has to fold. The folding process and the final fold are both determined by the sequence of amino acids making up the protein chain. It is not currently possible to predict the conformation of the native state from the amino acid seq...

Spontaneous-fission properties of 256 Fm, 258 Fm, and 260 Fm isotopes are studied within the Skyrme-Hartree-Fock+BCS framework. In the particle-hole channel we take the Skyrme SkM * effective force, while in the particle-particle channel we employ the seniority pairing interaction. Three static fission paths for all investigated heavy fermium isotopes are found. The analysis of these fission mo...

The concept of perturbative gauge invariance formulated exclusively by means of asymptotic fields is generalized to massive gauge fields. Applying it to the electroweak theory leads to an essentially complete fixing of couplings of scalar and ghost fields and of the coupling to fermionic matter, in agreement with the standard theory. The W/Z mass ratio is also determined, as well as the chiral ...

We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space. The resulting logic LREC has a data complexity in LOGSPACE, and it defines LOGSPACE-complete problems like deterministic reachability and Boolean formula evaluation. We prove that LREC is strictly more expressive than deterministic tran...

1 An example protocol . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2 SDP characterization of cheating strategies . . . . . . . . . . . . . . . . . . . . . . 4 3 Derivations of the reduced SDPs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4 Second-order cone programming formulations and analysis . . . . . . . . . . . . . . 12 5 Developing the strategies in...

This paper gives an overview of recent achievements of the multiwavelet theory. The construction of multiwavelets is based on a multiresolution analysis with higher multiplicity generated by a scaling vector. The basic properties of scaling vectors such as L-stability, approximation order and regularity are studied. Most of the proofs are sketched.

A common problem in physics is to fit regression data by a parametric class of functions, and to decide whether a certain functional form allows for a good fit of the data. Common goodness of fit methods are based on the calculation of the distribution of certain statistical quantities under the assumption that the model under consideration holds true. This proceeding bears methodological flaws...

A new definition of boundedness of linear order-homomorphisms (LOH)in $L$-topological vector spaces is proposed. The new definition iscompared with the previous one given by Fang [The continuity offuzzy linear order-homomorphism, J. Fuzzy Math. 5 (4) (1997)829$-$838]. In addition, the relationship between boundedness andcontinuity of LOHs is discussed. Finally, a new uniform boundednessprincipl...