Concept

Théorème des zéros de Hilbert

Publications associées (11)

Convex Combination of Diffusion Strategies Over Networks

Combining diffusion strategies with complementary properties enables enhanced performance when they can be run simultaneously. In this article, we first propose two schemes for the convex combination of two diffusion strategies, namely, the power-normalize ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Orders That Are Etale-Locally Isomorphic

Eva Bayer Fluckiger

Let R be a semilocal Dedekind domain with fraction field F. It is shown that two hereditary R-orders in central simple F-algebras that become isomorphic after tensoring with F and with some faithfully flat etale R-algebra are isomorphic. On the other hand, ...

AMER MATHEMATICAL SOC2020

Affine Combination of Diffusion Strategies Over Networks

Ali H. Sayed, Jie Chen

Diffusion adaptation is a powerful strategy for distributed estimation and learning over networks. Motivated by the concept of combining adaptive filters, this work proposes a combination framework that aggregates the operation of multiple diffusion strate ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Open and Closed Radicals: Local Geometry around Unpaired Electrons Governs Magic-Angle Spinning Dynamic Nuclear Polarization Performance

David Lyndon Emsley, Yu Rao, Dominik Józef Kubicki, Moreno Lelli, Gabriele Stevanato, Manuel Cordova, Georges Guévork Jean-Jacques Menzildjian

The development of magic-angle spinning dynamic nuclear polarization (MAS DNP) has allowed atomic-level characterization of materials for which conventional solid-state NMR is impractical due to the lack of sensitivity. The rapid progress of MAS DNP has be ...

2020

Orders that are étale-locally isomorphic

Eva Bayer Fluckiger, Mathieu Huruguen

Let R be a semilocal Dedekind domain with fraction field F. It is shown that two hereditary R-orders in central simple F-algebras that become isomorphic after tensoring with F and with some faithfully flat étale R-algebra are isomorphic. On the other hand, ...

2019

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Exact diagonalization of SU( N ) Heisenberg and Affleck-Kennedy-Lieb-Tasaki chains using the full SU( N ) symmetry

Frédéric Mila, Pierre Marcel Nataf, Kianna Wan

We present a method for the exact diagonalization of the SU(N) Heisenberg interaction Hamiltonian using Young tableaus to work directly in each irreducible representation of the global SU(N) group. This generalized scheme is applicable to chains consisting ...

2017

Combinatorial presentation of multidimensional persistent homology

Martina Scolamiero

A multifiltration is a functor indexed by Nr that maps any morphism to a monomorphism. The goal of this paper is to describe in an explicit and combinatorial way the natural Nr-graded R[x(1),...x(r)]-module structure on the homology of a multifiltration of ...

Elsevier2017

ElimLin Algorithm Revisited

Serge Vaudenay, Pouyan Sepehrdad, Petr Susil

ElimLin is a simple algorithm for solving polynomial systems of multivariate equations over small finite fields. It was initially proposed as a single tool by Courtois to attack DES. It can reveal some hidden linear equations existing in the ideal generate ...

Springer2012

On Sums of Locally Testable Affine Invariant Properties

Ghid Maatouk, Elena Grigorescu

Affine-invariant properties are an abstract class of properties that generalize some central algebraic ones, such as linearity and low-degree-ness, that have been studied extensively in the context of property testing. Affine invariant properties consider ...

Springer2011

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