In this paper, we apply the concept of fuzzy soft sets to ordered semigroup theory. The concepts of (∈γ ,∈γ ∨qδ )-fuzzy left (right) ideals, (∈γ ,∈γ ∨qδ )-fuzzy bi-ideals and (∈γ ,∈γ ∨qδ )-fuzzy quasi-ideals are introduced and some related properties are obtained. Three kinds of lattice structures of the set of all (∈γ ,∈γ ∨qδ )-fuzzy soft left (right) ideals of an ordered semigroup are derived...

We define interval valued (∈,∈∨q)-fuzzy k-ideals, interval valued (∈,∈∨q)-fuzzy k-quasi-ideals, interval valued (∈,∈∨q)-fuzzy k-bi-ideals and characterize k-regular and k-intra regular hemirings by the properties of interval valued (∈,∈∨q)-fuzzy k-ideals, interval valued (∈,∈∨q)-fuzzy k-quasi-ideals and interval valued (∈,∈∨q)-fuzzy k-bi-ideals. 2010 mathematics subject classification: 16Y60 • ...

In this talk, we point out that curvature-regular asymptotically flat solitons with negative mass are contained in the Myers-Perry family in five dimensions. These solitons do not have horizon, but instead a conical NUT singularity of quasi-regular nature surrounded by naked CTCs. We show that this quasi-regular singularity can be made regular for a set of discrete values of angular momentum by...

In this paper it is proved that relative hyperbolicity is an invariant of quasi-isometry. As a byproduct we provide simplified definitions of relative hyperbolicity in terms of the geometry of a Cayley graph. In particular we obtain a definition very similar to the one of hyperbolicity, relying on the existence for every quasi-geodesic triangle of a central left coset of peripheral subgroup.

Part I showed that the number of ways to place q nonattacking queens or similar chess pieces on an n× n square chessboard is a quasipolynomial function of n. We prove the previously empirically observed period of the bishops quasipolynomial, which is exactly 2 for three or more bishops. The proof depends on signed graphs and the Ehrhart theory of inside-out polytopes.

We study groups acting by length-preserving transformations on spaces equipped with asymmetric, partially-defined distance functions. We introduce a natural notion of quasi-isometry for such spaces and exhibit an extension of the Švarc-Milnor Lemma to this setting. Among the most natural examples of these spaces are finitely generated monoids and semigroups and their Cayley and Schützenberger g...

We show that enumerating all minimal spanning and connected subsets of a given matroid can be solved in incremental quasi-polynomial time. In the special case of graphical matroids, we improve this complexity bound by showing that all minimal 2-vertex connected subgraphs of a given graph can be generated in incremental polynomial time.

We show that enumerating all minimal spanning and connected subsets of a given matroid can be solved in incremental quasi-polynomial time. In the special case of graphical matroids, we improve this complexity bound by showing that all minimal 2-vertex connected subgraphs of a given graph can be generated in incremental polynomial time.

Part I showed that the number of ways to place q nonattacking queens or similar chess pieces on an n× n square chessboard is a quasipolynomial function of n. We prove the previously empirically observed period of the bishops quasipolynomial, which is exactly 2 for three or more bishops. The proof depends on signed graphs and the Ehrhart theory of inside-out polytopes.