Concept

Symmetric polynomial

Related publications (100)

Graph Chatbot

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.

Simplified Modal Expansion to Analyze Frequency-Selective Surfaces: An Equivalent Circuit Approach

Juan Ramon Mosig, Maria Garcia Vigueras

This communication extends a previously reported analytical circuit that models the plane wave scattering by 2-D arrays of planar patches/apertures embedded in a layered media. In this extension, it is assumed that the current/electric field spatial profil ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Exact diagonalization of HeisenbergSU(N)chains in the fully symmetric and antisymmetric representations

Frédéric Mila, Pierre Marcel Nataf

Motivated by recent experimental progress in the context of ultracold multicolor fermionic atoms in optical lattices, we have developed a method to exactly diagonalize the Heisenberg SU(N) Hamiltonian with several particles per site living in a fully symme ...

2016

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

Polynomiality of Hurwitz numbers, Bouchard-Marino conjecture, and a new proof of the ELSV formula

Nicolas Gerson Orantin

In this paper we give a new proof of the ELSV formula. First, we refine an argument of Okounkov and Pandharipande in order to prove (quasi-)polynomiality of Hurwitz numbers without using the ELSV formula (the only way to do that before used the ELSV formul ...

Academic Press Inc Elsevier Science2015

Multimarginal Optimal Transport Maps for One-dimensional Repulsive Costs

Maria Colombo

We study a multimarginal optimal transportation problem in one dimension. For a symmetric, repulsive cost function, we show that, given a minimizing transport plan, its symmetrization is induced by a cyclical map, and that the symmetric optimal plan is uni ...

2015

International portfolios: A comparison of solution methods

Serhiy Stepanchuk

We compare the performance of the perturbation-based (local) portfolio solution method of Devereux & Sutherland (2010a, 2011) with a global solution method. As a test suite we use model specifications that broadly capture features of international financia ...

Elsevier Science Bv2015

Equality between Monge and Kantorovich multimarginal problems with Coulomb cost

Maria Colombo

A standard question arising in optimal transport theory is whether the Monge problem and the Kantorovich relaxation have the same infimum; the positive answer means that we can pass to the relaxed problem without loss of information. In the classical case ...

2015

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

MATHICSE Technical Report : 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 poly- nomial spaces to approximate a given function depending on a multivariate random variable uniformly distributed on a hypercube. The polynomial approximation is calculated ...

MATHICSE2015

Computing in social networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...

Elsevier2014

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