Réunion d'été SMC 2012
Hôtels Regina Inn et Ramada (Regina~Saskatchewan), 2 -4 juin 2012  www.smc.math.ca//Reunions/ete12

Positivité totale
Org: Shaun Fallat (Regina) et Michael Gekhtman (Notre Dame)
[PDF]

ALVARO BARRERAS, Universidad de Zaragoza
Signed bidiagonal decompositions  [PDF]

Matrices with a bidiagonal decomposition satisfying some sign restrictions are analyzed. They include all nonsingular totally positive matrices, their matrices opposite in sign and their inverses, as well as tridiagonal nonsingular $H$-matrices. Properties of these matrices are presented and the bidiagonal factorization can be used to perform coputations with high relative accuracy.

SHAUN FALLAT, University of Regina
Rank Deficiency and Shadows in Totally Nonnegative Matrices  [PDF]

An $m \times n$ matrix is called totally nonnegative (TN) if all of its minors are nonnegative. It is a simple consequence of this definition to deduce that if $A = [a_{ij} ]$ is TN with no zero rows or columns, and if $a_{kl} = 0$, then $A$ will contain a block of zeros determined by the $(k, l)$ position. In this talk, I will present a generalization of this phenomenon to larger sized rank deficient blocks, discuss some related results on row and column inclusion for TN matrices, and connections to the distribution of zero minors in a TN matrix.

STEPHANE LAUNOIS, University of Kent (United Kingdom)
Deleting derivations algorithm and TNN matrices  [PDF]

In this talk, I will present the deleting derivations algorithm, which was first developed in the context of quantum algebras, and explain the significance of this algorithm for the study of TNN matrices.

MAHMOUD MANJEGANI, Isfahan University of Technology and University of Regina
Hadamard Powers of Totally Positive Matrices  [PDF]

Let $A=(a_{ij})$ be a totally positive $n\times n$ matrix. Is the $A^{(\alpha)}$ totally positive? In this talk we try to show that under some conditions on $\alpha$ the Hadamard power $A^{(\alpha)}$ is totally positive.

(Joint work with Shaun M. Fallat)

SHAHLA NASSERASR, University of Regina
TP$_k$ completion of partial matrices with one unspecified entry  [PDF]

An $m\times n$ matrix is called TP$_k$ if every minor of size at most $k$ is positive. The TP$_k$ completion problem for patterns of specified entries is considered. For a given pattern with one unspecified entry, the minimal set of conditions characterizing TP$_k$ completability is given. These conditions are finitely many polynomial inequalities in the specified entries of the pattern. This is joint work with C. Johnson and V. Akin.

## Commandites

Nous remercions chaleureusement ces commanditaires de leur soutien.

© Société mathématique du Canada

© Société mathématique du Canada : http://www.smc.math.ca/
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 17, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8455810546875, "perplexity_flag": "middle"}