Related papers: Metacommutation in Central Simple Algebras

The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…

We prove that, in any field of characteristic not two and not three except the five-element field, each element decomposes into a product of four factors whose sum vanishes. We also find all $k,n,q$ such that every $n\times n$ matrix over…

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…

We study linear difference equations with variable coefficients in a ring using a new nonlinear method. In a ring with identity, if the homogeneous part of the linear equation has a solution in the unit group of the ring (i.e., a unitary…

A ring has bounded factorizations if every cancellative nonunit $a \in R$ can be written as a product of atoms and there is a bound $\lambda(a)$ on the lengths of such factorizations. The bounded factorization property is one of the most…

In this paper, we investigate subnormal subgroups of the multiplicative group of an almost locally simple artinian algebra with involution. In particular, we show that if either the set of traces or the set of norms of such a subgroup with…

We investigate bicomplex analogues of fundamental notions from classical algebraic number theory. In particular, we show that the primitive element theorem admits a natural generalization to bicomplex extensions, giving rise to two distinct…

The contraction is applied to obtaining of integrable systems associated with nonsemisimple algebras. The effect of contraction is splitting off some components from initial system without loss of integrability.

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

A cross matrix $X$ can have nonzero elements located only on the main diagonal and the anti-diagonal, so that the sparsity pattern has the shape of a cross. It is shown that $X$ can be factorized into products of matrices that are at most…

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2x2-matrix…

We investigate how sorting algorithms efficiently overcome the exponential size of the permutation space. Our main contribution is a new continuous-time formulation of sorting as a gradient flow on the permutohedron, yielding an independent…

We give an analog of Frobenius' theorem about the factorization of the group determinant on the group algebra of finite abelian groups and we extend it into dihedral groups and generalized quaternion groups. Furthermore, we describe the…

Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploit clustering of elements in order to achieve higher…

For all finite fields of $q$ elements where $q\equiv1\pmod4$ we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in…

A combinatorial object is said to be quasirandom if it exhibits certain properties that are typically seen in a truly random object of the same kind. It is known that a permutation is quasirandom if and only if the pattern density of each…