Displaying similar documents to “Rank gradient, cost of groups and the rank versus Heegaard genus problem”

Co-rank and Betti number of a group

Irina Gelbukh (2015)

Czechoslovak Mathematical Journal

Similarity:

For a finitely generated group, we study the relations between its rank, the maximal rank of its free quotient, called co-rank (inner rank, cut number), and the maximal rank of its free abelian quotient, called the Betti number. We show that any combination of the group's rank, co-rank, and Betti number within obvious constraints is realized for some finitely presented group (for Betti number equal to rank, the group can be chosen torsion-free). In addition, we show that the Betti number...

Trace and determinant in Banach algebras

Bernard Aupetit, H. Mouton (1996)

Studia Mathematica

Similarity:

We show that the trace and the determinant on a semisimple Banach algebra can be defined in a purely spectral and analytic way and then we obtain many consequences from these new definitions.

A new rank formula for idempotent matrices with applications

Yong Ge Tian, George P. H. Styan (2002)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

It is shown that rank ( P * A Q ) = rank ( P * A ) + rank ( A Q ) - rank ( A ) , where A is idempotent, [ P , Q ] has full row rank and P * Q = 0 . Some applications of the rank formula to generalized inverses of matrices are also presented.

The "Thirty-seven Percent Rule" and the secretary problem with relative ranks

Béla Bajnok, Svetoslav Semov (2014)

Discussiones Mathematicae Probability and Statistics

Similarity:

We revisit the problem of selecting an item from n choices that appear before us in random sequential order so as to minimize the expected rank of the item selected. In particular, we examine the stopping rule where we reject the first k items and then select the first subsequent item that ranks lower than the l-th lowest-ranked item among the first k. We prove that the optimal rule has k ~ n/e, as in the classical secretary problem where our sole objective is to select the item of lowest...