Publication

A conjecture about Minkowski additions of convex polytopes

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.

Uniform 4-polytope

In geometry, a uniform 4-polytope (or uniform polychoron) is a 4-dimensional polytope which is vertex-transitive and whose cells are uniform polyhedra, and faces are regular polygons. There are 47 non-prismatic convex uniform 4-polytopes. There are two infinite sets of convex prismatic forms, along with 17 cases arising as prisms of the convex uniform polyhedra. There are also an unknown number of non-convex star forms.

Minkowski addition

In geometry, the Minkowski sum of two sets of position vectors A and B in Euclidean space is formed by adding each vector in A to each vector in B: The Minkowski difference (also Minkowski subtraction, Minkowski decomposition, or geometric difference) is the corresponding inverse, where produces a set that could be summed with B to recover A. This is defined as the complement of the Minkowski sum of the complement of A with the reflection of B about the origin. This definition allows a symmetrical relationship between the Minkowski sum and difference.

Regular Polytopes (book)

Regular Polytopes is a geometry book on regular polytopes written by Harold Scott MacDonald Coxeter. It was originally published by Methuen in 1947 and by Pitman Publishing in 1948, with a second edition published by Macmillan in 1963 and a third edition by Dover Publications in 1973. The Basic Library List Committee of the Mathematical Association of America has recommended that it be included in undergraduate mathematics libraries. The main topics of the book are the Platonic solids (regular convex polyhedra), related polyhedra, and their higher-dimensional generalizations.

Conjecture

In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis (still a conjecture) or Fermat's Last Theorem (a conjecture until proven in 1995 by Andrew Wiles), have shaped much of mathematical history as new areas of mathematics are developed in order to prove them. Formal mathematics is based on provable truth.

Minkowski space

In mathematical physics, Minkowski space (or Minkowski spacetime) (mɪŋˈkɔːfski,_-ˈkɒf-) combines inertial space and time manifolds (x,y) with a non-inertial reference frame of space and time (x',t') into a four-dimensional model relating a position (inertial frame of reference) to the field (physics). A four-vector (x,y,z,t) consists of a coordinate axes such as a Euclidean space plus time. This may be used with the non-inertial frame to illustrate specifics of motion, but should not be confused with the spacetime model generally.

Convex hull

In geometry, the convex hull or convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset. Convex hulls of open sets are open, and convex hulls of compact sets are compact.

Minkowski functional

In mathematics, in the field of functional analysis, a Minkowski functional (after Hermann Minkowski) or gauge function is a function that recovers a notion of distance on a linear space. If is a subset of a real or complex vector space then the or of is defined to be the function valued in the extended real numbers, defined by where the infimum of the empty set is defined to be positive infinity (which is a real number so that would then be real-valued).

Pólya conjecture

In number theory, the Pólya conjecture (or Pólya's conjecture) stated that "most" (i.e., 50% or more) of the natural numbers less than any given number have an odd number of prime factors. The conjecture was set forth by the Hungarian mathematician George Pólya in 1919, and proved false in 1958 by C. Brian Haselgrove. Though mathematicians typically refer to this statement as the Pólya conjecture, Pólya never actually conjectured that the statement was true; rather, he showed that the truth of the statement would imply the Riemann hypothesis.

Cramér's conjecture

In number theory, Cramér's conjecture, formulated by the Swedish mathematician Harald Cramér in 1936, is an estimate for the size of gaps between consecutive prime numbers: intuitively, that gaps between consecutive primes are always small, and the conjecture quantifies asymptotically just how small they must be. It states that where pn denotes the nth prime number, O is big O notation, and "log" is the natural logarithm.

Beal conjecture

The Beal conjecture is the following conjecture in number theory: If where A, B, C, x, y, and z are positive integers with x, y, z ≥ 3, then A, B, and C have a common prime factor. Equivalently, The equation has no solutions in positive integers and pairwise coprime integers A, B, C if x, y, z ≥ 3. The conjecture was formulated in 1993 by Andrew Beal, a banker and amateur mathematician, while investigating generalizations of Fermat's Last Theorem. Since 1997, Beal has offered a monetary prize for a peer-reviewed proof of this conjecture or a counterexample.