Konrad Engel

activity

20132020

most citedProjection inequalities for antichains

7 citations · 15 across the 6 of their papers we have counts for

collaborators

8 papers

math-ph2020★ 1 cited

Reconstruction of polytopes from the modulus of the Fourier transform with small wave length

Konrad Engel, Bastian Laasch

Let $P$ be an $n$ -dimensional convex polytope and $S$ be a hypersurface in $R^{n}$ . This paper investigates potentials to reconstruct $P$ or at…

math.MG2020★ 1 cited

The modulus of the Fourier transform on a sphere determines 3-dimensional convex polytopes

Konrad Engel, Bastian Laasch

Let $P$ and $P^{'}$ be $3$ -dimensional convex polytopes in $R^{3}$ and $S \subseteq R^{3}$ be a non-empty intersection of an open set with a sphere.…

math.CA2020★ 3 cited

An identity theorem for the Fourier transform of polytopes on rationally parameterisable hypersurfaces

Konrad Engel

A set $S$ of points in $R^{n}$ is called a rationally parameterisable hypersurface if $S = {σ (t) : t \in D}$ , where $\boldsym…

math.CO2018★ 7 cited

Projection inequalities for antichains

Konrad Engel, Themis Mitsis, Christos Pelekis +1

A set $A \subseteq R^{n}$ is called an antichain (resp. antichain) if it does not contain two distinct elements $x = (x_{1}, \dots, x_{n})$ and ${\mathbf y}=(y_1,\ldot…

math.CO2017

Boundary optimization for rough sets

Konrad Engel, Tran Dan Thu

Let $n > m \geq 2$ be integers and let $A = {A_{1}, \dots, A_{m}}$ be a partition of $[n] = {1, \dots, n}$ . For $X \subseteq [n]$ , its $A$ -boundary region $\mathcal{A}(X)…

math.CO2017★ 1 cited

A fractal perspective on optimal antichains and intersecting subsets of the unit $n$ -cube

Konrad Engel, Themis Mitsis, Christos Pelekis

An \emph{ $n$ -cube antichain} is a subset of the unit $n$ -cube $[0, 1]^{n}$ that does not contain two elements $x = (x_{1}, x_{2}, \dots, x_{n})$ and $\mathbf{y}=(y_1, y_2,\ldots, y_n…

math.CO2016

Bandwidth of graphs resulting from the edge clique covering problem

Konrad Engel, Sebastian Hanisch

Let $n, k, b$ be integers with $1 \leq k - 1 \leq b \leq n$ and let $G_{n, k, b}$ be the graph whose vertices are the $k$ -element subsets $X$ of ${0, \dots, n}$ with $max (X) - min (X) \leq b$ …

cs.DM2013★ 2 cited

The Dilworth Number of Auto-Chordal-Bipartite Graphs

Anne Berry, Andreas Brandstädt, Konrad Engel

The mirror (or bipartite complement) mir(B) of a bipartite graph B=(X,Y,E) has the same color classes X and Y as B, and two vertices x in X and y in Y are adjacent in mir(B) if and…