Given a finite Weyl group W with root system , assign the weight α ∈ to each covering pair in the Bruhat order related by the reflection corresponding to α. Extending this multiplicatively to chains, we prove that the sum of the weights of all maximal chains in the Bruhat order has an explicit product formula, and prove a similar result for a weighted sum over maximal chains in the Bruhat order...

A partial function f on an k-element set Ek is a partial Sheffer function if every partial function on Ek is definable in terms of f . Since this holds if and only if f belongs to no maximal partial clone on Ek, a characterization of partial Sheffer functions reduces to finding families of minimal coverings of maximal partial clones on Ek. We show that for each k ≥ 2 there exists a unique minim...

The work considers the problem of solving a system of fuzzy relational equations with inf-implication composition and introduces the concepts of a characteristic matrix and attainable components. It is first shown that solving the system is closely related with the covering problem. Further, it is proved that maximal solutions of the system correspond to irredundant coverings of the characteris...

We study the structure of the maximal ideal space M(H∞) of the algebra H ∞ = H∞(D) of bounded analytic functions defined on the open unit disk D ⊂ C. Based on the fact that dim M(H∞) = 2 we prove for H∞ the matrix-valued corona theorem. Our results heavily rely on the topological construction describing maximal ideal spaces of certain algebras of continuous functions defined on the covering spa...

Klimb, J., On the minimal covering of infinite sets, Discrete Applied Mathematics 45 (1993) 161-168. Minimal covering of infinite sets is studied. It is shown that if BC2’ is closed, then /* contains a minimal covering of X. If r// is a covering of X, then fl is closed on X if and only if there is an admissible functionf: X-1 4 which has no chain. For star type set systems Theorem 15 gives a su...

In this article, we introduce the concept of co-covering which is the dual of covering concept. Then, we prove several theorems being similar to the theorems that have been de-veloped for the covering concept. For example, we provide the lifting criterion for co-coverings of a topological space X, which helps us to classify them by subgroups of the group of all homeomorphisms of X.

An [n, k, r]-partite graph is a graph whose vertex set, V , can be partitioned into n pairwisedisjoint independent sets, V1, . . . , Vn, each containing exactly k vertices, and the subgraph induced by Vi ∪ Vj contains exactly r independent edges, for 1 ≤ i < j ≤ n. An independent transversal in an [n, k, r]-partite graph is an independent set, T , consisting of n vertices, one from each Vi. An ...

There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...

Undesirable consequences of dangerous goods incidents can be mitigated by quick arrival of specialized response teams at the accident site. We present a novel methodology to determine the optimal design of a specialized team network so as to maximize its ability to respond to such incidents in a region. We show that this problem can be represented via a maximal arc-covering model.We discuss two...