Results 261 to 270 of about 5,923,679 (293)

On Complete Symmetric Functions

SIAM Journal on Mathematical Analysis, 1988
This paper is devoted to the study of some properties of the complete symmetric functions. These functions play an important role in the theory of partitions and in the combinatorics as well. Among other things, the representation formulas as well as the recurrence formulas and inequalities involving functions under discussion are given.
openaire   +1 more source

Differential Symmetric Functions

Annals of Combinatorics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Properties of Symmetric Fitness Functions

IEEE Transactions on Evolutionary Computation, 2006
The properties of symmetric fitness functions are investigated. We show that the search spaces obtained from symmetric functions have the zero-correlation structures between fitness and distance. It is also proven that symmetric functions induce a class of the hardest problems in terms of the epistasis variance and its variants.
Sung-Soon Choi, Yung-Keun Kwon, Byung Ro Moon   +2 more
openaire   +1 more source

The q-deformation of symmetric functions and the symmetric group

Journal of Physics A: Mathematical and General, 1991
Summary: The \(q\)-deformation of symmetric functions is introduced leading to \(q\)- analogues of many well-known relationships in the theory of symmetric functions, \(q\)-deformed scalar products are developed and used to define \(q\)-dependent symmetric functions.
Salam, M. A., Wybourne, B. G.
openaire   +1 more source

Symmetric Polynomials and Symmetric Functions

1995
In Chapter 17 of [371] we have studied symmetric polynomials called zonal polynomials. In this chapter we consider other types of symmetric polynomials as well as their generalizations called symmetric functions (symmetric “polynomials” of an infinite number of indeterminates).
N. Ja. Vilenkin, A. U. Klimyk
openaire   +1 more source

Symmetric Functions and Symmetric Species

1986
Publisher Summary This chapter introduces the notion of symmetric species, which can be viewed as a set-theoretic (a category-theoretic) counterpart of the notion of a symmetric function. To each of the classical classes of symmetric functions, the chapter associates a symmetric species.
BONETTI F., ROTA G. C., SENATO D, VENEZIA, Antonietta   +3 more
openaire   +2 more sources

On MacDonald's Symmetric Functions

Bulletin of the London Mathematical Society, 1992
An algorithm for computing Macdonald's two-parameter symmetric functions is suggested. A transition matrix from the basis of power sums to the basis of Macdonald's functions is constructed recursively (with respect to the dominance partial order on partitions) by a method analogous to Shoji's method of computing the Green functions of \(\text{GL}(n,q)\)
openaire   +2 more sources

Some Generalizations of Quasi-symmetric Functions and Noncommutative Symmetric Functions

2000
In this paper, we investigate various kinds of generalisations of symmetric functions. The classical algebra Sym of symmetric functions is embedded in QSym, the algebra of quasi-symmetric functions, and is also a quotient of the algebra Sym of noncommutative symmetric functions.
Duchamp, G., Hivert, Florent, Thibon, Jean-Yves   +2 more
openaire   +2 more sources

Generalized symmetric and generalized pseudo-symmetric functions

ICECS'99. Proceedings of ICECS '99. 6th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.99EX357), 2003
We introduce generalized symmetric and generalized pseudo-symmetric functions which can be represented as regular two-dimensional linear arrays. It is possible due in part to generalized symmetries, which can be used when functions are represented using exor-based decompositions. We also identify and use local symmetries.
openaire   +2 more sources

Symmetric Ternary Switching Functions

IEEE Transactions on Electronic Computers, 1966
This paper develops a theory of symmetric ternary switching functions and presents systematic methods for their detection, identification and synthesis. Shannon's theory of binary symmetric functions is extended to ternary functions by defining a set of five ``priming'' operations which, together with the ``permutation'' operations, form a group ...
openaire   +2 more sources