ConferenceMoscow Workshop on Combinatorics and Number Theory
Moscow, Russia

All lectures will be at the 202 auditorium of the New Building of MIPT.
How to get to the New Building of MIPT.
You need to go to the station "Novodachnaya". The way from the station to MIPT is here. The train schedule is here.
10:00  10:50  N. Alon "Additive Patterns in Multiplicative Subgroups" 
11:00  11:50  B. Sudakov "Judicious partitions of graphs" 
11:50  12:20  Coffee 
12:20  12:50  M. Zhukovskii "Zeroone laws for G(n, n^{−α})" 
13:00  13:20  G. Nenashev "Counting the minimal number of inflections of a plane doodle" 
Lunch  
15:00  15:50  A. Samorodnitsky "Lower bounds for designs in symmetric spaces" 
16:00  16:30  I. Aliev, M. Henk, E. Linke "On Integer Points in Knapsack Polytopes" 
16:30  17:00  Coffee 
17:00  17:30  F. Adiceam "Rational approximation and arithmetic progressions" 
17:40  18:00  V. Zhuravleva "Distribution of some linear recurrence sequences modulo 1" 
10:00  10:50  N. Budarina, V. Bernik, F. Götze "On distribution of algebraic numbers in the domains of small measure in the fields of R, C and Q_p" 
11:00  11:50  Yu. Nesterenko "Exponent of irrationality of some numbers" 
11:50  12:20  Coffee 
12:20  12:50  S. Kristensen "Fourier theoretic methods in Diophantine approximation" 
13:00  13:30  S. Pedersen "A Cantor set type result in the ﬁeld of formal Laurent series" 
Lunch  
15:00  15:50  J. Balogh "The typical structure of sparse K_{r+1}free graphs" 
16:00  16:40  J. Kozik, D. Shabanov "Colorings of simple hypergraphs" 
16:40  17:00  Coffee 
17:00  17:30  R. Karasev "Covering dimension using toric varieties" 
17:40  18:10  S. Lawrencenko "Irreducible triangulations of 2manifolds with boundary" 
10:00  10:50  J. Pach "Erdös's problems on distinct distances: Recent developments" 
11:00  11:30  D. Karpov "Minimal kconnected graphs with minimal number of vertices of degree k" 
11:30  12:00  Coffee 
12:00  12:40  V. Zhuravlev "Bounded remainder sets, diophantine equations and balanced words" 
Lunch  
15:00  15:50  L. Summerer "A geometric approach to simultaneous approximation" 
16:00  16:40  O. German "On some problems in multiplicative Diophantine approximation" 
16:40  17:00  Coffee 
17:00  17:20  R. Akhunzhanov "On twodimensional Dirichlet spectrum" 
17:30  17:50  D. Shatskov "Oscillation theorems for irrationality measure functions" 
Conference Party 
10:00  10:50  B. Weiss "Remarks on Danzer's problem" 
11:00  11:50  N. Dolbilin "Local sources of global order in regular structures" 
11:50  12:10  Coffee 
12:10  13:00  D. Badziahin "On recent developments related to padic Littlewood conjecture" 
13:10  13:30  D. Gayfulin "On Diophantine exponents in dimension 4" 
13:40  14:20  I. Shkredov, S. Konyagin "Quantitative version of BeurlingHelson theorem" 
Lunch  
Free afternoon 
10:00  10:50  G. Katona "Largest families of sets, under conditions defined by a given poset" 
11:00  11:30  L. Ostroumova "Recencybased preferential attachment models" 
11:30  12:00  Coffee 
12:00  12:30  G. Nagy "A bijective proof of Shapiro's Catalan convolution" 
12:40  13:00  A. Taranenko "Multidimensional permanents and an upper bound on the number of transversals in latin squares" 
Lunch  
15:00  15:50  A. Sapozhenko "On sets free from solutions of linear equations in finite Abelian groups" 
16:00  16:20  D. Frolenkov "On the PólyaVinogradov inequality and its generalization" 
16:20  16:50  Coffee 
16:50  17:20  N. Moshchevitin "TBA" 
17:30  18:00  I. Kan "TBA" 
10:00  10:50  A. Kelmans "On planarity, matroid duality and matroid isomorphism of graphs" 
11:00  11:30  K. Das "Eigenvalues of graph matrices and graph parameters" 
11:40  12:10  A. Kupavskii "Diameter graphs in R^4" 
12:10  12:30  Coffee 
12:40  13:10  A. Polyanskii "Schur conjecture in R^d" 
13:20  13:50  I. Bogdanov "The number of vertices in a graph with large chromatic number and locally small chromatic number" 
14:00  14:30  A. Raigorodskii "Hypergraphs with forbidden edgeintersections: new results and applications to Euclidean Ramsey theory" 
Lunch 
Conference sponsors are and
Supported by Moscow Journal of Combinatorics and Number Theory