Publications associées (34)

How hard is to distinguish graphs with graph neural networks?

Andreas Loukas

A hallmark of graph neural networks is their ability to distinguish the isomorphism class of their inputs. This study derives hardness results for the classification variant of graph isomorphism in the message-passing model (MPNN). MPNN encompasses the maj ...
2020

On Power Scalability of Modular Multilevel Converters: Increasing Current Ratings Through Branch Paralleling

Drazen Dujic, Stefan Milovanovic

The modular multilevel converter (MMC) presented in Figure 1 found its place within highvoltage and medium-voltage (MV) applications owing to the possibility of effortlessly meeting the imposed voltage requirements by stacking the so-called submodules (SMs ...
2020

Finitely generated infinite simple groups of homeomorphisms of the real line

Yash Lodha

We construct examples of finitely generated infinite simple groups of homeomorphisms of the real line. Equivalently, these are examples of finitely generated simple left (or right) orderable groups. This answers a well known open question of Rhemtulla from ...
SPRINGER HEIDELBERG2019

Comprehensive Analysis and Design of a Quasi Two-Level Converter Leg

Drazen Dujic, Stefan Milovanovic

Quasi two-level operation of voltage source converters, intended to operate either within high/medium voltage DC networks or low output frequency applications, has caught the attention of both academia and industry. Sequential insertion of the so-called su ...
2019

A generalization of Kátai's orthogonality criterion with applications

Florian Karl Richter

We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of Kátai's orthogonality cri ...
2019

First principles gyrokinetic analysis of electromagnetic plasma instabilities

Laurent Villard, Stephan Brunner, Emmanuel Lanti, Alberto Bottino, Noé Thomas Elie Ohana

A two-fold analysis of electromagnetic core tokamak instabilities in the framework of the gyrokinetic theory is presented. First principle theoretical foundations of the gyrokinetic theory are used to explain and justify the numerical results obtained with ...
IOP PUBLISHING LTD2019

Restriction of irreducible modules for Spin2+1(K) to Spin2(K)

Mikaël Cavallin

Let K be an algebraically closed field of characteristic p0p\geq0 and let Y=SPin2n+1(K)(n3)Y=SPin_{2n+1}(K) (n\geq3) be a simply connected simple algebraic group of type BnB_n over KK. Also let XX be the subgroup of type DnD_n, embedded in YY in the usual way, as the ...
2017

Patching And Weak Approximation In Isometry Groups

Eva Bayer Fluckiger

Let R be a semilocal principal ideal domain. Two algebraic objects over R in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all completions of R and its fract ...
Amer Mathematical Soc2017

Revisiting the nilpotent polynomial Hales–Jewett theorem

Florian Karl Richter

Answering a question posed by Bergelson and Leibman in [6], we establish a nilpotent version of the Polynomial Hales–Jewett Theorem that contains the main theorem in [6] as a special case. Important to the formulation and the proof of our main theorem is t ...
2017

Elliptic curves over a finite field and the trace formula

Ian Nicholas Petrow

We prove formulas for power moments for point counts of elliptic curves over a finite field k such that the groups of k-points of the curves contain a chosen subgroup. These formulas express the moments in terms of traces of Hecke operators for certain con ...
Wiley2017

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.