Related papers: A Complex Primitive $N$th Root Of Unity: A Very El…

We present an approach (the biroot method) for nth root approximation that yields closed-form rational functions with coefficients derived from binomial structures, Gaussian functions, or qualifying DAG structures. The method emerges from…

Many problems in applied mathematics require root finding algorithms. Unfortunately, root finding methods have limitations. Firstly, regarding the convergence, there is a trade-off between the size of it's domain and it's rate. Secondly the…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

We formulate the Root Extraction problem in finite Abelian $p$-groups and then extend it to generic finite Abelian groups. We provide algorithms to solve them. We also give the bounds on the number of group operations required for these…

We introduce and study the notion of slightly trivial extensions of a fusion category which can be viewed as the first level of complexity of extensions. We also provide two examples of slightly trivial extensions which arise from rank $3$…

They run our lives, if you believe the hype in the news, but there is no precise definition of "algorithms" which is generally accepted by the mathematicians, logicians and computer scientists who create and study them. My main aims here…

We show that the full group C$^*$-algebra of the free product of two nontrivial countable amenable discrete groups, where at least one of them has more than two elements, is primitive. We also show that in many cases, this C$^*$-algebra is…

We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…

Following the Perron-Frobenius theorem, the spectral radius of a primitive matrix is a simple eigenvalue. It is shown that for a primitive matrix $A$, there is a positive rank one matrix $X$ such that $B = A \circ X$, where $\circ$ denotes…

We present a simple approach to discrete q-Hermite polynomials with special emphasis on analogies with the classical case.

Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…

Let $E$ be any directed graph, and $K$ any field. We classify those graphs $E$ for which the Leavitt path algebra $L_K(E)$ is primitive. As a consequence, we obtain classes of examples of von Neumann regular prime rings which are not…

In this paper, we explore the use of path idempotents for the Hecke algebra of type $A$ at roots of unity. For $q$ a primitive $\ell$-th root of unity we obain a non-unital imbedding of (a quotient of) the group algebra of $S_m$ into (a…

A vanishing sum of roots of unity is called minimal if no proper, nonempty sub-sum of it vanishes. This paper classifies all minimal vanishing sums of roots of unity of weight at most 16 by hand, thereby uncovering new phenomena beyond the…

We investigate the construction of circulant matrices derived from primitive roots over finite fields. Our approach reduces exponential sums to Jacobi sums, thereby establishing explicit connections between character theory and matrix…

Consider any nonzero univariate polynomial with rational coefficients, presented as an elementary algebraic expression (using only integer exponents). Letting sigma(f) denotes the additive complexity of f, we show that the number of…

Let $n$ be an even positive integer with at most three distinct prime factors and let $\ze_n$ be a primitive $n$-th root of unity. In this study, we made an attempt to find the lowest-degree $0,1$-polynomial $f(x) \in \Q[x]$ having at least…

This paper contains an algebraic constructive and self-contained account of the invariance rule of the digital root under division for an arbitrary natural basis representation. Both the cases of repeating and non-repeating fractionals are…

Noncompact forms of the Drinfeld-Jimbo quantum groups U_q(g) with (H_i)* = H_i, (X_i^{+-})* = s_i X_i^{-+} for s_i= +-1 are studied at roots of unity. This covers g = so(n,2p), su(n,p), so*(2l), sp(n,p), sp(l,R), and exceptional cases.…