Concept

Espace affine

Publications associées (115)

The tropical momentum map: a classification of toric log symplectic manifolds

We give a generalization of toric symplectic geometry to Poisson manifolds which are symplectic away from a collection of hypersurfaces forming a normal crossing configuration. We introduce the tropical momentum map, which takes values in a generalization ...

Springer Verlag2017

An upper bound for the Tarski numbers of nonamenable groups of piecewise projective homeomorphisms

Yash Lodha

The Tarski number of a nonamenable group is the smallest number of pieces needed for a paradoxical decomposition of the group. Nonamenable groups of piecewise projective homeomorphisms were introduced in [N. Monod, Groups of piecewise projective homeomorph ...

World Scientific Publ Co Pte Ltd2017

Representing groups against all odds

Maxime Gheysens

We investigate how probability tools can be useful to study representations of non-amenable groups. A suitable notion of "probabilistic subgroup" is proposed for locally compact groups, and is valuable to induction of representations. Nonamenable groups ad ...

EPFL2017

Extension complexity of stable set polytopes of bipartite graphs

Yuri Faenza, Manuel Francesco Aprile

The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...

Springer2017

Scalable Low-rank Matrix and Tensor Decomposition on Graphs

Nauman Shahid

In many signal processing, machine learning and computer vision applications, one often has to deal with high dimensional and big datasets such as images, videos, web content, etc. The data can come in various forms, such as univariate or multivariate time ...

EPFL2017

A posteriori error estimation for the steady Navier-Stokes equations in random domains

Fabio Nobile, Marco Picasso, Diane Sylvie Guignard

We consider finite element error approximations of the steady incompressible Navier-Stokes equations defined on a randomly perturbed domain, the perturbation being small. Introducing a random mapping, these equations are transformed into PDEs on a fixed re ...

Elsevier2017

Space-dependent source determination in a time-fractional diffusion equation using a local discontinuous Galerkin method

Jan Sickmann Hesthaven, Reza Mokhtari

This paper is devoted to determining a space-dependent source term in an inverse problem of the time-fractional diffusion equation. We use a fully-discrete method based on a finite difference scheme in time and a local discontinuous Galerkin method (LDG) i ...

Springer2017

Notions of affinity in calculus of variations with differential forms

Saugata Bandyopadhyay, Swarnendu Sil

Ext-int. one affine functions are functions affine in the direction of one-divisible exterior forms with respect to the exterior product in one variable and with respect to the interior product in the other. The purpose of this article is to prove a charac ...

Walter De Gruyter Gmbh2016

Enumeration of reversible functions and its application to circuit complexity

Giovanni De Micheli, Mathias Soeken, Nabila Abdessaied

We review combinational results to enumerate and classify reversible functions and investigate the application to circuit complexity. In particularly, we consider the effect of negating and permuting input and output variables and the effect of applying li ...

Springer2016

Reduced Basis Methods: From Low-Rank Matrices To Low-Rank Tensors

Daniel Kressner, Jonas Ballani

We propose a novel combination of the reduced basis method with low-rank tensor techniques for the efficient solution of parameter-dependent linear systems in the case of several parameters. This combination, called rbTensor, consists of three ingredients. ...

Siam Publications2016

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search