Publications associées à Complete homogeneous symmetric polynomial

A Determinantal Identity for the Permanent of a Rank 2 Matrix

We prove an identity relating the permanent of a rank 2 matrix and the determinants of its Hadamard powers. When viewed in the right way, the resulting formula looks strikingly similar to an identity of Carlitz and Levine, suggesting the possibility that t ...

TAYLOR & FRANCIS INC2022

On arithmetic progressions in symmetric sets in finite field model

Jan Hazla

We consider two problems regarding arithmetic progressions in symmetric sets in the finite field (product space) model. ...

ELECTRONIC JOURNAL OF COMBINATORICS2020

Principal Component Analysis By Optimization Of Symmetric Functions Has No Spurious Local Optima

Armin Eftekhari

Principal component analysis (PCA) finds the best linear representation of data and is an indispensable tool in many learning and inference tasks. Classically, principal components of a dataset are interpreted as the directions that preserve most of its "e ...

SIAM PUBLICATIONS2020

Twisting structures and morphisms up to strong homotopy

Kathryn Hess Bellwald

We define twisted composition products of symmetric sequences via classifying morphisms rather than twisting cochains. Our approach allows us to establish an adjunction that simultaneously generalizes a classic one for algebras and coalgebras, and the bar- ...

2020

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

Function Computation over Networks : Efficient Information Processing for Cache and Sensor Applications

Chien-Yi Wang

This thesis looks at efficient information processing for two network applications: content delivery with caching and collecting summary statistics in wireless sensor networks. Both applications are studied under the same paradigm: function computation ove ...

EPFL2015

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

Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis

Daniel Kressner

Novel memory-efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the ...

Wiley-Blackwell2014

Silence-Based Communication

Christina Fragouli

Communication complexity---the minimum amount of communication required---of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and ...

2010

BOOSTERS: a derivative-free algorithm based on radial basis functions

Michel Bierlaire, Rodrigue Oeuvray

Derivative-free optimization involves the methods used to minimize an expensive objective functionwhen its derivatives are not available. We present here a trust-region algorithmbased on Radial Basis Functions (RBFs). The main originality of our approach i ...

2009

Symmetric and non-symmetric discontinuous Galerkin methods stabilized using bubble enrichment

Erik Burman, Benjamin Stamm

In this Note we prove that in two and three space dimensions, the symmetric and non-symmetric discontinuous Galerkin method for second order elliptic problems is stable when using piecewise linear elements enriched with quadratic bubbles without any penali ...

2008

Electronic origin of the isostructural decomposition in cubic M1-xAlxN (M=Ti, Cr, Sc, Hf): A first-principles study

Alireza Karimi

We have used first-principles calculations to investigate the mixing enthalpies, lattice parameters and electronic density of states of the ternary nitride systems Ti1-xAlxN, Cr1-xAlxN, Sc1-xAlxN and Hf1-xAlxN in the cubic B1 structure where the transition ...

2008

Fountain Codes for the Slepian-Wolf Problem

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, we describe one solution to the two-user Slepian-Wolf problem in a certain part of the achievable region using fountain codes. Symmetric case of memoryless compression of two correlated sources is considered and modeled by a BSC channel. The ...

2006

Generalized Biorthogonal Daubechies Wavelets

Michaël Unser, Thierry Blu, Cédric René Jean Vonesch

We propose a generalization of the Cohen-Daubechies-Feauveau (CDF) and 9⁄7 biorthogonal wavelet families. This is done within the framework of non-stationary multiresolution analysis, which involves a sequence of embedded approximation spaces generated by ...

SPIE2005