Related papers: On minimal easily computable dimension group algeb…
We study semiprojective, subhomogeneous C*-algebras and give a detailed description of their structure. In particular, we find two characterizations of semiprojectivity for subhomogeneous C*-algebras: one in terms of their primitive ideal…
We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…
In this paper, we study the ideal structure of reduced $C^*$-algebras $C^*_r(G)$ associated to \'etale groupoids $G$. In particular, we characterize when there is a one-to-one correspondence between the closed, two-sided ideals in…
We develop the theory of difference algebraic groups in the case where we have finitely many pairwise commuting difference operators. We show that the defining ideal of a difference algebraic group is finitely generated as a difference…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime…
Generating functions for the size of a $r$-sphere, with respect to the Manhattan distance in an $n$-dimensional grid, are used to provide explicit formulas for the minimum and maximum size of an $r$-ball centered at a point of the grid.…
We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
We complete the description of group gradings on finite-dimensional incidence algebras. Moreover, we classify the finite-dimensional graded algebras that can be realized as incidence algebras endowed with a group grading.
We prove a number of results having to do with equipping type-I $\mathrm{C}^*$-algebras with compact quantum group structures, the two main ones being that such a compact quantum group is necessarily co-amenable, and that if the…
Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class…
The goal of this paper is to describe the structure of finite-dimensional semi-simple Leibniz algebras in characteristic zero. Our main tool in this endeavor are hemi-semidirect products. One of the major results of this paper is a…
In this paper, we propose and study $r$-minimal codes, a natural extension of minimal codes which have been extensively studied with respect to Hamming metric, rank metric and sum-rank metric. We first propose $r$-minimal codes in a general…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
Over fields of characteristic zero, we determine all absolutely irreducible Yetter-Drinfeld modules over groups that have prime dimension and yield a finite-dimensional Nichols algebra. To achieve our goal, we introduce orders of braided…
We show that Nichols algebras of most simple Yetter-Drinfeld modules over the projective special linear group over a finite field, corresponding to semisimple orbits, have infinite dimension. We introduce a new criterium to determine when a…
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
Exactly integrable systems connected to semisimple algebras of second rank with an arbitrary choice of grading are presented in explicit form. General solutions of these systems are expressed in terms of matrix elements of two fundamental…
An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…