Related papers: Joins in the strong Weihrauch degrees
In this paper we focus on algebraic aspects of contractions of Lie and Leibniz algebras. The rigidity of algebras plays an important role in the study of their varieties. The rigid algebras generate the irreducible components of this…
Conjunctive table algebras are introduced and axiomatically characterized. A conjunctive table algebra is a variant of SPJR algebra (a weaker form of relational algebra), which corresponds to conjunctive queries with equality. The table…
The degree distribution of many biological and technological networks has been described as a power-law distribution. While the degree distribution does not capture all aspects of a network, it has often been suggested that its functional…
We prove that every distributive algebraic lattice with at most $\aleph\_1$ compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The $\aleph\_1$ bound is optimal, as…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…
In this paper we study the representation theory for certain ``half lattice vertex algebras.'' In particular we construct a large class of irreducible modules for these vertex algebras. We also discuss how the representation theory of these…
For an infinite chain bicomplex we show that the orthogonality and grading conditions provide it with the structure of a bigraded differential algebra with respect to a natural multiplication of several elements bicomplex spaces.…
Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce…
The Dowling lattice $Q_n(\mathfrak{G})$, $\mathfrak{G}$ a finite group, generalizes the geometric lattice generated by all vectors, over a field, with at most two nonzero components. Abstractly, it is a fundamental object in the…
In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…
This is a survey on formality results relying on weight structures. A weight structure is a naturally occurring grading on certain differential graded algebras. If this weight satisfies a purity property, one can deduce formality. Algebraic…
We study a new class of infinite dimensional Lie algebras, which has important applications to the theory of integrable equations. The construction of these algebras is very similar to the one for automorphic functions and this motivates…
We consider problems concerning the partial order structure of the set of spreading models of Banach spaces. We construct examples of spaces showing that the possible structure of these sets include certain classes of finite semi-lattices…
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…
Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…
Composition and lattice join (transitive closure of a union) of equivalence relations are operations taking pairs of decidable equivalence relations to relations that are semi-decidable, but not necessarily decidable. This article addresses…