Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Principal ideal

Related publications (18)

The multivariate Serre conjecture ring

Luc Guyot

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

Academic Press Inc Elsevier Science2023

Singular global components and frequency shift of the geodesic acoustic continuum modes in shaped tokamaks

Jonathan Graves

Within the ideal magnetohydrodynamic (MHD) model, the geodesic acoustic modes (GAMs) in tokamaks derived by Winsor et al (1968 Phys. Fluids 11 2448) belong to the continuous spectrum, characterised by unbounded non-square integrable eigenfunctions (delta f ...

2019

Subaquatic slope instabilities: The aftermath of river correction and artificial dumps in Lake Biel (Switzerland)

Alfred Johny Wüest, Carl Love Mikael Råman Vinnå

River engineering projects are developing rapidly across the globe, drastically modifying water courses and sediment transfer. Investigation of the impact of engineering works focuses usually on short-term impacts, thus a longer-term perspective is still m ...

2020

Computer Algebraic Approach to Verification and Debugging of Galois Field Multipliers

Cunxi Yu

The paper presents a novel method to verify and debug gate-level arithmetic circuits implemented in Galois Field arithmetic. The method is based on forward reduction of the specification polynomials of the circuit in GF(2(m)) using GF(2) models of its logi ...

IEEE2018

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

The algebra of essential relations on a finite set

Jacques Thévenaz, Serge Bouc

Let X be a finite set and let k be a commutative ring. We consider the k-algebra of the monoid of all relations on X, modulo the ideal generated by the relations factorizing through a set of cardinality strictly smaller than Card(X), called inessential rel ...

Walter de Gruyter2016

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

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

Sup-norms of Eigenfunctions on Arithmetic Ellipsoids

Philippe Michel

Let B be a positive quaternion algebra, and let O subset of B be an Eichler order. There is associated, in a natural way, a variety X = X(O) the connected components of which are indexed by the ideal classes of O and are isomorphic to spheres. This variety ...

Oxford University Press2011

Distribution of periodic torus orbits and Duke's theorem for cubic fields

Philippe Michel

We study periodic torus orbits on spaces of lattices. Using the action of the group of adelic points of the underlying tori, we define a natural equivalence relation on these orbits, and show that the equivalence classes become uniformly distributed. This ...

2011

Annihilating Polynomials for Quadratic Forms

Let K be a field with char(K) ≠ 2. The Witt-Grothendieck ring (K) and the Witt ring W (K) of K are both quotients of the group ring ℤ[𝓖(K)], where 𝓖(K) := K*/(K*)2 is the square class group of K. Since ℤ[𝓖(K)] is integra ...

EPFL2010

Arithmetic Bounds-Lenstra's Constant and Torsion of K-Groups

This thesis is concerned with computations of bounds for two different arithmetic invariants. In both cases it is done with the intention of proving some algebraic or arithmetic properties for number fields. The first part is devoted to computations of low ...

EPFL2010

On Hermitian Pfister Forms

Let K be a field of characteristic different from 2. It is known that a quadratic Pfister form over K is hyperbolic once it is isotropic. It is also known that the dimension of an anisotropic quadratic form over K belonging to a given power of the fundamen ...

2008

A mealy machine with polynomial growth of irrational degree

We consider a very simple Mealy machine ( two nontrivial states over a two-symbol alphabet), and derive some properties of the semigroup it generates. It is an infinite, finitely generated semigroup, and we show that the growth function of its balls behave ...

2008

Minimum euclidien des ordres maximaux dans les algèbres centrales à division

Jérôme Chaubert

This work concerns the study of Euclidean minima of maximal orders in central simple algebras. In the first part, we define the concept of ideal lattice in the non-commutative case. Let A be a semi-simple algebra over Q. An ideal lattice over A is a triple ...

EPFL2007

Réseaux idéaux sur des corps CM et des corps totalement réels

Ivan Suarez Atias

This thesis deals with the study of ideal lattices over number fields. Let K be a number field, which is assumed to be CM or totally real. An ideal lattice over K is a pair (I,b), where I is a fractional ideal of K and b : I × I → R is a symmetric positive ...

EPFL2005

Modélisation des entreprises sur la base des compétences

Grégoire Pepiot

Today enterprises operate in a constantly changing market, characterized by shorter and shorter product life cycles, an increased demand for flexibility and changing techniques and technologies. In order to control these factors of complexity, enterprise m ...

EPFL2005

An object-oriented model for adaptive high-performance computing on the computational GRID

Tuan Anh Nguyen

The dissertation presents a new parallel programming paradigm for developing high performance (HPC) applications on the Grid. We address the question "How to tailor HPC applications to the Grid?" where the heterogeneity and the large scale of resources are ...

EPFL2005

Related publications (18)