iuuk.mff.cuni.cz

kam.mff.cuni.cz

Useful links

http://kam.mff.cuni.cz/links.html.en

Faculty of Mathematics and Physics. School of Computer Science. Computer Science Institute of Charles University. Webmaster: kamweb@kam.mff.cuni.cz Modified: 27. 06. 2013.

ms.mff.cuni.cz

Computer Science, MFF UK

http://www.ms.mff.cuni.cz/all.html.en

Minutes from board meetings. Department of Applied Mathematics. Institute for Theoretical Computer Science. Computer Science Institute of Charles University. Department of Distributed and Dependable Systems. Department of Software Engineering. Department of Software and Computer Science Education. Department of Theoretical Computer Science and Mathematical Logic. Network and Labs Management Center. Institute of Formal and Applied Linguistics. What's behind your screen. Hints for typical situations. Pragu...

kam.mff.cuni.cz

Midsummer Combinatorial Workshop XXI

http://kam.mff.cuni.cz/workshops/mcw

July 27 - July 31, 2015, Prague. The workshop continues the tradition of Prague Combinatorial Workshops. Held since 1993. Oriented on problems of all fields of graph theory, combinatorics and discrete geometry, it will continue in the spirit and informal working atmosphere of the previous meetings. The workshop takes place at DIMATIA. And the Department of Applied Mathematics. The workshop participation is by invitation only. Towards a fraction of the expenses. At Lecture Room S5: Workshop starts. Martin...

openproblemgarden.org

Chromatic number of associahedron | Open Problem Garden

http://www.openproblemgarden.org/op/chromatic_number_of_associahedron

Chromatic number of associahedron. Wood, David R. Associahedron, graph colouring, chromatic number. Recomm. for undergrads:. June 2nd, 2015. Associahedra have unbounded chromatic number. The chromatic number of (the 1-skeleton of) associahedra was first considered by Fabila-Monroy et al [FFHHUW]. They proved that for the associahedron corresponding to edge flips in triangulations of a convex. Gon, the chromatic number is at most. The best known lower bound is. Private communication, Ruy Fabila-Monroy].

mks.mff.cuni.cz

Naši partneři

http://mks.mff.cuni.cz/partneri.php

Matematický korespondenční seminář může fungovat i díky podpoře našich partnerů:. Katedra matematické analýzy MFF UK. Jednota českých matematiků a fyziků. Vzdělávací projekt pro nadanou mládež. Íránská geometrická olympiáda IGO. Termín odeslání 1. podzimní. Termín odeslání 2. podzimní. Mks (zavináč) mff.cuni.cz. 118 00 Praha 1. Matematický korespondenční seminář je organizovaný studenty Matematicko-fyzikální fakulty UK. Pod záštitou Informatického ústavu UK a Oddělení pro vnější vztahy a propagaci UK.

openproblemgarden.org

Keywords | Open Problem Garden

http://www.openproblemgarden.org/keywords

12 month loans bad credit, 12 month loans, 12 month payday loans. 12 month loans, 12 month payday loans. 12 month loans, 12 month payday loans, 12 month loans no credit check. 12 month loans, 12 month payday loans, 3 month loans. 12 month loans, 12 month payday loans, 3 month loans, 3 month payday loans. 12 month loans, 12 month payday loans, 3 month payday loans. 12 month loans, 12 month payday loans, 3 month payday loans, 3 month loans. 12 month loans, 12 month payday loans, 6 month payday loans. Gener...

openproblemgarden.org

Analysis | Open Problem Garden

http://www.openproblemgarden.org/category/analysis

C r$ Stability Conjecture. Criterion for boundedness of power series. Something like Picard for 1-forms. Inequality for square summable complex series. Imp : Importance (Low , Medium , High , Outstanding ). Rec : Recommended for undergraduates. Note: Resolved problems from this section may be found in Solved problems. Theoretical Comp. Sci. Sum of prime and semiprime conjecture. A funcoid related to directed topological spaces. Infinite distributivity of meet over join for a principal funcoid.

openproblemgarden.org

Theoretical Computer Science | Open Problem Garden

http://www.openproblemgarden.org/category/theoretical_computer_science

Sums of independent random variables with unbounded variance. Exponential Algorithms for Knapsack. The robustness of the tensor product. Subset-sums equality (pigeonhole version). Complexity of square-root sum. Linear-size circuits for stable $0,1 2$ sorting? Unconditional derandomization of Arthur-Merlin games. Refuting random 3SAT-instances on $O(n)$ clauses (weak form). Imp : Importance (Low , Medium , High , Outstanding ). Rec : Recommended for undergraduates. Theoretical Comp. Sci.

openproblemgarden.org

Group Theory | Open Problem Garden

http://www.openproblemgarden.org/category/group_theory

Growth of finitely presented groups. Subgroup formed by elements of order dividing n. Which lattices occur as intervals in subgroup lattices of finite groups? Imp : Importance (Low , Medium , High , Outstanding ). Rec : Recommended for undergraduates. Note: Resolved problems from this section may be found in Solved problems. Theoretical Comp. Sci. Sum of prime and semiprime conjecture. A funcoid related to directed topological spaces. Infinite distributivity of meet over join for a principal funcoid.