Results 221 to 230 of about 5,044 (263)

b -Hurwitz numbers from refined topological recursion. [PDF]

open access: yesMath Ann
Kumar Chidambaram N   +2 more
europepmc   +1 more source

Symmetric boolean polynomials

Computational Mathematics and Mathematical Physics, 2010
Summary: Symmetric Boolean polynomials are a natural and long-term object of study in many branches of discrete mathematics. New facts concerning symmetric Boolean polynomials are presented, and applications in cryptography and for determining the number of zeros of symmetric polynomials are proposed.
V K Leont'Ev
exaly   +3 more sources

Interpolation with symmetric polynomials

Numerical Algorithms, 2016
Interpolation problems in more than one dimensional ambient spaces are studied in this article. Whenever the dimension of the ambient space is more than one, these problems are a lot more difficult to analyse than the classical univariate problems, for instance because not only convergence properties but also existence questions of interpolants ...
Jesús M. Carnicer, Carmen Godés
openaire   +3 more sources

Jacobians of Symmetric Polynomials

Annals of Combinatorics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lascoux, Alain, Pragacz, P.
openaire   +3 more sources

Algorithms for symmetrical polynomials

Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976
A special representation for symmetrical polynomials is introduced. Algorithms for the ring operations and for several versions of Gauss' method to express an arbitrary symmetrical polynomial by the elementary symmetrical functions are given and analyzed. Empirical observations show that the representation which is the most economical in terms of space
openaire   +2 more sources

On the representation of symmetric polynomials

Communications of the ACM, 1967
Relations are given between certain symmetric polynomials in the light of the theory of the symmetric group. Such an approach unifies earlier work and lends insight to previously published work by Aaron Booker. A generalization of Graeffe's root-squaring technique for the determination of the roots of a polynomial is suggested.
openaire   +2 more sources

Chromatic Polynomials and the Symmetric Group

Graphs and Combinatorics, 2004
The author gives a new combinatorial interpretation of the coefficients of chromatic polynomials of graphs in terms of subsets of permutations and introduces a combinatorially defined polynomial associated to a directed graph. He proves that it is related to the chromatic polynomials.
openaire   +1 more source

Krawtchouk Polynomials and the Symmetrization of Hypergroups

SIAM Journal on Mathematical Analysis, 1974
This paper introduces the method of symmetrization of the measure algebra of a compact $P_ * $-hypergroup. This method is used to form a measure algebra whose characters are Krawtchouk polynomials (these are the finite sets of polynomials orthogonal with respect to the binomial distribution on $\{ 0,1, \cdots ,N\} $.
Dunkl, Charles F., Ramirez, Donald E.
openaire   +2 more sources

Home - About - Disclaimer - Privacy