Preuve combinatoire

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...

ELECTRONIC JOURNAL OF COMBINATORICS2021

Hermitian Categories, Extension Of Scalars And Systems Of Sesquilinear Forms

Eva Bayer Fluckiger, Daniel Arnold Moldovan

We prove that the category of systems of sesquilinear forms over a given hermitian category is equivalent to the category of unimodular 1-hermitian forms over another hermitian category. The sesquilinear forms are not required to be unimodular or defined o ...

Pacific Journal Mathematics2014

Combinatorial necklace splitting

Doemoetoer Palvoelgyi

We give a new, combinatorial proof for the necklace splitting problem for two thieves using only Tucker's lemma (a combinatorial version of the Borsuk-Ulam theorem). We show how this method can be applied to obtain a related recent result of Simonyi and ev ...

American Mathematical Society2009

Interference-Resilient Information Exchange

Rachid Guerraoui, Seth Gilbert

This paper presents an efficient protocol for reliably exchanging information in a single-hop, multi-channel radio network subject to unpredictable interference. We model the interference by an adversary that can simultaneously disrupt up to t of the C ava ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009