On rank invariance of generalized Schwarz-Pick-Potapov block matrices of matrix-valued Carathéodory functions

In view of a multiple Nevanlinna-Pick interpolation problem, we study the rank of generalized Schwarz-Pick-Potapov block matrices of matrix-valued Carathéodory functions. Those matrices are determined by the values of a Carathéodory function and the values of its derivatives up to a certain order. We derive statements on rank invariance of such generalized Schwarz-Pick-Potapov block matrices. These results are applied to describe the case of exactly one solution for the finite multiple Nevanlinna-Pick interpolation problem and to discuss matrix-valued Carathéodory functions with the highest degree of degeneracy.     

Polynomial Lie Algebras and Growth of Their Finitely Generated Lie Subalgebras

The concept of polynomial Lie algebra of finite rank was introduced by V. M. Buchstaber in his studies of new relationships between hyperelliptic functions and the theory of integrable systems. In this paper we prove the following theorem: the Lie subalgebra generated by the frame of a polynomial Lie algebra of finite rank has at most polynomial growth. In addition, important examples of polynomial Lie algebras of countable rank are considered in the paper. Such Lie algebras arise in the study of certain hyperbolic partial differential equations, as well as in the construction of self-similar infinite-dimensional Lie algebras (such as the Fibonacci algebra).     

Interval-Valued Rank in Finite Ordered Sets

We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data objects like the semantic hierarchies of ontological databases. These rarely satisfy the strong property of gradedness, which is required for traditional rank functions to exist. Representing such semantic hierarchies as finite, bounded posets, we recognize the duality of ordered structures to motivate rank functions with respect to verticality both from the bottom and from the top. Our rank functions are thus interval-valued, and always exist, even for non-graded posets, providing order homomorphisms to an interval order on the interval-valued ranks. The concept of rank width arises naturally, allowing us to identify the poset region with point-valued width as its longest graded portion (which we call the “spindle”). A standard interval rank function is naturally motivated both in terms of its extremality and on pragmatic grounds. Its properties are examined, including the relationship to traditional grading and rank functions, and methods to assess comparisons of standard interval-valued ranks.     

On Zeta-Functions of Finite Abelian Groups

In the paper, the zeta-functions of finite Abelian groups of rank 2 and 3 are considered. One- and two-dimensional limit theorems for these zeta-functions on the complex plane and in the space of meromorphic functions are obtained.     

Pólya–Carlson dichotomy for coincidence Reidemeister zeta functions via profinite completions

We consider coincidence Reidemeister zeta functions for tame endomorphism pairs of nilpotent groups of finite rank, shedding new light on the subject by means of profinite completion techniques.In particular, we provide a closed formula for coincidence Reidemeister numbers for iterations of endomorphism pairs of torsion-free nilpotent groups of finite rank, based on a weak commutativity condition, which derives from simultaneous triangularisability on abelian sections. Furthermore, we present results in support of a Pólya–Carlson dichotomy between rationality and a natural boundary for the analytic behaviour of the zeta functions in question.     

Functions with a finite number of negative squares on semigroups

We consider indefinite functions on semigroups and their relation to representations in spaces with an indefinite metric. Special attention is given to functions of finite rank, where the space of representation is of finite dimension, and to functions for which the corresponding representation consists of bounded operators in Pontrjagin spaces.The authors wish to thankMarco Thill for useful remarks.     

On the Kapranov ranks of tropical matrices

We investigate the Kapranov rank functions of tropical matrices for different ground fields. For any infinite ground field we show that the rank-product inequality holds for Kapranov rank, and we prove that the Kapranov rank respects Green’s preorders on the semigroup of tropical n-by-n matrices. The rank-product inequality is shown to fail for Kapranov rank over any finite ground field. We provide an example of a 7-by-7 01-matrix whose Kapranov rank is independent of a ground field, equals 6, and exceeds tropical rank.     

有限秩Toeplitz算子的(半)换位子

获得了Bergman空间上形如(T_f,T_g]-T_(h~n)和[T_f,T_g]-T_(h~n)的算子为有限秩时的充要条件,其中f,g,h均为有界调和函数,n为非负自然数.     

Word functions of pseudo-Markov chains

A word function is a function from the set of all words over a finite alphabet into the set of real numbers. In particular, when the blocks of a partition over the state set of a Markov chain are taken as the letters of the finite alphabet, and the function represents the probabilities that the chain will visit sequences of such blocks consecutively, then the function is a function of a Markov chain. It is known that (the rank of a function is defined in the text), a word function is of “finite rank” if and only if it is a function of a pseudo Markov chain (“pseudo” means here that the initial vector and the matrix representing the chain may have positive, negative, or zero values and are not necessarily stochastic). The aim of this note is to show that any function of a pseudo Markov chain can be represented as the difference of two functions of true Markov chains multiplied by a factor which grows exponentially with the length of the arguments (considered as words over a finite alphabet).     

Finite rank Toeplitz operators: Some extensions of D. Luecking's theorem

The recent theorem by D. Luecking about finite rank Bergman-Toeplitz operators is extended to weights being distributions with compact support and to the spaces of harmonic functions.     

Duality of codes supported on regular lattices,with an application to enumerative combinatorics

We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions. The weights are obtained by composing a suitable support map with the rank function of a graded lattice satisfying certain regularity properties. A regular weight on a group canonically induces a regular weight on the character group, and invertible MacWilliams identities always hold for such a pair of weights. Moreover, the Krawtchouk coefficients of the corresponding MacWilliams transformation have a precise combinatorial significance, and can be expressed in terms of the invariants of the underlying lattice. In particular, they are easy to compute in many examples. Several weight functions traditionally studied in Coding Theory belong to the class of weights introduced in this paper. Our lattice-theory approach also offers a control on metric structures that a regular weight induces on the underlying group. In particular, it allows to show that every finite abelian group admits weight functions that, simultaneously, give rise to MacWilliams identities, and endow the underlying group with a metric space structure. We propose a general notion of extremality for (not necessarily additive) codes in groups endowed with semi-regular supports, and establish a Singleton-type bound. We then investigate the combinatorics and duality theory of extremal codes, extending classical results on the weight and distance distribution of error-correcting codes. Finally, we apply the theory of MacWilliams identities to enumerative combinatorics problems, obtaining closed formulae for the number of rectangular matrices over a finite having prescribed rank and satisfying some linear conditions.     

Generalized inversion of finite rank Hankel and Toeplitz operators with rational matrix symbols

The goal of the paper is a generalized inversion of finite rank Hankel operators and Hankel or Toeplitz operators with block matrices having finitely many rows. To attain it a left coprime fractional factorization of a strictly proper rational matrix function and the Bezout equation are used. Generalized inverses of these operators and generating functions for the inverses are explicitly constructed in terms of the fractional factorization.     

On residually finite groups of finite general rank

Following A. I.Mal’tsev, we say that a group G has finite general rank if there is a positive integer r such that every finite set of elements of G is contained in some r-generated subgroup. Several known theorems concerning finitely generated residually finite groups are generalized here to the case of residually finite groups of finite general rank. For example, it is proved that the families of all finite homomorphic images of a residually finite group of finite general rank and of the quotient of the group by a nonidentity normal subgroup are different. Special cases of this result are a similar result of Moldavanskii on finitely generated residually finite groups and the following assertion: every residually finite group of finite general rank is Hopfian. This assertion generalizes a similarMal’tsev result on the Hopf property of every finitely generated residually finite group.     

On Weyl groups in minimal simple groups of finite Morley rank

We prove that generous non-nilpotent Borel subgroups of connected minimal simple groups of finite Morley rank are self-normalizing. We use this to introduce a uniform approach to the analysis of connected minimal simple groups of finite Morley rank through a case division incorporating four mutually exclusive classes of groups. We use these to analyze Carter subgroups and Weyl groups in connected minimal simple groups of finite Morley rank. Finally, the self-normalization theorem is applied to give a new proof of an important step in the classification of simple groups of finite Morley rank of odd type.     

Finite Homomorphic Images of Groups of Finite Rank

Let π be a finite set of primes. We prove that each soluble group of finite rank contains a finite index subgroup whose every finite homomorphic π-image is nilpotent. A similar assertion is proved for a finitely generated group of finite rank. These statements are obtained as a consequence of the following result of the article: Each soluble pro-π-group of finite rank has an open normal pronilpotent subgroup.

     

Groups whose proper subgroups are Baer-by-Chernikov or Baer-by-(finite rank)

Our main result is that a locally graded group whose proper subgroups are Baer-by-Chernikov is itself Baer-by-Chernikov. We prove also that a locally (soluble-by-finite) group whose proper subgroups are Baer-by-(finite rank) is itself Baer-by-(finite rank) if either it is locally of finite rank but not locally finite or it has no infinite simple images.     

一类带位势非线性热方程解的不存在性定理

研究与向量场有关的非线性次椭圆热方程.通过选取合适的测试函数,应用反证法证明了与之相关的初边值问题解的不存在性定理,将欧式空间及Heisenberg群上的结果推广至满足H（o）rmander有限秩条件的光滑向量场.     

Groups in which every subgroup of infinite rank is almost permutable

In this paper, the structure of locally finite groups of infinite rank whose subgroups of infinite rank are permutable in a subgroup of finite index is investigated.     

A finitary Tits' alternative

It is shown that for any family of finite groups of uniformly bounded rank, either (i) a subdirect product of these groups contains a non-cyclic free group, or (ii) there exists a single word w which is a law in each group, and moreover, if N is the length of the word, and r the maximal rank of each finite group, then each group is nilpotent-of-bounded class-by-abelian-by-bounded-index, with the bounds being functions of N and r alone. Additionally, various corollaries are derived from this result.     

Solvable groups of finite non-Abelian rank

The concept of the non-Abelian rank of a group is introduced. Solvable groups of finite non-Abelian rank are studied and it is proved that their (special) rank is finite.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 2, pp. 159–164, February, 1990.