Related papers: Matrix Expression of Finite Boolean-type Algebras
We investigate the cluster-tilted algebras of finite representation type over an algebraically closed field. We give an explicit description of the relations for the quivers for finite representation type. As a consequence we show that a…
An algebra $L$ over a field $\Bbb F$, in which product is denoted by $[\,,\,]$, is said to be \textit{ Lie type algebra} if for all elements $a,b,c\in L$ there exist $\alpha, \beta\in \Bbb F$ such that $\alpha\neq 0$ and $[[a,b],c]=\alpha…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
Using Ohkawa's theorem that the collection of Bousfield classes is a set, we perform a number of constructions with Bousfield classes. In particular, we describe a greatest lower bound operator; we also note that a certain subset DL of the…
Let $A$ be a finite dimensional algebra over an algebraically closed field $k$. We investigate the structure properties of the endomorphism algebras of semi-tilting $A$-modules, and prove that the endomorphism algebras arising from the…
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…
In this article we study homotopes of finite-dimensional algebras (not necessarily, associative). In the case of associative algebras we study homotopes by methods of Category theory and give description of so-called well-tempered elements…
A finite algebra $\bA=\alg{A;\cF}$ is \emph{dualizable} if there exists a discrete topological relational structure $\BA=\alg{A;\cG;\cT}$, compatible with $\cF$, such that the canonical evaluation map $e\_{\bB}\colon \bB\to \Hom(…
$\nabla$-algebra is a natural generalization of Heyting algebra, unifying many algebraic structures including bounded lattices, Heyting algebras, temporal Heyting algebras and the algebraic presentation of the dynamic topological systems.…
An algebra is said to be \emph{$\tau$-tilting finite} provided it has only a finite number of $\tau$-rigid objects up to isomorphism. We associate a category to each such algebra. The objects are the wide subcategories of its category of…
In this paper using the connections between some subvarieties of residuated lattices, we investigated some properties of the lattice of ideals in commutative and unitary rings. We give new characterizations for commutative rings $A$ in…
Several structural properties of a universal algebra can be seen from the higher commutators of its congruences. Even on a finite algebra, the sequence of higher commutator operations is an infinite object. In the present paper, we exhibit…
Even the fastest SMT solvers have performance problems with regular expressions from real programs. Because these performance issues often arise from the problem representation (e.g. non-deterministic finite automata get determinized and…
Let B be a cluster-tilted algebra. We prove that B is $\tau$-tilting finite if and only if B is representation-finite.
We investigate free products of finite dimensional $C^*$-algebras with amalgamation over diagonal subalgebras. We look to determine under what circumstances a given free product is exact and/or nuclear. In some cases we find a description…
We introduce a generalized version of a q-Schur algebra (of parabolic type) for arbitrary Hecke algebras over extended Weyl groups. We describe how the decomposition matrix of a finite group with split BN-pair, with respect to a…
Alternating timed automata (ATA) are an extension of timed automata, that are closed under complementation and hence amenable to logic-to-automata translations. Several timed logics, including Metric Temporal Logic (MTL), can be converted…
Transition Algebra (TA) is a type of infinite logic introduced to discuss rewriting systems. The natural deductive proof systems already introduced in TA satisfy completeness for countable signatures. However, it lacks compactness, making…
In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…
We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure $M$ is cellular if and only if $M$ is $\omega$-categorical and mutually algebraic. Second,…