Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Recherche

Afficher tous les résultats pour

Accueil

Concept

Espace affine

Science formelle
Mathématiques
Algèbre
Algèbre linéaire

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (28)

Page 2 sur 2

On the fundamental domain of affine Springer fibers

Zongbin Chen

Let G be a connected reductive algebraic group over an algebraically closed field k,gamma is an element of g( k(( epsilon ))) a semisimple regular element, we introduce a fundamental domain F gamma for the affine Springer fibers X gamma. We show that the p ...

Springer Heidelberg2017

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

Tudor Ratiu

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

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

Fabio Nobile, Giovanni Migliorati

We analyze the accuracy of the discrete least-squares approximation of a function

u

in multivariate polynomial spaces

P_\Lambda:=span\{y\mapsto y^\nu \,: \, \nu\in \Lambda\}

with

\Lambda\subset N_0^d

over the domain

\Gamma:=[-1,1]^d

, based on the s ...

2017