In this paper we investigate the class of rigid monomial ideals. We give a characterization of the minimal free resolutions of certain classes of these ideals. Specifically, we show that the ideals in a particular subclass of rigid monomial ideals are lattice-linear and thus their minimal resolution can be constructed as a poset resolution. We then use this result to give a description of the m...

We characterize the fuzzy ideal generated by a fuzzy subset in a semigroup and the fuzzy interior ideal generated by a fuzzy subset in a semigroup. Our work generalizes the characterizations ([8]) of those fuzzy ideals generated by fuzzy subsets in semigroups with an identity element.

D. Molodtsov (1999) [1] introduced the concept of a soft set as a new approach for modeling uncertainties. Xiao et al. [7] and Pei and Miao [8] discussed the relationship between soft sets and information systems. They showed that soft sets are a class of special information systems. So it’s important to study the structures of soft sets for information systems. Shabir and Naz(2011) [20], studi...

In ‎this ‎paper, ‎we ‎study ‎the ‎relation ‎between ‎the ‎soft ‎sets ‎and ‎soft ‎Lie ‎algebras ‎with ‎the ‎lattice theory. ‎We ‎introduce ‎the ‎concepts ‎of ‎the ‎lattice ‎of ‎soft ‎sets, ‎full ‎soft ‎sets ‎and ‎soft ‎Lie ‎algebras ‎and next, we ‎verify ‎some ‎properties ‎of ‎them. We ‎prove ‎that ‎the ‎lattice ‎of ‎the ‎soft ‎sets ‎on ‎a fixed parameter set is isomorphic to the power set of a ...

The aim of this article is to lay a foundation for providing a soft algebraic tool in considering many problems that contain uncertainties. In order to provide these soft algebraic structures, the notion of union soft q-ideals are introduced, and related properties are investigated. Conditions for a union soft ideal to be a union soft q-ideal are established. Characterizations of a union soft q...

This paper summarizes relations between the constructive theory of polynomial ideals and polynomial interpolation in several variables. The main ingredient is a generalization of the algorithm for division with remainder to \quotients" of polynomials and nite sets of polynomi-als. x1. Introduction When compared to the univariate case, polynomial interpolation in several variables turns out to b...

Various search directions used in interior-point-algorithms for the SDP (semidefinite program) and the monotone SDLCP (semide nite linear complementarity problem) are characterized by the intersection of a maximal monotone a ne subspace and a maximal and strictly antitone a ne subspace. This observation provides a uni ed geometric view over the existence of those search directions.