Concept

Uniform polytope

Related publications (17)

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.

Synthesis and properties of heterostructures in nanowires and 2-D materials

Akshay Balgarkashi

Modern solid-state devices were made possible by the discovery of semiconductor heterostructures. Heterostructures offer the ability to fabricate low-dimensional nanostructures such as quantum dots which can restrain carriers in all three-directions. Quant ...

EPFL2022

On the Volume of the John-Lowner Ellipsoid

Grigory Ivanov

We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...

SPRINGER2020

Facet-driven formation of axial and radial In(Ga)As clusters in GaAs nanowires

Anna Fontcuberta i Morral, Lucas Güniat, Santhanu Panikar Ramanandan, Didem Dede, Martin George Friedl, Jean-Baptiste Leran, Wonjong Kim, Nicolas Tappy, Akshay Balgarkashi

Embedding quantum dots in nanowires (NWs) constitutes one promising building block for quantum photonic technologies. Earlier attempts to grow InAs quantum dots on GaAs nanowires were based on the Stranski-Krastanov growth mechanism. Here, we propose a nov ...

IOP PUBLISHING LTD2020

Complexity of linear relaxations in integer programming

Matthias Schymura

For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity rc(X). This parameter was introduced by Kaibel & Weltge (2015) and captures the ...

2020

Exceptional graphs for the random walk

Juhan Aru

If W is the simple random walk on the square lattice Z(2), then W induces a random walk W-G on any spanning subgraph G subset of Z(2) of the lattice as follows: viewing W as a uniformly random infinite word on the alphabet {x, -x, y, -y}, the walk W-G star ...

INST MATHEMATICAL STATISTICS2020

Presymplectic convexity and (ir)rational polytopes

Tudor Ratiu

In this paper, we extend the Atiyah-Guillemin-Sternberg convexity theorem and Delzant's classification of symplectic toric manifolds to presymplectic manifolds. We also define and study the Morita equivalence of presymplectic toric manifolds and of their c ...

2019

Uniform s-Cross-Intersecting Families

Andrei Kupavskii

In this paper we study a question related to the classical Erdos-Ko-Rado theorem, which states that any family of k-element subsets of the set [n] = {1,..., n} in which any two sets intersect has cardinality at most ((n-1)(k-1)). We say that two non-empty ...

Cambridge Univ Press2017

On Polygons Excluding Point Sets

Radoslav Fulek, Balázs Keszegh, Filip Moric

By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that is in general position, and the convex hull of B c ...

Springer Japan2013

Compressed look-up-table based real-time rectification hardware

Alexandre Schmid, Yusuf Leblebici, Abdulkadir Akin, Ipek Baz, Luis Manuel Gaemperle

Stereo image rectification is a pre-processing step of disparity estimation intended to remove image distortions and to enable stereo matching along an epipolar line. A real-time disparity estimation system needs to perform real-time rectification which re ...

2013

Optimal decision trees for point location in polytopic data sets - application to explicit MPC

Colin Neil Jones

Explicit Model Predictive Control (EMPC) produces control laws defined over a set of polytopic regions in the state space. In this paper we present a method to create a binary search tree for point location in such polytopic sets, in order to provide a fas ...

2010