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

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 ...

Acceleration measurements are fundamental in applications such as consumer electronics, navigation, automotive safety and Internet of things (IoT). In comparison with capacitive or piezoresistive MEMS accelerometers, resonant graphene accelerometers have t ...

Conformal field theory lies at the heart of two central topics in theoretical high energy physics: the study of quantum gravity and the mapping of quantum field theories through the renormalization group. In this thesis we explore a technique to study conf ...

We formulate a conjecture characterizing smooth projective varieties in positive characteristic whose Frobenius morphism can be lifted modulo p(2)-we expect that such varieties, after a finite stale cover, admit a toric fibration over an ordinary abelian v ...

The poset Y-k,Y-2 consists of k + 2 distinct elements x(1), x(2), ..., x(k), y(1), y(2), such that x(1)

In the Convex Body Chasing problem, we are given an initial point v0. Rd and an online sequence of n convex bodies F1,..., Fn. When we receive Ft, we are required to move inside Ft. Our goal is to minimize the total distance traveled. This fundamental onli ...

The Boolean lattice (2[n],subset of) is the family of all subsets of [n]={1,MIDLINE HORIZONTAL ELLIPSIS,n}, ordered by inclusion. Let P be a partially ordered set. We prove that if n is sufficiently large, then there exists a packing P of copies of P in (2 ...

Even with correct training, up to 25% of children never master handwriting like their peers. While research shows a correlation between handwriting difficulties and school failure, these difficulties can also impact children in their self esteem and behavi ...

We construct a new family of lattice packings for superballs in three dimensions (unit balls for the l(3)(p) norm) with p epsilon (1, 1.58]. We conjecture that the family also exists for p epsilon (1.58, log(2) 3 = 1.5849625 ...]. Like in the densest latti ...

The nematode Caenorhabditis elegans has been extensively used as a model multicellular organism to study the influence of osmotic stress conditions and the toxicity of chemical compounds on developmental and motility-associated phenotypes. However, the sev ...

Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross and any pair of independent edges cross at most once. According to the celebrated Crossing Lemma of Ajtai, Chvatal, Newborn, Szemeredi and Leighton, the nu ...

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

Chat with Graph Search

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

Proof Of Concept Of A Graphene-Based Resonant Accelerometer

Nonperturbative Mellin Amplitudes

Global Frobenius liftability I

A simple proof for a forbidden subposet problem

Nested Convex Bodies are Chaseable

Packing the Boolean lattice with copies of a poset

Analysis and Remediation of Handwriting difficulties

New dense superball packings in three dimensions

Automated phenotyping of Caenorhabditis elegans embryos with a high-throughput-screening microfluidic platform

A Crossing Lemma for Multigraphs