Truncated homogeneous symmetric functions

Let $h_\lambda$, $e_\lambda$, and $m_\lambda$ denote the homogeneous symmetric function, the elementary symmetric function and the monomial symmetric function associated with the partition $\lambda$ respectively. We give combinatorial interpretations for the coefficients that arise in expanding $m_\lambda$ in terms of homogeneous symmetric functions and the elementary symmetric functions. Such coefficients are interpreted in terms of certain classes of bi-brick permutations. The theory of Lyndon words is shown to play an important role in our interpretations.

The elementary, complete homogeneous, and power sum symmetric functions

Two important classes of symmetric Boolean functions are the equal-weight Boolean functions and the elementary (or homogeneous) symmetric Boolean functions. In this paper we studied the equal-weight symmetric Boolean functions. First the Walsh spectra of the equal-weight symmetric Boolean functions are given. Second the sufficient and necessary condition on correlation-immunity of the equal-weight symmetric Boolean function is derived and other cryptology properties such as the nonlinearity, balance and propagation criterion are taken into account. In particular, the nonlinearity of the equal-weight symmetric Boolean functions with n (n ≥ 10) variables is determined by their Hamming weight. Considering these properties will be helpful in further investigations of symmetric Boolean functions.

We present the basic elements of a generalization of symmetric function theory involving functions of commuting and anticommuting (Grassmannian) variables. These new functions, called symmetric functions in superspace, are invariant under the diagonal action of the symmetric group on the sets of commuting and anticommuting variables. In this work, we present the superspace extension of the classical bases, namely, the monomial symmetric functions, the elementary symmetric functions, the completely symmetric functions, and the power sums. Various basic results, such as the generating functions for the multiplicative bases, Cauchy formulas, involution operations as well as the combinatorial scalar product are also generalized.

In 1992, Loeb (Adv Math, 91:64–74, 1992) considered a natural extension of the binomial coefficients to negative entries and gave a combinatorial interpretation in terms of hybrid sets. He showed that many of the fundamental properties of binomial coefficients continue to hold in this extended setting. Recently, Formichella and Straub (Ann Comb, 23:725–748, 2019) showed that these results can be extended to the q-binomial coefficients with arbitrary integer values and extended the work of Loeb further by examining the arithmetic properties of the q-binomial coefficients. In this paper, we give an alternative combinatorial interpretation in terms of lattice paths and consider an extension of the more general weight-dependent binomial coefficients, first defined by Schlosser (Sém Lothar Combin, 81:24, 2020), to arbitrary integer values. Remarkably, many of the results of Loeb, Formichella and Straub continue to hold in the general weighted setting. We also examine important special cases of the weight-dependent binomial coefficients, including ordinary, q- and elliptic binomial coefficients as well as elementary and complete homogeneous symmetric functions.

In this note we prove with a bijective argument that every monomial symmetric function is a polynomial with integer coefficients in the elementary symmetric functions.

In [24] the authors introduced inhomogeneous bases of the ring of symmetric functions. The elements in these bases have the property that they evaluate to characters of symmetric groups. In this article we develop further properties of these bases by proving product and coproduct formulae. In addition, we give the transition coefficients between the elementary symmetric functions and the irreducible character basis.

Recursive relations for objects of statistical interest have long been important for computation, and they remain so even with hugely improved computing power. Such recursions are frequently derived by exploiting relations between generating functions. For example, the top-order zonal polynomials that occur in much distribution theory under normality can be recursively related to other (easily computed) symmetric functions (power-sum and elementary symmetric functions; Ruben, 1962,Annals of Mathematical Statistics33, 542–570; Hillier, Kan, and Wang, 2009,Econometric Theory25, 211–242). Typically, in a recursion of this type thekth object of interest,dk, say, is expressed in terms of all lower orderdj’s. In Hillier et al. (2009) we pointed out that, in the case of top-order zonal polynomials and other invariant polynomials of multiple matrix argument, afixed lengthrecursion can be deduced. We refer to this as a short recursion. The present paper shows that the main results in Hillier et al. (2009) can be generalized and that short recursions can be obtained for a much larger class of objects/generating functions. As applications, we show that short recursions can be obtained for various problems involving quadratic forms in noncentral normal vectors, including moments, product moments, and expectations of ratios of powers of quadratic forms. For this class of problems, we also show that the length of the recursion can be further reduced by an application of a generalization of Horner’s method (cf. Brown, 1986,SIAM Journal on Scientific and Statistical Computing7, 689–695), producing a super-short recursion that is significantly more efficient than even the short recursion.

Rotation symmetric functions have been used as components of different cryptosystems. Functions in this class are invariant under circular translation of indices. In this paper, we will do some enumeration on homogeneous rotation symmetric functions over F p . A formula for counting homogeneous rotation symmetric functions over F p is presented when gcd(n ,d ) is a prime power, where n is the number of input variables and d is the algebraic degree of the function, which demonstrates that we solved one of the problems in [7].

Description of Minimum Weight Codewords of Cyclic Codes by Algebraic Systems

Rotation Symmetric Boolean Functions –; Count and Cryptographic Properties

On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2

The richly developed theory of complex manifolds plays important roles in our understanding of holomorphic functions in several complex variables. It is natural to consider manifolds that will play similar roles in the theory of holomorphic functions in several non-commuting variables. In this paper we introduce the class of \emph{nc-manifolds}, the mathematical objects that at each point possess a neighborhood that has the structure of an \emph{nc-domain} in the \emph{$d$-dimensional nc-universe $\m^d$}. We illustrate the use of such manifolds in free analysis through the construction of the non-commutative Riemann surface for the matricial square root function. A second illustration is the construction of a non-commutative analog of the elementary symmetric functions in two variables. For any symmetric domain in $\m^2$ we construct a 2-dimensional non-commutative manifold such that the symmetric holomorphic functions on the domain are in bijective correspondence with the holomorphic functions on the manifold. We also derive a version of the classical Newton-Girard formulae for power sums of two non-commuting variables.

The q-Stirling numbers of both kinds are specializations of the complete or elementary symmetric functions. In this note, we use this fact to prove that the q-Stirling numbers can be expressed in terms of the q-binomial coefficients and vice versa.

The r-Whitney numbers of both kinds are specializations of complete and elementary symmetric functions. In this paper, we use this fact to express a finite discrete convolution involving r-Whitney numbers of both kinds in terms of Bernoulli polynomials.