We show the existence of (ϵ,n)-complements for (ϵ,R)-complementary projective generalized pairs (X,B+M) Fano type, when either coefficients B and μj belong to a finite set, or DCC set M′≡0, where M′=∑μjMj′ Mj′ are nef Cartier divisors.

Fix integers b > a ≥ 1 with g := gcd(a, b). A set S ⊆ N is {a, b}-multiplicative if ax 6= by for all x, y ∈ S. For all n, we determine an {a, b}-multiplicative set with maximum cardinality in [n], and conclude that the maximum density of an {a, b}-multiplicative set is b b+g . Erdős [2, 3, 4] defined a set S ⊆ N to be multiplicative Sidon1 if ab = cd implies {a, b} = {c, d} for all a, b, c, d ∈...

Alon, Angel, Benjamini and Lubetzky recently studied an old problem of Euler on sumsets for which all elements of A + B are integer squares. Improving their result we prove: 1. There exists a set A of 3 positive integers and a corresponding set B ⊂ [0, N ] with |B| ≫ (logN)15/17, such that all elements of A+B are perfect squares. 2. There exists a set A of 3 integers and a corresponding set B ⊂...

In the present work, we have developed a mild, efficient, and environmentally benign method for the synthesis of tetrahydrobenzo[b]pyran derivatives via a three-component cyclocondensation of aldehydes, malononitrile and dimedone utilizing ammonium chloride as a simple, easily available and cost effective catalyst under microwave irradiation. This method has several attracting features such as ...

Let A be a non empty set, let B be a set, let B1 be a set, and let y1 be a function from B1 into A. Let us assume that B1 ⊆ B. The functor cylinder0(A,B,B1, y1) yields a non empty subset of A B and is defined by: (Def. 1) cylinder0(A,B,B1, y1) = {y : B → A: y B1 = y1}. Let A be a non empty set and let B be a set. A non empty subset of AB is said to be a thin cylinder of A and B if: (Def. 2) The...

• New segmentation deals with intensity inhomogeneity within biological images. Use of continuous formulation B-spline level set RSF active contour model. Watershed algorithm a relevant choice object markers. The efficiency is proved in terms qualitative and quantitative evaluation. Image plays an important role the analysis understanding cellular process. However, this task becomes difficult w...

Let G = ( V, E ) be a graph of order n and let B D the set vertices in V \ that have neighbor vertex . The differential is defined as ∂ |B(D)| − |D| maximum value for any subset A said to dominating if every adjacent dominant it contains -set which also set. This paper devoted computation wheel, cycle path-related graphs infrastructure networks. Furthermore, types networks are recognized.

We give an algorithm for deciding whether an embedding of a finite partial order P into the enumeration degrees of the Σ2-sets can always be extended to an embedding of a finite partial order Q ⊃ P. 1. The theorem. Reducibilities are relations on the power set of the natural numbers, conveying that a set A ⊆ ω can in some sense be “computed” or, in more generality, “defined”, from another set B...