Concept

Groupe général linéaire

Publications associées (70)

Linear and non-linear studies of spurious backward-wave instabilities in a smooth-wall gyrotron beam duct

Stefano Alberti, Jérémy Genoud, Trach-Minh Tran

Recently developed self-consistent models for beam-wave interaction simulations of a gyrotron oscillator are used to study spurious backward-wave instabilities in smooth-wall metallic beam ducts. Starting from a simple case with a basic geometry, the influ ...

2017

Special Reductive Groups Over An Arbitrary Field

Mathieu Huruguen

A linear algebraic group G defined over a field k is called special if every G-torsor over every field extension of k is trivial. In 1958 Grothendieck classified special groups in the case where the base field is algebraically closed. In this paper we desc ...

Springer Birkhauser2016

Revisiting the Sanders-Bogolyubov-Ruzsa Theorem in F-p(n) and its Application to Non-malleable Codes

Divesh Aggarwal

Non-malleable codes (NMCs) protect sensitive data against degrees of corruption that prohibit error detection, ensuring instead that a corrupted codeword decodes correctly or to something that bears little relation to the original message. The split-state ...

Ieee2016

Bifurcation points of a singular boundary-value problem on (0,1)

Charles Stuart

Following earlier work on some special cases [17,11] and on the analogous problem in higher dimensions [10,20], we make a more thorough investigation of the bifurcation points for a nonlinear boundary value problem of the form -{A(x)u' (x)}'.= f (lambda, x ...

Academic Press Inc Elsevier Science2016

Multi-Component Ginzburg-Landau Theory: Microscopic Derivation and Examples

Marius Christopher Lemm

This paper consists of three parts. In part I, we microscopically derive Ginzburg–Landau (GL) theory from BCS theory for translation-invariant systems in which multiple types of superconductivity may coexist. Our motivation are unconventional superconducto ...

2016

Representer Theorems for Sparsity-Promoting $ ℓ _{ 1 } $ Regularization

Michaël Unser, Julien René Pierre Fageot, Harshit Gupta

We present a theoretical analysis and comparison of the effect of

ℓ _{ 1 }

versus

ℓ _{ 2 }

regularization for the resolution of ill-posed linear inverse and/or compressed sensing problems. Our formulation covers the most general setting where the s ...

IEEE2016

Reducing acquisition time for axon diameter mapping using global optimization in the spatial-angular-microstructure space

Jean-Philippe Thiran, Yves Wiaux, Erick Jorge Canales Rodriguez, David Paul Roger Romascano, Alessandro Daducci, Anna Auria Rasclosa, Tim Bjørn Dyrby

State-of-the-art microstructure imaging methods usually fit biophysical models to the diffusion MRI data on a voxel-by-voxel basis using non-linear procedures that require both long acquisitions and processing time. We recently introduced AMICO, a framewor ...

2016

Distinguished unipotent elements and multiplicity-free subgroups of simple algebraic groups

Donna Testerman, Martin W. Liebeck

For G a simple algebraic group over an algebraically closed field of characteristic 0, we determine the irreducible representations ρ:G→I(V), where I(V) denotes one of the classical groups SL(V), Sp(V), SO(V), such that ρ sends some distinguished unipotent ...

2015

Subgroups Of Simple Algebraic Groups Containing Regular Tori, And Irreducible Representations With Multiplicity 1 Non-Zero Weights

Donna Testerman

Our main goal is to determine, under certain restrictions, the maximal closed connected subgroups of simple linear algebraic groups containing a regular torus. We call a torus regular if its centralizer is abelian. We also obtain some results of independen ...

Springer Verlag2015

Slow fluctuations in recurrent networks of spiking neurons

Tilo Schwalger

Networks of fast nonlinear elements may display slowfluctuations if interactions are strong. We find a transition in the long-term variability of a sparse recurrent network of perfect integrate-and-fire neurons at which the Fano factor switches from zero t ...

Amer Physical Soc2015

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