Publication

What do gravitons say about (unimodular) gravity?

Related publications (46)

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.

MATHICSE Technical Report : Quasi-Toeplitz matrix arithmetic : a Matlab toolbox

Stefano Massei

A Quasi Toeplitz (QT) matrix is a semi-infinite matrix of the kind

A = T(a) + E

where

T(a) = (aj-i)_{i,j\in \mathbb{Z}_{+}}

E = (e_{i,j})_{i,j\in\mathbb{Z}_{+}}

is compact and the norms

\| a\|_{\mathcal{W}} =\sum_{i\in\mathbb{Z}} |a|_j

and $|E|_{ ...

MATHICSE2018

On multivariate trace inequalities of Sutter, Berta, and Tomamichel

Marius Christopher Lemm

We consider a family of multivariate trace inequalities recently derived by Sutter, Berta, and Tomamichel. These inequalities generalize the Golden-Thompson inequality and Lieb’s triple matrix inequality to an arbitrary number of matrices in a way that fea ...

2018

Heat kernel methods for Lifshitz theories

Diego Blas Temino, Mario Herrero Valea

We study the one-loop covariant effective action of Lifshitz theories using the heat kernel technique. The characteristic feature of Lifshitz theories is an anisotropic scaling between space and time. This is enforced by the existence of a preferred foliat ...

Springer2017

Fast recovery and approximation of hidden Cauchy structure

Robert Gerhard Jérôme Luce

We derive an algorithm of optimal complexity which determines whether a given matrix is a Cauchy matrix, and which exactly recovers the Cauchy points defining a Cauchy matrix from the matrix entries. Moreover, we study how to approximate a given matrix by ...

Elsevier Science Inc2016

Soft optical composites for tunable transmittance

Pedro Miguel Nunes Pereira de Almeida Reis, Sanjeev Kumar

We introduce a soft composite that is actuated mechanically to achieve switchable and tunable optical transmittance. Our design comprises a series of parallel opaque platelets embedded into an optically clear silicone-based elastomer matrix. Under an appli ...

2016

Scale-invariant alternatives to general relativity. II. Dilaton properties

Georgios Karananas

In the present paper, we revisit gravitational theories which are invariant under TDiffs-transverse (volume-preserving) diffeomorphisms and global scale transformations. It is known that these theories can be rewritten in an equivalent diffeomorphism-invar ...

Amer Physical Soc2016

Parallel algorithms for tensor completion in the CP format

Daniel Kressner, André Uschmajew

Low-rank tensor completion addresses the task of filling in missing entries in multidimensional data. It has proven its versatility in numerous applications, including context aware recommender systems and multivariate function learning. To handle large-sc ...

Elsevier Science Bv2016

Optimal acoustic rake receiver

Martin Vetterli, Ivan Dokmanic, Robin Scheibler

An acoustic processing method for M acoustic receivers comprising the steps of: Determining a beamforming weight vector with M weights for the M acoustic receivers based on at least one the steering vector of at least one real acoustic source, on steering ...

2016

Completing Lorentz violating massive gravity at high energies

Sergey Sibiryakov, Diego Blas Temino

Theories with massive gravitons are interesting for a variety of physical applications, ranging from cosmological phenomena to holographic modeling of condensed matter systems. To date, they have been formulated as effective field theories with a cutoff pr ...

Springer Verlag2015

On Convergence Of The Maximum Block Improvement Method

André Uschmajew

The MBI (maximum block improvement) method is a greedy approach to solving optimization problems where the decision variables can be grouped into a finite number of blocks. Assuming that optimizing over one block of variables while fixing all others is rel ...

Siam Publications2015