Related papers: On Hyperoctahedral Enumeration System, Application…

We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…

Let $H$ be a permutation group on a set $\Lambda$, which is permutationally isomorphic to a finite alternating or symmetric group $A_n$ or $S_n$ acting on the $k$-element subsets of points from $\{1,\ldots,n\}$, for some arbitrary but fixed…

Let $\pi=(\pi_1,\pi_2,\hdots,\pi_n)$ be permutation of the elements $1,2,\hdots,n. $ Positive integer $k\leq2^{n-1}$ we call index of $\pi,$ if in its binary notation as $n$-digital binary number, the 1's correspond to the ascent points. We…

We determine when an orthodox semigroup S has a permutation that sends each member of S to one of its inverses and show that if such a permutation exists, it may be taken to be an involution. In the case of a finite orthodox semigroup the…

It is well-known that any permutation can be written as a product of two involutions. We provide an explicit formula for the number of ways to do so, depending only on the cycle type of the permutation. In many cases, these numbers are sums…

In this paper, we compute the iterated derived sets of the set of multiple t-values under the usual topology of R. Our results imply that the set of multiple t-values, ordered by >=, is a well-ordered set.

We prove the existence of signed combinatorial interpretations for several large families of structure constants. These families include standard bases of symmetric and quasisymmetric polynomials, as well as various bases in Schubert…

In the paper we present a description of complex systems in terms of self-organization processes of prime integer relations. A prime integer relation is an indivisible element made up of integers as the basic constituents following a single…

A permutation is called mod-k-alternating if its entries are restricted to having the same remainder as the index, modulo some integer $k \geq 1.$ In this paper, we find the sign-balance for mod-k-alternating permutations with respect to…

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

We investigate how sorting algorithms efficiently overcome the exponential size of the permutation space. Our main contribution is a new continuous-time formulation of sorting as a gradient flow on the permutohedron, yielding an independent…

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

This work investigates preserving and reversing unimodality and convexity properties for sequences under transformations defined by sign-regular kernels. It is shown that these transformations only preserve these properties if the kernels…

We wrote this paper as an example to show the way we pass from ordered semigroups to ordered hypersemigroups.

We describe the spreading property for finite transitive permutation groups in terms of properties of their associated coherent configurations, in much the same way that separating and synchronising groups can be described via properties of…

A permutiple is a natural number that is a nontrivial multiple of a permutation of its digits in some base. Special cases of permutiples include cyclic numbers (multiples of cyclic permutations of their digits) and palintiple numbers…

In this note, we represent integers in a type of factoradic notation. Rather than use the corresponding Lehmer code, we will view integers as permutations. Given a pair of integers n and k, we give a formula for n mod k in terms of the…

Analysis on fractals is a growing field, with hints of potential for widespread applicability across all of STEM. One of the most heavily researched type of fractals are the nested fractals, fractal shapes defined by virtue of being made of…

Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…

Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member…