Related papers: On composition-closed classes of Boolean functions
Let A be a finitely generated associative algebra over an algebraically closed field. We characterize the finite dimensional modules over A whose orbit closures are regular varieties.
A clone on a set X is a set of finitary operations on X which contains all the projections and is closed under composition. The set of all clones forms a complete lattice Cl(X) with greatest element O, the set of all finitary operations.…
We present generalization of the Bloom variety theorem of ordered algebras in fuzzy setting. We introduce algebras with fuzzy orders which consist of sets of functions which are compatible with particular binary fuzzy relations called fuzzy…
In this paper we define a class of Boolean and generalized Boolean functions defined on $\mathbb{F}_2^n$ with values in $\mathbb{Z}_q$ (mostly, we consider $q=2^k$), which we call landscape functions (whose class containing generalized…
Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…
We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…
The main properties of indefinite Kac-Moody and Borcherds algebras, considered in a unified way as Lorentzian algebras, are reviewed. The connection with the conformal field theory of the vertex operator construction is discussed. By the…
We classify the Boolean degree $1$ functions of $k$-spaces in a vector space of dimension $n$ (also known as Cameron-Liebler classes) over the field with $q$ elements for $n \geq n_0(k, q)$. This also implies that two-intersecting sets with…
Given a bounded lattice $L$ with bounds $0$ and $1$, it is well known that the set $\mathsf{Pol}_{0,1}(L)$ of all $0,1$-preserving polynomials of $L$ forms a natural subclass of the set $\mathsf{C}(L)$ of aggregation functions on $L$. The…
Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…
We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
Starting from an extension of the Poisson bracket structure and Kubo-Martin-Schwinger-property of classical statistical mechanics of continuous systems to spin systems, defined on a lattice, we derive a series of, as we think, new and…
The following result has been shown recently in the form of a dichotomy: For every total clone $C$ on $\mathbf{2} := \{0,1\}$, the set $\mathcal{I}(C)$ of all partial clones on $\mathbf{2}$ whose total component is $C$, is either finite or…
Sheaves are objects of a local nature: a global section is determined by how it looks locally. Hence, a sheaf cannot describe mathematical structures which contain global or nonlocal geometric information. To fill this gap, we introduce the…
We propose developing the theory of consequences of morasses relevant in mathematical applications in the language alternative to the usual one, replacing commonly used structures by families of sets originating with Velleman's neat…
The goal of this paper is to formalize the notion of The Compositional Integral in The Complex Plane. We prove a convergence theorem guaranteeing its existence. We prove an analogue of Cauchy's Integral Theorem--and suggest an approach at…
Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.
This paper presents an investigation on the structure of conditional events and on the probability measures which arise naturally in this context. In particular we introduce a construction which defines a (finite) {\em Boolean algebra of…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…