Related papers: Reflection factorizations of Singer cycles
Let $G$ be a finite reductive group defined over a finite field $F_q$. In the case where $G$ is a special linear group, we compute the multiplicities of irreducible characters of $G(F_{q^2})$ with the character of $G(F_{q^2})$ induced from…
This paper considers a restriction to non-negative matrix factorization in which at least one matrix factor is stochastic. That is, the elements of the matrix factors are non-negative and the columns of one matrix factor sum to 1. This…
The construction of shortest feedback shift registers for a finite sequence S_1,...,S_N is considered over the finite ring Z_{p^r}. A novel algorithm is presented that yields a parametrization of all shortest feedback shift registers for…
Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…
Given a positive integer $r$ and a prime power $q$, we estimate the probability that the characteristic polynomial $f_{A}(t)$ of a random matrix $A$ in $\mathrm{GL}_{n}(\mathbb{F}_{q})$ is square-free with $r$ (monic) irreducible factors…
In our previous paper math.QA/0412192 the Cayley-Hamilton identity for the GL(m|n) type quantum matrix algebra was obtained. Here we continue investigation of that identity. We derive it in three alternative forms and, most importantly, we…
We discuss the structure of infrared singularities in on-shell QCD amplitudes with massive partons and present a general factorization formula in the limit of small parton masses. The factorization formula gives rise to an all-order…
In symmetric groups, studies of permutation factorizations or triples of permutations satisfying certain conditions have a long history. One particular interesting case is when two of the involved permutations are long cycles, for which…
We prove a version of Sylvester's law of inertia for the Reflection Equation Algebra (=REA). We will only be concerned with the REA constructed from the $R$-matrix associated to the standard $q$-deformation of $GL(N,\mathbb{C})$. For $q$…
We develop a simple recursive approach to treat reversible condensation polymerization with cyclization. Based upon a minimum set of balance equations, the law of mass action, Gaussian chain statistics, and the assumption of independent…
The number of ordered factorizations and the number of recursive divisors are two related arithmetic functions that are recursively defined. But it is hard to construct explicit representations of these functions. Taking advantage of their…
We study the (variable-length) codes of the form X u {a^n}, where X c a*wa* and |X| = n. We extend various notions and results from factorizations of cyclic groups theory to this type of codes. In particular, when n is the product of at…
In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group $G$ is said to admit a uniform group factorization if there…
We find the super-replication formulae which would be a generalization of replication formulae. And we apply the formulae to derive periodically vanishing property in the Fourier coefficients of the Hauptmodul ${\cal N}(j_{1,12})$ as a…
A compact T-algebra is an initial T-algebra whose inverse is a final T-coalgebra. Functors with this property are said to be algebraically compact. This is a very strong property used in programming semantics which allows one to interpret…
In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…
We consider the canonical quantization scheme for $c \leq 1$ ($(p,q)$ -) string theories and compare it with what is known from matrix model approach. We derive explicitly a trivial ($\equiv $ topological) solution. We discuss a ``dressing"…
We continue work started in [1] concerning integer sequences q(n), n in N, defined by q(n) = q(n-q(n-1)) + f(n), with q(1) = 1. Here, f(n), with f(1) = 0, is a given sequence. We define F as the set of semi-infinite sequence f such that the…
Several musical scales, like the major scale, can be described as finite arithmetic sequences modulo octave, i.e. chunks of an arithmetic sequence in a cyclic group. Hence the question of how many different arithmetic sequences in a cyclic…
We consider a stochastic sequence $\xi(m)$ with periodically stationary generalized multiple increments of fractional order which combines cyclostationary, multi-seasonal, integrated and fractionally integrated patterns. The filtering…