نتایج جستجو برای: combinatorics
تعداد نتایج: 6126 فیلتر نتایج به سال:
we give a survey of recent applications of group rings to combinatorics and tocryptography, including their use in the di erential cryptanalysis of block ciphers.
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the relevant proofs are quite short.
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology and information theory. With a caref...
When numbers are added in the usual way carries occur along the route. These carries cause a mess and it is natural to seek ways to minimize them. This paper proves that balanced arithmetic minimizes the proportion of carries. It also positions carries as cocycles in group theory and shows that if coset representatives for a finite-index normal subgroup H in a group G can be chosen so that the ...
Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asyptotically sharp version of Freiman’s theorem in Fn2 : if A ⊆ Fn2 is a set for which |A + A| 6 K|A| then A is contained in a subspace of size 2 √ K log K)|A|; except for the O( √ K logK) error, this is best possible. If in addition we assume that A is a downset, then we can als...
For the most part, this article is a survey of concrete results in extremal combinatorics obtained with the method of flag algebras. But our survey is also preceded, interleaved and concluded with a few general digressions about the method itself. Also, instead of giving a plain and unannotated list of results, we try to divide our account into several connected stories that often include histo...
Asymptotic extremal combinatorics deals with questions that in the language of model theory can be re-stated as follows. For finite models M, N of an universal theory without constants and function symbols (like graphs, digraphs or hypergraphs), let p(M, N) be the probability that a randomly chosen sub-model of N with |M | elements is isomorphic to M . Which asymptotic relations exist between t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید