Concept

Produit tensoriel de deux modules

Publications associées (86)

Correspondence functors and finiteness conditions

We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties wh ...

2018

Reductive overgroups of distinguished unipotent elements in simple algebraic groups

Mikko Tapani Korhonen

Let

G

be a simple linear algebraic group over an algebraically closed field

K

of characteristic

p \geq 0

. In this thesis, we investigate closed connected reductive subgroups

X < G

that contain a given distinguished unipotent element

u

G

. Our ...

EPFL2018

L-2-Betti Numbers Of Rigid C*-Tensor Categories And Discrete Quantum Groups

Sven Raum

We compute the L-2-Betti numbers of the free C*-tensor categories, which are the representation categories of the universal unitary quantum groups A(u)(F). We show that the L-2-Betti numbers of the dual of a compact quantum group G are equal to the L-2-Bet ...

Mathematical Science Publ2017

Combinatorial presentation of multidimensional persistent homology

Martina Scolamiero

A multifiltration is a functor indexed by Nr that maps any morphism to a monomorphism. The goal of this paper is to describe in an explicit and combinatorial way the natural Nr-graded R[x(1),...x(r)]-module structure on the homology of a multifiltration of ...

Elsevier2017

Preconditioned Low-Rank Riemannian Optimization For Linear Systems With Tensor Product Structure

Daniel Kressner, Michael Maximilian Steinlechner

The numerical solution of partial differential equations on high-dimensional domains gives rise to computationally challenging linear systems. When using standard discretization techniques, the size of the linear system grows exponentially with the number ...

Siam Publications2016

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

Riemannian Optimization For High-Dimensional Tensor Completion

Michael Maximilian Steinlechner

Tensor completion aims to reconstruct a high-dimensional data set where the vast majority of entries is missing. The assumption of low-rank structure in the underlying original data allows us to cast the completion problem into an optimization problem rest ...

Siam Publications2016

Efficient matrix computation for tensor-product isogeometric analysis: the use of sum factorization

Annalisa Buffa, Pablo Antolin Sanchez, Maurizio Martinelli

In this paper we discuss the use of the sum-factorization for the calculation of the integrals arising in Galerkin isogeometric analysis. While introducing very little change in an isogeometric code based on element-by-element quadrature and assembling, th ...

2015

Sur quelques foncteurs de bi-ensembles

Rosalie Françoise Chevalley

This thesis is in the context of representation theory of finite groups. More specifically, it studies biset functors. In this thesis, I focus on two biset functors: the Burnside functor and the functor of p-permutation modules. For the Burnside functor we ...

EPFL2015

MATHICSE Technical Report : Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure

Daniel Kressner, Michael Maximilian Steinlechner

MATHICSE2015

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