scholarly journals Pairs of Comparable Relations for Complete Homogeneous Symmetric Polynomial

2015 ◽  
Vol 7 (4) ◽  
pp. 26
Author(s):  
Soumendra Bera
Keyword(s):  
Exponential Function ◽  
Stirling Numbers ◽  
Binomial Coefficient ◽  
Symmetric Polynomial ◽  
Elementary Symmetric Polynomial ◽  
Generating Series ◽  
Homogeneous Symmetric Polynomial

<p>Complete homogeneous symmetric polynomial has connections with binomial coefficient, composition, elementary symmetric polynomial, exponential function, falling factorial, generating series, odd prime and Stirling numbers of the second kind by different summations. Surprisingly the relations in the context are comparable in pairs. </p>

scholarly journals An Orthosymplectic Pieri Rule

10.37236/7387 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Anna Stokke
Keyword(s):  
Linear Combination ◽  
Schur Functions ◽  
Symmetric Polynomial ◽  
Schur Function ◽  
Product Rule ◽  
Integer Coefficients ◽  
Pieri Formula ◽  
Symplectic Characters ◽  
Homogeneous Symmetric Polynomial

The classical Pieri formula gives a combinatorial rule for decomposing the product of a Schur function and a complete homogeneous symmetric polynomial as a linear combination of Schur functions with integer coefficients. We give a Pieri rule for describing the product of an orthosymplectic character and an orthosymplectic character arising from a one-row partition. We establish that the orthosymplectic Pieri rule coincides with Sundaram's Pieri rule for symplectic characters and that orthosymplectic characters and symplectic characters obey the same product rule. 

scholarly journals Enumerations for Compositions and Complete Homogeneous Symmetric Polynomial

2015 ◽  
Vol 7 (2) ◽  
pp. 1
Author(s):  
Soumendra Bera
Keyword(s):  
Positive Integer ◽  
Symmetric Polynomial ◽  
Enumeration Problems ◽  
Homogeneous Symmetric Polynomial

<p class="abstract">We count the number of occurrences of <em>t </em>as the summands<em> </em>(i) in the compositions of a positive integer <em>n</em> into <em>r</em> parts; and (ii) in all compositions of <em>n</em>; and subsequently obtain other results involving compositions. The initial counting further helps to solve the enumeration problems for complete homogeneous symmetric polynomial.</p>

scholarly journals CONSTRUCTING PERMUTATION POLYNOMIALS OVER FINITE FIELDS

2013 ◽  
Vol 89 (3) ◽  
pp. 420-430 ◽  
Author(s):  
XIAOER QIN ◽  
SHAOFANG HONG
Keyword(s):  
Finite Fields ◽  
Open Problem ◽  
Symmetric Polynomial ◽  
Permutation Polynomial ◽  
Permutation Polynomials ◽  
Elementary Symmetric Polynomial ◽  
Polynomials Over Finite Fields

AbstractIn this paper, we construct several new permutation polynomials over finite fields. First, using the linearised polynomials, we construct the permutation polynomial of the form ${ \mathop{\sum }\nolimits}_{i= 1}^{k} ({L}_{i} (x)+ {\gamma }_{i} ){h}_{i} (B(x))$ over ${\mathbf{F} }_{{q}^{m} } $, where ${L}_{i} (x)$ and $B(x)$ are linearised polynomials. This extends a theorem of Coulter, Henderson and Matthews. Consequently, we generalise a result of Marcos by constructing permutation polynomials of the forms $xh({\lambda }_{j} (x))$ and $xh({\mu }_{j} (x))$, where ${\lambda }_{j} (x)$ is the $j$th elementary symmetric polynomial of $x, {x}^{q} , \ldots , {x}^{{q}^{m- 1} } $ and ${\mu }_{j} (x)= {\mathrm{Tr} }_{{\mathbf{F} }_{{q}^{m} } / {\mathbf{F} }_{q} } ({x}^{j} )$. This answers an open problem raised by Zieve in 2010. Finally, by using the linear translator, we construct the permutation polynomial of the form ${L}_{1} (x)+ {L}_{2} (\gamma )h(f(x))$ over ${\mathbf{F} }_{{q}^{m} } $, which extends a result of Kyureghyan.

An entropy inequality

2009 ◽  
Vol 9 (7&8) ◽  
pp. 622-627
Author(s):  
M. Hellmund ◽  
A. Uhlmann
Keyword(s):  
Entropy Inequality ◽  
Quantum Information Theory ◽  
Upper Bounds ◽  
Symmetric Polynomial ◽  
Von Neumann Entropy ◽  
Elementary Symmetric Polynomial ◽  
Von Neumann ◽  
Entanglement Of Formation ◽  
Output Entropy ◽  
Quantities Of Interest

Let $S(\rho)=-\Tr (\rho\log\rho)$ be the von Neumann entropy of an $N$-dimensional quantum state $\rho$ and $e_2(\rho)$ the second elementary symmetric polynomial of the eigenvalues of $\rho$. We prove the inequality S(\rho) \;\le \; c(N) \; \sqrt{e_2(\rho)} where $c(N)=\log(N) \, \sqrt{\frac{2N}{N-1}}$. This generalizes an inequality given by Fuchs and Graaf~\cite{fuchsgraaf} for the case of one qubit, i.e., $N=2$. Equality is achieved if and only if $\rho$ is either a pure or the maximally mixed state. This inequality delivers new bounds for quantities of interest in quantum information theory, such as upper bounds for the minimum output entropy and the entanglement of formation as well as a lower bound for the Holevo channel capacity.

Elementary Symmetric Polynomials in Numbers of Modulus 1

2002 ◽  
Vol 54 (2) ◽  
pp. 239-262 ◽  
Author(s):  
Donald I. Cartwright ◽  
Tim Steger
Keyword(s):  
Symmetric Polynomial ◽  
Complex Polynomial ◽  
Complex Numbers ◽  
Symmetric Polynomials ◽  
Elementary Symmetric Polynomial ◽  
Elementary Symmetric Polynomials

AbstractWe describe the set of numbers σk(z1,…,zn+1), where z1,…,zn+1 are complex numbers of modulus 1 for which z1z2 … zn+1 = 1, and σk denotes the k-th elementary symmetric polynomial. Consequently, we give sharp constraints on the coefficients of a complex polynomial all of whose roots are of the same modulus. Another application is the calculation of the spectrum of certain adjacency operators arising naturally on a building of type Ãn.

Distribution and Correlation of the Coding Sequence Lengths in Bacterial Genomes

2008 ◽  
Vol 59 (11) ◽  
Author(s):  
Vasile V. Morariu
Keyword(s):  
Correlation Analysis ◽  
Exponential Function ◽  
Short Range ◽  
Statistical Physics ◽  
Bacterial Genomes ◽  
Coding Sequence ◽  
Correlation Properties ◽  
Short Range Correlations ◽  
Fluctuating System

The length of coding sequence (CDS) series in bacterial genomes were regarded as a fluctuating system and characterized by the methods of statistical physics. The distribution and the correlation properties of CDS for 47 genomes were investigated. The distribution was found to be approximated by an exponential function while the correlation analysis revealed short range correlations.

New family of Whitney numbers

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 309-320 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad Cakic ◽  
F.A. Shiha
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Stirling Numbers ◽  
Explicit Formulas ◽  
Basic Properties ◽  
New Family ◽  
Whitney Numbers ◽  
Special Cases

In this paper we give a new family of numbers, called ??-Whitney numbers, which gives generalization of many types of Whitney numbers and Stirling numbers. Some basic properties of these numbers such as recurrence relations, explicit formulas and generating functions are given. Finally many interesting special cases are derived.

Sign in / Sign up

Export Citation Format

Share Document