Related papers: A New Symmetric Function Identity With an Applicat…

In combinatorics, P\'{o}lya's Enumeration Theorem is a powerful tool for solving a wide range of counting problems, including the enumeration of groups, graphs, and chemical compounds. In this paper, we present an extension of P\'{o}lya's…

We define an abelian group homomorphism $\mathscr{F}$, which we call the Frobenius transform, from the ring of symmetric functions to the ring of the symmetric power series. The matrix entries of $\mathscr{F}$ in the Schur basis are the…

Amdeberhan and Merca recently studied arithmetic properties of the sequence $a(n)$, the reciprocal of the crank parity function, which counts the number of integer partitions of weight $n$ whose even parts are monochromatic and whose odd…

We define a parametric variant of generalized Euler sums and construct contour integration to give some explicit evaluations of these parametric Euler sums. In particular, we establish several explicit formulas of (Hurwitz) zeta functions,…

For an even integer $k\geq 2$, let $f$ be a primitive holomorphic cusp form of weight $k$ for the full modular group $SL(2,\mathbb{Z})$ and let $\lambda_{{\rm{sym}}^jf}(n)$ denote the $n^\text{th}$ normalized Fourier coefficient of the…

Let G be any of the complex classical groups GL(n), SO(2n+1), Sp(2n), O(2n), let g denote the Lie algebra of G, and let Z(g) denote the subalgebra of G-invariants in the universal enveloping algebra U(g). We derive a Taylor-type expansion…

The class of Lambert series generating functions (LGFs) denoted by $L_{\alpha}(q)$ formally enumerate the generalized sum-of-divisors functions, $\sigma_{\alpha}(n) = \sum_{d|n} d^{\alpha}$, for all integers $n \geq 1$ and fixed real-valued…

We study a multi-symmetric generalization of the classical Schur functions called the multi-symmetric Schur functions. These functions form an integral basis for the ring of multi-symmetric functions indexed by tuples of partitions and are…

Binomial Eulerian polynomials first appeared in work of Postnikov, Reiner and Williams on the face enumeration of generalized permutohedra. They are $\gamma$-positive (in particular, palindromic and unimodal) polynomials which can be…

Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.

An identity is derived expressing Schur functions as sums over products of pairs of Schur $Q$-functions, generalizing previously known special cases. This is shown to follow from their representations as vacuum expectation values (VEV's) of…

We present a formulas to add a row or a column to the power, monomial, forgotten, Schur, homogeneous and elementary symmetric functions. As an application of these operators we show that the operator that adds a column to the Schur…

A graph can be regarded as an electrical network in which each edge is a resistor. This point of view relates combinatorial quantities, such as the number of spanning trees, to electrical ones such as effective resistance. The second and…

In 2020, Hamaker, Pawlowski, and Sagan introduced the \emph{pattern quasisymmetric functions}, which are quasisymmetric functions associated with pattern-avoidance classes of permutations, and defined via expansions in fundamental…

Sigmoid functions play an important role in many areas of applied mathematics, including machine learning, population dynamics and probability. We place the study of sigmoid functions in the context of the derivative sub-group of the group…

Let G be the group of points of a quasi-split reductive algebraic group over a local field F. It follows from the local Langlands conjectures that to every non-trivial additive character of F and every representation of the Langlands dual…

Inspired by Lehmer's conjecture on the nonvanishing of the Ramanujan $\tau$-function, one may ask whether an odd integer $\alpha$ can be equal to $\tau(n)$ or any coefficient of a newform $f(z)$. Balakrishnan, Craig, Ono, and Tsai used the…

In an earlier paper [1] it was shown that the Frobenius compound characters for the symmetric groups are related to the irreducible characters by a linear relation that involves a unitriagular coupling matrix that gives the Frobenius…

Formulas for the expansion of arbitrary invariant group functions in terms of the characters for the Sp(2N), SO(2N+1), and SO(2N) groups are derived using a combinatorial method. The method is similar to one used by Balantekin to expand…

The modified Macdonald polynomials introduced by Garsia and Haiman (1996) have many remarkable combinatorial properties. One such class of properties involves applying the $\nabla$ operator of Bergeron and Garsia (1999) to basic symmetric…