Page 1 Next

Displaying 1 – 20 of 71

Showing per page

Families of strongly projective graphs

Benoit Larose (2002)

Discussiones Mathematicae Graph Theory

We give several characterisations of strongly projective graphs which generalise in many respects odd cycles and complete graphs [7]. We prove that all known families of projective graphs contain only strongly projective graphs, including complete graphs, odd cycles, Kneser graphs and non-bipartite distance-transitive graphs of diameter d ≥ 3.

Finite atomistic lattices that can be represented as lattices of quasivarieties

K. Adaricheva, Wiesław Dziobiak, V. Gorbunov (1993)

Fundamenta Mathematicae

We prove that a finite atomistic lattice can be represented as a lattice of quasivarieties if and only if it is isomorphic to the lattice of all subsemilattices of a finite semilattice. This settles a conjecture that appeared in the context of [11].

Finite basis problem for 2-testable monoids

Edmond Lee (2011)

Open Mathematics

A monoid S 1 obtained by adjoining a unit element to a 2-testable semigroup S is said to be 2-testable. It is shown that a 2-testable monoid S 1 is either inherently non-finitely based or hereditarily finitely based, depending on whether or not the variety generated by the semigroup S contains the Brandt semigroup of order five. Consequently, it is decidable in quadratic time if a finite 2-testable monoid is finitely based.

Finite Symmetric Functions with Non-Trivial Arity Gap

Shtrakov, Slavcho, Koppitz, Jörg (2012)

Serdica Journal of Computing

Given an n-ary k-valued function f, gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. In the present paper we study the properties of the symmetric function with non-trivial arity gap (2 ≤ gap(f)). We prove several results concerning decomposition of the symmetric functions with non-trivial arity gap with its minors or subfunctions. We show that all non-empty sets of...

Finitely generated almost universal varieties of 0 -lattices

Václav Koubek, Jiří Sichler (2005)

Commentationes Mathematicae Universitatis Carolinae

A concrete category 𝕂 is (algebraically) universal if any category of algebras has a full embedding into 𝕂 , and 𝕂 is almost universal if there is a class 𝒞 of 𝕂 -objects such that all non-constant homomorphisms between them form a universal category. The main result of this paper fully characterizes the finitely generated varieties of 0 -lattices which are almost universal.

Currently displaying 1 – 20 of 71

Page 1 Next