January 24, 2003 A NON-COMMUTATIVE POSITIVSTELLENSATZ ON ISOMETRIES JOHN W. HELTON, SCOTT MC CULLOUGH, MIHAI PUTINAR Abstract. A symmetric non-commutative polynomial p when evaluated at a tuple of operators on a finite d

Source URL: math.ucsd.edu

SYMMETRIC POLYNOMIALS KEITH CONRAD Let F be a field. A polynomial f (X1 , . . . , Xn ) ∈ F [X1 , . . . , Xn ] is called symmetric if it is unchanged by any permutation of its variables: f (X1 , . . . , Xn ) = f (Xσ(1)

Source URL: www.math.uconn.edu

A Polynomial Time Nilpotence Test for Galois Groups and Related Results V. Arvind1 and Piyush P Kurur2 1 2

Source URL: www.cse.iitk.ac.in

• Algebra
• Abstract algebra
• Mathematics
• Finite groups
• Galois theory
• Permutation groups
• Field theory
• Galois group
• Splitting field
• Permutation
• Symmetric group
• Sylow theorems

EXPLOITING SYMMETRIES IN SDP-RELAXATIONS FOR POLYNOMIAL OPTIMIZATION ´ CORDIAN RIENER, THORSTEN THEOBALD, LINA JANSSON ANDREN, AND JEAN B. LASSERRE Abstract. In this paper we study various approaches for exploiting symm

Source URL: www.math.uni-frankfurt.de

• Algebra
• Mathematics
• Abstract algebra
• Symmetric functions
• Symmetry
• Symmetry in mathematics
• Symmetric polynomial
• Linear algebra
• Orthogonal polynomials
• Invariant subspace
• Macdonald polynomials

Symmetric Cryptography and Algebraic Curves Jos´ e Felipe Voloch Abstract: We discuss some applications of the theory of algebraic curves to the study of S-boxes in symmetric cryptography. 0. Introduction

Source URL: www.ma.utexas.edu

• Algebra
• Mathematics
• Field theory
• Polynomials
• Splitting field
• Finite field
• Algebraic curve
• Minimal polynomial

HOLOGRAPHIC ALGORITHMS WITHOUT MATCHGATES J.M. LANDSBERG, JASON MORTON AND SERGUEI NORINE Abstract. The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems,

Source URL: www.math.tamu.edu

• Algebra
• Mathematics
• Linear algebra
• Determinants
• Multilinear algebra
• Pfaffian
• FKT algorithm
• Skew-symmetric matrix
• Matrix
• Tensor
• Holographic algorithm
• Antisymmetric

Fast Computation of Special Resultants ´ Alin Bostan a Philippe Flajolet a Bruno Salvy a Eric Schost b a Algorithms

Source URL: www.csd.uwo.ca

• Polynomials
• Computer algebra
• Algebra
• Symmetric functions
• Symmetric polynomial
• Finite field
• Irreducible polynomial
• Elementary symmetric polynomial
• XTR
• Resultant
• Splitting circle method
• Factorization of polynomials over finite fields

SYMMETRIC POLYNOMIALS FOR 2D SHAPE REPRESENTATION Renato M. P. Negrinho, Pedro M. Q. Aguiar Institute for Systems and Robotics / Instituto Superior T´ecnico, Lisboa, Portugal , .u

Source URL: users.isr.ist.utl.pt

• Homogeneous polynomials
• Polynomials
• Symmetric functions
• Algebra
• Invariant theory
• Elementary symmetric polynomial
• Symmetric polynomial
• Monomial
• Ring of symmetric functions
• Schur polynomial

Quadratization of Symmetric Pseudo-Boolean Functions Martin Anthonya , Endre Borosb , Yves Cramac , Aritanan Gruberd,∗ a Department of Mathematics, London School of Economics and Political Science, UK.

Source URL: www.maths.lse.ac.uk

• Algebraic structures
• Polynomials
• Mathematical optimization
• Pseudo-Boolean function
• Symmetric functions
• Ring
• Symmetric matrix
• Boolean algebra
• Elementary symmetric polynomial

A centrally symmetric version of the cyclic polytope Alexander Barvinok ∗ Department of Mathematics,

Source URL: www.math.lsa.umich.edu

• Geometry
• Mathematics
• Space
• Polyhedral combinatorics
• Polytopes
• Cyclic polytope
• Upper bound theorem
• Simplex
• Face
• 4-polytope
• Ehrhart polynomial