Related papers: On the clone of aggregation functions on bounded l…
The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…
The main problem of clone theory is to describe the clone lattice for a given basic set. For a two-element basic set this was resolved by E.L. Post, but for at least three-element basic set the full structure of the lattice is still…
We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a…
The concept of a clone is central to many branches of mathematics, such as universal algebra, algebraic logic, and lambda calculus. Abstractly a clone is a category with two objects such that one is a countably infinite power of the other.…
We study compatible aggregation functions on a general bounded distributive lattice $L$, where the compatibility is related to the congruences on $L$. As a by-product, a new proof of an earlier result of G. Gr\"atzer is obtained. Moreover,…
We characterize minimal clones generated by a majority function containing at most seven ternary operations.
We construct a theory of holant clones to capture the notion of expressibility in the holant framework. Their role is analogous to the role played by functional clones in the study of weighted counting Constraint Satisfaction Problems. We…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
Clonoids are sets of finitary operations between two algebraic structures that are closed under composition with their term operations on both sides. We conjecture that, for finite modules $\mathbf A$ and $\mathbf B$ there are only finitely…
Our goal is to develop a limit approach for a class of problems in additive combinatorics that is analogous to the limit theory of dense graph sequences. We introduce metric, convergence and limit objects for functions on groups and for…
Let A be a finite non-singleton set. For |A|=2 we show that the partial clone consisting of all selfdual monotone partial functions on A is not finitely generated, while it is the intersection of two finitely generated maximal partial…
This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.
Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute multiplicities of K-types in the discrete series using a rational expression for a generating function…
We introduce the blockwise gluing construction. This describes residuated integral chains which can be decomposed into (possibly) partial algebras, stacked one on top of the other, and such that elements in a certain component multiply in…
The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…
We review a few results concerning interpolation of monotone functions on infinite lattices, emphasizing the role of set-theoretic considerations. We also discuss a few open problems.
The general Galois theory for functions and relational constraints over arbitrary sets described in the authors' previous paper is refined by imposing algebraic conditions on relations.
We investigate the finitary functions from a finite product of finite fields $\prod_{j =1}^m\mathbb{F}_{q_j} = \mathbb{K}$ to a finite product of finite fields $\prod_{i =1}^n\mathbb{F}_{p_i} = \mathbb{F}$, where $|\mathbb{K}|$ and…
The optimization of submodular functions on the integer lattice has received much attention recently, but the objective functions of many applications are non-submodular. We provide two approximation algorithms for maximizing a…
The clone lattice Cl(X) over an infinite set X is a complete algebraic lattice with 2^X compact elements. We show that every algebraic lattice with at most 2^X compact elements is a complete sublattice of Cl(X).