Complemented lattice

Science formelle
Logique
Logique classique
Calcul des prédicats

Publications associées (17)

Page 2 sur 2

À propos
Confidentialité
Mentions légales

Graph Chatbot

A variational investigation of the SU(N) Heisenberg model in antisymmetric irreducible representations

Jérôme Dufour

Motivated by recent experimental progress in the context of ultra-cold multi-colour fermionic atoms in optical lattices, this thesis investigates the properties of the antiferromagnetic SU(N) Heisenberg models with fully antisymmetric irreducible represent ...

EPFL2016

A sieve algorithm based on overlattices

Anja Annemone Becker

In this paper, we present a heuristic algorithm for solving exact, as well as approximate, shortest vector and closest vector problems on lattices. The algorithm can be seen as a modified sieving algorithm for which the vectors of the intermediate sets lie ...

Cambridge Univ Press2014

L-2-Betti numbers of locally compact groups

Henrik Densing Petersen

The present paper is a summary and overview of results obtained in the author's thesis, "L-2-Betti Numbers of Locally Compact Groups", wherein the definition of L-2-Betti numbers for countable groups is extended to locally compact unimodular groups. In man ...

Elsevier2013

On the number of lattice points in a small sphere and a recursive lattice decoding algorithm

Annika Meyer

Let L be a lattice in . This paper provides two methods to obtain upper bounds on the number of points of L contained in a small sphere centered anywhere in . The first method is based on the observation that if the sphere is sufficiently small then the la ...

Springer US2013

Isometry groups of non-positively curved spaces: Discrete subgroups

Nicolas Monod

We study lattices in non-positively curved metric spaces. Borel density is established in that setting as well as a form of Mostow rigidity. A converse to the flat torus theorem is provided. Geometric arithmeticity results are obtained after a detour throu ...

2009

Quasi-Interpolating Spline Models for Hexagonally-Sampled Data

Dimitri Nestor Alice Van De Ville

The reconstruction of a continuous-domain representation from sampled data is an essential element of many image processing tasks, in particular, image resampling. Until today, most image data have been available on Cartesian lattices, despite the many the ...

IEEE2007

Hexagonal Versus Orthogonal Lattices: A New Comparison Using Approximation Theory

Dimitri Nestor Alice Van De Ville, Thierry Blu

We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the “natural” spline basis function as generator for a shift-invariant function space; i.e., the tensor-product B-spli ...

IEEE2005

Page 2 sur 2