On completion of fuzzy metric spaces

Completions of fuzzy metric spaces (in the sense of George and Veeramani) are discussed. A complete fuzzy metric space Y is said to be a˜fuzzy metric completion of a˜given fuzzy metric space X if X is isometric to a˜dense subspace of Y. We present an example of a˜fuzzy metric space that does not admit any fuzzy metric completion. However, we prove that every standard fuzzy metric space has an (up to isometry) unique fuzzy metric completion. We also show that for each fuzzy metric space there is an (up to uniform isomorphism) unique complete fuzzy metric space that contains a˜dense subspace uniformly isomorphic to it.     

三维空间子群网的推导

在严格的群论基础上对三维空间的两个几何不等价的极大有限群的子群网进行了详细推导.首先对两个极大有限群的所有对称操作矩阵的几何意义进行了逐一分析,然后根据群和子群的关系找出了它们所包含的全部子群,并对这种基于二次型理论的新代数方法的优越性进行了讨论 关键词： 二次型 同构 等价类     

Hyers–Ulam–Rassias stability of a generalized Apollonius–Jensen type additive mapping and isomorphisms between C *‐algebras

Let X, Y be Banach modules over a C *‐algebra. We prove the Hyers–Ulam–Rassias stability of the following functional equation in Banach modules over a unital C *‐algebra: It is shown that a mapping f: X → Y satisfies the above functional equation and f (0) = 0 if and only if the mapping f: X → Y is Cauchy additive. As an application, we show that every almost linear bijection h: A → B of a unital C *‐algebra A onto a unital C *‐algebra B is a C *‐algebra isomorphism when h (2^d uy) = h (2^d u) h (y) for all unitaries u ∈ A, all y ∈ A, and all d ∈ Z . (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The restricted isomorphism problem for metacyclic restricted Lie algebras

Let be a restricted Lie algebra with the restricted enveloping algebra over a perfect field of positive characteristic . The restricted isomorphism problem asks what invariants of are determined by . This problem is the analogue of the modular isomorphism problem for finite -groups. Bagiński and Sandling have given a positive answer to the modular isomorphism problem for metacyclic -groups. In this paper, we provide a positive answer to the restricted isomorphism problem in case is metacyclic and -nilpotent.

     

Norm conditions for uniform algebra isomorphisms

In recent years much work has been done analyzing maps, not assumed to be linear, between uniform algebras that preserve the norm, spectrum, or subsets of the spectra of algebra elements, and it is shown that such maps must be linear and/or multiplicative. Letting A and B be uniform algebras on compact Hausdorff spaces X and Y, respectively, it is shown here that if λ ∈ ℂ / {0} and T: A → B is a surjective map, not assumed to be linear, satisfying

QSAR models based on isomorphic and nonisomorphic data fusion for predicting the blood brain barrier permeability

A QSAR model for predicting the blood brain barrier permeability (BBBP) in a large and heterogeneous variety of compounds (136 compounds) has been developed using approximate similarity (AS) matrices as predictors and PLS as multivariate regression technique. AS values fuse information of both the isomorphic similarity and nonisomorphic dissimilarity with the purpose of achieving an accurate predictive space. In addition to the fact of applying AS values to heterogeneous data sets, a new concept on graph isomorphism based on the extended maximum common subgraph (EMCS) is defined for the building of AS spaces considering the atoms and bonds, which are bridges between the isomorphic and nonisomorphic substructures. This new isomorphism detection has as objective to take into account the position and nature of the nucleus substituents, thus allowing the development of accurate models for large and diverse sets of compounds. After an outliers study, the training and test stages were made and the results obtained using several AS approaches were compared. Several validation processes were carried out by means of employing several test sets, and high predictive ability was obtained for all the cases (Q(2) = 0.81 and standard error in prediction, SEP = 0.29).     

Locally trivial 𝔾a−actions on ℂ5 with singular algebraic quotients

Simple examples are given of proper algebraic actions of the additive group of complex numbers on ?⁵ whose geometric quotients are, respectively, a?ne, strictly quasia?ne, and algebraic spaces which are not schemes. Moreover, a Zariski locally trivial action is given whose ring of invariant regular functions defines a singular factorial a?ne fourfold embedded in ?¹². The geometric quotient for the action embeds as a strictly quasia?ne variety in the smooth locus of the algebraic quotient with complement isomorphic to the normal a?ne surface with the A₂?singularity at the origin.     

On the stability of sparse convolutions

We give a stability result for sparse convolutions on ${?}^2(G)\times {?}^1(G)$ for torsion-free discrete Abelian groups G such as $\mathbb{Z}$. It turns out, that the torsion-free property prevents full cancellation in the convolution of sparse sequences and hence allows to establish stability, that is, injectivity with an universal lower norm bound, which only depends on the support cardinalities of the sequences. This can be seen as a reverse statement of the Young inequality for sparse convolutions. Our result hinges on a compression argument in additive set theory.     

On the sequential order continuity of the <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">K</Emphasis>)-space

As shown in [1], for each compact Hausdorff space K without isolated points, there exists a compact Hausdorff P′-space X but not an F-space such that C(K) is isometrically Riesz isomorphic to a Riesz subspace of C(X). The proof is technical and depends heavily on some representation theorems. In this paper we give a simple and direct proof without any assumptions on isolated points. Some generalizations of these results are mentioned.     

Complexity results in graph reconstruction

We investigate the relative complexity of the graph isomorphism problem (GI) and problems related to the reconstruction of a graph from its vertex-deleted or edge-deleted subgraphs (in particular, deck checking (DC) and legitimate deck (LD) problems). We show that these problems are closely related for all amounts c?1 of deletion:

(1)

, , , and .

(2)

For all k?2, and .

(3)

For all k?2, .

(4)

.

(5)

For all k?2, .

For many of these results, even the c=1 case was not previously known.Similar to the definition of reconstruction numbers vrn_∃(G) [F. Harary, M. Plantholt, The graph reconstruction number, J. Graph Theory 9 (1985) 451-454] and ern_∃(G) (see [J. Lauri, R. Scapellato Topics in Graph Automorphism and Reconstruction, London Mathematical Society, Cambridge University Press, Cambridge, 2003, p. 120]), we introduce two new graph parameters, vrn_∀(G) and ern_∀(G), and give an example of a family {G_n}_n?4 of graphs on n vertices for which vrn_∃(G_n)<vrn_∀(G_n). For every k?2 and n?1, we show that there exists a collection of k graphs on (2^k-1+1)n+k vertices with 2ⁿ 1-vertex-preimages, i.e., one has families of graph collections whose number of 1-vertex-preimages is huge relative to the size of the graphs involved.