URSS.ru - Editorial URSS Publishers. Moscow - Books on Science
About the Publishers On-line bookstore Our address Email us

Return to:
Cover � Moscow Journal of Combinatorics and Number Theory. 2013
Id: 175647
39.9 EUR

Moscow Journal of Combinatorics and Number Theory. 2013. Vol.3, Iss.1

URSS. 120 pp. (English). Paperback. ISBN 978-5-453-00056-2.
Hardcopy. If you buy this issue we can send also a pdf version of the issue free of charge.

The aim of this journal is to publish original, high-quality research articles from a broad range of interests within combinatorics, number theory and allied areas. One volume of four issues is published annually.

On groups with Perfect Order Subsets
  Kevin Ford (Urbana), Sergei Konyagin (Moscow), Florian Luca (Mexico)
 2.Number theory tools
 3.Proof of Theorem 1
 4.Proof of Theorem 2
Disjoint edges in separated hypergraphs
  P'eter Frankl (Budapest)
 2.The case r=k
 3.The general case
 4.The proof of main result
Counterexamples to Borsuk's conjecture on spheres of small radii
  Andrey Kupavskii and Andrey Raigorodskii (Moscow)
 2.Formulation of the problem and statements of the results
 3.Proofs of Theorems 1 and 2
  3.2.Transforming Omega' into an Omega C Srd-1
  3.3.Lower bound for f(Omega )
  3.4.Proof of Lemma 1
 4.Proof of Theorem 3
 5.Proof of Theorem 4
 6.Improving Construction from Subsection 3.1 is hard
 7.Improving Construction from Subsection 3.1 is still possible
Uni-dimensional models of coalition formation: non-existence of stable partitions
  Alexei Savvateev (Moscow, Irkutsk)
 2.A universal counterexample: motivation and description
 3.Proof of the main result
 4.Notes on relevant research and bibliography
Choosability in simple hypergraphs
  Dmitry Shabanov (Moscow)
 1.Introduction and background of the problem
 2.Proof of Theorem 6
  2.1.Randomized algorithm for hypergraph coloring
  2.2.Formal construction of random coloring
  2.3.First event
  2.4.Second event
  2.5.Third event
  2.6.Application of Local Lemma

© 2017 by Editorial URSS. All rights reserved.