Concept

Relation d'équivalence

Publications associées (60)

The torsion group of endotrivial modules

Let G be a finite group and let T(G) be the abelian group of equivalence classes of endotrivial kG-modules, where k is an algebraically closed field of characteristic p. We determine, in terms of the structure of G, the kernel of the restriction map from T ...

Mathematical Science Publ2015

Locally Refinable Parametric Snakes

Michaël Unser, Daniel Andreas Schmitter, Anaïs Laure Marie-Thérèse Badoual

Shape segmentation is an active field of research in biomedical imaging. In this context, we present a new parameterization of a snake that is locally refinable. We introduce the possibility of locally increasing the approximation power of the parametric m ...

IEEE2015

Hermitian Categories, Extension Of Scalars And Systems Of Sesquilinear Forms

Eva Bayer Fluckiger, Daniel Arnold Moldovan

We prove that the category of systems of sesquilinear forms over a given hermitian category is equivalent to the category of unimodular 1-hermitian forms over another hermitian category. The sesquilinear forms are not required to be unimodular or defined o ...

Pacific Journal Mathematics2014

Actions of amenable equivalence relations on CAT(0) fields

Martin Anderegg, Philippe Paul Antoine Henry

We present the general notion of Borel fields of metric spaces and show some properties of such fields. Then we make the study specific to the Borel fields of proper CAT(0) spaces and we show that the standard tools we need behave in a Borel way. We also i ...

Cambridge University Press2014

Torsion-free endotrivial modules

Jacques Thévenaz, Nadia Mazza

Let G be a finite group and let T(G) be the abelian group of equivalence classes of endotrivial kG-modules, where k is an algebraically closed field of characteristic p. We investigate the torsion-free part TF(G) of the group T(G) and look for generators o ...

Elsevier2014

Sampling 2-D Signals on a Union of Lattices that Intersect on a Lattice

Jayakrishnan Unnikrishnan

This paper presents new sufficient conditions under which a field (or image) can be perfectly reconstructed from its samples on a union of two lattices that share a common coarse lattice. In particular, if samples taken on the first lattice can be used to ...

Ieee2014

Reversible Sesqui-Pushout Rewriting, Graph Transformation

Sandro Stucki

The paper proposes a variant of sesqui-pushout rewriting (SqPO) that allows one to develop the theory of nested application conditions (NACs) for arbitrary rule spans; this is a considerable generalisation compared with existing results for NACs, which onl ...

Springer2014

The Dade group of a finite group

Caroline Lassueur

The aim of this paper is to construct an equivalent of the Dade group of a p-group for an arbitrary finite group G, whose elements are equivalences classes of endo-p-permutation modules. To achieve this goal we use the theory of relative projectivity with ...

Elsevier2013

Stress-corrosion failure mechanisms in soda-lime silica glass

Pieter Christian Louter, Maria Lindqvist, Costanza Ronchetti

The present work focuses on stress-corrosion mechanisms in soda-lime silica glass. Four-point beam-bending tests were performed on small specimens, measuring failure time in function of temperature and relative humidity. By using linear elastic fracture me ...

Elsevier2013

Complete Completion using Types and Weights

Viktor Kuncak, Tihomir Gvero, Ivan Kuraj, Ruzica Piskac

Developing modern software typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that synthesizes ...

ACM2013

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