Christoph Spiegel

Christoph Spiegel

Auto-generated profile, based on publicly available information

Christoph Spiegel

Department for AI in Society, Science, and Technology Zuse Institute Berlin Germany

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 July 2017 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
CSChristoph Spiegel
Christoph Spiegel
We study the thresholds for the property of containing a solution to a linear homogeneous system in random sets. We expand a previous sparse Szémeredi-type result of Schacht to the broadest class of matrices possible. We also provide a shorter proof of a sparse Rado result of Friedgut, Rödl, Ruciński and Schacht based on a hypergraph container approach due to Nenadov and Steger. Lastly we further extend these results to include some solutions with repeated entries using a notion of non-trivial solutions due to Rúzsa as well as Rué et al.

10 May 2017 in Mathematische Zeitschrift
Verified
Journal Article
Open access
PDF file
JRJuanjo Rué
Juanjo Rué
CSChristoph Spiegel
Christoph Spiegel
AZAna Zumalacárregui
Ana Zumalacárregui
We study threshold functions for the existence of solutions to linear systems of equations in random sets and present a unified framework which includes arithmetic progressions, sum-free sets, \(B_{h}[g]\)-sets and Hilbert cubes. In particular, we show that there exists a threshold function for the property “\(\mathcal {A}\)contains a non-trivial solution of \(M\cdot \mathbf{x }=\mathbf 0 \)” where \(\mathcal {A}\) is a random set and each of its elements is chosen independently with the same probability from the interval of integers \(\{1,\dots ,n\}\). Our study contains a formal definition of trivial solutions for any linear system, extending a previous definition by Ruzsa when dealing with a single equation. Furthermore, we study the distribution of the number of non-trivial solutions at the threshold scale. We show that it converges to a Poisson distribution whose parameter depends on the volumes of certain convex polytopes arising from the linear system under study as well as the symmetry inherent in the structures, which we formally define and characterize.

26 August 2024 in Foundations of Computational Mathematics
Verified
Journal Article
Open access
PDF file
OPOlaf Parczyk
Olaf Parczyk
SPSebastian Pokutta
Sebastian Pokutta
CSChristoph Spiegel
Christoph Spiegel
TSTibor Szabó
Tibor Szabó
We study two related problems concerning the number of homogeneous subsets of given size in graphs that go back to questions of Erdős. Most notably, we improve the upper bounds on the Ramsey multiplicity of $$K_4$$ K 4 and $$K_5$$ K 5 and settle the minimum number of independent sets of size 4 in graphs with clique number at most 4. Motivated by the elusiveness of the symmetric Ramsey multiplicity problem, we also introduce an off-diagonal variant and obtain tight results when counting monochromatic $$K_4$$ K 4 or $$K_5$$ K 5 in only one of the colors and triangles in the other. The extremal constructions for each problem turn out to be blow-ups of a graph of constant size and were found through search heuristics. They are complemented by lower bounds established using flag algebras, resulting in a fully computer-assisted approach. For some of our theorems we can also derive that the extremal construction is stable in a very strong sense. More broadly, these problems lead us to the study of the region of possible pairs of clique and independent set densities that can be realized as the limit of some sequence of graphs.

21 August 2020 in Journal de Théorie des Nombres de Bordeaux
Verified
Journal Article
Closed access
PDF file
PCPablo Candela
Pablo Candela
OSOriol Serra
Oriol Serra
CSChristoph Spiegel
Christoph Spiegel
Freiman’s 2.4-Theorem states that any set A⊂ℤ p satisfying |2A|≤2.4|A|-3 and |A|<p/35 can be covered by an arithmetic progression of length at most |2A|-|A|+1. A more general result of Green and Ruzsa implies that this covering property holds for any set satisfying |2A|≤3|A|-4 as long as the rather strong density requirement |A|<p/10 215 is satisfied. We present a version of this statement that allows for sets satisfying |2A|≤2.48|A|-7 with the more modest density requirement of |A|<p/10 10 .

10 December 2018 in Random Structures & Algorithms
Verified
Journal Article
Closed access
PDF file
CKChristopher Kusch
Christopher Kusch
JRJuanjo Rué
Juanjo Rué
CSChristoph Spiegel
Christoph Spiegel
TSTibor Szabó
Tibor Szabó

1 March 2008
Verified
Conference Paper
Closed access
ZBZijian Bai
Zijian Bai
JBJens Berkmann
Jens Berkmann
CSChristoph Spiegel
Christoph Spiegel
TSTobias Scholand
Tobias Scholand
GBGuido H. Bruck
Guido H. Bruck
PJPeter Jung
Peter Jung
The long term evolution of UMTS (Universal Mobile Telecommunications System) Terrestrial Radio Access, abbreviated as UTRA LTE, makes use of OFDM (orthogonal frequency division multiplexing) combined with MIMO (multiple-input multiple-output), termed MIMO-OFDM. The potential maximization of transmitted data rates has been considered a most beneficial feature of MIMO schemes. This maximization shall be strived for by spatial multiplexing. In particular, high data rates in the downlink have been considered desirable. Also, in view of an efficient implementation, the downlink requires a thorough assessment. Therefore, the authors will discuss the deployment of spatial multiplexing in the UTRA LTE downlink and will show that the performance of successive interference cancellation (SIC) based data detection techniques for MIMO-OFDM is beneficial.