A new approach to bipolar soft sets and its applications

Faruk Karaaslan; Serkan Karataş

doi:10.1142/s1793830915500548

Home/Archive/arXiv

arXiv · 1406.2274

A new approach to bipolar soft sets and its applications

Faruk Karaaslan·Serkan Karataş

View original source ↗Read source document ↗Export metadata ↓

Abstract

Molodtsov \cite{molodtsov-1999} proposed the concept of soft set theory in 1999, which can be used as a mathematical tool for dealing with problems that contain uncertainty. Sabir and Naz \cite{shabir-2013} defined notion of bipolar soft set in 2013. In this paper, we redefine concept of bipolar soft set and bipolar soft set operations as more functional than former. Also we study on their basic properties and we present a decision making method with application.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Faruk Karaaslan, Serkan Karataş. 2014-06-06. A new approach to bipolar soft sets and its applications. https://doi.org/10.1142/s1793830915500548

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Geometric Duality Between Constraints and Gauge Fields: Mirror Realization and Reduction Geometry on Principal Bundles

A connection and a nonzero parallel adjoint field determine an invariant hyperplane constraint on a principal bundle. Its sign mirror preserves the hyperplane and reverses its coorientation; global gauge realization is controlled by a twisted stabilizer reduction. For regular fields we identify the normalizing gauge extension as a pushout of the torus-normalizer extension, giving exact lift orders and simultaneous-splitting criteria. In singular rank-two block families, reductions on a fixed trivial bundle form an affine second-Chern lattice whose Weyl stabilizers and finite-order lift spectra detect topology invisible to paired curvature. The reduction framework also determines the structure group and second cohomology of the matched-flag diagonalization space of Friedman and Park, and gives a first- and second-Chern criterion for normal matrices with fixed separated spectrum on four-complexes; every integral solution of their three-eigenline equation on $S^2\times S^2$ is realized. For moving reductions, the projected circle curvature differs from the ambient paired curvature by a covariant-derivative term. Full fatness on a closed four-manifold forces a nontrivial sign-mirror obstruction for every circle reduction; hyperbolic self-dual-form bundles also provide circle reductions in the $y$-fat setting of Florit and Ziller. Contact transgression, bundle automorphism twists, and the natural first-jet Spencer operator complete the geometric picture.

math.GM↗

arXiv2026

A proof of the irrationality of $π$ motivated by nested radicals with roots of $2$

In this work, we prove the irrationality of $π$ motivated by nested radicals with roots of $2$ of the kind $c_k = \sqrt{2 + c_{k - 1}}$ and $c_0 = 0$. Sample computations showing how the rational approximation tends to $π$ as the integer $k$ increases are presented.

math.GM↗

arXiv2026

The new Fermat-type factorization algorithm

Let n be any odd natural number other than a perfect square. We show that the new factorization algorithm, presented in this paper and which we call DFM-1 (where DFM stands for Detto's Factorization Method), is much more efficient than the implementation technique of Fermat's Factorization Algorithm (FFA) called FFA-1, which, among the implementation techniques of Fermat's Factorization Algorithm (FFA), is the one that requires the fewest iterations to identify the non-trivial and trivial factors of n (excluding the cases in which the two factors of the pair of non-trivial or trivial factors of n are so close to each other that they can be identified at the 1st iteration with each of such implementation techniques). Indeed, by the way in which Euler's totient function of any n that is a semiprime is applied to FFA-1, we arrive at the new factorization algorithm (DFM-1), which halves (possibly rounding up to the next integer) the number of iterations required by FFA-1. Furthermore, in this paper, we present the hypothetical scenario according to which the number of iterations could possibly be further reduced. Finally, and still in relation to this new factorization algorithm, in this paper we present the limit number of iterations, which is less than the number of iterations required by DFM-1 to reach the condition x - y = 1 which characterizes the pair of trivial factors of n, beyond which it is no longer possible for pairs of non-trivial factors of n to occur.

math.GM↗