Related papers: Over-Mahonian numbers: Basic properties and unimod…

We present various identities in the form of convolutions involving Stirling numbers of both kinds, Lah numbers, and binomial coefficients. Certain convolution polynomials are discussed also. The proofs are based on several series…

We show that one-dimensional superspace is isomorphic to a non-trivial but consistent limit as $q\to-1$ of the braided line. Supersymmetry is identified as translational invariance along this line. The supertranslation generator and…

We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…

The multimodal Lambek calculus is an extension of the Lambek calculus that includes several product operations (some of them being commutative or/and associative), unary modalities, and corresponding residual implications. In this work, we…

We give a self-contained proof of the strongest version of Mason's conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials,…

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

We prove that several results in different areas of number theory such as the divergent series, summation of arithmetic functions, uniform distribution modulo one and summation over prime numbers which are currently considered to be…

Let $G$ be a group and $G_0 \subseteq G$ be a subset. A sequence over $G_0$ means a finite sequence of terms from $G_0$, where the order of elements is disregarded and the repetition of elements is allowed. A product-one sequence is a…

Superpermutations are words over a finite alphabet containing every permutation as a factor. Finding the minimal length of a superpermutation is still an open problem. In this article, we introduce superpermutations matrices. We establish a…

In [Trace identities and $\bf {Z}/2\bf {Z}$-graded invariants, {\it Trans. Amer. Math. Soc. \bf309} (1988), 581--589] we generalized the first and second fundamental theorems of invariant theory from the general linear group to the general…

This is the first part of a series of papers. The whole series aims to develop the tools for the study of all almost Hermitian symmetric structures in a unified way. In particular, methods for the construction of invariant operators, their…

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…

Permutation polynomials with explicit constructions over finite fields have long been a topic of great interest in number theory. In recent years, by applying linear translators of functions from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$, many…

We consider properties of overpartitions that are simultaneously {\ell}-regular and {\mu}-regular, where {\ell} and {\mu} are positive relatively prime integers. We prove a seven-way combinatorial identity related to these overpartitions.…

The purpose of this article is to delve into the properties of invariants. The properties, explained in [2], reveal new ways to develop algorithms that allow us to test the primality of a number. In this article, some of these are shown,…

Each element of the commutator subgroup of a group can be represented as a product of commutators. The minimal number of factors in such a product is called the commutator length of the element. The commutator length of a group is defined…

Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…

Toral automorphisms, represented by unimodular integer matrices, are investigated with respect to their symmetries and reversing symmetries. We characterize the symmetry groups of GL(n,Z) matrices with simple spectrum through their…

The algebra of invariants of d-tuples of n x n skew-symmetric matrices under the action of the orthogonal group by simultaneous conjugation is considered over an infinite field of characteristic different from two. For n=3 and d>0 a minimal…

In our earlier article~\cite{CanSakran} we initiated a study of the complement-finite submonoids of the group of integer points of a unipotent linear algebraic group. In the present article, we continue to develop tools and techniques for…