Related papers: Counting Involutions on Multicomplex Numbers

Multiplicative convolution $\mu \ast \nu$ of two finite signed measures $\mu$ and $\nu$ on $\mathbb{R}^n$ and a related product $\mu \circledast \nu$ on the sphere $S^{n-1}$ are studied. For fixed $\mu$ the injectivity in $\nu$ of both…

This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation…

A well-labelled positive path of size n is a pair (p,\sigma) made of a word p=p_1p_2...p_{n-1} on the alphabet {-1, 0,+1} such that the sum of the letters of any prefix is non-negative, together with a permutation \sigma of {1,2,...,n} such…

Using elementary means, we prove several identities involving the M\"obius function, generalizing in the multidimensional case well-known formulas coming from convolution arguments.

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

We present an explicit bijection between finite-decimal real numbers and natural numbers ($\mathbb{N} = \{1, 2, 3, ...\}$) using a systematic 4-tuple parametrization with closed-form mathematical formulas for enumeration. Our enumeration…

In this paper, we study the staircase encoding of permutations, which maps a permutation to a staircase grid with cells filled with permutations. We consider many cases, where restricted to a permutation class, the staircase encoding…

In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…

We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…

We study the computational complexity of converting one representation of real numbers into another representation. Typical examples of representations are Cauchy sequences, base-10 expansions, Dedekind cuts and continued fractions.

This paper shows that a finite discrete convolution involving Stirling numbers of both kinds and harmonic numbers can be expressed in terms of the Bernoulli numbers. As applications of this expression, the linear recurrence relation for the…

In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…

A generalization of the Chu-Vandermonde convolution is presented and proved with the integral representation method. This identity can be transformed into another identity, which has as special cases two known identities. Another identity…

We consider a group SO(2n+1) over a p-adic field, and tempered irreducible representations of this group, of unipotent reduction. We use the construction due to Lusztig of these representations. In an old paper with Moeglin, we have defined…

We give a bijection between ordered $m$-clusters and (complete) $m$-exceptional sequences, a concept that we introduce for this purpose. This holds for all hereditary artin algebras. This extends the bijection in the $m = 1$ case shown in…

Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers…

We provide a bijective proof of the equidistribution of two pairs of vincular patterns in permutations, thereby resolving a recent open problem of Bitonti, Deb, and Sokal (arXiv:2412.10214). Since the bijection is involutive, we also…