Norm attaining operators and pseudospectrum

It is shown that if $11$, the operator $I+T$ attains its norm. A reflexive Banach space $X$ and a bounded rank one operator $T$ on $X$ are constructed such that $\|I+T\|>1$ and $I+T$ does not attain its norm.

Operators, commuting with the Volterra operator, are not weakly supercyclic

We prove that any bounded linear operator on $L_p[0,1]$ for $1\leq p

Workspace evaluation of manipulators through finite-partition of SE(3)

Workspace analysis and optimization are important in a manipulator design. As the complete workspace of a 6-DOF manipulator is embedded into a 6-imensional space, it is difficult to quantify and qualify it. Most literatures only considered the 3-D sub workspaces of the complete 6-D workspace. In this paper, a finite-partition approach of the Special Euclidean group SE(3) is proposed based on the topology properties of SE(3), which is the product of Special Orthogonal group SO(3) and R^3. It is known that the SO(3) is homeomorphic to a solid ball D^3 with antipodal points identified while the geometry of R^3 can be regarded as a cuboid. The complete 6-D workspace SE(3) is at the first time parametrically and proportionally partitioned into a number of elements with uniform convergence based on its geometry. As a result, a basis volume element of SE(3) is formed by the product of a basis volume element of R^3 and a basis volume element of SO(3), which is the product of a basis volume element of D^3 and its associated integration measure. By this way, the integration of the complete 6-D workspace volume becomes the simple summation of the basis volume elements of SE(3). Two new global performance indices, i.e., workspace volume ratio Wr and global condition index GCI, are defined over the complete 6-D workspace. A newly proposed 3 RPPS parallel manipulator is optimized based on this finite-partition approach. As a result, the optimal dimensions for maximal workspace are obtained, and the optimal performance points in the workspace are identified.

A splitting result for the algebraic K-theory of projective toric schemes

Suppose X is a projective toric scheme defined over a ring R and equipped with an ample line bundle L . We prove that its K-theory has a direct summand of the form K(R)(k+1) where k = 0 is minimal such that L?(-k-1) is not acyclic. Using a combinatorial description of quasi-coherent sheaves we interpret and prove this result for a ring R which is either commutative, or else left noetherian.

C∗-Segal algebras with order unit

We introduce the notion of a (noncommutative) C *-Segal algebra as a Banach algebra (A, {norm of matrix}{dot operator}{norm of matrix} A) which is a dense ideal in a C *-algebra (C, {norm of matrix}{dot operator}{norm of matrix} C), where {norm of matrix}{dot operator}{norm of matrix} A is strictly stronger than {norm of matrix}{dot operator}{norm of matrix} C onA. Several basic properties are investigated and, with the aid of the theory of multiplier modules, the structure of C *-Segal algebras with order unit is determined.

Semiring induced valuation algebras: Exact and approximate local computation algorithms

Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra.There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived from semiring valued mappings. In this paper we study how valuation algebras are induced by semirings and how the structure of the valuation algebra is related to the algebraic structure of the semiring. In particular, c-semirings with idempotent multiplication induce idempotent valuation algebras and therefore permit particularly efficient architectures for local computation. Also important are semirings whose multiplicative semigroup is embedded in a union of groups. They induce valuation algebras with a partially defined division. For these valuation algebras, the well-known architectures for Bayesian networks apply. We also extend the general computational framework to allow derivation of bounds and approximations, for when exact computation is not feasible.

Chaotic Banach algebras

We construct an infinite dimensional non-unital Banach algebra $A$ and $a\in A$ such that the sets $\{za^n:z\in\C,\ n\in\N\}$ and $\{({\bf 1}+a)^na:n\in\N\}$ are both dense in $A$, where $\bf 1$ is the unity in the unitalization $A^{\#}=A\oplus \spann\{{\bf 1}\}$ of $A$. As a byproduct, we get a hypercyclic operator $T$ on a Banach space such that $T\oplus T$ is non-cyclic and $\sigma(T)=\{1\}$.

Minimal Hilbert series for quadratic algebras and the Anick conjecture

We study the question on whether the famous Golod–Shafarevich estimate, which gives a lower bound for the Hilbert series of a (noncommutative) algebra, is attained. This question was considered by Anick in his 1983 paper ‘Generic algebras and CW-complexes’, Princeton Univ. Press, where he proved that the estimate is attained for the number of quadratic relations $d\leq n^2/4$
and $d\geq n^2/2$, and conjectured that it is the case for any number of quadratic relations. The particular point where the number of relations is equal to $n(n-1)/2$ was addressed by Vershik. He conjectured that a generic algebra with this number of relations is finite dimensional. We announce here the result that over any infinite field, the Anick conjecture holds for $d \geq 4(n2+n)/9$ and an arbitrary number of generators. We also discuss the result that confirms the Vershik conjecture over any field of characteristic 0, and a series of related
asymptotic results.

Finite dimensional semigroup quadratic algebras with the minimal number of relations

A quadratic semigroup algebra is an algebra over a field given by the generators x_1, . . . , x_n and a finite set of quadratic relations each of which either has the shape x_j x_k = 0 or the shape x_j x_k = x_l x_m . We prove that a quadratic semigroup algebra given by n generators and d=(n^2+n)/4 relations is always infinite dimensional. This strengthens the Golod–Shafarevich estimate for the above class of algebras. Our main result however is that for every n, there is a finite dimensional quadratic semigroup algebra with n generators and d_n relations, where d_n is the first integer greater than (n^2+n)/4 . That is, the above Golod–Shafarevich-type estimate for semigroup algebras is sharp.

Hypercyclic tuples of operators on $C^n$ and $R^n$

A tuple $(T_1,\dots,T_n)$ of continuous linear operators on a topological vector space $X$ is called hypercyclic if there is $x\in X$ such that the the orbit of $x$ under the action of the semigroup generated by $T_1,\dots,T_n$ is dense in $X$. This concept was introduced by N.~Feldman, who have raised 7 questions on hypercyclic tuples. We answer those 4 of them, which can be dealt with on the level of operators on finite dimensional spaces. In
particular, we prove that the minimal cardinality of a hypercyclic tuple of operators on $\C^n$ (respectively, on $\R^n$) is $n+1$ (respectively, $\frac n2+\frac{5+(-1)^n}{4}$), that there are non-diagonalizable tuples of operators on $\R^2$ which possess an orbit being neither dense nor nowhere dense and construct a hypercyclic 6-tuple of operators on $\C^3$ such that every operator commuting with each member of the tuple is non-cyclic.

A bit-level systolic architecture for implementing a VQ tree search

A bit-level systolic array system for performing a binary tree Vector Quantization codebook search is described. This consists of a linear chain of regular VLSI building blocks and exhibits data rates suitable for a wide range of real-time applications. A technique is described which reduces the computation required at each node in the binary tree to that of a single inner product operation. This method applies to all the common distortion measures (including the Euclidean distance, the Weighted Euclidean distance and the Itakura-Saito distortion measure) and significantly reduces the hardware required to implement the tree search system. © 1990 Kluwer Academic Publishers.

On Quillen's calculation of graded K-theory

We adapt Quillen’s calculation of graded K-groups of Z-graded rings with support in N to graded K-theory, allowing gradings in a product Z×G with G an arbitrary group. This in turn allows us to use induction and calculate graded K-theory of Z -multigraded rings.

Deployment on GPUs of an application in computational atomic physics

This paper describes the deployment on GPUs of PROP, a program of the 2DRMP suite which models electron collisions with H-like atoms and ions. Because performance on GPUs is better in single precision than in double precision, the numerical stability of the PROP program in single precision has been studied. The numerical quality of PROP results computed in single precision and their impact on the next program of the 2DRMP suite has been analyzed. Successive versions of the PROP program on GPUs have been developed in order to improve its performance. Particular attention has been paid to the optimization of data transfers and of linear algebra operations. Performance obtained on several architectures (including NVIDIA Fermi) are presented.