Typesetting simple verse with LaTeX
Author: Peter Wilson, Herries Press
Maintainer: Will Robertson
will dot robertson at latex-project dot org
2009/09/04
Abstract
The verse package provides some aids for the typesetting of simple verse.
Contents
1 Introdu
Kuratowski Theorem from below.
Dainis ZEPS
Abstract
This note proves the Kuratowski theorem from below, i.e. assuming that Kuratowski-like
theorem for Free-Planar graphs is right.
Graph is dened as a pair of sets (V, E ), where V is the set of vertices an
FPSAC 2009
DMTCS proc. (subm.), by the authors, 110
Determinants in the Kronecker product of
matrices: The incidence matrix of a complete
graph
Christopher R. H. Hanusa1 and Thomas Zaslavsky2
1
Department of Mathematics, Queens College (CUNY), 65-30 Kisse
Ask a Better Question, Get a Better Answer
A New Approach to Private Data Analysis
Cynthia Dwork
Microsoft Research
[email protected]
Abstract. Cryptographic techniques for reasoning about information
leakage have recently been brought to bear on the cl
Grbner Bases Algorithm
o
Iyad A. Ajwa
Zhuojun Liu
Paul S. Wang
Institute for Computational Mathematics
Department of Mathematics & Computer Science
Kent State University
Kent, Ohio 44242, U.S.A.
February 27, 2003
Abstract. Grbner Bases is a technique that
An Improved Algorithm for Finding the Strongly Connected
Components of a Directed Graph
David J. Pearce
Computer Science Group
Victoria University, NZ
[email protected]
Keywords: Graph Algorithms, Strongly Connected Components, Depth-First Search
PROCEEDINGS OF THE
AMERICAN MATHEMATICAL SOCIETY
Volume 124, Number 10, October 1996
EVERY MONOTONE GRAPH PROPERTY
HAS A SHARP THRESHOLD
EHUD FRIEDGUT AND GIL KALAI
(Communicated by Jery N. Kahn)
Abstract. In their seminal work which initiated random grap
1
SML-Lite Grammar
The following grammar describes the fragment of SML that each of you will
implement. Notice that this grammar is ambigous for several reasons. Hence
it will be imperative for you to use the features of ml-yacc to set operator and
langua
Two Ramsey-type results
after R. Rado
November 19, 2010
This note contains two Ramsey type results. The nite version is folklore, the innite
version is a theorem of Rado.
Theorem 1 If the edges of the complete graph Kn are colored with two colors, say red
Multivariable Calculus
1. The Derivative
Denition: Derivative at a Point
Let U be an open subset of Rm , let F : U Rn , and let a U . We say that F is
dierentiable at a if there exists an n m matrix DFa satisfying
F (a + h) F (a) DFa (h)
= 0.
h0
h
lim
In