Concept

Linearly ordered group

Related publications (6)

Uniformly perfect finitely generated simple left orderable groups

We show that the finitely generated simple left orderable groups G(rho) constructed by the first two authors in Hyde and Lodha [Finitely generated infinite simple groups of homeomorphisms of the real line. Invent. Math. (2019), doi:10.1007/s00222-01900880- ...

CAMBRIDGE UNIV PRESS2021

Geodesic flows on real forms of complex semi-simple Lie groups of rigid body type

Tudor Ratiu

The geodesic flows are studied on real forms of complex semi-simple Lie groups with respect to a left-invariant (pseudo-)Riemannian metric of rigid body type. The Williamson types of the isolated relative equilibria on generic adjoint orbits are determined ...

SPRINGER INTERNATIONAL PUBLISHING AG2020

Finitely generated infinite simple groups of homeomorphisms of the real line

Yash Lodha

We construct examples of finitely generated infinite simple groups of homeomorphisms of the real line. Equivalently, these are examples of finitely generated simple left (or right) orderable groups. This answers a well known open question of Rhemtulla from ...

SPRINGER HEIDELBERG2019

Restoring Jean Prouvé. The “Buvette” at Evian and other technical objects

Giulia Marino

Completed in 1957, the new buvette (pump room) of the Source Cachat in Evian-les-Bains is to be classed among twentieth-century icons. The building was the outcome of a fruitful partnership be-tween an experienced architect, Maurice Novarina, an “inspired ...

Docomomo International and Docomomo Slovenia2018

Distributed Similarity Search in High Dimensions Using Locality Sensitive Hashing

Karl Aberer, Sebastian Michel, Parisa Haghani

In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH) which has proven very efficient in answering KNN queries in centralized set ...

2009

A note on order preserving matchings

Thomas Liebling, François Margot

We study order preserving injections or bipartite matchings from poset V1 to poset V2. When V1 is totally ordered, we give an efficient algorithm for the associated optimization problem and the convex hull of the corresponding characteristic vectors. If V2 ...

1989

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.