相关论文: Characterization of preclones by matrix collection…
Analogical proportions are 4-ary relations that read "A is to B as C is to D". Recent works have highlighted the fact that such relations can support a specific form of inference, called analogical inference. This inference mechanism was…
For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…
Given a braided tensor *-category C with conjugate (dual) objects and irreducible unit together with a full symmetric subcategory S we define a crossed product C\rtimes S. This construction yields a tensor *-category with conjugates and an…
Preenvelopes of acts over a monoid are defined by analogy with Enochs' definition of preenvelopes of modules. Provided that it is closed for pure subacts, a class of acts is shown to be preenveloping precisely when it is closed under direct…
In this paper we focus on functions of the form $A^n\rightarrow \mathcal{P}(B)$, for possibly different arbitrary non-empty sets $A$ and $B$, and where $\mathcal{P}(B)$ denotes the set of all subsets of $B$. These mappings are called…
We propose some new method of constructing configurations, which consists in consecutive inscribing copies of one underlying configuration. A uniform characterization of the obtained class and the one introduced in our paper untitled…
We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…
There is a connection between permutation groups and permutation patterns: for any subgroup $G$ of the symmetric group $S_\ell$ and for any $n \geq \ell$, the set of $n$-permutations involving only members of $G$ as $\ell$-patterns is a…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
This paper studies trace class perturbation of closed linear relations in Hilbert spaces. The concept of trace class perturbation of closed relations is introduced by orthogonal projections. Equivalent characterizations of compact and trace…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
The Galois lattice is a graphic method of representing knowledge structures. The first basic purpose in this paper is to introduce a new class of Galois lattices, called graded Galois lattices. As a direct result, one can obtain the notion…
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…
A desired closure property in Bayesian probability is that an updated posterior distribution be in the same class of distributions --- say Gaussians --- as the prior distribution. When the updating takes place via a statistical model, one…
The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern mining and formal concept…
Equivalence relations or, more general, quasiorders (i.e., reflexive and transitive binary relations) $\rho$ have the property that an $n$-ary operation $f$ preserves $\rho$, i.e., $f$ is a polymorphism of $\rho$, if and only if each…
We prove that the category of preordered groups contains two full reflective subcategories that give rise to some interesting Galois theories. The first one is the category of the so-called commutative objects, which are precisely the…
An expansive, monotone operator is dominating; if it is also idempotent it is a closure operator. Although they have distinct properties, these two kinds of discrete operators are also intertwined. Every closure operator is dominating;…
Many classes of maps are characterized as (possibly multi-valued) maps preserving particular types of compact filters.
Given $\texttt{S}|\texttt{R}$ a finite Galois extension of finite chain rings and $\mathcal{B}$ an $\texttt{S}$-linear code we define two Galois operators, the closure operator and the interior operator. We proof that a linear code is…