Related papers: Three-factor decompositions of $\mathbb{U}_n$ with…

We have classified, upto isoclinism, certain groups with a given central factor. As an application, we classify, upto isoclinism, groups having at the most nine element centralizers. Among other results of independent interest, we have…

Given a factor code between sofic shifts X and Y, there is a family of decompositions of the original code into factor codes such that the entropies of the intermediate subshifts arising from the decompositions are dense in the interval…

We present a sharp upper bound for the number of generators of a finite group in terms of the ratio between the order and the exponent.

The groups distinguish their von Neumann algebras, in the case when these are factors.

This paper is dedicated to the factorizations of the symmetric group. Introducing a new bijection for partitioned 3-cacti, we derive an el- egant formula for the number of factorizations of a long cycle into a product of three permutations.…

We use the SmallGroups Library to find the finite subgroups of U(3) of order smaller than 512 which possess a faithful three-dimensional irreducible representation. From the resulting list of groups we extract those groups that can not be…

In this paper we introduce an Euclidean decomposition of elements a_n of an increasing sequence of natural numbers into weight * level + jump which we use to classify the numbers a_n either by weight or by level. We then show that this…

We consider uniformly resolvable decompositions of $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We give a partial solution for the case in which all resolution classes are either…

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

We decompose into irreducible factors the ${\rm SU}(2)$ Witten-Reshetikhin-Turaev representations of the mapping class group of a genus $2$ surface when the level is $p=4r$ and $p=2r^2$ with $r$ an odd prime and when $p=2r_1r_2$ with $r_1$,…

We study the cyclic $U(\mathfrak{gl}_n)$-module generated by the $l$-th power of the $\alpha$-determinant. When $l$ is a non-negative integer, for all but finite exceptional values of $alpha$, one shows that this cyclic module is isomorphic…

We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…

The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials $\Phi_n^*(x)$. They can be written as certain products of cyclotomic poynomials. We study the case where $n$ has two or three distinct prime…

Let G=SL_3(Z/pZ), p a prime. Let A be a set of generators of G. Then A grows under the group operation. To be precise: denote by |S| the number of elements of a finite set S. Assume |A| < |G|^{1-\epsilon} for some \epsilon>0. Then |A\cdot…

We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…

This paper presents no new results; its goals are purely pedagogical. A special case of the Cartan Decomposition has found much utility in the field of quantum computing, especially in its sub-field of quantum compiling. This special case…

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

We obtain some simple relations between decomposition numbers of quantized Schur algebras at an n-th root of unity (over a field of characteristic 0). These relations imply that every decomposition number for such an algebra occurs as a…

We give in this paper a new construction of factors of type ${\rm III_1}$. Under certain assumptions, we can, thanks to a result by Popa, give a complete classification for this family of factors. Although these factors are never full, we…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…