Results 1 to 10 of about 64,621 (168)
Balanced and Absorbing Soft Sets
The aim of this paper is to define the balanced softset and absorbing soft set over a linear space and construct someuseful theorem depending upon these ...
Sanjay Roy
doaj +2 more sources
Semicomplete absorbent sets in digraphs [PDF]
Let be a digraph and S a subset of vertices of D, S is an absorbent set if for every v in there exists a vertex u in S such that A subset S of V(D) is a semicomplete absorbent set if S is absorbent and the induced subdigraph is semicomplete. The minimum (respectively maximum) of the cardinalities of the semicomplete absorbent sets is the lower ...
Laura Pastrana-Ramírez +2 more
openaire +2 more sources
LEFT ABSORBING HYPER K-ALGEBRAS [PDF]
In the present manuscript, we introduce a type of hyper K-algebra which is called left absorbing hyper K-algebra and investigate some of the related properties. We also show that set of all types of positive implicative and commutative hyper K-ideal form
S. Madadi, M. A. Nasr-Azadani
doaj +1 more source
This paper is concerned with a sixth-order diffusion equation, which describes continuum evolution of film-free surface. By using the regularity estimates for the semigroups, iteration technique and the classical existence theorem of global attractors we
Ning Duan, Xiaopeng Zhao
doaj +1 more source
Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lara Dolecek +4 more
openaire +2 more sources
Chaotic and pathological phenomena in topological modules are studied in this manuscript. In particular, constructions of noncontinuous linear functionals are provided for a wide variety of topological modules.
Francisco Javier García-Pacheco
doaj +1 more source
A queueing system with a batch Markovian arrival process and varying priorities
We consider herein a single-server queueing system with a finite buffer and a batch Markovian arrival process. Customers staying in the buffer may have a lower or higher priority.
Valentina I. Klimenok
doaj +1 more source
Residence time near an absorbing set [PDF]
18 pages, 8 figures, IOP format. Revised version: changes in response to referee reports and various typos corrected.
Randon-Furling, J., Redner, S.
openaire +2 more sources
On (1,2)-absorbing primary ideals and uniformly primary ideals with order ≤ 2
This paper introduces a subset of the set of 1-absorbing primary ideals introduced in [3]. An ideal I of a ring R is (1,2)-absorbing primary if, whenever non-unit elements α, β, γ ∈ R with αβγ ∈ I,then αβ ∈ I or γ2 ∈ I.
Alhazmy Khaled +3 more
doaj +1 more source
Absorbing sets have been identified as structures in the graph of a low-density parity-check code that cause error floors — in particular in combination with binary message passing decoding algorithms. In this paper it is shown that absorbing sets involving only variable nodes up to degree 3 are equivalent to cycles and a sufficient and necessary ...
Gottfried Lechner, Sarah J. Johnson
openaire +2 more sources

