Note on strong refutation algorithms for random k-SAT formulas Hiˆe.p H`an 1 , Yury Person 2 , and Mathias Schacht Institut f¨ ur Informatik Humboldt-Universit¨

Source URL: www.math.uni-frankfurt.de

Two-Dimensional Carbides (MXenes): Synthesis, Properties and Applications Yury Gogotsi Department of Materials Science and Engineering, and A. J. Drexel Nanomaterials Institute, Drexel University, Philadelphia, PA 19104,

Source URL: www.phantomsnet.net

• Chemistry
• Electrochemistry
• MXenes
• Materials science
• Physical chemistry
• Emerging technologies
• Monolayers
• Yury Gogotsi
• Carbide
• Graphene
• Supercapacitor

HIGHLY CONNECTED COLOURED SUBGRAPHS VIA THE REGULARITY LEMMA HENRY LIU1 AND YURY PERSON2 Abstract. For integers n, r, s, k ∈ N, n ≥ k and r ≥ s, let m(n, r, s, k) be the largest (in order) k-connected component wit

Source URL: www.math.uni-frankfurt.de

WEAK QUASI-RANDOMNESS FOR UNIFORM HYPERGRAPHS ˆ. P HAN, ` DAVID CONLON, HIE YURY PERSON, AND MATHIAS SCHACHT Abstract. We study quasi-random properties of k-uniform hypergraphs. Our

Source URL: www.math.uni-frankfurt.de

On-Line Learning of Long-Range Obstacle Detection for Off-Road Robots Raia Hadsell1 , Pierre Sermanet2 , Jan Ben2 , Jeff Han1 , Sumit Chopra1 , Marc’Aurelio Ranzato1 , Yury Sulsky1,2 , Beat Flepp2 , Urs Muller2 , Yann

Source URL: sermanet.free.fr

ON THE RANK OF HIGHER INCLUSION MATRICES ´ CODRUT ¸ GROSU, YURY PERSON, TIBOR SZABO Abstract. Let r ≥ s ≥ 0 be integers and G be an r-graph. The higher inclusion matrix Msr (G) is a {0, 1}-matrix with rows indexed

Source URL: page.mi.fu-berlin.de

On Extremal Hypergraphs for Hamiltonian Cycles Roman Glebov 1,2 Yury Person 2

Source URL: www.math.uni-frankfurt.de

Semantic Social Profile – a Semantic Boost for the Social Information in MediaWiki Yury Katkov1 and Dmitry Pokoptsev2 1 National Research University of Information Technologies, Mechanics and Optics

Source URL: www.wis.ewi.tudelft.nl

ON COLORINGS OF HYPERGRAPHS WITHOUT MONOCHROMATIC FANO PLANES ˇ ¨ HANNO LEFMANN, YURY PERSON, VOJTECH RODL,

Source URL: www.math.uni-frankfurt.de

arXiv:1412.6366v1 [math.CO] 19 DecLARGEST COMPONENTS IN RANDOM HYPERGRAPHS OLIVER COOLEY, MIHYUN KANG, AND YURY PERSON Abstract. In this paper we consider j-tuple-connected components in random k-uniform hypergrap

Source URL: arxiv.org