In [13], Migliore–Miró-Roig–Nagel show that the Weak Lefschetz property can fail for an ideal I ⊆ K[x1, . . . , x4] generated by powers of linear forms. This is in contrast to the analogous situation in K[x1, x2, x3], where WLP always holds [16]. We use the inverse system dictionary to connect I to an ideal of fat points, and show that failure of WLP for powers of linear forms is connected to t...

In this paper, we introduce the notion of hyper pseudo B C K - algebras, which is a generalization of pseudo BCK -algebras and hyper BCK -algebras and we investigates some related properties. In follow, we de ne some kinds of hyper pseudo BCK -ideals of a hyper pseudo BCK - algebra and we find the relations among them. Finally, we characterize the hyper pseudo BCK -ideals of type 4 generated by...

We investigate the rigidity of hyperbolic cone metrics on 3-manifolds which are isometric gluing of ideal and hyper-ideal tetrahedra in hyperbolic spaces. These metrics will be called ideal and hyperideal hyperbolic polyhedral metrics. It is shown that a hyper-ideal hyperbolic polyhedral metric is determined up to isometry by its curvature and a decorated ideal hyperbolic polyhedral metric is d...

A twistor construction of the hierarchy associated with the hyper-KK ahler equations on a metric (the anti-self-dual Einstein vacuum equations, ASDVE, in four dimensions) is given. The recursion operator R is constructed and used to build an innnite-dimensional symmetry algebra and in particular higher ows for the hyper-KK ahler equations. It is shown that R acts on the twistor data by multipli...

Ideal Connes-amenability of dual Banach algebras was investigated in [17] by A. Minapoor, A. Bodaghi and D. Ebrahimi Bagha. They studied weak∗continuous derivations from dual Banach algebras into their weak∗-closed two- sided ideals. This work considers weak∗-continuous derivations of dual triangular Banach algebras into their weak∗-closed two- sided ideals . We investigate when weak∗continuous...

Recall that a (hyper)graph is d-degenerate if every of its nonempty subgraphs has a vertex of degree at most d. Every d-degenerate (hyper)graph is (easily) (d + 1)colorable. A (hyper)graph is almost d-degenerate if it is not d-degenerate, but every its proper subgraph is d-degenerate. In particular, if G is almost (k − 1)-degenerate, then after deleting any edge it is k-colorable. For k ≥ 2, we...

Hyper-spectral Atmospheric Infrared Sounder has many channels. Although, it has been carried out channel selection in the actual application process, but compared with the previous detector, the channel also seems more and thus easy to weak correlation between channels, which is not obey classical variational assimilation theory requires observation error is not related. Hyper-spectral sounder ...

We introduce the notion of a weak ideal compression function, which is vulnerable to strong forms of attack, but is otherwise random. We show that such weak ideal compression functions can be used to create secure hash functions, thereby giving a design that can be used to eliminate attacks caused by undesirable properties of compression functions. We prove that the construction we give, which ...

Assume that n and k are positive integers with n ≥ 2k + 1. A non-hamiltonian graph G is hypo hamiltonian if G − v is hamiltonian for any v ∈ V (G). It is proved that the generalized Petersen graph P (n, k) is hypo hamiltonian if and only if k = 2 and n ≡ 5 (mod 6). Similarly, a hamiltonian graph G is hyper hamiltonian if G−v is hamiltonian for any v ∈ V (G). In this paper, we will give some nec...

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...