相关论文: Centralizer clones relative to a strong limit card…

Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…

A common theme in mathematics is to define generalized solutions to deal with problems that potentially do not have solutions. A classical example is the introduction of least squares solutions via the normal equations associated with a…

We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in…

We consider a couple of versions of classical Kurosh problem (whether there is an infinite-dimensional algebraic algebra?) for varieties of linear multioperator algebras over a field. We show that, given an arbitrary signature, there is a…

We introduce a class of permutation centralizer algebras which underly the combinatorics of multi-matrix gauge invariant observables. One family of such non-commutative algebras is parametrised by two integers. Its Wedderburn-Artin…

Given an infinite set X and an ideal I of subsets of X, the set of all finitary operations on X which map all (powers of) I-small sets to I-small sets is a clone. In a 2001 article, G. Czedli and L. Heindorf asked whether or not for two…

Simple cardinality refers to counting nonzero elements of an independent variable satisfying certain properties. Composite cardinality is a simple counting process composited with an affine mapping, and is therefore more complicated than…

We define a family of algebras \mathsf{FH}_{m} which generalise the Farahat-Higman algebra introduced in [FH59] by replacing the role of the center of the group algebra of the symmetric groups with centraliser algebras of symmetric groups.…

Let u be a word over the positive integers. Motivated in part by a question from representation theory, we study the centralizer set of u which is C(u) = {w | uw is Knuth-equivalent to wu}. In particular, we give various necessary…

We prove automatic continuity theorems for "decomposable" or "local" linear transformations between certain natural subspaces of operator algebras. The transformations involved are not algebra homomorphisms but often are module…

We investigate the closed convex hull of unitary orbits of selfadjoint elements in arbitrary unital C*-algebras. Using a notion of majorization against unbounded traces, a characterization of these closed convex hulls is obtained.…

For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A iff each one is a substitution instance of the other using operations from C. We study the clones for…

The notion of associativity (which differs from the straightforward generalization of the usual associativity given by the move of parentheses in the relevant expression) for operations of high arity is introduced. It is proved that the…

We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…

In this paper we consider centralizers of single elements in Ore extensions of the ring of polynomials in one variable over a field. We show that they are commutative and finitely generated as an algebra. We also show that for certain…

We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…

This paper is a continuation of [GLT], which develops a level theory and establishes strong character bounds for finite simple groups of linear and unitary type in the case that the centralizer of the element has small order compared to…

This paper revisits the universal asymmetric $1 \to 2$ quantum cloning problem. We identify the symmetry properties of this optimisation problem, giving us access to the optimal quantum cloning map. Furthermore, we use the bipolar theorem,…

The code equivalence problem is central in coding theory and cryptography. While classical invariants are effective for Hamming and rank metrics, the sum-rank metric, which unifies both, introduces new challenges. This paper introduces new…

We consider the affine vertex algebra at the critical level associated with the centralizer of a nilpotent element in the Lie algebra $\mathfrak{gl}_N$. Due to a recent result of Arakawa and Premet, the center of this vertex algebra is an…