Related papers: Commuting degree for BCK-algebras
We investigate how well complex algebraic numbers can be approximated by algebraic numbers of degree at most n. We also investigate how well complex algebraic numbers can be approximated by algebraic integers of degree at most n+1. It…
For finite dimensional algebras over algebraically closed fields, we study the sets of pairwise Hom-orthogonal modules and obtain new results on some open conjectures on the behaviour of bricks and several related problems, which we…
We first study some properties of images of commuting differential operators of polynomial algebras of order one with constant leading coefficients. We then propose what we call the image conjecture on these differential operators and show…
An element $a$ of a lattice cups to an element $b > a$ if there is a $c < b$ such that $a \cup c = b$. An element of a lattice has the cupping property if it cups to every element above it. We prove that there are non-zero honest elementary…
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…
We provide $\mathbb{N}$-filtrations on the negative part $U_q(\mathfrak{n}^-)$ of the quantum group associated to a finite-dimensional simple Lie algebra $\mathfrak{g}$, such that the associated graded algebra is a skew-polynomial algebra…
Two areas of mathematics which have received substantial attention in recent years are the theory of optimal transport and the Elliott classification programme for C*-algebras. We combine these two seemingly unrelated disciplines to make…
We consider $\Lambda$ an artin algebra and $n \geq 2$. We study how to compute the left and right degrees of irreducible morphisms between complexes in a generalized standard Auslander-Reiten component of ${\mathbf{C_n}({\rm proj}\,…
The variety of bicommutative algebras is the class of all nonassociative algebras satisfying the polynomial identities $(x_1x_2)x_3=(x_1x_3)x_2$ and $x_1(x_2x_3)=x_2(x_1x_3)$. In this paper we provide a complete description of varieties of…
A subset $A$ of a Boolean algebra $B$ is said to be $(n,m)$-reaped if there is a partition of unity $P \subset B$ of size $n$ such that the cardinality of $\{b \in P: b \wedge a \neq \emptyset\}$ is greater than or equal to $m$ for all…
In a previous work, the first and third authors studied a random knot model for all two-bridge knots using billiard table diagrams. Here we present a closed formula for the distribution of the crossing numbers of such random knots. We also…
Classical and quantum conduction on a bond-diluted Bethe lattice is considered. The bond dilution is subject to the constraint that every occupied bond must have at least $k-1$ neighboring occupied bonds, i.e. $k$-core diluted. In the…
Suppose two Hermitian matrices $A,B$ almost commute ($\Vert [A,B] \Vert \leq \delta$). Are they close to a commuting pair of Hermitian matrices, $A',B'$, with $\Vert A-A' \Vert,\Vert B-B'\Vert \leq \epsilon$? A theorem of H. Lin shows that…
We classify (possibly non commutative) algebras of low rank over a domain R. We first review results for algebras of rank 2 and for finite-dimensional division algebras over the real numbers. These results motivate us to consider which…
Let $\mathbb{F}$ be a finite field and let $f$ be a linear polynomial in $\mathbb{F}[x]$. We investigate the number of polynomials of degree $d$ which commute with $f$ under composition. In so doing, we rediscover a result of Park, but with…
We prove that the commutator is stable in permutations endowed with the Hamming distance, that is, two permutations that almost commute are near two commuting permutations. Our result extends to $k$-tuples of almost commuting permutations,…
We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homology with the highest probability: either zero or…
Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…
For every integer $d\ge 1$, there is a unital closed subalgebra $A_d\subset B(H)$ with similarity degree equal precisely to $d$, in the sense of our previous paper. This means that for any unital homomorphism $u\colon A_d\to B(H)$ we have…
Let $B$ be a rational function of degree at least two that is neither a Latt\`es map nor conjugate to $z^{\pm n}$ or $\pm T_n$. We provide a method for describing the set $C_B$ consisting of all rational functions commuting with $B.$…