About: Dittert conjecture     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FDittert_conjecture

The Dittert conjecture, or Dittert–Hajek conjecture, is a mathematical hypothesis (in combinatorics) concerning the maximum achieved by a particular function of matrices with real, nonnegative entries satisfying a summation condition. The conjecture is due to Eric Dittert and (independently) Bruce Hajek. Let be a square matrix of order with nonnegative entries and with . Its permanent is defined as , where the sum extends over all elements of the symmetric group.

AttributesValues
rdfs:label
  • Conjectura de Dittert (ca)
  • Dittert conjecture (en)
rdfs:comment
  • En combinatòria, la conjectura de Dittert, o conjectura de Dittert-Hajek, és una hipòtesi matemàtica relativa al màxim assolit per una determinada funció de matrius amb entrades reals i no negatives que compleixin una condició sumatòria. La conjectura es deu a Eric Dittert i (independentment) a Bruce Hajek. Sigui una matriu quadrada d'ordre amb entrades no negatives i amb . Definim com , on la suma s'estén sobre tots els elements del grup simètric. (ca)
  • The Dittert conjecture, or Dittert–Hajek conjecture, is a mathematical hypothesis (in combinatorics) concerning the maximum achieved by a particular function of matrices with real, nonnegative entries satisfying a summation condition. The conjecture is due to Eric Dittert and (independently) Bruce Hajek. Let be a square matrix of order with nonnegative entries and with . Its permanent is defined as , where the sum extends over all elements of the symmetric group. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • En combinatòria, la conjectura de Dittert, o conjectura de Dittert-Hajek, és una hipòtesi matemàtica relativa al màxim assolit per una determinada funció de matrius amb entrades reals i no negatives que compleixin una condició sumatòria. La conjectura es deu a Eric Dittert i (independentment) a Bruce Hajek. Sigui una matriu quadrada d'ordre amb entrades no negatives i amb . Definim com , on la suma s'estén sobre tots els elements del grup simètric. La conjectura de Dittert afirma que la funció definida per es maximitza (de manera única) quan , on es defineix com la matriu quadrada d'ordre amb totes les entrades iguals 1. (ca)
  • The Dittert conjecture, or Dittert–Hajek conjecture, is a mathematical hypothesis (in combinatorics) concerning the maximum achieved by a particular function of matrices with real, nonnegative entries satisfying a summation condition. The conjecture is due to Eric Dittert and (independently) Bruce Hajek. Let be a square matrix of order with nonnegative entries and with . Its permanent is defined as , where the sum extends over all elements of the symmetric group. The Dittert conjecture asserts that the function defined by is (uniquely) maximized when , where is defined to be the square matrix of order with all entries equal to 1. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 55 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software