Concept

Plane (mathematics)

Related publications (61)

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.

The fundamental plane of EDisCS galaxies The effect of size evolution (vol 524, A6, 2010)

Pascale Jablonka

We discovered a mistake in Eqs. (7) and (10) of Saglia et al. (2010, A&A, 524, A6), which propagates to Tables 8 and 9 and Fig. 25. We revise the tables, the figure and the affected statements in the paper. As a result, the reduction in the luminosity evol ...

Edp Sciences S A2016

An Improved Upper Bound for the ErdAs-Szekeres Conjecture

Let ES(n) denote the minimum natural number such that every set of ES(n) points in general position in the plane contains n points in convex position. In 1935, ErdAs and Szekeres proved that ES. In 1961, they obtained the lower bound , which they conjectur ...

Springer2016

Anisotropic transport properties of tungsten disulfide

László Forró, Richard Gaal, Helmuth Berger, Bálint Náfrádi, Andrea Pisoni, Jacim Jacimovic

Single crystals of WS2 were prepared by chemical vapor transport method using sulfur as a transport agent. Measurements of electrical resistivity, Seebeck coefficient and thermal conductivity as a function of temperature, along the in-plane and the out-of- ...

Pergamon-Elsevier Science Ltd2016

Unlabeled Sensing

Golnooshsadat Elhami

Like other data sensing problems, in unlabeled sensing, the target is to solve the equation y = Φx by finding vector x given a set of sample values in vector y as well as the matrix Φ. However, the main challenge in unlabeled sensing is that the correct or ...

2015

Free Edge Lengths in Plane Graphs

Radoslav Fulek, Filip Moric

We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graph H (where H is the "host" of G). The graph G is free in H if for every choice of positive lengths for the edges of G, the host H has a pla ...

Springer2015

In-Plane Mode Dynamics of Capillary Self-Alignment

Massimo Mastrangeli, Pierre Lambert

We present an experimental study of the complete in-plane dynamics of capillary self-alignment. The two translational (shift) and single rotational (twist) in-plane modes of square millimetric transparent dies bridged to shape-matching receptor sites throu ...

American Chemical Society2014

Generalized eigenvalue problems with specified eigenvalues

Daniel Kressner

We consider the distance from a (square or rectangular) matrix pencil to the nearest matrix pencil in 2-norm that has a set of specified eigenvalues. We derive a singular value optimization characterization for this problem and illustrate its usefulness fo ...

Oxford University Press2014

A tunable millimeter-wave phase shifter driven by dielectric elastomer actuators

Herbert Shea, Julien Perruisseau-Carrier, Samuel Rosset, Pietro Romano

We present the successful operation of the first dielectric elastomer actuator (DEA) driven tunable millimeter-wave phase shifter. The development of dynamically reconfigurable microwave/millimeter-wave (MW/MMW) antenna devices is becoming a prime need in ...

Spie-Int Soc Optical Engineering2014

A note on coloring line arrangements

János Pach, Rom Pinchasi

We show that the lines of every arrangement of n lines in the plane can be colored with O(root n/log n) colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. by a circle minus(root/log n) factor. Any further imp ...

Electronic Journal Of Combinatorics2014

Convergence of quasi-optimal Stochastic Galerkin methods for a class of PDES with random coefficients

Fabio Nobile, Lorenzo Tamellini

In this work we consider quasi-optimal versions of the Stochastic Galerkin method for solving linear elliptic PDEs with stochastic coefficients. In particular, we consider the case of a finite number

N

of random inputs and an analytic dependence of the s ...

2014

Convergence of quasi-optimal Stochastic Galerkin methods for a class of PDES with random coefficients

Fabio Nobile, Lorenzo Tamellini

In this work we consider quasi-optimal versions of the Stochastic Galerkin method for solving linear elliptic PDEs with stochastic coefficients. In particular, we consider the case of a finite number

N

of random inputs and an analytic dependence of the s ...

2014