Related papers: Deciding absorption in relational structures
Let S be a subring of the ring R. We investigate the question of whether S intersected by U(R) is equal to U(S) holds for the units. In many situations our answer is positive. There is a special emphasis on the case when R is a full matrix…
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
We show that an A-infinity algebra structure can be transferred to a projective resolution of the complex underlying any A-infinity algebra. Under certain connectedness assumptions, this transferred structure is unique up to homotopy. In…
We show that the Fra\"iss\'e limit of a category of unital separable $C^*$-algebras which is sufficiently closed under tensor products of its objects and morphisms is strongly self-absorbing, given that it has approximate inner half-flip.…
For a finite lattice $\Lambda$, $\Lambda$-ultrametric spaces have, among other reasons, appeared as a means of constructing structures with lattices of equivalence relations embedding $\Lambda$. This makes use of an isomorphism of…
We give a presentation of a finite crystallographic reflection group in terms of an arbitrary seed in the corresponding cluster algebra of finite type and interpret the presentation in terms of companion bases in the associated root system.
It has been conjectured that finite tensor categories have finitely generated cohomology. We show that this is equivalent to finitely generated Hochschild cohomology for the endomorphism algebras of the projective generators.
A group is metabelian if its commutator subgroup is abelian. For finitely generated metabelian groups, classical commutative algebra, algebraic geometry and geometric group theory, especially the latter two subjects, can be brought to bear…
Suppose we wish to embed an (associative) $k$-algebra $A$ in a $k$-algebra $R$ generated in some specified way; e.g., by two elements, or by copies of given $k$-algebras $A_1,$ $A_2,$ $A_3.$ Several authors have obtained sufficient…
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An important class of algebras are those that generate congruence…
A submodule $W$ of $V$ is summand absorbing, if $x + y \in W$ implies $x \in W, \; y \in W $ for any $x, y \in V$. Such submodules often appear in modules over (additively) idempotent semirings, particularly in tropical algebra. This paper…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this word-related…
We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…
Given a finite connected bipartite graph, finite-dimensional indecomposable semisimple Leibniz algebras are constructed. Furthermore, any finite-dimensional indecomposable semisimple Leibniz algebra admits a similar construction.
On a finite structure, the polymorphism invariant relations are exactly the primitively positively definable relations. On infinite structures, these two sets of relations are different in general. Infinitary primitively positively…
We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
We show that semiprojectivity of a C*-algebra is preserved when passing to C*-subalgebras of finite codimension. In particular, any pullback of two semiprojective C*-algebras over a finite-dimensional C*-algebra is again semiprojective.
A rank one local system on the complement of a hyperplane arrangement is said to be admissible if it satisfies certain non-positivity condition at every resonant edges. It is known that the cohomology of admissible local system can be…