Concept
Formule de Faulhaber
Publications associées (5)
A positive combinatorial formula for symplectic Kostka-Foulkes polynomials I: Rows
We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To show this, we construct a new algorithm for computing cocyclage in terms of wh ...
ACADEMIC PRESS INC ELSEVIER SCIENCE2020Distributed Learning over Networks under Subspace Constraints
Ali H. Sayed, Stefan Vlaski, Roula Nassif
This work presents and studies a distributed algorithm for solving optimization problems over networks where agents have individual costs to minimize subject to subspace constraints that require the minimizers across the network to lie in a low-dimensional ...
IEEE2019Analytic twists of modular forms and applications
We are interested in the study of non-correlation of Fourier coefficients of Maass forms against a wide class of real analytic functions. In particular, the class of functions we are interested in should be thought of as some archimedean analogs of Frobeni ...
EPFL2017DynaProg for Scala
Dynamic programming is an algorithmic technique to solve problems that follow the Bellman’s principle: optimal solutions depends on optimal sub-problem solutions. The core idea behind dynamic programming is to memoize intermediate results into matrices to ...
2013Modeling work zone crash frequency by quantifying measurement errors in work zone length
Work zones are temporary traffic control zones that can potentially cause safety problems. Maintaining safety, while implementing necessary changes on roadways, is an important challenge traffic engineers and researchers have to confront. In this study, th ...
Pergamon-Elsevier Science Ltd2013