EuDML | Browse

Items

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 161

Complete generators and maximal completions of $M V$ -algebras

Ján Jakubík (1998)

Czechoslovak Mathematical Journal

Complete permutability of partitions in a set. I

Jitka Ševečková, František Šik (1989)

Archivum Mathematicum

Completely dissociative groupoids

Milton Braitt, David Hobby, Donald Silberger (2012)

Mathematica Bohemica

In a groupoid, consider arbitrarily parenthesized expressions on the $k$ variables $x_{0}, x_{1}, \dots x_{k - 1}$ where each $x_{i}$ appears once and all variables appear in order of their indices. We call these expressions $k$ -ary formal products, and denote the set containing all of them by $F^{σ} (k)$ . If $u, v \in F^{σ} (k)$ are distinct, the statement that $u$ and $v$ are equal for all values of $x_{0}, x_{1}, \dots x_{k - 1}$ is a generalized associative law. Among other results, we show that many small groupoids are completely dissociative, meaning that no generalized associative law holds...

Completely Regular and Orthodox Congruences on Regular Semigroups

Branka Alimpić, Dragica N. Krgović (1993)

Publications de l'Institut Mathématique

Completely regular and orthodox congruences on regular semigroups.

Alimpić, Branka P., Krgović, Dragica N. (1993)

Publications de l'Institut Mathématique. Nouvelle Série

Completeness criteria and invariants for operation and transformation algebras.

Jakubíková-Studenovská, Danica, Mašulović, Dragan, Pöschel, Reinhard (2004)

Beiträge zur Algebra und Geometrie

Completeness, functional completeness and relative completeness.

Doroslovački, Rade, Pantović, Jovanka, Tošić, Ratko, Vojvodić, Gradimir (1999)

Novi Sad Journal of Mathematics

Completeness theorem for the Evans logic of identities.

Sheremet, M.S. (2004)

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]

Complétion et complétude selon H. Andreka et I. Nemeti

F. Cury (1992)

Diagrammes

Completion varieties

W. Bartol, D. Niwiński, L. Rudak (1985)

Colloquium Mathematicae

Complexity of hypersubstitutions and lattices of varieties

Thawhat Changphas, Klaus Denecke (2003)

Discussiones Mathematicae - General Algebra and Applications

Hypersubstitutions are mappings which map operation symbols to terms. The set of all hypersubstitutions of a given type forms a monoid with respect to the composition of operations. Together with a second binary operation, to be written as addition, the set of all hypersubstitutions of a given type forms a left-seminearring. Monoids and left-seminearrings of hypersubstitutions can be used to describe complete sublattices of the lattice of all varieties of algebras of a given type. The complexity...

Complexity of terms, composition, and hypersubstitution.

Denecke, Klaus, Wismath, Shelly L. (2003)

International Journal of Mathematics and Mathematical Sciences

Composition of axial functions of products of finite sets

Krzysztof Płotka (2007)

Colloquium Mathematicae

We show that every function f: A × B → A × B, where |A| ≤ 3 and |B| < ω, can be represented as a composition f₁ ∘ f₂ ∘ f₃ ∘ f₄ of four axial functions, where f₁ is a vertical function. We also prove that for every finite set A of cardinality at least 3, there exist a finite set B and a function f: A × B → A × B such that f ≠ f₁ ∘ f₂ ∘ f₃ ∘ f₄ for any axial functions f₁, f₂, f₃, f₄, whenever f₁ is a horizontal function.

Composition-representative subsets.

Griffing, Gary (2003)

Theory and Applications of Categories [electronic only]

Computability potential scales of $n$ -element algebras with restrictions on arity.

Pinus, A.G. (2005)

Sibirskij Matematicheskij Zhurnal

Computing the greatest $𝐗$ -eigenvector of a matrix in max-min algebra

Ján Plavka (2016)

Kybernetika

A vector $x$ is said to be an eigenvector of a square max-min matrix $A$ if $A \otimes x = x$ . An eigenvector $x$ of $A$ is called the greatest $𝐗$ -eigenvector of $A$ if $x \in 𝐗 = {x; \underset{̲}{x} \leq x \leq \bar{x}}$ and $y \leq x$ for each eigenvector $y \in 𝐗$ . A max-min matrix $A$ is called strongly $𝐗$ -robust if the orbit $x, A \otimes x, A^{2} \otimes x, \dots$ reaches the greatest $𝐗$ -eigenvector with any starting vector of $𝐗$ . We suggest an $O (n^{3})$ algorithm for computing the greatest $𝐗$ -eigenvector of $A$ and study the strong $𝐗$ -robustness. The necessary and sufficient conditions for strong $𝐗$ -robustness are introduced and an efficient...

Currently displaying 81 – 100 of 161