Related papers: Two identities of derangements

We classify all irreducible admissible representations of three Olshanski pairs connected to the infinite symmetric group. In particular, our methods yield two simple proofs of the classical Thoma's description of the characters of the…

An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…

We give a new expression of the multiple harmonic sum, which serves as a refinement of the iterated integral expression of the multiple zeta value, and prove it using the so-called connected sum method. Based on this fact, by taking two…

In this paper we introduce the definition of marked permutations. We first present a bijection between Stirling permutations and marked permutations. We then present an involution on Stirling derangements. Furthermore, we present a…

Multidimensional combinatorial substitutions are rules that replace symbols by finite patterns of symbols in $\mathbb Z^d$. We focus on the case where the patterns are not necessarily rectangular, which requires a specific description of…

In this note we show that the known relation between double groupoids and matched pairs of groups may be extended, or seems to extend, to the triple case. The references give some other occurrences of double groupoids.

We propose a new refinement of the McKay conjecture and we prove it for symmetric groups.

The Weil Conjectures are applied to the Hessenberg Varieties to obtain interesting information about the combinatorics of descents in the symmetric group. Combining this with elementary linear algebra leads to elegant proofs of some…

Recently N.Jing discovered a certain combinatorial identity from validity of the Serre relations in some vertex representations of quantum Kac-Moody algebras. We generalize this identity, in particular, extending it from polynomials to…

Identities of complex irreducible representations of finite groups can be explicitly constructed from character value sets. Among other things, these identities determine representations up to Gassmann equivalency. Some examples of…

We prove irreducibility and mutual inequivalence for certain unitary representations of R. Thompson's groups F and T.

We derive two new generalizations of the Busche-Ramanujan identities involving the multiple Dirichlet convolution of arithmetic functions of several variables. The proofs use formal multiple Dirichlet series and properties of symmetric…

We present a new and useful congruence identity satisfied by m-permutable varieties.

We combinatorially prove Tetranacci, Tetranacci-Fibonacci, and additional identities using only squares and dominoes on a hexagonal double-strip. Some of these are new proofs of old identities, and others we believe have never been seen…

Using an elementary approach involving the Euler Beta function and the binomial theorem, we derive two polynomial identities; one of which is a generalization of a known polynomial identity. Two well-known combinatorial identities, namely…

In this paper, we obtain a generalization of an identity due to Carlitz on Bernoulli polynomials. Then we use this generalized formula to derive two symmetric identities which reduce to some known identities on Bernoulli polynomials and…

We provide the combinatorial proofs of the log-convexity for the derangement numbers in the symmetric group $\mathfrak{S}_n$, hyperoctahedral group $\mathfrak{B}_n$, and the demihyperoctahedral group $\mathfrak{D}_n$. We also show that the…

In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix.…

A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…

In this paper we formulate combinatorial identities that give representation of positive integers as linear combination of even powers of 2 with binomial coefficients. We present side by side combinatorial as well as computer generated…