Related papers: Solution sets of systems of equations over finite …
Many real applications problems can be encoded easily as quantified formulas in SMT. However, this simplicity comes at the cost of difficulty during solving by SMT solvers. Different strategies and quantifier instantiation techniques have…
An algebra $S$ is called a Skolem-Noether algebra (SN algebra for short) if for every central simple algebra $R$, every homomorphism $R\to R\otimes S$ extends to an inner automorphism of $R\otimes S$. One of the important properties of such…
Based on the complete-lattice approach, a new Lagrangian duality theory for set-valued optimization problems is presented. In contrast to previous approaches, set-valued versions for the known scalar formulas involving infimum and supremum…
We denote by Conc(A) the semilattice of all finitely generated congruences of an (universal) algebra A, and we define Conc(V) as the class of all isomorphic copies of all Conc(A), for A in V, for any variety V of algebras. Let V and W be…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
A semigroup $S$ is called an equational domain if any finite union of algebraic sets over $S$ is algebraic. We prove some necessary and sufficient conditions for a completely simple semigroup to be an equational domain.
We define and study semilattices and lattices for $E$-closed families of theories. Properties of these semilattices and lattices are investigated. It is shown that lattices for families of theories with least generating sets are…
We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…
We present a Galois theory connecting finitary operations with pairs of finitary relations one of which is contained in the other. The Galois closed sets on both sides are characterised as locally closed subuniverses of the full iterative…
The notion of commutation of operations in universal algebra leads to the concept of centralizer clone and gives rise to a well-known class of problems that we call centralizer problems, in which one seeks to determine whether a given set…
Let A be an associative algebra with identity over a field k. An atomistic subsemiring R of the lattice of subspaces of A, endowed with the natural product, is a subsemiring which is a closed atomistic sublattice. When R has no zero…
Nowadays, data are generated massively and rapidly from scientific fields as bioinformatics, neuroscience and astronomy to business and engineering fields. Cluster analysis, as one of the major data analysis tools, is therefore more…
We study the algebraic dynamics of self-correspondences on a curve. A self-correspondence on a (proper and smooth) curve $C$ over an algebraically closed field is the data of another curve $D$ and two non-constant separable morphisms…
We investigate homological properties of perfect algebras of prime characteristic. The principle is as follows: perfect algebras resolve the singularities. For example, we show any module over the ring of absolute integral closure has…
We study algebraicity and smoothness of fixed point stacks for flat group schemes which have a finite composition series whose factors are either reductive or proper, flat, finitely presented, acting on algebraic stacks with affine,…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
As well-known, in a finitary algebraic structure the set $\Gamma$ of all the non-generators is the intersection of all the maximal proper substructures. In particular, $\Gamma$ is a substructure. We show that the corresponding statements…
Alon and F\"uredi (European J. Combin., 1993) proved that any family of hyperplanes that covers every point of the Boolean cube $\{0,1\}^n$ except one must contain at least $n$ hyperplanes. We obtain two extensions of this result, in…
We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…
We show that the Schreier sets $\mathcal{S}_{\alpha}\ (\alpha<\omega_1)$ satisfy the following dichotomy property. For every hereditary collection $\cf$ of finite subsets of $\N$, either there exists infinite $M=(m_i)_1^{\infty}\subseteq\N$…