Search results for "polynomial"

Ordinary and graded cocharacter of the Jordan algebra of 2x2 upper triangular matrices

2014

Abstract Let F be a field of characteristic zero and U J 2 ( F ) be the Jordan algebra of 2 × 2 upper triangular matrices over F . In this paper we give a complete description of the space of multilinear graded and ordinary identities in the language of Young diagrams through the representation theory of a Young subgroup of S n . For every Z 2 -grading of U J 2 ( F ) we compute the multiplicities in the graded cocharacter sequence and furthermore we compute the ordinary cocharacter.

Polynomial method to study the entanglement of pure N-qubit states

2009

We present a mapping which associates pure N-qubit states with a polynomial. The roots of the polynomial characterize the state completely. Using the properties of the polynomial we construct a way to determine the separability and the number of unentangled qubits of pure N-qubit states.

A Polynomial Quantum Query Lower Bound for the Set Equality Problem

2004

The set equality problem is to tell whether two sets A and B are equal or disjoint under the promise that one of these is the case. This problem is related to the Graph Isomorphism problem. It was an open problem to find any ω(1) query lower bound when sets A and B are given by quantum oracles. We will show that any error-bounded quantum query algorithm that solves the set equality problem must evaluate oracles \(\Omega(\sqrt[5]{\frac{n}{\ln n}})\) times, where n=|A|=|B|.

The Monadic Quantifier Alternation Hierarchy over Grids and Graphs

2002

AbstractThe monadic second-order quantifier alternation hierarchy over the class of finite graphs is shown to be strict. The proof is based on automata theoretic ideas and starts from a restricted class of graph-like structures, namely finite two-dimensional grids. Considering grids where the width is a function of the height, we prove that the difference between the levels k+1 and k of the monadic hierarchy is witnessed by a set of grids where this function is (k+1)-fold exponential. We then transfer the hierarchy result to the class of directed (or undirected) graphs, using an encoding technique called strong reduction. It is notable that one can obtain sets of graphs which occur arbitrar…

A stronger Dunford-Pettis property

2008

Polynomial codimension growth and the Specht problem

2017

Abstract We construct a continuous family of algebras over a field of characteristic zero with slow codimension growth bounded by a polynomial of degree 4. This is achieved by building, for any real number α ∈ ( 0 , 1 ) a commutative nonassociative algebra A α whose codimension sequence c n ( A α ) , n = 1 , 2 , …  , is polynomially bounded and lim ⁡ log n ⁡ c n ( A α ) = 3 + α . As an application we are able to construct a new example of a variety with an infinite basis of identities.

Standard polynomials are characterized by their degree and exponent

2011

Abstract By the Giambruno–Zaicev theorem (Giambruno and Zaicev, 1999) [5] , the exponent exp ( A ) of a p.i. algebra A exists, and is always an integer. In Berele and Regev (2001) [2] it was shown that the exponent exp ( St n ) of the standard polynomial St n of degree n is not smaller than the exponent of any polynomial of degree n. Here it is proved that exp ( St n ) is strictly larger than the exponent of any other polynomial of degree n which is not a multiple of St n .

Pietsch's factorization theorem for dominated polynomials

2007

Abstract We prove that, like in the linear case, there is a canonical prototype of a p -dominated homogeneous polynomial through which every p -dominated polynomial between Banach spaces factors.

Nonlinear embeddings: Applications to analysis, fractals and polynomial root finding

2016

We introduce $\mathcal{B}_{\kappa}$-embeddings, nonlinear mathematical structures that connect, through smooth paths parameterized by $\kappa$, a finite or denumerable set of objects at $\kappa=0$ (e.g. numbers, functions, vectors, coefficients of a generating function...) to their ordinary sum at $\kappa \to \infty$. We show that $\mathcal{B}_{\kappa}$-embeddings can be used to design nonlinear irreversible processes through this connection. A number of examples of increasing complexity are worked out to illustrate the possibilities uncovered by this concept. These include not only smooth functions but also fractals on the real line and on the complex plane. As an application, we use $\mat…

The surjective hull of a polynomial ideal

2016

The aim of this paper is the study of surjective ideals of homogeneous polynomials between Banach spaces. To do so we define the surjective hull of a polynomial ideal and prove the main properties of this hull procedure. For a more comprehensive theory, new lifting properties of homogeneous polynomials are proved and applied to the description of the surjective hulls of the ideals of I-bounded polynomials and of composition polynomials ideals. Several applications are provided.