Powerful skew arithmetic circuits are introduced. These are skew arithmetic circuits with variables, where input gates can be labelled with powers xn for binary encoded numbers n. It is shown that polynomial identity testing for powerful skew arithmetic circuits belongs to coRNC, which generalizes a corresponding result for (standard) skew circuits. Two applications of this result are presented...

document image processing, skew detection An important part of any document recognition system is detection of skew in the image of a page. This paper presents a new, accurate and robust skew detection algorithm based on a method for finding rows of text in page images. Results of a test of the new algorithm and a comparison against Baird's well known algorithm on 400 pages show the new algorit...

In this paper, we compute doubly truncated moments for the selection elliptical class of distributions, including some multivariate asymmetric versions well-known such as normal, Student’s t, slash, among others. We address members family, establishing neat formulation high-order and its first two moments. establish sufficient necessary conditions existence these Further, propose optimized meth...

This article studies a family of multivariate skew-symmetric distributions. We show that any multivariate probability density function admits a skewsymmetric representation. We derive several characteristics of this representation and establish an invariance property. We present a stochastic representation of skew-symmetric distributions which lends itself readily to simulations. The flexibilit...

We investigate the amenability of skew field extensions of the complex numbers. We prove that all skew fields of finite Gelfand-Kirillov transcendence degree are amenable. However there are both amenable and non-amenable finitely generated skew fields of infinite Gelfand-Kirillov transcendence degree. AMS Subject Classifications: 12E15, 43A07

In this paper we generalize coding theory of cyclic codes over finite fields to skew polynomial rings over finite rings. Codes that are principal ideals in quotient rings of skew polynomial rings by two sided ideals are studied. Next we consider skew codes of endomorphism type and derivation type. And we give some examples.

In this paper, we study skew cyclic codes over the ring R = Fq + uFq + vFq + uvFq, where u 2 = u, v2 = v, uv = vu, q = p and p is an odd prime. We investigate the structural properties of skew cyclic codes over R through a decomposition theorem. Furthermore, we give a formula for the number of skew cyclic codes of length n over R.

A Coxeter system is called skew-angled if its Coxeter matrix contains no entry equal to 2. In this paper we prove rigidity results for skew-angled Coxeter groups. As a consequence of our results we obtain that skew-angled Coxeter groups are rigid up to diagram twisting.

In this paper we consider skew bisubmodular functions as recently introduced by the authors and Powell. We construct a convex extension of a skew bisubmodular function which we call Lovász extension in correspondence to the submodular case. We use this extension to show that skew bisubmodular functions given by an oracle can be minimised in polynomial time.

In this paper, a class of multivariate skew distributions has been explored. Then its properties are derived. The relationship between the multivariate skew normal and the Wishart distribution is also studied. @ 2003 Elsevier Science Ltd. All rights reserved. Keywords-Skew normal distribution, Wishart distribution, Moment generating function, Moments. Skewness.