A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Algorithmic and analytic framework for optimization ofmulti-user performance in wireless networks with interference
[article]
2007
Preserved Fulltext
The contribution of this work is an analytic and algorithmic framework for achieving min-max fairness and optimization of weighted aggregated performance in single-hop networks with interference. ...
In dieser Arbeit stellen wir einen theoretischen und algorithmischen Rahmen für die Gewährleistug von Min-Max-Fairness und Optimierung der gewichteten Summenperformanz in einem Ein-Hop-Netzwerk mit Interferenz ...
Stanczak, Characterization of max-min fair performance in large networks via Szemeredi's Regularity Lemma," Proc. IEEE International Symposium on Information Theory (ISIT 2007), Jun 2007 26. A. ...
doi:10.14279/depositonce-1712
fatcat:y3puwbmum5h3booy4g2fwhqldu
05291 Abstracts Collection – Sublinear Algorithms
2006
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. ...
The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available. ...
The proof requires a framework extending Szemeredi's Regularity Lemma. ...
doi:10.4230/dagsemproc.05291.1
fatcat:t62y4eotrfb5tbhmpsx7qzniwi
Some Fundamental Theorems in Mathematics
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
An expository hitchhikers guide to some theorems in mathematics. ...
Zorn's lemma is due to Kazimierz Kuratowski in 1922 and Max August Zorn in 1935. Andrey Nikolayevich Tykhonov proved his theorem in 1930. ...
By choosing M large enough (compared to k, min(H)) H ∩ M is a relatively large homogeneous set for P |M e of size at least k. This finishes the proof of the extended finite Ramsey theorem. ...
arXiv:1807.08416v4
fatcat:lw7lbsxyznfrnaozilxapihmdy
Arithmetic structure in sets of integers
2011
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
More precisely, we establish that, given a subset of size linear in N, the set of its popular differences does not always contain the complete difference set of another large set. ...
Finally, in Chapter 4 we investigate the structure of the set of popular di erences of a subset of ZN. ...
The latter expectation can be bounded via the following simple lemma for cubes, several rather laboured versions of which appear in [Gir79]: Lemma 3.5. ...
doi:10.17863/cam.16214
fatcat:5htpzi7yera4jppuuod2xif2ty
Symmetry, Almost
2019
Notices of the American Mathematical Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Invited Addresses
Special Sessions If you are volunteering to speak in a Special Session, you should send your abstract as early as possible via the abstract submission form found at http://www.ams.org ...
Accommodations Participants should make their own arrangements directly with the hotel of their choice. Special discounted rates were negotiated with the hotels listed below. ...
They also analyze a max-norm (‖ ‖ max ∶= min = * ‖ ‖ 2,∞ ⋅ ‖ ‖ 2,∞ ) projection scheme that tolerates arbitrary nonuniform sampling. ...
doi:10.1090/noti1775
fatcat:xwrijzvqazg7bdym7un5qq2jjq
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers
[article]
2009
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Finally, I am greatly in debt and most thankful to my brother Patrick Schweitzer, who persistently improved the quality of my dissertation in virtually every aspect. ...
As mentioned in Subsection 2.6.2, this also translates into a characterization via screws. For an introduction to strongly regular graphs see [25] . ...
Lovász' Local Lemma in the context of van der Waerden numbers A better lower bound than the one just presented may be obtained via Lovász' Local Lemma. ...
doi:10.22028/d291-25946
fatcat:ff66x4zhlzaghlr4visddjomkq