Related papers: Bitwise Triangular Coordinates for Central Product…

This paper introduces a class of extended central factorial numbers generated by a parity-dependent recurrence relation, termed the "flickering operator". We demonstrate that the resulting triangular structure, now indexed as OEIS A395021,…

We propose a novel quaternion product unit (QPU) to represent data on 3D rotation groups. The QPU leverages quaternion algebra and the law of 3D rotation group, representing 3D rotation data as quaternions and merging them via a weighted…

Let $n,k,$ and $r$ be nonnegative integers and let $S_n$ be the symmetric group. We introduce a quotient $R_{n,k,r}$ of the polynomial ring $\mathbb{Q}[x_1, \dots, x_n]$ in $n$ variables which carries the structure of a graded $S_n$-module.…

We study the decomposition of tensor products between a Steinberg module and a costandard module, both as a module for the algebraic group $G$ and when restricted to either a Frobenius kernel $G_r$ or a finite Chevalley group…

In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…

We study polynomial families {f_n(x)}_{n>=0} over a commutative ring R encoded by triangular arrays of order m, via expansions of the form f_n(x)=sum_{b=0}^{floor(n/m)} lambda_1(n,b) x^{n-mb}, where lambda_1 is the direct kernel supported…

We study certain polynomial trace identities in the group $SL(2,\IC)$ and their application in the theory of discrete groups. We obtain canonical representations for two generator groups in \S 4 and then in \S 5 we give a new proof for…

We propose a new approach to extending the notion of commutator and Lie algebra to algebras with ternary multiplication laws. Our approach is based on ternary associativity of the first and second kind. We propose a ternary commutator,…

We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of…

A systematic study of holomorphic gauge invariant operators in general $\mathcal{N}=1$ quiver gauge theories, with unitary gauge groups and bifundamental matter fields, was recently presented in [1]. For large ranks a simple counting…

We announce a series of results on the combinatorial study of the q-Catalan triangle (C_{n,k}(q)), defined by C_{n,0}(q)=q^{n(n-1)/2} and C_{n,k}(q)=C_{n,k-1}(q)+q^{n-k-1}C_{n-1,k}(q). We establish combinatorial interpretations via a…

Trialitarian triples are triples of central simple algebras of degree 8 with orthogonal involution that provide a convenient structure for the representation of trialitarian algebraic groups as automorphism groups. This paper explicitly…

We continue the investigation of Boolean-like algebras of dimension n (nBA) having n constants e1,...,en, and an (n+1)-ary operation q (a "generalised if-then-else") that induces a decomposition of the algebra into n factors through the…

The explicit matrix realizations of the reversion anti-automorphism and the spin group depend on the set of matrices chosen to represent a basis of 1 -vectors for a given Clifford algebra. On the other hand, there are iterative procedures…

An important code of length $n^2$ is obtained by taking centralizer of a square matrix over a finite field $\mathbb{F}_q$. Twisted centralizer codes, twisted by an element $a \in \mathbb{F}_q$, are also similar type of codes but different…

Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…

Let $A$ be an expanding matrix on ${\Bbb R}^s$ with integral entries. A fundamental question in the fractal tiling theory is to understand the structure of the digit set ${\mathcal D}\subset{\Bbb Z}^s$ so that the integral self-affine set…

The Collatz iteration is governed by two distinct update rules, depending on the parity of the current iterate: n(i+1)=3n(i)+1 for odd n(i), and n(i+1)=n(i)/2 for even n(i). We show that these rules can be written equivalently as a single…

A permutationally invariant n-bit code for quantum error correction can be realized as a subspace stabilized by the non-Abelian group S_n. The code corresponds to bases for the trivial representation, and all other irreducible…

Let $A$, $B$, and $C$ be three $n\times n$ matrices. We investigate the problem of verifying whether $AB=C$ over the ring of integers and finding the correct product $AB$. Given that $C$ is different from $AB$ by at most $k$ entries, we…