Representations of finite sets and correspondences
International audience
Generalized allocation scheme with cell occupancies from a fixed finite set
Published in Discrete Mathematics and Applications
We consider a generalized scheme of allocation of n particles (elements) over unordered cells (components) under the condition that the number of particles in each cell belongs to a fixed finite set A of positive integers. A new asymptotic estimates for the total number In(A) of variants of allocations of n particles are obtained under some conditi...
On classes of functions of many-valued logic with minimal logarithmic growth rate
Published in Discrete Mathematics and Applications
We obtain a criterion for the minimal logarithmic growth rate for an arbitrary set with a given set of operations defined on it, i.e., we describe all finite sets A with operations on them such that the growth rate differs by at most a constant from the logarithmic growth rate to base ∣A∣.
Model Predictive Base Direct Speed Control of Induction Motor Drive—Continuous and Finite Set Approaches
In the paper a comparative study of the two control structures based on MPC (Model Predictive Control) for an electrical drive system with an induction motor are presented. As opposed to the classical approach, in which DFOC (Direct Field Oriented Control) with four controllers is considered, in the current study only one MPC controller is utilized...
The algebra of Boolean matrices, correspondence functors, and simplicity
We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence functor. The method uses the theory of such functors developed in [BT2, BT3], as well as some...
Tensor product of correspondence functors
As part of the study of correspondence functors, the present paper investigates their tensor product and proves some of its main properties. In particular, the correspondence functor associated to a finite lattice has the structure of a commutative algebra in the tensor category of all correspondence functors.
Polynomial Transformations of Random Variables on Finite Sets
Published in Mathematical Notes
A Synergetic Theory of Information
A new approach is presented to defining the amount of information, in which information is understood as the data about a finite set as a whole, whereas the average length of an integrative code of elements serves as a measure of information. In the framework of this approach, the formula for the syntropy of a reflection was obtained for the first ...
Correspondence functors and lattices
A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commu-tative ring. A main tool for this study is the construction of a correspondence functor associated to any finite lattice T. We prove for instance that this functor is projective if and only if the lattice T is ...
Correspondence functors and finiteness conditions
We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties which do not hold for other types of func-tors. In particular, if k is a field and if F is a cor...
