|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
Permanent has less zeros than determinant over finite fieldsстатья
- Авторы: Guterman A.E., Budrevich M.
- Сборник: Proceedings of the Ghent conference on Finite Fields and Applications
- Серия: Contemporary Mathematics
- Том: 579
- Год издания: 2012
- Издательство: American Mathematical Society
- Местоположение издательства: United States
- Первая страница: 33
- Последняя страница: 42
- DOI: 10.1090/conm/579/11516
- Аннотация: Let F_q be an arbitrary finite field of characteristic different from two. We show that the permanent function has less zeros than the determinant function for square matrices of an arbitrary size n>2 over F_q. As a consequence, we obtain the answer to the Polya problem over F_q by showing that there are no bijective transformations on matrices with entries from F_q which map the permanent into the determinant.
- Добавил в систему: Гутерман Александр Эмилевич