Concept

Anneau principal

Publications associées (26)

The multivariate Serre conjecture ring

It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension

San Diego2023

Metallicity Distribution Functions of 13 Ultra-faint Dwarf Galaxy Candidates from Hubble Space Telescope Narrowband Imaging

Nicolas Lawrence Etienne Longeard

We present uniformly measured stellar metallicities of 463 stars in 13 Milky Way (MW) ultra-faint dwarf galaxies (UFDs; M-V = -7.1 to -0.8) using narrowband CaHK (F395N) imaging taken with the Hubble Space Telescope. This represents the largest homogeneous ...

Bristol2023

One-type-fits-all-systems: Strategies for preventing potential-induced degradation in crystalline silicon solar photovoltaic modules

Christophe Ballif, Alessandro Francesco Aldo Virtuani, Eleonora Annigoni

In this work, we investigate the relationship between potential-induced degradation (PID) and the bill of material used in module manufacturing. We manufacture samples with different combination of materials, using two types of solar cells (conventional vs ...

WILEY2019

LRSAM1-mediated ubiquitylation is disrupted in axonal Charcot-Marie-Tooth disease 2P

Vincenzo Sorrentino

Charcot-Marie-Tooth (CMT) disease type 2 is a genetically heterogeneous group of inherited neuropathies characterized by motor and sensory deficits as a result of peripheral axonal degeneration. We recently reported a frameshift (FS) mutation in the Really ...

Oxford Univ Press2017

Short Stickelberger Class Relations and Application to Ideal-SVP

Benjamin Pierre Charles Wesolowski

The worst-case hardness of finding short vectors in ideals of cyclotomic number fields (Ideal-SVP) is a central matter in lattice based cryptography. Assuming the worst-case hardness of Ideal-SVP allows to prove the Ring-LWE and Ring-SIS assumptions, and t ...

Springer International Publishing Ag2017

Computational Aspects of Jacobians of Hyperelliptic Curves

Alina Dudeanu

Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...

EPFL2016

A Multiscale Pyramid Transform for Graph Signals

Pierre Vandergheynst, David Shuman, Mohammadjavad Faraji

Multiscale transforms designed to process analog and discrete-time signals and images cannot be directly applied to analyze high-dimensional data residing on the vertices of a weighted graph, as they do not capture the intrinsic topology of the graph data ...

Institute of Electrical and Electronics Engineers2016

Principal Polynomial Analysis

Devis Tuia

This paper presents a new framework for manifold learning based on a sequence of principal polynomials that capture the possibly nonlinear nature of the data. The proposed Principal Polynomial Analysis (PPA) generalizes PCA by modeling the directions of ma ...

World Scientific Publ Co Pte Ltd2014

Spaces With Noetherian Cohomology

Jérôme Scherer

Is the cohomology of the classifying space of a p-compact group, with Noetherian twisted coefficients, a Noetherian module? In this paper we provide, over the ring of p-adic integers, such a generalization to p-compact groups of the Evens-Venkov Theorem. W ...

Cambridge University Press2013

Polar ring galaxies as tests of gravity

Polar ring galaxies are ideal objects with which to study the three-dimensional shapes of galactic gravitational potentials since two rotation curves can be measured in two perpendicular planes. Observational studies have uncovered systematically larger ro ...

Oxford Univ Press2013

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