Concept

Correspondance de Galois

Publications associées (33)

Forward-reflected-backward method with variance reduction

We propose a variance reduced algorithm for solving monotone variational inequalities. Without assuming strong monotonicity, cocoercivity, or boundedness of the domain, we prove almost sure convergence of the iterates generated by the algorithm to a soluti ...

2021

A reflected forward-backward splitting method for monotone inclusions involving Lipschitzian operators

Volkan Cevher, Cong Bang Vu

In this paper, we propose a novel splitting method for finding a zero point of the sum of two monotone operators where one of them is Lipschizian. The weak convergence the method is proved in real Hilbert spaces. Applying the proposed method to composite m ...

2020

Construction of Polar Codes With Sublinear Complexity

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Design framework for the structural analysis of free-form timber plate structures using wood-wood connections

Yves Weinand, Petras Vestartas, Anh Chi Nguyen

Geometrically complex timber plate structures using wood-wood connections are increasingly designed thanks to digital fabrication. Whereas their fabrication has been automated using computer-aided design programming, research focused on the development of ...

2019

Stochastic Forward-Douglas-Rachford Splitting for Monotone Inclusions

Volkan Cevher, Alp Yurtsever, Cong Bang Vu

We propose a stochastic Forward-Douglas-Rachford Splitting framework for finding a zero point of the sum of three maximally monotone operators in real separable Hilbert space, where one of the operators is cocoercive. We characterize the rate of convergenc ...

Springer International Publishing2018

Mapping Monotone Boolean Functions into Majority

Giovanni De Micheli, Mathias Soeken, Luca Gaetano Amarù, Eleonora Testa, Winston Jason Haaswijk

We consider the problem of decomposing monotone Boolean functions into majority-of-three operations, with a particular focus on decomposing the majority-n function. When targeting monotone Boolean functions, Shannon's expansion can be expressed by a single ...

2018

Computing heteroclinic orbits using adjoint-based methods

Tobias Schneider, Mirko Farano

Transitional turbulence in shear flows is supported by a network of unstable exact invariant solutions of the Navier-Stokes equations. The network is interconnected by heteroclinic connections along which the turbulent trajectories evolve between invariant ...

CAMBRIDGE UNIV PRESS2018

Adventures in Monotone Complexity and TFNP

Mika Tapani Göös, Dmitrii Sokolov

Separations: We introduce a monotone variant of Xor-Sat and show it has exponential monotone circuit complexity. Since Xor-Sat is in NC^2, this improves qualitatively on the monotone vs. non-monotone separation of Tardos (1988). We also show that monotone ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2018

Cohomological Invariants for G-Galois Algebras and Self-Dual Normal Bases

Eva Bayer Fluckiger

Cohomological Invariants for G-Galois Algebras and Self-Dual Normal Bases. We define degree two cohomological invariants for

G

-Galois algebras over fields of characteristic not 2, and use them to give necessary conditions for the existence of a self--dua ...

2017

Some consequences of Masser's counting theorem on elliptic curves

Valéry Aurélien Mahé

We use Masser's counting theorem to prove a lower bound for the canonical height in powers of elliptic curves. We also prove the Galois case of the elliptic Lehmer problem, combining Kummer theory and Masser's result with bounds on the rank and torsion of ...

Springer Heidelberg2017

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

Cohomological Invariants for G-Galois Algebras and Self-Dual Normal Bases

Eva Bayer Fluckiger

Cohomological Invariants for G-Galois Algebras and Self-Dual Normal Bases. We define degree two cohomological invariants for

G

-Galois algebras over fields of characteristic not 2, and use them to give necessary conditions for the existence of a self--dua ...

2017