All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 191

Showing per page

Metric spaces with point character equal to their size

C. Avart, P. Komjath, Vojtěch Rödl (2010)

Commentationes Mathematicae Universitatis Carolinae

In this paper we consider the point character of metric spaces. This parameter which is a uniform version of dimension, was introduced in the context of uniform spaces in the late seventies by Jan Pelant, Cardinal reflections and point-character of uniformities, Seminar Uniform Spaces (Prague, 1973–1974), Math. Inst. Czech. Acad. Sci., Prague, 1975, pp. 149–158. Here we prove for each cardinal κ , the existence of a metric space of cardinality and point character κ . Since the point character can...

Migrativity properties of 2-uninorms over semi-t-operators

Ying Li-Jun, Qin Feng (2022)

Kybernetika

In this paper, we analyze and characterize all solutions about α -migrativity properties of the five subclasses of 2-uninorms, i. e. C k , C k 0 , C k 1 , C 1 0 , C 0 1 , over semi-t-operators. We give the sufficient and necessary conditions that make these α -migrativity equations hold for all possible combinations of 2-uninorms over semi-t-operators. The results obtained show that for G ∈ C k , the α -migrativity of G over a semi-t-operator F μ , ν is closely related to the α -section of F μ , ν or the ordinal sum representation of t-norm...

Minimal monads

Karel Čuda, Blanka Vojtášková (1987)

Commentationes Mathematicae Universitatis Carolinae

Minimal predictors in hat problems

Christopher S. Hardin, Alan D. Taylor (2010)

Fundamenta Mathematicae

We consider a combinatorial problem related to guessing the values of a function at various points based on its values at certain other points, often presented by way of a hat-problem metaphor: there are a number of players who will have colored hats placed on their heads, and they wish to guess the colors of their own hats. A visibility relation specifies who can see which hats. This paper focuses on the existence of minimal predictors: strategies guaranteeing at least one player guesses correctly,...

Minimality of non-σ-scattered orders

Tetsuya Ishiu, Justin Tatch Moore (2009)

Fundamenta Mathematicae

We will characterize-under appropriate axiomatic assumptions-when a linear order is minimal with respect to not being a countable union of scattered suborders. We show that, assuming PFA⁺, the only linear orders which are minimal with respect to not being σ-scattered are either Countryman types or real types. We also outline a plausible approach to demonstrating the relative consistency of: There are no minimal non-σ-scattered linear orders. In the process of establishing these results, we will...

Minimizing and maximizing a linear objective function under a fuzzy max - * relational equation and an inequality constraint

Zofia Matusiewicz (2022)

Kybernetika

This paper provides an extension of results connected with the problem of the optimization of a linear objective function subject to max - * fuzzy relational equations and an inequality constraint, where * is an operation. This research is important because the knowledge and the algorithms presented in the paper can be used in various optimization processes. Previous articles describe an important problem of minimizing a linear objective function under a fuzzy max - * relational equation and an inequality constraint,...

Currently displaying 81 – 100 of 191