Related papers: A note on the Zassenhaus product formula
Let ${\Bbb F}_{n}$ be the free group of rank $n$ and let $\bigoplus C^{*}({\Bbb F}_{n})$ denote the direct sum of full group C$^{*}$-algebras $C^{*}({\Bbb F}_{n})$ of ${\Bbb F}_{n}$ $(1\leq n<\infty$). We introduce a new comultiplication…
We provide a new approach towards the analysis of the fusion products defined by B.~Feigin and S.~Loktev in the representation theory of (truncated) current Lie algebras. We understand the fusion product as a degeneration using Gr\"obner…
The main aim of the article is to show, in the absence of the Axiom of Choice, relationships between the following, independent of $\mathbf{ZF}$, statements: "Every countable product of compact metrizable spaces is separable (respectively,…
We derive a closed formula for a star-product on complex projective space and on the domain $SU(n+1)/S(U(1)\times U(n))$ using a completely elementary construction: Starting from the standard star-product of Wick type on $C^{n+1} \setminus…
Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…
Binomial Theorem for (N+n)^r is described with non-commuting variables N and n.
We prove a noncommutative Bader-Shalom factor theorem for lattices with dense projections in product groups. As an application of this result and our previous works, we obtain a noncommutative Margulis factor theorem for all irreducible…
Let C be a coalgebra over a field k and A its dual algebra. The category of C-comodules is equivalent to a category of A-modules. We use this to interpret the cotensor product M \square N of two comodules in terms of the appropriate…
Recently, Bapat and Kurata [\textit{Linear Algebra Appl.}, 562(2019), 135-153] defined the Cartesian product of two square matrices $A$ and $B$ as $A\oslash B=A\otimes \J+\J\otimes B$, where $\J$ is the all one matrix of appropriate order…
We describe an efficient algorithm to write any element of the alternating group A_n as a product of two n-cycles (in particular, we show that any element of A_n can be so written -- a result of E. A. Bertram). An easy corollary is that…
We say that two permutations $\pi$ and $\rho$ have separated descents at position $k$ if $\pi$ has no descents before position $k$ and $\rho$ has no descents after position $k$. We give a counting formula, in terms of reduced word tableaux,…
We apply the Clebsch-Gordan and Racah coefficients to calculate the double tensors for two equivalent d electrons. We also obtain the commutation relations for these double tensors and choose certain quantum numbers, which produce a…
A difference equation based method of determining two factors of a composite is presented. The feasibility of P-complexity is shown. Presentation of material is non-theoretical; intended to be accessible to a broader audience of non…
I discuss a formula decomposing the integral of time-ordered products of operators into sums of products of integrals of time-ordered commutators. The resulting factorization enables summation of an infinite series to be carried out to…
An exotic crossed product is a way of associating a C*-algebra to each C*-dynamical system that generalizes the well-known universal and reduced crossed products. Exotic crossed products provide natural generalizations of, and tools to…
A new definition for the Riemann zeta function for all positive integer number s > 1 is presented. We discover a most elegant expression and easy method for calculating the Riemann zeta function for small even integer values. Through this…
This article is devoted to present an explicit formula for the $c$th nilpotent multiplier of nilpotent products of some cyclic groups $G={\bf {Z}}\stackrel{n_1}{*}{\bf {Z}}\stackrel{n_2}{*}...\stackrel{n_{t-1}}{*}{\bf…
The binomial convolution of two sequences $\{a_n\}$ and $\{b_n\}$ is the sequence whose $n$th term is $\sum_{k=0}^{n} \binom{n}{k} a_k b_{n-k}$. If $\{a_n\}$ and $\{b_n\}$ have rational generating functions then so does their binomial…
We show that two tensor permutation matrices permutate tensor product of rectangle matrices. Some examples, in the particular case of tensor commutation matrices, for studying some linear matrix equations are given.
We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.