Concept

Polynôme de Schur

Publications associées (12)

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

EPFL2018

A semi-algebraic version of Zarankiewicz's problem

János Pach

A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...

European Mathematical Soc2017

Sampling and Reconstruction of Shapes with Algebraic Boundaries

Martin Vetterli, Arash Amini, Mitra Fatemi

We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of

\mathds{1}_{\{p\leq0\}}

to the image plane, where

\mathds{1}

denotes the indicator function and

p

is some r ...

2016

Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets

Fabio Nobile, Giovanni Migliorati

We analyze the stability and accuracy of discrete least squares on multivariate polynomial spaces to approximate a given function depending on a multivariate random variable uniformly distributed on a hypercube. The polynomial approximation is calculated s ...

2015

Analytical Form of Shepp-Logan Phantom for Parallel MRI

Michaël Unser, Dimitri Nestor Alice Van De Ville, Matthieu Guerquin-Kern

We present an analytical form of ground-truth k-space data for the 2-D Shepp-Logan brain phantom in the presence of multiple and non-homogeneous receiving coils. The analytical form allows us to conduct realistic simulations and validations of reconstructi ...

IEEE2010

Defect of characters of the symmetric group

Following the work of B. Kulshammer, J. B. Olsson and G. R. Robinson on generalized blocks of the symmetric groups, we give a definition for the l-defect of characters of the symmetric group G(n), where l > 1 is an arbitrary integer. We prove that the l-de ...

De Gruyter2009

A path integral formalism of DNA looping probability

Ludovica Cotta-Ramusino

In this thesis we describe a path integral formalism to evaluate approximations to the probability density function for the location and orientation of one end of a continuum polymer chain at thermodynamic equilibrium with a heat bath. We concentrate on th ...

EPFL2008

Robust Control of Polytopic Systems by Convex Optimization

Alireza Karimi, Roland Longchamp, Hamid Khatibi

Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polytopic system is given over an infinite-dimensional space. A finite-dimensional app ...

2007