Fuzzy Galois connections on fuzzy posets

The concept of fuzzy Galois connections is defined on fuzzy posets with Bělohlávek's fuzzy Galois connections as a special case. The properties of fuzzy Galois connections are investigated. Then the relations between fuzzy Galois connections and fuzzy closure operators, fuzzy interior operators are studied. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Fuzzy Galois connections categorically

This paper presents a systematic investigation of fuzzy (non‐commutative) Galois connections in the sense of R. Bělohlávek [1], from the point of view of enriched category theory. The results obtained show that the theory of enriched categories makes it possible to present the theory of fuzzy Galois connections in a succinct way; and more importantly, it provides a useful method to express and to study the link and the difference between the commutative and the non‐commutative worlds (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On polynomial digraphs

Let Φ(x,y) be a bivariate polynomial with complex coefficients. The zeroes of Φ(x,y) are given a combinatorial structure by considering them as arcs of a directed graph G(Φ). This paper studies some relationship between the polynomial Φ(x,y) and the structure of G(Φ).     

A Galois Connection

The connection presented in this paper mirror-links two metamathematical structures, the finitary closure operators, and the compact consistency properties, in such a way that a specification of one structure induces a provably equivalent specification of the other. Mathematics Subject Classification (2000): Primary 06A15, Secondary 28E10 03B22     

Galois Graphs: Walks, Trees and Automorphisms

Given a symmetric polynomial (x, y) over a perfect field k of characteristic zero, the Galois graph G() is defined by taking the algebraic closure as the vertex set and adjacencies corresponding to the zeroes of (x, y). Some graph properties of G(), such as lengths of walks, distances and cycles are described in terms of . Symmetry is also considered, relating the Galois group Gal( /k) to the automorphism group of certain classes of Galois graphs. Finally, an application concerning modular curves classifying pairs of isogeny elliptic curves is revisited.     

Galois connexion of a fuzzy subset

By their representation theorem, Negoita and Ralescu ‘identify’ a fuzzy set with a family of ordinary sets (levels). Here we ‘identify’ a fuzzy set with a Galois connexion between the boolean of a set and the valuation set. The two representations are closely connected.     

The Galois closure of the Garcia–Stichtenoth tower

We describe the Galois closure of the Garcia–Stichtenoth tower and prove that it is optimal.     

Biclosed Binary Relations and Galois Connections

Given two closure spaces (E,) and (E,), a relation RE×E is said biclosed if every row of its matrix representation corresponds to a closed subset of E, and every column to a closed subset of E. An isomorphism between, on the one hand, the set of all biclosed relations and, on the other hand, the set of all Galois connections between the two lattices of closed sets is established. Several computational applications are derived from this result.     

On the number of certain Galois extensions of local fields

In this paper, we will calculate the number of Galois extensions of local fields with Galois group or .

     

Non-dual fuzzy connections

The lack of double negation and de Morgan properties makes fuzzy logic unsymmetrical. This is the reason why fuzzy versions of notions like closure operator or Galois connection deserve attention for both antiotone and isotone cases, these two cases not being dual. This paper offers them attention, comming to the following conclusions: – some kind of hardly describable local preduality still makes possible important parallel results; – interesting new concepts besides antitone and isotone ones (like, for instance, conjugated pair), that were classically reducible to the first, gain independency in fuzzy setting.     

The Galois closure of Drinfeld modular towers

In this article we study Drinfeld modular curves X₀(pn) associated to congruence subgroups Γ₀(pn) of GL(2,Fq[T]) where p is a prime of Fq[T]. For n>r>0 we compute the extension degrees and investigate the structure of the Galois closures of the covers X₀(pn)→X₀(pr) and some of their variations. The results have some immediate implications for the Galois closures of two well-known optimal wild towers of function fields over finite fields introduced by Garcia and Stichtenoth, for which the modular interpretation was given by Elkies.     

On Certain Isomorphisms between Absolute Galois Groups

Let k be an algebraically closed field of characteristic zero, F be an algebraically closed extension of k of transcendence degree one, and G be the group of automorphisms over k of the field F. The purpose of this note is to calculate the group of continuous automorphisms of G.     

Galois connections among fuzzy groups, similarities, distances

Given a set S, we define Galois connections between the lattices of the fuzzy subgroups of transformations in S, the lattice of the similarities in S and the lattice of the distances in S.     

Constructing highly arc transitive digraphs using a direct fibre product

We introduce a construction of highly arc transitive digraphs using a direct fibre product. This product generalizes some known classes of highly arc transitive digraphs but also allows us to construct new ones. We use the product to obtain counterexamples to a conjecture advanced by Cameron, Praeger and Wormald on the structure of certain highly arc transitive digraphs.     

Solution Sets of Interval-Valued Fuzzy Relational Equations

This paper introduces the concepts of tolerable solution set, united solution set, and controllable solution set of interval-valued fuzzy relational equations. Given a continuous t-norm, it is proved that each of the three types of the solution sets of interval-valued fuzzy relational equations with a max-t-norm composition, if nonempty, is composed of one maximum solution and a finite number of minimal solutions. Necessary and sufficient conditions for the existence of solutions are given. Computational procedures based on the constructive proofs are proposed to generate the complete solution sets. Examples are given to illustrate the procedures. An erratum to this article is available at .     

Solution Sets of Interval-Valued Min-S-Norm Fuzzy Relational Equations

This paper introduces the concepts of tolerable solution set, united solution set, and controllable solution set for interval-valued fuzzy relational equations. Given a continuous s-norm, it is shown that each of the three types of the solution sets of interval-valued fuzzy relational equations with a min-s-norm composition, if nonempty, is composed of one minimum solution and a finite number of maximal solutions. Necessary and sufficient conditions for the existence of solutions are given. Computational procedures based on the constructive proofs are proposed to generate the complete solution sets. An example is given to illustrate the proposed procedures. An erratum to this article is available at .     

Query Optimization in Distributed Relational Databases

The query optimizer is the DBMS (data base management system) component whose task is to find an optimal execution plan for a given input query. Typically, optimization is performed using dynamic programming. However, in distributed execution environments, this approach becomes intractable, due to the increase in the search space incurred by distribution. We propose the use of the tabu search metaheuristic for distributed query optimization. A hashing-based data structure is used to keep track of the search memory, simplifying significantly the implementation of tabu search. To validate this proposal, we implemented the tabu search strategy in the scope of an existing optimizer, which runs several search strategies. We focus our attention on the more difficult problems in terms of the query execution space, in which the solution space includes bushy execution plans and Cartesian products, which are not dealt with very often in the literature. Using a real-life application, we show the effectiveness of tabu search when compared to other strategies.     

Some connections between an operator and its Helton class

In this paper we show that the nilpotent perturbation of operators in the Helton class of p-hyponormal operators has scalar extensions. As a corollary we get that the nilpotent perturbation of each operator in the Helton class of p-hyponormal operators has a nontrivial invariant subspace if its spectrum has nonempty interior in the plane.