Theorem

Results: 6939



#Item
341Graph theory / Bipartite graph / Planar graph / Graph / Spectral graph theory / Extremal graph theory / Universal graph / Line graph / Planar separator theorem

A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a

Add to Reading List

Source URL: www.math.ucsd.edu

Language: English - Date: 2000-06-04 20:41:54
342Mathematical analysis / Analysis / Mathematics / Convex analysis / Logarithmically concave function / Convex function / Central limit theorem / Normal distribution / Convex optimization / Expected value / Distribution / Rejection sampling

JMLR: Workshop and Conference Proceedings vol 40:1–26, 2015 Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions Alexandre Belloni The Fuqua School of Business, Duke Univer

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2015-07-20 20:08:35
343Software / Computing / Logic / Mathematical proofs / Proof theory / Logical consequence / Statements / Theorem / LaTeX / Ed / TeX / QED

QED.sty — right-justified end-of-proof mark Paul Taylor

Add to Reading List

Source URL: www.paultaylor.eu

Language: English - Date: 2009-02-12 12:57:49
344Mathematics / Graph theory / Mathematical analysis / Conformal mapping / Projective geometry / Planar graph / Riemann surfaces / Complex analysis / Operator theory / Differential geometry of surfaces / Stereographic projection / Brouwer fixed-point theorem

Spectral Graph Theory Lecture 20 The Second Eigenvalue of Planar Graphs Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2015-11-11 11:13:23
345Error detection and correction / Coding theory / Information theory / Discrete mathematics / Mathematics / Forward error correction / Low-density parity-check code / Constant-weight code / Huffman coding / Noisy-channel coding theorem / Prefix code / Burst error-correcting code

ISIT 2003, Yokohama, Japan, June 29 – July 4, 2003 Sparse Data Blocks and Multi-User Channels Edward A. Ratzer Cavendish Laboratory, University of Cambridge Madingley Road, Cambridge CB3 0HE, UK

Add to Reading List

Source URL: www.inference.phy.cam.ac.uk

Language: English - Date: 2003-06-05 10:39:01
346Time series analysis / SADS / Abundance / Autocorrelation / Statistics / Rock music / Biodiversity

Species abundance distribution results from a spatial analogy of central limit theorem Arnosˇt L. Sˇizlinga,b,1, David Storcha,c, Eva Sˇizlingova´d, Jirˇí Reifc,e, and Kevin J. Gastonb aCenter for Theoretical Stud

Add to Reading List

Source URL: www.cts.cuni.cz

Language: English - Date: 2009-04-22 11:09:05
347Algebra / Abstract algebra / Mathematics / Algebraic geometry / Cohomology theories / Sheaf theory / Homological algebra / Complex manifolds / Coherent sheaf / Sheaf / Crystalline cohomology / Cohomology

891 Documenta Math. On Base Change Theorem and Coherence in Rigid Cohomology

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2003-12-22 16:28:52
348Software engineering / Computer programming / Computing / Functional languages / Type theory / Data types / Procedural programming languages / ATS / Object-oriented programming / ML / Polymorphism / OCaml

Combining Programming with Theorem Proving Chiyan Chen and

Add to Reading List

Source URL: www.cs.bu.edu

Language: English - Date: 2005-11-01 11:55:41
349Exponentials / Mathematical physics / Binomial theorem

$SPAD/src/input kamke2.input Timothy Daly December 30, 2008 Abstract This is the 50 ODEs of the Kamke test suite as published by E. S. Cheb-Terrab[1]. They have been rewritten using Axiom syntax. Where

Add to Reading List

Source URL: axiom-developer.org

Language: English - Date: 2008-12-30 18:00:24
350Graph theory / Discrete mathematics / Laman graph / Graph / Topological graph theory

Mixed Volume Techniques for Embeddings of Laman Graphs Reinhard Steffens∗, Thorsten Theobald† Abstract We use Bernstein’s Theorem [1] to obtain combinatorial bounds for the

Add to Reading List

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

Language: English - Date: 2008-06-23 09:41:53
UPDATE