Several authors have considered the analogue of space-time codes over finite fields, usually taking the distance between two matrices as the rank of their difference. We introduce a weight enumerator for these “finite rank codes,” and show that there is a MacWilliams-type identity connecting the weight enumerator of a linear finite rank code to that of its dual. We do so with a proof of suffici...

Most recent results in matrix completion assume that the matrix under consideration is low-rank or that the columns are in a union of low-rank subspaces. In real-world settings, however, the linear structure underlying these models is distorted by a (typically unknown) nonlinear transformation. This paper addresses the challenge of matrix completion in the face of such nonlinearities. Given a f...

We decompose tensor products of the defining representation of a Cartan type Lie algebra W (n) in the case where the number of tensoring does not exceed the rank of the Lie algebra. As a result, we get a kind of Schur duality between W (n) and a finite dimensional non-semisimple algebra, which is the semi-group ring of the transformation semigroup Tm .

Let G be a finite group having an order preserving and rank preserving action on a finite ranked poset P. Let P/G denote the quotient poset. A well known result in algebraic Sperner theory asserts that an order raising G-linear map on V (P) (the complex vector space with P as basis) satisfying the full rank property induces an order raising linear map on V (P/G), also satisfying the full rank p...

The aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a monoid version of D. Higman’s celebrated theorem characterizing primitivity in terms of connectedness of orbital digraphs. A thorough study of the module (or repr...

Wavelet transformation is one of the most practical mathematical transformations in the field of image processing, especially image and signal processing. Depending on the nature of the multiresolution analysis, Wavelet transformation become more accessible and powerful tools. In this paper, we refer to the mathematical foundations of this transformation.   Introduction: The...

This paper presents a new method for the identification of Hammerstein systems. The parameter estimation problem is formulated as a rank minimization problem by constraining a finite dimensional time dependency between signals. Due to the unknown intermediate signal, the rank minimization problem cannot be solved directly. Thus, the rank minimization problem is reformulated as an intermediate s...

Automatic structures are a subject which has gained a lot of attention in the “logic in computer science” community during the last fifteen years. Roughly speaking, a structure is automatic if its domain, relations and functions can be recognized by finite automata on strings or trees. In particular, such structures are finitely presentable. The investigation of automatic structures is largely ...

Let G be a countable Abelian group with Zd as a subgroup so that G/Zd is a locally finite group. (An Abelian group is locally finite if every element has finite order.) We can construct a rank one action of G so that the Z-subaction is 2-simple, 2-mixing and only commutes with the other transformations in the action of G. Applications of this construction include a transformation with square ro...