Displaying 21 – 40 of 2109

Showing per page

A classification of rational languages by semilattice-ordered monoids

Libor Polák (2004)

Archivum Mathematicum

We prove here an Eilenberg type theorem: the so-called conjunctive varieties of rational languages correspond to the pseudovarieties of finite semilattice-ordered monoids. Taking complements of members of a conjunctive variety of languages we get a so-called disjunctive variety. We present here a non-trivial example of such a variety together with an equational characterization of the corresponding pseudovariety.

A clone-theoretic formulation of the Erdos-Faber-Lovász conjecture

Lucien Haddad, Claude Tardif (2004)

Discussiones Mathematicae Graph Theory

The Erdős-Faber-Lovász conjecture states that if a graph G is the union of n cliques of size n no two of which share more than one vertex, then χ(G) = n. We provide a formulation of this conjecture in terms of maximal partial clones of partial operations on a set.

A deceptive fact about functions

Wiesław Dziobiak, Andrzej Ehrenfeucht, Jacqueline Grace, Donald Silberger (2000)

Fundamenta Mathematicae

The paper provides a proof of a combinatorial result which pertains to the characterization of the set of equations which are solvable in the composition monoid of all partial functions on an infinite set.

A duality between infinitary varieties and algebraic theories

Jiří Adámek, Václav Koubek, Jiří Velebil (2000)

Commentationes Mathematicae Universitatis Carolinae

A duality between λ -ary varieties and λ -ary algebraic theories is proved as a direct generalization of the finitary case studied by the first author, F.W. Lawvere and J. Rosick’y. We also prove that for every uncountable cardinal λ , whenever λ -small products commute with 𝒟 -colimits in Set , then 𝒟 must be a λ -filtered category. We nevertheless introduce the concept of λ -sifted colimits so that morphisms between λ -ary varieties (defined to be λ -ary, regular right adjoints) are precisely the functors...

A duality for isotropic median algebras

Miroslav Ploščica (1992)

Commentationes Mathematicae Universitatis Carolinae

We establish categorical dualities between varieties of isotropic median algebras and suitable categories of operational and relational topological structures. We follow a general duality theory of B.A. Davey and H. Werner. The duality results are used to describe free isotropic median algebras. If the number of free generators is less than five, the description is detailed.

A dyadic view of rational convex sets

Gábor Czédli, Miklós Maróti, Anna B. Romanowska (2014)

Commentationes Mathematicae Universitatis Carolinae

Let F be a subfield of the field of real numbers. Equipped with the binary arithmetic mean operation, each convex subset C of F n becomes a commutative binary mode, also called idempotent commutative medial (or entropic) groupoid. Let C and C ' be convex subsets of F n . Assume that they are of the same dimension and at least one of them is bounded, or F is the field of all rational numbers. We prove that the corresponding idempotent commutative medial groupoids are isomorphic iff the affine space F n ...

A factorization of quasiorder hypergroups

Ivan Chajda, Šárka Hošková (2004)

Commentationes Mathematicae Universitatis Carolinae

The contribution is devoted to the question of the interchange of the construction of a quasiorder hypergroup from a quasiordered set and the factorization.

A Finite Axiomatization of Nondeterministic Regular Expressions

Flavio Corradini, Rocco De Nicola, Anna Labella (2010)

RAIRO - Theoretical Informatics and Applications

An alternative (tree-based) semantics for a class of regular expressions is proposed that assigns a central rôle to the + operator and thus to nondeterminism and nondeterministic choice. For the new semantics a consistent and complete axiomatization is obtained from the original axiomatization of regular expressions by Salomaa and by Kozen by dropping the idempotence law for + and the distribution law of • over +.

Currently displaying 21 – 40 of 2109