induced operators on symmetry classes of polynomials

Authors

mahin ranjbari

yousef zamani

abstract

‎in this paper‎, ‎we give a necessary and sufficient condition for the equality of two symmetrized decomposable polynomials‎. ‎then‎, ‎we study some algebraic and geometric properties of the induced operators over symmetry classes of polynomials in the case of linear characters‎.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Symmetry classes of polynomials associated with the dihedral group

‎In this paper‎, ‎we obtain the dimensions of symmetry classes of polynomials associated with‎ ‎the irreducible characters of the dihedral group as a subgroup of‎ ‎the full symmetric group‎. ‎Then we discuss the existence of o-basis‎ ‎of these classes‎.

full text

symmetry classes of polynomials associated with the dihedral group

‎in this paper‎, ‎we obtain the dimensions of symmetry classes of polynomials associated with‎ ‎the irreducible characters of the dihedral group as a subgroup of‎ ‎the full symmetric group‎. ‎then we discuss the existence of o-basis‎ ‎of these classes‎.

full text

symmetry classes of polynomials associated with the ‎direct ‎product of permutation groups

‎let $g_{i} $ be a subgroup of $ s_{m_{i}}‎ ,‎ 1 leq i leq k$‎. ‎suppose $chi_{i}$ is an irreducible complex character of $g_{i}$‎. ‎we consider $ g_{1}times cdots times g_{k} $ as subgroup of $ s_{m} $‎, ‎where $ m=m_{1}+cdots‎ +‎m_{k} $‎. ‎in this paper‎, ‎we give a formula for the dimension of $h_{d}(g_{1}times cdots times g_{k}‎, ‎chi_{1}timescdots times chi_{k})$ and investigate the existe...

full text

On Symmetry of Independence Polynomials

An independent set in a graph is a set of pairwise non-adjacent vertices, and α(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident edges, while μ(G) is the cardinality of a maximum matching. If sk is the number of independent sets of cardinality k in G, then I(G;x) = s0 + s1x+ s2x 2 + ...+ sαx , α = α (G) , is called the independence polynomial of G ...

full text

Kravchuk Polynomials and Induced/Reduced Operators on Clifford Algebras

Kravchuk polynomials arise as orthogonal polynomials with respect to the binomial distribution and have numerous applications in harmonic analysis, statistics, coding theory, and quantum probability. The relationship between Kravchuk polynomials and Clifford algebras is multifaceted. In this paper, Kravchuk polynomials are discovered as traces of conjugation operators in Clifford algebras, and ...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of group theory

Publisher: university of isfahan

ISSN 2251-7650

volume

issue Articles in Press 2016

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023