Related papers: Reconstruction of weak bialgebra maps and its appl…

We give a description of a weakly continuous rank preserving map on a reflexive algebra on complex Hilbert space with commutative completely distributive subspace lattice. We show that the implementation of a rank preserving map can be…

We study a special class of weakly associative algebras: the symmetric Leibniz algebras. We describe the structure of the commutative and skew symmetric algebras associated with the polarization-depolarization principle. We also give a…

We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…

We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…

We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite…

Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications in algebraic geometry and beyond. We have previously reported on an implementation of CAD in Maple which offers…

In this paper, we give a purely cohomological interpretation of the extension problem for associative algebras; that is the problem of extending an associative algebra by another associative algebra. We then give a similar interpretation of…

We extend the Dong-Mason theorem on the irreducibility of modules for orbifold vertex algebras from [C. Dong, G. Mason, Duke Math. J. 86 (1997)] 305-321] for the category of weak modules. Let $V$ be a vertex operator algebra, $g$ an…

This paper is devoted to the complete algebraic classification of complex 5-dimensional nilpotent bicommutative algebras.

We give here some precisions and improvements about the validity of the explicit reconstruction of any holomorphic function on a ball of $\mathbb{C}^2$ from its restrictions on a family of complex lines. Such validity depends on the mutual…

This thesis is devoted to the proof of a theorem showing the existence of a closed model category structure for weakly enriched categories. It requires first of all the definitions of weakly enriched categories and equivalences of weakly…

We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…

We study general properties of multipliers and weak multipliers of algebras. We apply the results to determine the (weak) multipliers of associative algebras and zeropotent algebras of dimension 3 over an algebraically closed field.

Assume $A$ is weakly symmetric, indecomposable, with radical cube zero and radical square non-zero. We show that such algebra of wild representation type does not have a non-projective module $M$ whose ext algebra is finite-dimensional.…

An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

The aim of this work is to show how we can decompose a module (if decomposable) into an indecomposable module with the help of the minimization process.

We give a simple, elementary proof that a uniform algebra is weakly sequentially complete if and only if it is finite-dimensional.

We define a notion of a weak canonical base for a partial type. This notion is weaker than the usual canonical base for an amalgamation base. We prove that certain family of partial types have a weak canonical base. This family clearly…

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…