Publication

Ramsey-Type Results For Semi-Algebraic Relations

János Pach, Andrew Suk
2014
Journal Articles

Abstract

A k-ary semi-algebraic relation E on R-d is a subset of R-kd, the set of k-tuples of points in R-d, which is determined by a finite number of polynomial inequalities in kd real variables. The description complexity of such a relation is at most t if d, k

Official source

https://infoscience.epfl.ch/entities/publication/061f1224-b5f4-469d-a7ad-704b190b8256

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

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.

Ramsey-Type Results For Semi-Algebraic Relations

Chat with Graph Search

Succinct ordering and aggregation constraints in algebraic array theories

Experimental and ab initio derivation of interface stress in nanomultilayered coatings: Application to immiscible Cu/W system with variable in-plane stress

Inhalation of Microplastics—A Toxicological Complexity