Pages that link to "Item:Q5961543"

The following pages link to An entropy proof of Bregman's theorem (Q5961543):

Displaying 24 items.

• On the maximum number of Latin transversals (Q272327) (← links)
• Asymptotics of the upper matching conjecture (Q385029) (← links)
• Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures (Q385153) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• An upper bound on the number of high-dimensional permutations (Q485003) (← links)
• Notes on use of generalized entropies in counting (Q503654) (← links)
• Entropy bounds for perfect matchings and Hamiltonian cycles (Q624182) (← links)
• A proof of the upper matching conjecture for large graphs (Q1984527) (← links)
• Enumerating extensions of mutually orthogonal Latin squares (Q2004974) (← links)
• New bounds for perfect \(k\)-hashing (Q2217492) (← links)
• A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
• An upper bound for permanents of nonnegative matrices (Q2474496) (← links)
• An Entropy-Based Proof for the Moore Bound for Irregular Graphs (Q2821702) (← links)
• An upper bound on the number of Steiner triple systems (Q2868080) (← links)
• Permanents of multidimensional matrices: Properties and applications (Q2959191) (← links)
• A Tight Analysis of Bethe Approximation for Permanent (Q5020728) (← links)
• Further results on generalized conditional entropies (Q5245728) (← links)
• Extremal Graphs With a Given Number of Perfect Matchings (Q5325953) (← links)
• Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares (Q5501087) (← links)
• An algorithmic proof of Brégman–Minc theorem (Q5850764) (← links)
• Proof of a hypercontractive estimate via entropy (Q5951519) (← links)
• Tight bounds on the coefficients of partition functions via stability (Q5970255) (← links)
• The number of \(n\)-queens configurations (Q6098437) (← links)
• On the codimension of permanental varieties (Q6663149) (← links)