Bar´ery Gibsona dlja problemy Polia

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Bar´ery Gibsona dlja problemy Polia
Authors:	ID Dolinar, Gregor (Author) ID Guterman, Aleksandr Èmilevič (Author) ID Kuzma, Bojan (Author)
Files:	http://mech.math.msu.su/~fpm/ps/k10/k108/k10807.pdf
Language:	Russian
Work type:	Not categorized
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	IAM - Andrej Marušič Institute
Abstract:	V članku je obravnavana spodnja meja za število neničelnih elementov v ▫$(0, 1)$▫ matrikah, pri katerem se da permanento vedno pretvoriti v determinanto samo s spreminjanjem predznaka ▫$pm$▫ elementom matrike.
Keywords:	matematika, linearna algebra, teorija matrik, permanenta, determinanta
Year of publishing:	2010
Number of pages:	Str. 73-86
PID:	20.500.12556/RUP-7716
ISSN:	1560-5159
UDC:	512.643
COBISS.SI-ID:	16093529
Publication date in RUP:	03.04.2017
Views:	2108
Downloads:	64
Metadata:
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Language:	Slovenian
Title:	On the Gibson barrier for the Polya problem
Abstract:	V članku je obravnavana spodnja meja za število neničelnih elementov v ▫$(0, 1)$▫ matrikah, pri katerem se da permanento vedno pretvoriti v determinanto samo s spreminjanjem predznaka ▫$\pm$▫ elementom matrike.We study lower bounds on the number of nonzero entries in ▫$(0, 1)$▫ matrices such that the permanent is always convertible to the determinant by placing ▫$\pm$▫ signs on matrix entries.
Keywords:	matematika, linearna algebra, teorija matrik, permanenta, determinanta, mathematics, linear algebra, matrix theory, permanent, determinant

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back