Related papers: Minimal factorizations of a cycle: a multivariate …

This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis…

This is half an overview article since what we describe here is essentially known. We describe $KK$-theory by generators and relations in a formal sum of formal products of $*$-homomorphisms and some synthetical morphisms. What comes out is…

We generalize Menon's identity by considering sums representing arithmetical functions of several variables. As an application, we give a formula for the number of cyclic subgroups of the direct product of several cyclic groups of arbitrary…

We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…

We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that…

In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item…

Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…

We study the maximum multiplicity $\mathcal{M}(k,n)$ of a simple transposition $s_k=(k \: k+1)$ in a reduced word for the longest permutation $w_0=n \: n-1 \: \cdots \: 2 \: 1$, a problem closely related to much previous work on sorting…

$ n-$cycle permutation polynomials with small n have the advantage that their compositional inverses are efficient in terms of implementation. These permutation polynomials have significant applications in cryptography and coding theory. In…

When we study the Karnaugh map in the switching theory course, we learn that the ones in the map must be combined in groups of $a \times b$ elements, being $a$ and $b$ powers of two. The result is the logic function described as a sum of…

The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…

A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal…

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…

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

Let $k$ be a field of characteristic two. We prove that a non constant monic polynomial $f\in k[X]$ of degree $n$ is the minimal/characteristic polynomial of a symmetric matrix with entries in $k$ if and only if it is not the product of…

Bipartite calculus is a direct generalization of Kauffman planar expansion from $N=2$ to arbitrary $N$, applicable to the restricted class of knots which are entirely made of antiparallel lock tangles. Whenever applicable, it allows a…

We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous Cayley formula, which states that the number of labeled…

Let G be a finite group. We study the group of G-equivariant self-homotopy equivalences of product of G-spaces. For a product of n-spaces, we represent it as product of n-subgroups under the assumption of equivariant reducibility. Further…

A perfect $1$-factorisation of a graph is a decomposition of that graph into $1$-factors such that the union of any two $1$-factors is a Hamiltonian cycle. A Latin square of order $n$ is row-Hamiltonian if for every pair $(r,s)$ of distinct…