Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXVIII, Tome 439 (2015), pp. 26-37
Citer cet article
M. V. Budrevich; A. E. Guterman; K. A. Taranin. On divisibility for the permanents of $(\pm1)$-matrices. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXVIII, Tome 439 (2015), pp. 26-37. http://geodesic.mathdoc.fr/item/ZNSL_2015_439_a2/
@article{ZNSL_2015_439_a2,
author = {M. V. Budrevich and A. E. Guterman and K. A. Taranin},
title = {On divisibility for the permanents of $(\pm1)$-matrices},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {26--37},
year = {2015},
volume = {439},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2015_439_a2/}
}
TY - JOUR
AU - M. V. Budrevich
AU - A. E. Guterman
AU - K. A. Taranin
TI - On divisibility for the permanents of $(\pm1)$-matrices
JO - Zapiski Nauchnykh Seminarov POMI
PY - 2015
SP - 26
EP - 37
VL - 439
UR - http://geodesic.mathdoc.fr/item/ZNSL_2015_439_a2/
LA - ru
ID - ZNSL_2015_439_a2
ER -
%0 Journal Article
%A M. V. Budrevich
%A A. E. Guterman
%A K. A. Taranin
%T On divisibility for the permanents of $(\pm1)$-matrices
%J Zapiski Nauchnykh Seminarov POMI
%D 2015
%P 26-37
%V 439
%U http://geodesic.mathdoc.fr/item/ZNSL_2015_439_a2/
%G ru
%F ZNSL_2015_439_a2
The classical results by Kräuter and Seifter concerning the divisibility of permanents for $(\pm1)$-matrices by large powers of $2$ are useful in testing whether the permanent is a nonvanishing function. In this paper, a new approach to this problem, which allows one to obtain a short combinatorial proof of the results by Kräuter and Seifter, is suggested.
