Related papers: Reflection factorizations of Singer cycles

The study of the set-theoretic solutions of the reflection equation, also known as reflection maps, is closely related to that of the Yang-Baxter maps. In this work, we construct reflection maps on various geometrical objects, associated…

Let J be a finite-dimensional nilpotent algebra over a finite field F_q. We formulate a procedure for analysing characters of the group 1+J. In particular, we study characters of the group $U_n (q)$ of unipotent triangular $n\times n$…

We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…

The capture calculus is an extension of System F<: that tracks free variables of terms in their type, allowing one to represent capabilities while limiting their scope. While previous calculi had mechanized soundness proofs -- notably…

Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…

Let $M_{d,n}(q)$ denote the number of monic irreducible polynomials in $\mathbb{F}_q[x_1, x_2, \ldots , x_n]$ of degree $d$. We show that for a fixed degree $d$, the sequence $M_{d,n}(q)$ converges $q$-adically to an explicitly determined…

We show that very simple continued fractions can be obtained for the ordinary generating functions enumerating permutations or D-permutations with a large number of independent statistics, when each cycle is given a weight $-1$. The proof…

Let $\mathbb{F}_q$ be a finite field of odd characteristic. We study R\'edei functions that induce permutations over $\mathbb{P}^1(\mathbb{F}_q)$ whose cycle decomposition contains only cycles of length $1$ and $j$, for an integer $j\geq…

Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for…

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

Inspired by factorized scattering from delta-type impurities in (1+1)-dimensional space-time, we propose and analyse a generalization of the Zamolodchikov-Faddeev algebra. Distinguished elements of the new algebra, called reflection and…

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

The N distinct prime numbers that make up a composite number M allow $2^{N-1}$ bi partioning into two relatively prime factors. Each such pair defines a pair of conjugate representations. These pairs of conjugate representations, each of…

The scalar difference equation $x_{n+1}=f_{n}(x_{n},x_{n-1},...,x_{n-k})$ may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind(S)$ of $S$ is defined to be the…

We discuss reflections identities of harmonic sums up to weight three. The need for this kind of identities emerges in analysis of the general structure of eigenvalue of the BFKL equation. The reflection identities decompose a product of…

We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information. We therefore investigate factor occurrence statistics in…

In this paper, we study factorizations of cycles. The main result is that under certain condition, the number of ways to factor a $d$-cycle into a product of cycles of prescribed lengths is $d^{r-2}.$ To prove our result, we first define a…

Let $f(x)\in {\mathbb Z}[x]$ be an $N$th degree polynomial that is monic and irreducible over ${\mathbb Q}$. We say that $f(x)$ is {\em monogenic} if $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of…

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…