Concept

Galois connection

Related publications (18)

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

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

Mapping Monotone Boolean Functions into Majority

Giovanni De Micheli, Eleonora Testa, Mathias Soeken, Luca Gaetano Amarù, 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

Michele De Palma, 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 University Press2018

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

Approximate Decoding for Network Coded Inter-dependent Data

Pascal Frossard, Nikolaos Thomos, Hyung Gon Park

In this paper, we consider decoding of loss tolerant data encoded by network coding and transmitted over error-prone networks. Intermediate network nodes typically perform the random linear network coding in a Galois field and a Gaussian elimination is use ...

Elsevier Science Bv2016

The renormalon diagram in gauge theories on R-3 x S-1

We analyze the renormalon diagram of gauge theories on . In particular, we perform exact one loop calculations for the vacuum polarization in QCD with adjoint matter and observe that all infrared logarithms, as functions of the external momentum, cancel be ...

Springer Nature2015

Mechanical form-finding of timber fabric structures

Seyed Sina Nabaei

How about fastening a knot? not with ropes... but with timber panels. Timber Fabric Structures (TFS) originate from such an inspiration. An architectural reinterpretation of fabric techniques (mainly braiding) using building scale timber panels to design ...

EPFL2014

Erratum for “Galois algebras, Hasse principle and induction-restriction methods” (vol 16, pg 677, 2011)

Eva Bayer Fluckiger

This is a correction to [BP 11] E. Bayer-Fluckiger, R. Parimala, Galois algebras, Hasse principle and induction-restriction methods, Documenta Math. 16 (2011), 677-707. ...

Univ Bielefeld2013

Bin Packing via Discrepancy of Permutations

Friedrich Eisenbrand, Thomas Rothvoss, Doemoetoer Palvoelgyi

A well-studied special case of bin packing is the 3-partition problem, where n items of size > 1/4 have to be packed in a minimum number of bins of capacity one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a suitable LP relaxati ...

Association for Computing Machinery2013

Hanani-Tutte and Monotone Drawings

Radoslav Fulek

A drawing of a graph is x-monotone if every edge intersects every vertical line at most once and every vertical line contains at most one vertex. Pach and Toth showed that if a graph has an x-monotone drawing in which every pair of edges crosses an even nu ...

Springer-Verlag Berlin2011

On the use of graphs in discrete tomography

Dominique de Werra, Bernard Ries

In this tutorial paper, we consider the basic image reconstruction problem which stems from discrete tomography. We derive a graph theoretical model and we explore some variations and extensions of this model. This allows us to establish connections with s ...

2010

On the Construction of Galois Towers

In this paper we study an asymptotically optimal tame tower over the field with p(2) elements introduced by Garcia-Stichtenoth. This tower is related with a modular tower, for which explicit equations were given by Elkies. We use this relation to investiga ...

American Mathematical Society, P.O. Box 6248 Ms. Phoebe Murdock, Providence, Ri 02940 Usa2009

Singularities of generic characteristic polynomials and smooth finite splittings of Azumaya algebras over surfaces

Manuel Ojanguren

Let k be an algebraically closed field. Let P(X-11,...,X-nn, T) be the characteristic polynomial of the generic matrix (X-ij) over k. We determine its singular locus as well as the singular locus of its Galois splitting. If X is a smooth quasi-projective s ...

Springer-Verlag2009

Homotopic Hopf-Galois extensions: foundations and examples

Kathryn Hess Bellwald

Hopf-Galois extensions of rings generalize Galois extensions, with the coaction of a Hopf algebra replacing the action of a group. Galois extensions with respect to a group

G

are the Hopf-Galois extensions with respect to the dual of the group algebra of ...

2009

Multiple of trace forms and algebras with involution

Eva Bayer Fluckiger

Let k be a field of characteristic

\neq

2, and let G be a finite group. The aim of this article is to give a cohomological criterion for the isomorphism of multiples of trace forms of G-Galois algebras over k. The proof uses results concerning multiples ...

Oxford University Press2007

Anneau de Witt des G-formes et multiples de G-formes trace

Philippe Chabloz

This thesis deals with the study of G-forms and particulary the trace form of a G-Galois algebra. Let k be a field of characteristic not two. Let G be a finite group and L a G-Galois algebra over k. We define the trace form qL by qL(x, y) = TrL/k(xy) for a ...

EPFL2004