Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Recherche

Afficher tous les résultats pour

Accueil

Concept

Conjecture de Cramér

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (27)

Page 2 sur 2

Structure of optimal schedules in diamond networks

Christina Fragouli, Siddhartha Brahma

We consider Gaussian diamond networks with n half-duplex relays. At any point of time, a relay can either be in a listening (L) or transmitting (T) state. The capacity of such networks can be approximated to within a constant gap (independent of channel SN ...

Ieee2014

Proof of a conjecture by Gazeau et al. using the Gould-Hopper polynomials

Olivier Lévêque

We provide here some probabilistic interpretations of the generalized binomial distributions proposed by Gazeau et al. ["Generating functions for generalized binomial distributions," J. Math. Phys. 53, 103304 (2012)]. In the second part, we prove the "stro ...

Amer Inst Physics2013

The number of distinct distances from a vertex of a convex polygon

János Pach, Rom Pinchasi, Gabriel Nivasch

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is 13n/36 - O(1). I ...

2013

Tight Bounds on the Redundancy of Huffman Codes

In this paper, we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound on the redundancy of such Huffman c ...

Ieee-Inst Electrical Electronics Engineers Inc2012

Quantum fluctuations of one-dimensional free fermions and Fisher-Hartwig formula for Toeplitz determinants

We revisit the problem of finding the probability distribution of a fermionic number of one-dimensional spinless free fermions on a segment of a given length. The generating function for this probability distribution can be expressed as a determinant of a ...

2011

Conway's conjecture for monotone thrackles

János Pach

A drawing of a graph in the plane is called a thrackle if every pair of edges meet precisely once, either at a common vertex or at a proper crossing. According to Conway's conjecture, every thrackle has at most as many edges as vertices. We prove this conj ...

Mathematical Association of America2011

A computational approach to Conway's thrackle conjecture

János Pach, Radoslav Fulek

A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum number of edges that a thrackle of n vertices can have. According to a 40 yea ...

2011