American Mathematical Society - Sample Paper

Sample Paper for the amsmath Package
File name: testmath.tex

American Mathematical Society
Version 2.0, 1999/11/15
Introduction
This paper contains examples of various features from AMS-LATEX.
Enumeration of Hamiltonian paths in a graph
Let A = (aij ) be the adjacency matrix of graph G. The corresponding Kirchhoff

matrix K = (kij ) is obtained from A by replacing in A each diagonal entry by
the degree of its corresponding vertex; i.e., the ith diagonal entry is identified
with the degree of the ith vertex. It is well known that
det K(i|i) = the number of spanning trees of G,
i = 1, . . . , n
(1)
where K(i|i) is the ith principal submatrix of K.

\det\mathbf{K}(i|i)=\text{ the number of spanning trees of $G$},
Let Ci(j) be the set of graphs obtained from
S G by attaching edge (vi vj )
to each spanning tree of G. Denote by Ci = j Ci(j) . It is obvious that the
collection of Hamiltonian cycles is a subset of Ci . Note that the cardinality of
b = {
Ci is kii det K(i|i). Let X
x1 , . . . , x
n }.
$\wh X=\{\hat x_1,\dots,\hat x_n\}$
b by
Define multiplication for the elements of X
x
i x
j = x
j x
i ,
x
2i = 0,
i, j = 1, . . . , n.
(2)
P
Let kij = kij x
j and kij = j6=i kij . Then the number of Hamiltonian cycles
Hc is given by the relation [8]
Y
n

1
b
x
j Hc = kij det K(i|i),
2
j=1
1
i = 1, . . . , n.
(3)
Sample paper for the amsmath package
The task here is to express (3) in a form free of any x

i , i = 1, . . . , n. The result
also leads to the resolution of enumeration of Hamiltonian paths in a graph.
It is well known that the enumeration of Hamiltonian cycles and paths in
a complete graph Kn and in a complete bipartite graph Kn1 n2 can only be
found from first combinatorial principles [4]. One wonders if there exists a
formula which can be used very efficiently to produce Kn and Kn1 n2 . Recently,
using Lagrangian methods, Goulden and Jackson have shown that Hc can be
expressed in terms of the determinant and permanent of the adjacency matrix
[3]. However, the formula of Goulden and Jackson determines neither Kn nor
Kn1 n2 effectively. In this paper, using an algebraic method, we parametrize
the adjacency matrix. The resulting formula also involves the determinant and
permanent, but it can easily be applied to Kn and Kn1 n2 . In addition, we
eliminate the permanent from Hc and show that Hc can be represented by
a determinantal function of multivariables, each variable with domain {0, 1}.
Furthermore, we show that Hc can be written by number of spanning trees of
subgraphs. Finally, we apply the formulas to a complete multigraph Kn1 ...np .
The conditions aij = aji , i, j = 1, . . . , n, are not required in this paper. All
formulas can be extended to a digraph simply by multiplying Hc by 2.
Main Theorem
Notation. For p, q P and n we write (q, n) (p, n) if q p and Aq,n =

Ap,n .
\begin{notation} For $p,q\in P$ and $n\in\omega$
...
\end{notation}
Let B = (bij ) be an n n matrix. Let n = {1, . . . , n}. Using the properties
of (2), it is readily seen that
Lemma 3.1.
Y X
in

bij x
i
jn
Y

x
i per B
(4)
in
where per B is the permanent of B.

Let Yb = {
y1 , . . . , yn }. Define multiplication for the elements of Yb by
yi yj + yj yi = 0,
i, j = 1, . . . , n.
(5)
Then, it follows that

Lemma 3.2.
Y X
in
jn

bij yj
Y
in

yi det B.
(6)
Note that all basic properties of determinants are direct consequences of

Lemma 3.2. Write
X
X ()
bij yj =
bij yj + (bii i )
yi y
(7)
jn
jn
where
()
bii = i ,
()
bij = bij ,
i 6= j.
(8)
()
Let B() = (bij ). By (6) and (7), it is straightforward to show the following
result:
Theorem 3.3.
det B =
n X Y
X
(bii i ) det B() (Il |Il ),
(9)
l=0 Il n iIl
where Il = {i1 , . . . , il } and B() (Il |Il ) is the principal submatrix obtained from
B() by deleting its i1 , . . . , il rows and columns.
Remark 3.1. Let M be an n n matrix. The convention M(n|n) = 1 has been
used in (9) and hereafter.
Before proceeding with our discussion, we pause to note that Theorem 3.3
yields immediately a fundamental formula which can be used to compute the
coefficients of a characteristic polynomial [9]:
Pn
Corollary 3.4. Write det(B xI) = l=0 (1)l bl xl . Then
X
bl =
det B(Il |Il ).
(10)
Il n
Let
D1 t
a12 t2 . . . a1n tn
a21 t1
D2 t
. . . a2n tn
K(t, t1 , . . . , tn ) =
. . . . . . . . . . . . . . . . . . . . . . ,
an1 t1 an2 t2 . . .
Dn t
(11)
\begin{pmatrix} D_1t&-a_{12}t_2&\dots&-a_{1n}t_n\\
-a_{21}t_1&D_2t&\dots&-a_{2n}t_n\\
\hdotsfor[2]{4}\\
-a_{n1}t_1&-a_{n2}t_2&\dots&D_nt\end{pmatrix}
where
Di =
aij tj ,
i = 1, . . . , n.
jn
Set
D(t1 , . . . , tn ) =
det K(t, t1 , . . . , tn )|t=1 .

t
(12)
Then
D(t1 , . . . , tn ) =
Di det K(t = 1, t1 , . . . , tn ; i|i),
(13)
in
where K(t = 1, t1 , . . . , tn ; i|i) is the ith principal submatrix of K(t = 1, t1 , . . . , tn ).

Theorem 3.3 leads to
X
Y Y
det K(t1 , t1 , . . . , tn ) =
(1)|I| tn|I|
ti
(Dj + j tj ) det A(t) (I|I). (14)
In
iI
jI
Note that
det K(t = 1, t1 , . . . , tn ) =
(1)|I|
In
Y
iI
ti
(Dj + j tj ) det A() (I|I) = 0.
jI
(15)
Let ti = x
i , i = 1, . . . , n. Lemma 3.1 yields
X

ali xi det K(t = 1, x1 , . . . , xn ; l|l)
in
Y
x
i
in
(1)|I| per A() (I|I) det A() (I {l}|I {l}). (16)
In{l}
\begin{multline}
\biggl(\sum_{\,i\in\mathbf{n}}a_{l _i}x_i\biggr)
\det\mathbf{K}(t=1,x_1,\dots,x_n;l |l )\\
=\biggl(\prod_{\,i\in\mathbf{n}}\hat x_i\biggr)
\sum_{I\subseteq\mathbf{n}-\{l \}}
(-1)^{\envert{I}}\per\mathbf{A}^{(\lambda)}(I|I)
\det\mathbf{A}^{(\lambda)}
(\overline I\cup\{l \}|\overline I\cup\{l \}).
\label{sum-ali}
\end{multline}
By (3), (6), and (7), we have
Proposition 3.5.
n
Hc =
1 X
(1)l Dl ,
2n
(17)
l=0
where
Dl =
X
Il n
D(t1 , . . . , tn )2|
n
.
0, if iIl
ti =
, i=1,...,n
1, otherwise
(18)
Application
We consider here the applications of Theorems 5.1 and 5.2 to a complete multipartite graph Kn1 ...np . It can be shown that the number of spanning trees of
Kn1 ...np may be written

T = np2
p
Y
(n ni )ni 1
(19)
i=1
where
n = n1 + + np .
(20)
It follows from Theorems 5.1 and 5.2 that

p
Y
ni
Hc =
1 X
(1)l (n l)p2
2n
l=0
l1 ++lp =l i=1
ni li
[(n l) (ni li )]
li

p
X
(n l)2
(ni li )2 .
(21)
j=1
... \binom{n_i}{l _i}\\

and
Hc =
n1
1X
(1)l (n l)p2
2
p
Y
ni
li

lp
[(n l) (np lp )].
[(n l) (ni li )]ni li 1
np
l=0
l1 ++lp =l i=1
(22)
The enumeration of Hc in a Kn1 np graph can also be carried out by Theorem 7.2 or 7.3 together with the algebraic method of (2). Some elegant
representations may be obtained. For example, Hc in a Kn1 n2 n3 graph may be
written

n2
n3
n1 ! n2 ! n3 ! X n1
Hc =
n1 + n2 + n3 i
i
n3 n1 + i n3 n2 + i
(23)

n1 1
n2 1
n3 1
+
.
i
n3 n1 + i n3 n2 + i
Secret Key Exchanges
Modern cryptography is fundamentally concerned with the problem of secure

private communication. A Secret Key Exchange is a protocol where Alice and
Bob, having no secret information in common to start, are able to agree on
a common secret key, conversing over a public channel. The notion of a Secret Key Exchange protocol was first introduced in the seminal paper of Diffie
and Hellman [1]. [1] presented a concrete implementation of a Secret Key Exchange protocol, dependent on a specific assumption (a variant on the discrete
log), specially tailored to yield Secret Key Exchange. Secret Key Exchange is
of course trivial if trapdoor permutations exist. However, there is no known

implementation based on a weaker general assumption.
The concept of an informationally one-way function was introduced in [5].
We give only an informal definition here:
Definition 5.1. A polynomial time computable function f = {fk } is informationally one-way if there is no probabilistic polynomial time algorithm which
(with probability of the form 1k e for some e > 0) returns on input y {0, 1}k
a random element of f 1 (y).
In the non-uniform setting [5] show that these are not weaker than one-way
functions:
Theorem 5.1 ([5] (non-uniform)). The existence of informationally one-way
functions implies the existence of one-way functions.
We will stick to the convention introduced above of saying non-uniform
before the theorem statement when the theorem makes use of non-uniformity.
It should be understood that if nothing is said then the result holds for both
the uniform and the non-uniform models.
It now follows from Theorem 5.1 that
Theorem 5.2 (non-uniform). Weak SKE implies the existence of a one-way
function.
More recently, the polynomial-time, interior point algorithms for linear programming have been extended to the case of convex quadratic programs [11, 13],
certain linear complementarity problems [7, 10], and the nonlinear complementarity problem [6]. The connection between these algorithms and the classical
Newton method for nonlinear equations is well explained in [7].
Review
We begin our discussion with the following definition:

Definition 6.1. A function H : <n <n is said to be B-differentiable at the
point z if (i) H is Lipschitz continuous in a neighborhood of z, and (ii) there exists a positive homogeneous function BH(z) : <n <n , called the B-derivative
of H at z, such that
lim
v0
H(z + v) H(z) BH(z)v

= 0.
kvk
The function H is B-differentiable in set S if it is B-differentiable at every point

in S. The B-derivative BH(z) is said to be strong if
H(z + v) H(z + v 0 ) BH(z)(v v 0 )
= 0.
kv v 0 k
(v,v )(0,0)
lim
0
Lemma 6.1. There exists a smooth function 0 (z) defined for |z| > 1 2a
satisfying the following properties:
(i) 0 (z) is bounded above and below by positive constants c1 0 (z) c2 .
(ii) If |z| > 1, then 0 (z) = 1.
(iii) For all z in the domain of 0 , 0 ln 0 0.
(iv) If 1 2a < |z| < 1 a, then 0 ln 0 c3 > 0.
Proof. We choose 0 (z) to be a radial function depending only on r = |z|. Let
h(r) 0 be a suitable smooth function satisfying h(r) c3 for 1 2a < |z| <
1 a, and h(r) = 0 for |z| > 1 a2 . The radial Laplacian
2

d
1 d
0 ln 0 (r) =
+
ln 0 (r)
dr2
r dr
has smooth coefficients for r > 1 2a. Therefore, we may apply the existence
and uniqueness theory for ordinary differential equations. Simply let ln 0 (r)
be the solution of the differential equation
2

1 d
d
+
ln 0 (r) = h(r)
dr2
r dr
with initial conditions given by ln 0 (1) = 0 and ln 00 (1) = 0.
Next, let D be a finite collection of pairwise disjoint disks, all of which
are contained in the unit disk centered at the origin in C. We assume that
D = {z | |z z | < }. Suppose that D (a) denotes the smaller concentric
disk D (a) = {z |S|z z | (1 2a)}. We define a smooth
S weight function
0 (z) for z C D (a) by setting 0 (z) = 1 when z
/ D and 0 (z) =
0 ((z z )/) when z is an element of D . It follows from Lemma 6.1 that 0
satisfies the properties:
(i) 0 (z) is bounded above and below by positive constants c1 0 (z) c2 .
S
(ii) 0 ln 0 0 for all z C D (a), the domain where the function 0
is defined.
(iii) 0 ln 0 c3 2 when (1 2a) < |z z | < (1 a).
Let A
S denote the annulus A = {(1 2a) < |z z | < (1 a)}, and set
A = A . The properties (2) and (3) of 0 may be summarized as 0 ln 0
c3 2 A , where A is the characteristic function of A.
Suppose that is a nonnegative real constant.
We apply Proposition 3.5
S
2
with (z) = 0 (z)e|z| . If u C0 (R2 D (a)), assume Sthat D is a
bounded domain containing the support of u and A D R2 D (a). A
calculation gives
Z
Z
Z
2
2
2
2
|z|2
2
u 0 (z)e|z|2 c4
|u| 0 e
+ c5
|u| 0 e|z| .
D
The boundedness, property (1) of 0 , then yields

Z
Z
Z
2 |z|2
2
2
2
2
u e
c6
|u| e|z| + c7 2
|u| e|z| .
D
Let B(X) be the set of blocks of X and let b(X) = |B(X)|. If QX then
is constant on the blocks of X .
PX = { M | = X },
QX = { M | X }.
(24)
If X then = Y for some Y X so that

[
QX =
PY .
Y X
Thus by M
obius inversion
|PY | =
(Y, X) |QX | .
XY
Thus there is a bijection from QX to W B(X) . In particular |QX | = wb(X) .

Next note that b(X) = dim X. We see this by choosing a basis for X
consisting of vectors v k defined by
(
1 if i k ,
k
vi =
0 otherwise.
\[v^{k}_{i}=
\begin{cases} 1 & \text{if $i \in \Lambda_{k}$},\\
0 &\text{otherwise.} \end{cases}
\]
Lemma 6.2. Let A be an arrangement. Then
X
(A, t) =
(1)|B| tdim T (B) .
BA
00
In order to compute R recall the definition of S(X, Y ) from Lemma 3.1.

Since H B, AH B. Thus if T (B) = Y then B S(H, Y ). Let L00 = L(A00 ).
Then
X
R00 =
(1)|B| tdim T (B)
HBA
X
Y
L00
(1)|B| tdim Y
BS(H,Y )
X
Y
L00
X
Y L00
00
(1)|BAH | tdim Y
BS(H,Y )
(H, Y )tdim Y
= (A , t).
(25)
Corollary 6.3. Let (A, A0 , A00 ) be a triple of arrangements. Then

(A, t) = (A0 , t) + t(A00 , t).
Definition 6.2. Let (A, A0 , A00 ) be a triple with respect to the hyperplane
H A. Call H a separator if T (A) 6 L(A0 ).
Corollary 6.4. Let (A, A0 , A00 ) be a triple with respect to H A.
(i) If H is a separator then
(A) = (A00 )
and hence
|(A)| = |(A00 )| .
(ii) If H is not a separator then
(A) = (A0 ) (A00 )
and
|(A)| = |(A0 )| + |(A00 )| .
Proof. It follows from Theorem 5.1 that (A, t) has leading term
(1)r(A) (A)tr(A) .
The conclusion follows by comparing coefficients of the leading terms on both
sides of the equation in Corollary 6.3. If H is a separator then r(A0 ) < r(A)
and there is no contribution from (A0 , t).
The Poincare polynomial of an arrangement will appear repeatedly in these
notes. It will be shown to equal the Poincare polynomial of the graded algebras
which we are going to associate with A. It is also the Poincare polynomial
of the complement M (A) for a complex arrangement. Here we prove that the
Poincare polynomial is the chamber counting function for a real arrangement.
The complement M (A) is a disjoint union of chambers
[
M (A) =
C.
CCham(A)
The number of chambers is determined by the Poincare polynomial as follows.

Theorem 6.5. Let AR be a real arrangement. Then
|Cham(AR )| = (AR , 1).
Proof. We check the properties required in Corollary 6.4: (i) follows from
(l , t) = 1, and (ii) is a consequence of Corollary 3.4.
Figure 1: Q(A1 ) = xyz(x z)(x + z)(y z)(y + z)
Figure 2: Q(A2 ) = xyz(x + y + z)(x + y z)(x y + z)(x y z)
10
11
Theorem 6.6. Let be a protocol for a random pair (X, Y ). If one of (x0 , y)
and (x, y 0 ) is a prefix of the other and (x, y) SX,Y , then
0
hj (x0 , y)i
j=1 = hj (x, y)ij=1 = hj (x, y )ij=1 .
Proof. We show by induction on i that

hj (x0 , y)iij=1 = hj (x, y)iij=1 = hj (x, y 0 )iij=1 .
The induction hypothesis holds vacuously for i = 0. Assume it holds for
0 i1
0
i 1, in particular [j (x0 , y)]i1

j=1 = [j (x, y )]j=1 . Then one of [j (x , y)]j=i
0
0
and [j (x, y )]j=i is a prefix of the other which implies that one of i (x , y) and
i (x, y 0 ) is a prefix of the other. If the ith message is transmitted by PX then,
by the separate-transmissions property and the induction hypothesis, i (x, y) =
i (x, y 0 ), hence one of i (x, y) and i (x0 , y) is a prefix of the other. By the
implicit-termination property, neither i (x, y) nor i (x0 , y) can be a proper prefix of the other, hence they must be the same and i (x0 , y) = i (x, y) = i (x, y 0 ).
If the ith message is transmitted by PY then, symmetrically, i (x, y) = i (x0 , y)
by the induction hypothesis and the separate-transmissions property, and, then,
i (x, y) = i (x, y 0 ) by the implicit-termination property, proving the induction
step.
If is a protocol for (X, Y ), and (x, y), (x0 , y) are distinct inputs in SX,Y ,
0
then, by the correct-decision property, hj (x, y)i

j=1 6= hj (x , y)ij=1 .
Equation (25) defined PY s ambiguity set SX|Y (y) to be the set of possible X
values when Y = y. The last corollary implies that for all y SY , the multiset1
of codewords { (x, y) : x SX|Y (y)} is prefix free.
One-Way Complexity
C1 (X|Y ), the one-way complexity of a random pair (X, Y ), is the number of

bits PX must transmit in the worst case when PY is not permitted to transmit
any feedback messages. Starting with SX,Y , the support set of (X, Y ), we define
G(X|Y ), the characteristic hypergraph of (X, Y ), and show that
C1 (X|Y ) = d log (G(X|Y ))e .
Let (X, Y ) be a random pair. For each y in SY , the support set of Y ,
Equation (25) defined SX|Y (y) to be the set of possible x values when Y = y.
The characteristic hypergraph G(X|Y ) of (X, Y ) has SX as its vertex set and
the hyperedge SX|Y (y) for each y SY .
We can now prove a continuity theorem.
1A
multiset allows multiplicity of elements. Hence, {0, 01, 01} is prefix free as a set, but
not as a multiset.
12
Theorem 7.1. Let Rn be an open set, let u BV (; Rm ), and let

Du
u
m
n
Tx = y R : y = u
(x) +
(x), z for some z R
|Du|
(26)
for every x \Su . Let f : Rm Rk be a Lipschitz continuous function such

that f (0) = 0, and let v = f (u) : Rk . Then v BV (; Rk ) and

Jv = (f (u+ ) f (u )) u Hn1 Su .
(27)

e
In addition, for Du
-almost every x the restriction of the function f to Txu
is differentiable at u
(x) and

e
Du
e
e = ( f | u )(

u
)
Dv
Tx
e Du .
Du
(28)
Before proving the theorem, we state without proof three elementary remarks
which will be useful in the sequel.
Remark 7.1. Let : ]0, +[ ]0, +[ be a continuous function such that
(t) 0 as t 0. Then
lim g((h)) = L lim+ g(h) = L
h0+
h0
for any function g : ]0, +[ R.

Remark 7.2. Let g : Rn R be a Lipschitz continuous function and assume
that
g(hz) g(0)
L(z) = lim+
h
h0
exists for every z Qn and that L is a linear function of z. Then g is differentiable at 0.
Remark 7.3. Let A : Rn Rm be a linear function, and let f : Rm R be a
function. Then the restriction of f to the range of A is differentiable at 0 if and
only if f (A) : Rn R is differentiable at 0 and
( f |Im(A) )(0)A = (f (A))(0).
Proof. We begin by showing that v BV (; Rk ) and
|Dv| (B) K |Du| (B)
B B(),
(29)
where K > 0 is the Lipschitz constant of f . By (13) and by the approximation

result quoted in 3, it is possible to find a sequence (uh ) C 1 (; Rm ) converging
to u in L1 (; Rm ) and such that
Z
lim
|uh | dx = |Du| ().
h+
13
The functions vh = f (uh ) are locally Lipschitz continuous in , and the definition of differential implies that |vh | K |uh | almost everywhere in . The
lower semicontinuity of the total variation and (13) yield
Z
|Dv| () lim inf |Dvh | () = lim inf
|vh | dx
h+
h+
Z
(30)
K lim inf
|uh | dx = K |Du| ().
h+
Since f (0) = 0, we have also

Z
Z
|v| dx K
|u| dx;
therefore u BV (; Rk ). Repeating the same argument for every open set

A , we get (29) for every B B(), because |Dv|, |Du| are Radon measures.
To prove Lemma 6.1, first we observe that
Sv Su ,
v(x) = f (
u(x))
x \Su .
(31)
In fact, for every > 0 we have

{y B (x) : |v(y) f (
u(x))| > } {y B (x) : |u(y) u
(x)| > /K},
hence
lim+
|{y B (x) : |v(y) f (

u(x))| > }|
=0
n
whenever x \Su . By a similar argument, if x Su is a point such that there

exists a triplet (u+ , u , u ) satisfying (14), (15), then
(v + (x) v (x)) v = (f (u+ (x)) f (u (x))) u
if x Sv
and f (u (x)) = f (u+ (x)) if x Su \Sv . Hence, by (1.8) we get

Z
Z
+
Jv(B) =
(v v ) v dHn1 =
(f (u+ ) f (u )) u dHn1
BSv
BSv
Z
=
(f (u+ ) f (u )) u dHn1
BSu
and Lemma 6.1 is proved.

To prove (31), it is not restrictive to assume that k = 1. Moreover, to
simplify our notation, from now on we shall assume that = Rn . The proof of
(31) is divided into two steps. In the first step we prove the statement in the
one-dimensional case (n = 1), using Theorem 5.2. In the second step we achieve
the general result using Theorem 7.1.
14
Step 1

e
Assume that n = 1. Since Su is at most countable, (7) yields that Dv
(Su \Sv ) =
e + Jv is the Radon-Nikod
0, so that (19) and (21) imply that Dv = Dv
ym decomposition
of
Dv
in
absolutely
continuous
and
singular
part
with
respect
to

e
By
Theorem
5.2,
we
have
Du
.
e
Dv
(t) = lim
e
st+
Du
Dv([t, s[)

,
e
Du ([t, s[)
e
Du
(t) = lim
e
st+
Du
Du([t, s[)

e
Du ([t, s[)

e
Du-almost everywhere in R. It is well known (see, for instance, [12, 2.5.16])
that every one-dimensional function of bounded variation w has a unique left
continuous representative, i.e., a function w
such that w
= w almost everywhere
and limst w(s)
= w(t)
for every t R. These conditions imply

u
(t) = Du(], t[),
v(t) = Dv(], t[)
t R
(32)
and
v(t) = f (
u(t))
t R.
(33)

e
Let t R be such that Du ([t, s[) > 0 for every s > t and assume that the
limits in (22) exist. By (23) and (24) we get
v(s) v(t)
f (
u(s)) f (
u(t))

=
e
e
Du ([t, s[)
Du ([t, s[)

e
Du
e
f (
u(s)) f (
u(t) + (t) Du
([t, s[))
e
Du

=
e
Du ([t, s[)

e
Du
e
u(t))
f (
u(t) + (t) Du
([t, s[)) f (
e
Du

+
e
Du ([t, s[)
for every s > t. Using the Lipschitz condition on f we find

e

Du
e

f (
u(t) + (t) Du ([t, s[)) f (
u(t))

e
v(s) v(t)

Du

Du

e ([t, s[)
Du
e ([t, s[)

e

u
Du
(s) u
(t)
(t) .
K
e ([t, s[) Du
e
Du
15

e
By (29), the function s Du
([t, s[) is continuous and converges to 0 as s t.
Therefore Remark 7.1 and the previous inequality imply
e
Dv
(t) = lim
e
h0+
Du
e
Du
f (
u(t) + h (t)) f (
u(t))
e
Du
h

e
Du -a.e. in R.
By (22), u
(x) = u
(x) for every x R\Su ; moreover, applying the same argument to the functions u0 (t) = u(t), v 0 (t) = f (u0 (t)) = v(t), we get
e
Dv
(t) = lim
e
h0
Du
e
Du
f (
u(t) + h (t)) f (
u(t))
e
Du
h

e
Du -a.e. in R
and our statement is proved.
Step 2
Let us consider now the general case n > 1. Let Rn be such that || = 1,
and let = {y Rn : hy, i = 0}. In the following, we shall identify Rn with
R, and we shall denote by y the variable ranging in and by t the variable
ranging in R. By the just proven one-dimensional result, and by Theorem 3.3,
we get
lim
h0
e y
Du
(t)) f (
u(y + t))
f (
u(y + t) + h
e y
Du
h
e y
Dv
(t)
=
e y
Du

e
Duy -a.e. in R
for Hn1 -almost every y . We claim that

e i
hDu,

(y + t) =
e

hDu, i
e
Du
y (t)
e
Duy

e
Duy -a.e. in R
(34)
for Hn1 -almost every y . In fact, by (16) and (18) we get

Z
Z

e
Du
e y dHn1 (y) =
e y dHn1 (y)
y Du
Du
e
Du
y
Z

e
e i
hDu,
e i = hDu, i hDu,
e i =
e y dHn1 (y)

(y + ) Du
= hDu,
e

e

hDu,
i
hDu, i
16
and (24) follows from (13). By the same argument it is possible to prove that
e i
hDv,
(y + t) =

e
hDu, i
e
Dv
y (t)
e
Duy

e
Duy -a.e. in R
(35)
for Hn1 -almost every y . By (24) and (25) we get
lim
e i
hDu,
(y + t)) f (
f (
u(y + t) + h
u(y + t))
e i
hDu,
h
h0
e i
hDv,
(y + t)
=
e i
hDu,
for Hn1 -almost every y , and using again (14), (15) we get
lim
e i
hDu,
(x)) f (
f (
u(x) + h
u(x))
e i
hDu,
h
h0
e i
hDv,
(x)
=
e i
hDu,

e

hDu, i-a.e. in Rn .

e

e
e
i-almost evSince the function hDu,
i / Du
is strictly positive hDu,
erywhere, we obtain also
lim

e

hDu, i
e i
hDu,
(x)) f (
f (
u(x) + h (x)
u(x))
e
e i
Du
hDu,
h0
h

e

hDu, i
e i
hDv,

(x)
= (x)
e
e i
Du
hDu,

e

hDu, i-almost everywhere
Finally, since

e

hDu, i hDu,
e i

=
e e

Du hDu, i

e

hDu, i hDv,
e i

=
e e

Du hDu, i
in Rn .
e i
hDu,
=
e
Du
e
Du
,
e
Du
e i
hDv,
=
e
Du
e
Dv
,
e
Du

e
Du -a.e. in Rn

e
Du -a.e. in Rn
17

e
e
iand since both sides of (33) are zero Du
-almost everywhere on hDu,
negligible sets, we conclude that
*
+
e
Du
f u
(x) + h (x), f (
u(x)) *
+
e
Du
e
Dv
lim
= (x), ,
h0
h
e
Du

e
Du-a.e. in Rn . Since is arbitrary, by Remarks 7.2 and 7.3 the restriction of

e
f to the affine space Txu is differentiable at u
(x) for Du
-almost every x Rn
and (26) holds.
It follows from (13), (14), and (15) that
X
Y Y
D(t1 , . . . , tn ) =
(1)|I|1 |I|
ti
(Dj + j tj ) det A() (I|I).
(36)
In
iI
jI
Let ti = x
i , i = 1, . . . , n. Lemma 1 leads to
Y X
D(
x1 , . . . , x
n ) =
x
i
(1)|I|1 |I| per A() (I|I) det A() (I|I).
in
(37)
In
By (3), (13), and (37), we have the following result:

Theorem 7.2.
1 X
()
l(1)l1 Al ,
2n
Hc =
(38)
l=1
where
()
Al
per A() (Il |Il ) det A() (I l |I l ), |Il | = l.
(39)
Il n
()
It is worth noting that Al of (39) is similar to the coefficients bl of the

characteristic polynomial of (10). It is well known in graph theory that the
coefficients bl can be expressed as a sum over certain subgraphs. It is interesting
to see whether Al , = 0, structural properties of a graph.
We may call (38) a parametric representation of Hc . In computation, the
parameter i plays very important roles. The choice of the parameter usually
depends on the properties of the given graph. For a complete graph Kn , let
i = 1, i = 1, . . . , n. It follows from (39) that
(
n!, if l = 1
(1)
Al =
(40)
0, otherwise.
By (38)
Hc =
1
(n 1)!.
2
(41)
For a complete bipartite graph Kn1 n2 , let i = 0, i = 1, . . . , n. By (39),

(
n1 !n2 !n1 n2 , if l = 2
Al =
0,
otherwise .
18
(42)
Theorem 7.2 leads to
1
n1 !n2 !n1 n2 .
n1 + n2
Now, we consider an asymmetrical approach. Theorem 3.3 leads to
Hc =
(43)
det K(t = 1, t1 , . . . , tn ; l|l)

Y Y
X
(1)|I|
ti
=
(Dj + j tj ) det A() (I {l}|I {l}). (44)
In{l}
iI
jI
By (3) and (16) we have the following asymmetrical result:

Theorem 7.3.
Hc =
1
2
(1)|I| per A() (I|I) det A() (I {l}|I {l})
(45)
In{l}
which reduces to GouldenJacksons formula when i = 0, i = 1, . . . , n [9].
8
8.1
Various font features of the amsmath package

Bold versions of special symbols
In the amsmath package \boldsymbol is used for getting individual bold math
symbols and bold Greek letterseverything in math except for letters of the
Latin alphabet, where youd use \mathbf. For example,
A_\infty + \pi A_0 \sim
\mathbf{A}_{\boldsymbol{\infty}} \boldsymbol{+}
\boldsymbol{\pi} \mathbf{A}_{\boldsymbol{0}}
looks like this:
A + A0 A + A0
8.2
Poor mans bold
If a bold version of a particular symbol doesnt exist in the available fonts, then
\boldsymbol cant be used to make that symbol bold. At the present time, this
means that \boldsymbol cant be used with symbols from the msam and msbm
fonts, among others. In some cases, poor mans bold (\pmb) can be used instead
of \boldsymbol:

x y
y z
19
\[\frac{\partial x}{\partial y}
\pmb{\bigg\vert}
\frac{\partial y}{\partial z}\]
P
Q
So-called large operator symbols such as
and
require an additional
command, \mathop, to produce proper spacing and limits when \pmb is used.
For further details see The TEXbook.
XY
XY
F (ri )
(ri )
i<B
i odd
i<B
i odd
\[\sum_{\substack{i<B\\\text{$i$ odd}}}
\prod_\kappa \kappa F(r_i)\qquad
\mathop{\pmb{\sum}}_{\substack{i<B\\\text{$i$ odd}}}
\mathop{\pmb{\prod}}_\kappa \kappa(r_i)
\]
9
9.1
Compound symbols and other features

Multiple integral signs
\iint, \iiint, and \iiiint give multiple integral signs with the spacing between them nicely adjusted, in both text and display style. \idotsint gives
two integral signs with dots between them.
ZZ
ZZZ
f (x, y) dx dy
f (x, y, z) dx dy dz
(46)
A
ZZZZ
Z
f (w, x, y, z) dw dx dy dz
9.2
f (x1 , . . . , xk )
(47)
Over and under arrows
Some extra over and under arrow operations are provided in the amsmath package. (Basic LATEX provides \overrightarrow and \overleftarrow).
(t)Et h = (t)Et h
(t)Et h = (t)Et h
(t)Et h = (t)Et h
\begin{align*}
\overrightarrow{\psi_\delta(t) E_t h}&
=\underrightarrow{\psi_\delta(t) E_t h}\\
\overleftarrow{\psi_\delta(t) E_t h}&
20
=\underleftarrow{\psi_\delta(t) E_t h}\\

\overleftrightarrow{\psi_\delta(t) E_t h}&
=\underleftrightarrow{\psi_\delta(t) E_t h}
\end{align*}
These all scale properly in subscript sizes:
Z
ax dx
AB
\[\int_{\overrightarrow{AB}} ax\,dx\]
9.3
Dots
Normally you need only type \dots for ellipsis dots in a math formula. The
main exception is when the dots fall at the end of the formula; then you need
to specify one of \dotsc (series dots, after a comma), \dotsb (binary dots, for
binary relations or operators), \dotsm (multiplication dots), or \dotsi (dots
after an integral). For example, the input
Then we have the series $A_1,A_2,\dotsc$,
the regional sum $A_1+A_2+\dotsb$,
the orthogonal product $A_1A_2\dotsm$,
and the infinite integral
\[\int_{A_1}\int_{A_2}\dotsi\].
produces
Then we have the series A1 , A2 , . . . , the regional sum A1 + A2 +
, the orthogonal product A1 A2 , and the infinite integral
Z Z
A1
9.4
A2
Accents in math
Double accents:
``
A G
D
~~
V
\[\Hat{\Hat{H}}\quad\Check{\Check{C}}\quad
\Tilde{\Tilde{T}}\quad\Acute{\Acute{A}}\quad
\Grave{\Grave{G}}\quad\Dot{\Dot{D}}\quad
\Ddot{\Ddot{D}}\quad\Breve{\Breve{B}}\quad
\Bar{\Bar{B}}\quad\Vec{\Vec{V}}\]
This double accent operation is complicated and tends to slow down the processing of a LATEX file.
9.5
21
Dot accents
\dddot and \ddddot are available to produce triple and quadruple dot accents
in addition to the \dot and \ddot accents already available in LATEX:
...
....
Q
R
\[\dddot{Q}\qquad\ddddot{R}\]
9.6
Roots
In the amsmath package \leftroot and \uproot allow you to adjust the position
of the root index of a radical:
\sqrt[\leftroot{-2}\uproot{2}\beta]{k}
gives good positioning of the :
9.7
Boxed formulas
The command \boxed puts a box around its argument, like \fbox except that
the contents are in math mode:
\boxed{W_t-F\subseteq V(P_i)\subseteq W_t}
Wt F V (Pi ) Wt .
9.8
Extensible arrows
\xleftarrow and \xrightarrow produce arrows that extend automatically to

accommodate unusually wide subscripts or superscripts. The text of the subscript or superscript are given as an optional resp. mandatory argument: Example:
0 (b)
0
F 4[n 1] E 0 b
\[0 \xleftarrow[\zeta]{\alpha} F\times\triangle[n-1]

\xrightarrow{\partial_0\alpha(b)} E^{\partial_0b}\]
9.9
\overset, \underset, and \sideset
Examples:
X
b
\[\overset{*}{X}\qquad\underset{*}{X}\qquad
\overset{a}{\underset{b}{X}}\]
22
The command \sideset is for a rather special purpose: putting symbols

P at
the
subscript
and
superscript
corners
of
a
large
operator
symbol
such
as
or
Q
, without affecting the placement of limits. Examples:
Y
X0
Ei x
0im
\[\sideset{_*^*}{_*^*}\prod_k\qquad
\sideset{}{}\sum_{0\le i\le m} E_i\beta x
\]
9.10
The \text command
The main use of the command \text is for words or phrases in a display:
y = y0
if and only if yk0 = k y (k)
\[\mathbf{y}=\mathbf{y}\quad\text{if and only if}\quad

y_k=\delta_k y_{\tau(k)}\]
9.11
Operator names
The more common math functions such as log, sin, and lim have predefined control sequences: \log, \sin, \lim. The amsmath package provides \DeclareMathOperator
and \DeclareMathOperator* for producing new function names that will have
the same typographical treatment. Examples:
kf k = ess supxRn |f (x)|
\[\norm{f}_\infty=
\esssup_{x\in R^n}\abs{f(x)}\]
1
meas1 {u R+
: f (u) > } = measn {x Rn : |f (x)| }
> 0.
\[\meas_1\{u\in R_+^1\colon f^*(u)>\alpha\}

=\meas_n\{x\in R^n\colon \abs{f(x)}\geq\alpha\}
\quad \forall\alpha>0.\]
\esssup and \meas would be defined in the document preamble as
\DeclareMathOperator*{\esssup}{ess\,sup}
\DeclareMathOperator{\meas}{meas}
The following special operator names are predefined in the amsmath package:
\varlimsup, \varliminf, \varinjlim, and \varprojlim. Heres what they
23
look like in use:

lim Q(un , un u# ) 0
(48)
lim |an+1 | / |an | = 0
(49)
n
n
lim(mi ) 0
lim Ap 0
(50)
(51)
pS(A)
\begin{align}
&\varlimsup_{n\rightarrow\infty}
\mathcal{Q}(u_n,u_n-u^{\#})\le0\\
&\varliminf_{n\rightarrow\infty}
\left\lvert a_{n+1}\right\rvert/\left\lvert a_n\right\rvert=0\\
&\varinjlim (m_i^\lambda\cdot)^*\le0\\
&\varprojlim_{p\in S(A)}A_p\le0
\end{align}
9.12
\mod and its relatives
The commands \mod and \pod are variants of \pmod preferred by some authors;
\mod omits the parentheses, whereas \pod omits the mod and retains the
parentheses. Examples:
xy+1
(mod m2 )
2
(52)
xy+1
mod m
(53)
xy+1
(54)
(m )
\begin{align}
x&\equiv y+1\pmod{m^2}\\
x&\equiv y+1\mod{m^2}\\
x&\equiv y+1\pod{m^2}
\end{align}
9.13
Fractions and related constructions
The usual notation for binomials is similar to the fraction concept, so it has a
similar command \binom with two arguments. Example:

X
k k1
k k2
k
I = 2
2
+
2
1
2
C

(55)
k kl
+ + (1)l
2
+ + (1)k
l
= (2 1)k = 1
24
\begin{equation}
\begin{split}
[\sum_{\gamma\in\Gamma_C} I_\gamma&
=2^k-\binom{k}{1}2^{k-1}+\binom{k}{2}2^{k-2}\\
&\quad+\dots+(-1)^l\binom{k}{l}2^{k-l}
+\dots+(-1)^k\\
&=(2-1)^k=1
\end{split}
\end{equation}
There are also abbreviations
\dfrac
\tfrac
\dbinom
\tbinom
for the commonly needed constructions

{\displaystyle\frac ... }
{\textstyle\frac ... }
{\displaystyle\binom ... }
{\textstyle\binom ... }
The generalized fraction command \genfrac provides full access to the six
TEX fraction primitives:

n+1
n+1
\overwithdelims:
(56)
\over:
2
2

n+1
n+1
\atop:
\atopwithdelims:
(57)
2
2

n+1
n+1
\abovewithdelims:
(58)
\above:
2
2
\text{\cn{over}: }&\genfrac{}{}{}{}{n+1}{2}&
\text{\cn{overwithdelims}: }&
\genfrac{\langle}{\rangle}{}{}{n+1}{2}\\
\text{\cn{atop}: }&\genfrac{}{}{0pt}{}{n+1}{2}&
\text{\cn{atopwithdelims}: }&
\genfrac{(}{)}{0pt}{}{n+1}{2}\\
\text{\cn{above}: }&\genfrac{}{}{1pt}{}{n+1}{2}&
\text{\cn{abovewithdelims}: }&
\genfrac{[}{]}{1pt}{}{n+1}{2}
9.14
25
Continued fractions
The continued fraction

1
2+
(59)
2+
2+
2+
1
2 +
can be obtained by typing

\cfrac{1}{\sqrt{2}+
\cfrac{1}{\sqrt{2}+
\cfrac{1}{\sqrt{2}+
\cfrac{1}{\sqrt{2}+
\cfrac{1}{\sqrt{2}+\dotsb
}}}}}
Left or right placement of any of the numerators is accomplished by using
\cfrac[l] or \cfrac[r] instead of \cfrac.
9.15
Smash
In amsmath there are optional arguments t and b for the plain TEX command
\smash, because sometimes it is advantageous to be able to smash only the top
or only the bottom of
something while retaining the natural depth or height. In
the formula Xj = (1/ j )Xj0 \smash[b] has been used to limit the size of the
radical symbol.
$X_j=(1/\sqrt{\smash[b]{\lambda_j}})X_j$
Without
the use of \smash[b] the formula would have appeared thus: Xj =
p
(1/ j )Xj0 , with the radical extending to encompass the depth of the subscript
j.
9.16
The cases environment
Cases constructions like the following can be produced using the cases environment.
(
0
if r j is odd,
Prj =
(60)
(rj)/2
r! (1)
if r j is even.
\begin{equation} P_{r-j}=
\begin{cases}
0& \text{if $r-j$ is odd},\\
r!\,(-1)^{(r-j)/2}& \text{if $r-j$ is even}.
26
\end{cases}
\end{equation}
Notice the use of \text and the embedded math.
9.17
Matrix
Here are samples of the matrix environments, \matrix, \pmatrix, \bmatrix,

\Bmatrix, \vmatrix and \Vmatrix:

% %
%
%
%
%

(61)
$ $
$
$
$
$
\begin{matrix}
\vartheta& \varrho\\\varphi&
\end{matrix}\quad
\begin{pmatrix}
\end{pmatrix}\quad
\begin{bmatrix}
\end{bmatrix}\quad
\begin{Bmatrix}
\end{Bmatrix}\quad
\begin{vmatrix}
\end{vmatrix}\quad
\begin{Vmatrix}
\end{Vmatrix}
\varpi
\varpi
\varpi
\varpi
\varpi
\varpi
To produce a small matrix suitable for use in text, use the smallmatrix
environment.
\begin{math}
\bigl( \begin{smallmatrix}
a&b\\ c&d
\end{smallmatrix} \bigr)
\end{math}
To show the effect
of the matrix on the surrounding lines of a paragraph, we
put it here: ac db and follow it with enough text to ensure that there will be at
least one full line below the matrix.
27
\hdotsfor{number } produces a row of dots in a matrix spanning the given

number of columns:

0
...
0

(1 , 1 )

kn2

0

( , ) ( , ) . . .
W () = 2 1

2 2
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

kn1
kn2
kn n1

( , ) ( , ) . . . ( ,
(n , n )
n 1
n 2
n n1 )
\[W(\Phi)= \begin{Vmatrix}
\dfrac\varphi{(\varphi_1,\varepsilon_1)}&0&\dots&0\\
\dfrac{\varphi k_{n2}}{(\varphi_2,\varepsilon_1)}&
\dfrac\varphi{(\varphi_2,\varepsilon_2)}&\dots&0\\
\hdotsfor{5}\\
\dfrac{\varphi k_{n1}}{(\varphi_n,\varepsilon_1)}&
\dfrac{\varphi k_{n2}}{(\varphi_n,\varepsilon_2)}&\dots&
\dfrac{\varphi k_{n\,n-1}}{(\varphi_n,\varepsilon_{n-1})}&
\dfrac{\varphi}{(\varphi_n,\varepsilon_n)}
\end{Vmatrix}\]
The spacing of the dots can be varied through use of a square-bracket option,
for example, \hdotsfor[1.5]{3}. The number in square brackets will be used
as a multiplier; the normal value is 1.
9.18
The \substack command
The \substack command can be used to produce a multiline subscript or superscript: for example
\sum_{\substack{0\le i\le m\\ 0<j<n}} P(i,j)
produces a two-line subscript underneath the sum:
X
P (i, j)
(62)
0im
0<j<n
A slightly more generalized form is the subarray environment which allows you
to specify that each line should be left-aligned instead of centered, as here:
X
P (i, j)
(63)
0im
0<j<n
\sum_{\begin{subarray}{l}
0\le i\le m\\ 0<j<n
\end{subarray}}
P(i,j)
9.19
28
Big-g-g delimiters
Here are some big delimiters, first in \normalsize:

Z t

Ey
Lx,yx (s) (x) ds
0
\[\biggl(\mathbf{E}_{y}
\int_0^{t_\varepsilon}L_{x,y^x(s)}\varphi(x)\,ds
\biggr)
\]
and now in \Large size:
Z
Ey

Lx,yx (s) (x) ds
0
{\Large
\[\biggl(\mathbf{E}_{y}
\biggr)
\]}
29
Examples of multiple-line equation structures
Note: Starting on this page, vertical rules are added at the

margins so that the positioning of various display elements
with respect to the margins can be seen more clearly.
A.1
Split
The split environment is not an independent environment but should be used

inside something else such as equation or align.
If there is not enough room for it, the equation number for a split will be
shifted to the previous line, when equation numbers are on the left; the number
shifts down to the next line when numbers are on the right.
Z t
fh, (x, y) = Ex,y
Lx,y (u) (x) du
0
Z
= h Lx,z (x)x (dz)

Z t
Z
1
Ey
Lx,yx (s) (x) ds t Lx,z (x)x (dz)
+h
t
0
Z t

Z t
1
Ey
Lx,yx (s) (x) ds Ex,y
Lx,y (s) (x) ds
+
t
0
0
b
= hLx (x) + h (x, y),
(64)
Some text after to test the below-display spacing.
\begin{equation}
\begin{split}
f_{h,\varepsilon}(x,y)
&=\varepsilon\mathbf{E}_{x,y}\int_0^{t_\varepsilon}
L_{x,y_\varepsilon(\varepsilon u)}\varphi(x)\,du\\
&= h\int L_{x,z}\varphi(x)\rho_x(dz)\\
&\quad+h\biggl[\frac{1}{t_\varepsilon}\biggl(\mathbf{E}_{y}
-t_\varepsilon\int L_{x,z}\varphi(x)\rho_x(dz)\biggr)\\
&\phantom{{=}+h\biggl[}+\frac{1}{t_\varepsilon}
\biggl(\mathbf{E}_{y}\int_0^{t_\varepsilon}L_{x,y^x(s)}
\varphi(x)\,ds -\mathbf{E}_{x,y}\int_0^{t_\varepsilon}
L_{x,y_\varepsilon(\varepsilon s)}
\varphi(x)\,ds\biggr)\biggr]\\
&=h\wh{L}_x\varphi(x)+h\theta_\varepsilon(x,y),
\end{split}
\end{equation}
30
Unnumbered version:
Z t
fh, (x, y) = Ex,y
Lx,y (u) (x) du
0
Z
= h Lx,z (x)x (dz)
Z t

Z
1
+h
Ey
Lx,yx (s) (x) ds t Lx,z (x)x (dz)
t
0
Z t

Z t
1
+
Ey
Lx,yx (s) (x) ds Ex,y
Lx,y (s) (x) ds
t
0
0
b x (x) + h (x, y),
= hL
\begin{equation*}
\begin{split}
f_{h,\varepsilon}(x,y)
&=\varepsilon\mathbf{E}_{x,y}\int_0^{t_\varepsilon}
L_{x,y_\varepsilon(\varepsilon u)}\varphi(x)\,du\\
&= h\int L_{x,z}\varphi(x)\rho_x(dz)\\
&\quad+h\biggl[\frac{1}{t_\varepsilon}\biggl(\mathbf{E}_{y}
-t_\varepsilon\int L_{x,z}\varphi(x)\rho_x(dz)\biggr)\\
&\phantom{{=}+h\biggl[}+\frac{1}{t_\varepsilon}
\biggl(\mathbf{E}_{y}\int_0^{t_\varepsilon}L_{x,y^x(s)}
\varphi(x)\,ds -\mathbf{E}_{x,y}\int_0^{t_\varepsilon}
L_{x,y_\varepsilon(\varepsilon s)}
\varphi(x)\,ds\biggr)\biggr]\\
&=h\wh{L}_x\varphi(x)+h\theta_\varepsilon(x,y),
\end{split}
\end{equation*}
31
If the option centertags is included in the options list of the amsmath package, the equation numbers for split environments will be centered vertically
on the height of the split:
Z
(
)
Z a
Z

T
d

(t) u(a, t)
c()ut (, t) d dt
|I2 | =

0
(t) k(, t) a
(65)

Z

e

1,0
C6 f
Sea, W2 (, l ) |u| W2A (; r , T ) .
32
Use of split within align:

Z

|I1 | = gRu d
Z Z
g(, t) d
d
(66)
Z
1/2
2
C3
u2x +
1
k
Z
2
1/2
cut d
c

e

1,0
W2 (, l ) |u| W2A (; r , T ) .
C4 f Sea,
Z T

Z a
Z

d
(t) u(a, t)
|I2 | =
c()ut (, t) d dt
0
(t) k(, t) a
Z

1,0

e

A
e

C6 f
Sa, W2 (, l ) |u| W2 (; r , T ) .
(67)

\begin{align}
\begin{split}\abs{I_1}
&=\left\lvert \int_\Omega gRu\,d\Omega\right\rvert\\
&\le C_3\left[\int_\Omega\left(\int_{a}^x
g(\xi,t)\,d\xi\right)^2d\Omega\right]^{1/2}\\
&\quad\times \left[\int_\Omega\left\{u^2_x+\frac{1}{k}
\left(\int_{a}^x cu_t\,d\xi\right)^2\right\}
c\Omega\right]^{1/2}\\
&\le C_4\left\lvert \left\lvert f\left\lvert \wt{S}^{-1,0}_{a,-}
W_2(\Omega,\Gamma_l)\right\rvert\right\rvert
\left\lvert \abs{u}\overset{\circ}\to W_2^{\wt{A}}
(\Omega;\Gamma_r,T)\right\rvert\right\rvert.
\end{split}\label{eq:A}\\
\begin{split}\abs{I_2}&=\left\lvert \int_{0}^T \psi(t)\left\{u(a,t)
-\int_{\gamma(t)}^a\frac{d\theta}{k(\theta,t)}
\int_{a}^\theta c(\xi)u_t(\xi,t)\,d\xi\right\}dt\right\rvert\\
&\le C_6\left\lvert \left\lvert f\int_\Omega
\left\lvert \wt{S}^{-1,0}_{a,-}
\end{split}
\end{align}
33
Unnumbered align, with a number on the second split:

Z

|I1 | = gRu d
"Z Z
2 #1/2
x
C3
g(, t) d d
a
"Z (
1
u2x +
k
Z
#1/2
2 )
cut d

1,0
W2 (, l ) |u| W2A (; r , T ) .
C4 f Sea,
Z
(
)
Z a
Z
T

d

(t) u(a, t)
|I2 | =
c()ut (, t) d dt
0

k(,
t)
(t)
a

Z

e

e1,0

C6 f
Sa, W2 (, l ) |u| W2A (; r , T ) .
(670 )

\begin{align*}
\begin{split}\abs{I_1}&=\left\lvert \int_\Omega gRu\,d\Omega\right\rvert\\
&\le C_3\left[\int_\Omega\left(\int_{a}^x
g(\xi,t)\,d\xi\right)^2d\Omega\right]^{1/2}\\
&\phantom{=}\times \left[\int_\Omega\left\{u^2_x+\frac{1}{k}
\left(\int_{a}^x cu_t\,d\xi\right)^2\right\}
c\Omega\right]^{1/2}\\
&\le C_4\left\lvert \left\lvert f\left\lvert \wt{S}^{-1,0}_{a,-}
\end{split}\\
\begin{split}\abs{I_2}&=\left\lvert \int_{0}^T \psi(t)\left\{u(a,t)
-\int_{\gamma(t)}^a\frac{d\theta}{k(\theta,t)}
\int_{a}^\theta c(\xi)u_t(\xi,t)\,d\xi\right\}dt\right\rvert\\
&\le C_6\left\lvert \left\lvert f\int_\Omega
\left\lvert \wt{S}^{-1,0}_{a,-}
\end{split}\tag{\theequation$$}
\end{align*}
A.2
34
Multline
Numbered version:
Z b Z
a

[f (x)2 g(y)2 + f (y)2 g(x)2 ] 2f (x)g(x)f (y)g(y) dx dy
Z b
=
g(y)
a
g 2f (y)g(y)
f + f (y)
a

f g dy
(68)
To test the use of \label and \ref, we refer to the number of this equation
here: (68).
\begin{multline}\label{eq:E}
\int_a^b\biggl\{\int_a^b[f(x)^2g(y)^2+f(y)^2g(x)^2]
-2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\
=\int_a^b\biggl\{g(y)^2\int_a^bf^2+f(y)^2
\int_a^b g^2-2f(y)g(y)\int_a^b fg\biggr\}\,dy
\end{multline}
Unnumbered version:
Z b Z
a

[f (x) g(y) + f (y) g(x) ] 2f (x)g(x)f (y)g(y) dx dy
2
Z b
=
a
g(y)2
Z
a
f 2 + f (y)2
g 2 2f (y)g(y)

\begin{multline*}
\int_a^b\biggl\{\int_a^b[f(x)^2g(y)^2+f(y)^2g(x)^2]
-2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\
=\int_a^b\biggl\{g(y)^2\int_a^bf^2+f(y)^2
\int_a^b g^2-2f(y)g(y)\int_a^b fg\biggr\}\,dy
\end{multline*}
Z
a

f g dy
A.3
35
Gather
Numbered version with \notag on the second line:

D(a, r) {z C : |z a| < r},
(69)
seg(a, r) {z C : =z = =a, |z a| < r},

c(e, , r) {(x, y) C : |x e| < y tan , 0 < y < r},
[
C(E, , r)
c(e, , r).
eE
\begin{gather}
D(a,r)\equiv\{z\in\mathbf{C}\colon \abs{z-a}<r\},\\
\seg(a,r)\equiv\{z\in\mathbf{C}\colon
\Im z= \Im a,\ \abs{z-a}<r\},\notag\\
c(e,\theta,r)\equiv\{(x,y)\in\mathbf{C}
\colon \abs{x-e}<y\tan\theta,\ 0<y<r\},\\
C(E,\theta,r)\equiv\bigcup_{e\in E}c(e,\theta,r).
\end{gather}
Unnumbered version.
D(a, r) {z C : |z a| < r},
seg(a, r) {z C : =z = =a, |z a| < r},
c(e, , r) {(x, y) C : |x e| < y tan , 0 < y < r},
[
C(E, , r)
c(e, , r).
eE

\begin{gather*}
D(a,r)\equiv\{z\in\mathbf{C}\colon \abs{z-a}<r\},\\
\seg (a,r)\equiv\{z\in\mathbf{C}\colon
\Im z= \Im a,\ \abs{z-a}<r\},\\
c(e,\theta,r)\equiv\{(x,y)\in\mathbf{C}
\colon \abs{x-e}<y\tan\theta,\ 0<y<r\},\\
C(E,\theta,r)\equiv\bigcup_{e\in E}c(e,\theta,r).
\end{gather*}
(70)
(71)
A.4
36
Align
Numbered version:
x (t) = (cos tu + sin tx, v),
(72)
y (t) = (u, cos tv + sin ty),

z (t) = cos tu + sin tv, sin tu + cos tv .
(73)
(74)

\begin{align}
\gamma_x(t)&=(\cos tu+\sin tx,v),\\
\gamma_y(t)&=(u,\cos tv+\sin ty),\\
\gamma_z(t)&=\left(\cos tu+\frac\alpha\beta\sin tv,
-\frac\beta\alpha\sin tu+\cos tv\right).
\end{align}
Unnumbered version:
x (t) = (cos tu + sin tx, v),
y (t) = (u, cos tv + sin ty),

z (t) = cos tu + sin tv, sin tu + cos tv .

\begin{align*}
\gamma_x(t)&=(\cos tu+\sin tx,v),\\
\gamma_y(t)&=(u,\cos tv+\sin ty),\\
\gamma_z(t)&=\left(\cos tu+\frac\alpha\beta\sin tv,
-\frac\beta\alpha\sin tu+\cos tv\right).
\end{align*}
A variation:
x=y
0
x =y
0
x+x =y+y
by (84)
(75)
by (85)
(76)
by Axiom 1.
(77)

\begin{align}
x& =y && \text {by (\ref{eq:C})}\\
x& = y && \text {by (\ref{eq:D})}\\
x+x & = y+y && \text {by Axiom 1.}
\end{align}
A.5
37
Align and split within gather
When using the align environment within the gather environment, one or the
other, or both, should be unnumbered (using the * form); numbering both the
outer and inner environment would cause a conflict.
Automatically numbered gather with split and align*:
(x, z) = z 10 x mn xm z n
= z M r1 x M r(m+n) xm z n
(78)
0 = ( 0 )2 ,
1 = 01,
2 = ( 1 )2 ,
Here the split environment gets a number from the outer gather environment;
numbers for individual lines of the align* are suppressed because of the star.
\begin{gather}
\begin{split} \varphi(x,z)
&=z-\gamma_{10}x-\gamma_{mn}x^mz^n\\
&=z-Mr^{-1}x-Mr^{-(m+n)}x^mz^n
\end{split}\\[6pt]
\begin{align*}
\zeta^0 &=(\xi^0)^2,\\
\zeta^1 &=\xi^0\xi^1,\\
\zeta^2 &=(\xi^1)^2,
\end{align*}
\end{gather}
The *-ed form of gather with the non-*-ed form of align.
(x, z) = z 10 x mn xm z n
= z M r1 x M r(m+n) xm z n
0 = ( 0 )2 ,
1
0 1
= ,
2
1 2
= ( ) ,
\begin{gather*}
\begin{split} \varphi(x,z)
&=z-\gamma_{10}x-\gamma_{mn}x^mz^n\\
&=z-Mr^{-1}x-Mr^{-(m+n)}x^mz^n
\end{split}\\[6pt]
\begin{align} \zeta^0&=(\xi^0)^2,\\
(79)
(80)
(81)
\zeta^1 &=\xi^0\xi^1,\\
\zeta^2 &=(\xi^1)^2,
\end{align}
\end{gather*}
38
A.6
39
Alignat
Numbered version:
Vi = vi qi vj ,
X i = xi q i xj ,
Vj = vj ,
X j = xj ,
Ui = ui ,
for i 6= j;
X
Uj uj +
qi ui .
i6=j

\begin{alignat}{3}
V_i & =v_i - q_i v_j, & \qquad X_i & = x_i - q_i x_j,
& \qquad U_i & = u_i,
\qquad \text{for $i\ne j$;}\label{eq:B}\\
V_j & = v_j, & \qquad X_j & = x_j,
& \qquad U_j & u_j + \sum_{i\ne j} q_i u_i.
\end{alignat}
Unnumbered version:
V i = vi q i vj ,
X i = xi q i xj ,
V j = vj ,
X j = xj ,
Ui = ui ,
for i 6= j;
X
Uj uj +
qi ui .
i6=j

\begin{alignat*}3
V_i & =v_i - q_i v_j, & \qquad X_i & = x_i - q_i x_j,
& \qquad U_i & = u_i,
\qquad \text{for $i\ne j$;} \\
V_j & = v_j, & \qquad X_j & = x_j,
& \qquad U_j & u_j + \sum_{i\ne j} q_i u_i.
\end{alignat*}
(82)
(83)
40
The most common use for alignat is for things like

x=y
by (66)
(84)
x0 = y 0
by (82)
(85)
by Axiom 1.
(86)
x+x =y+y

\begin{alignat}{2}
x& =y && \qquad \text {by (\ref{eq:A})}\label{eq:C}\\
x& = y && \qquad \text {by (\ref{eq:B})}\label{eq:D}\\
x+x & = y+y && \qquad \text {by Axiom 1.}
\end{alignat}
REFERENCES
41
References
[1] W. Diffie and E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory 22 (1976), no. 5, 644654.
[2] D. H. Fremlin, Cichons diagram, 1983/1984, presented at the Seminaire
Initiation `
a lAnalyse, G. Choquet, M. Rogalski, J. Saint Raymond, at the
Universite Pierre et Marie Curie, Paris, 23e annee.
[3] I. P. Goulden and D. M. Jackson, The enumeration of directed closed Euler
trails and directed Hamiltonian circuits by Langrangian methods, European
J. Combin. 2 (1981), 131212.
[4] F. Harary and E. M. Palmer, Graphical enumeration, Academic Press, 1973.
[5] R. Impagliazzo, L. Levin, and M. Luby, Pseudo-random generation from
one-way functions, Proc. 21st STOC (1989), ACM, New York, pp. 1224.
[6] M. Kojima, S. Mizuno, and A. Yoshise, A new continuation method for
complementarity problems with uniform p-functions, Tech. Report B-194,
Tokyo Inst. of Technology, Tokyo, 1987, Dept. of Information Sciences.
[7]
, A polynomial-time algorithm for a class of linear complementarity

problems, Tech. Report B-193, Tokyo Inst. of Technology, Tokyo, 1987,
Dept. of Information Sciences.
[8] C. J. Liu and Yutze Chow, On operator and formal sum methods for graph
enumeration problems, SIAM J. Algorithms Discrete Methods 5 (1984),
384438.
[9] M. Marcus and H. Minc, A survey of matrix theory and matrix inequalities,
Complementary Series in Math. 14 (1964), 2148.
[10] S. Mizuno, A. Yoshise, and T. Kikuchi, Practical polynomial time algorithms for linear complementarity problems, Tech. Report 13, Tokyo Inst.
of Technology, Tokyo, April 1988, Dept. of Industrial Engineering and Management.
[11] R. D. Monteiro and I. Adler, Interior path following primal-dual algorithms,
part II: Quadratic programming, August 1987, Working paper, Dept. of
Industrial Engineering and Operations Research.
[12] E. M. Stein, Singular integrals and differentiability properties of functions,
Princeton Univ. Press, Princeton, N.J., 1970.
[13] Y. Ye, Interior algorithms for linear, quadratic and linearly constrained
convex programming, Ph.D. thesis, Stanford Univ., Palo Alto, Calif., July
1987, Dept. of EngineeringEconomic Systems, unpublished.

American Mathematical Society - Sample Paper

Uploaded by

Copyright:

Available Formats

American Mathematical Society - Sample Paper

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

American Mathematical Society - Sample Paper

Uploaded by

Copyright:

Available Formats

Sample Paper for the amsmath Package

File name: testmath.tex

This paper contains examples of various features from AMS-LATEX.

Enumeration of Hamiltonian paths in a graph

Let A = (aij ) be the adjacency matrix of graph G. The corresponding Kirchhoff

where K(i|i) is the ith principal submatrix of K.

Sample paper for the amsmath package

The task here is to express (3) in a form free of any x

Notation. For p, q P and n we write (q, n) (p, n) if q p and Aq,n =

where per B is the permanent of B.

Then, it follows that

Sample paper for the amsmath package

Note that all basic properties of determinants are direct consequences of

(bii i ) det B() (Il |Il ),

det B(Il |Il ).

det K(t, t1 , . . . , tn )|t=1 .

Sample paper for the amsmath package

Di det K(t = 1, t1 , . . . , tn ; i|i),

where K(t = 1, t1 , . . . , tn ; i|i) is the ith principal submatrix of K(t = 1, t1 , . . . , tn ).

(Dj + j tj ) det A() (I|I) = 0.

(1)|I| per A() (I|I) det A() (I {l}|I {l}). (16)

Sample paper for the amsmath package

Kn1 ...np may be written

It follows from Theorems 5.1 and 5.2 that

... \binom{n_i}{l _i}\\

Secret Key Exchanges

Modern cryptography is fundamentally concerned with the problem of secure

Sample paper for the amsmath package

of course trivial if trapdoor permutations exist. However, there is no known

We begin our discussion with the following definition:

H(z + v) H(z) BH(z)v

The function H is B-differentiable in set S if it is B-differentiable at every point

Sample paper for the amsmath package

Sample paper for the amsmath package

The boundedness, property (1) of 0 , then yields

If X then = Y for some Y X so that

Thus there is a bijection from QX to W B(X) . In particular |QX | = wb(X) .

In order to compute R recall the definition of S(X, Y ) from Lemma 3.1.

Sample paper for the amsmath package

Corollary 6.3. Let (A, A0 , A00 ) be a triple of arrangements. Then

The number of chambers is determined by the Poincare polynomial as follows.

Sample paper for the amsmath package

Figure 1: Q(A1 ) = xyz(x z)(x + z)(y z)(y + z)

Figure 2: Q(A2 ) = xyz(x + y + z)(x + y z)(x y + z)(x y z)

Sample paper for the amsmath package

Proof. We show by induction on i that

i 1, in particular [j (x0 , y)]i1

then, by the correct-decision property, hj (x, y)i

C1 (X|Y ), the one-way complexity of a random pair (X, Y ), is the number of

Sample paper for the amsmath package

Theorem 7.1. Let Rn be an open set, let u BV (; Rm ), and let

for every x \Su . Let f : Rm Rk be a Lipschitz continuous function such

for any function g : ]0, +[ R.

where K > 0 is the Lipschitz constant of f . By (13) and by the approximation

Sample paper for the amsmath package

Since f (0) = 0, we have also

therefore u BV (; Rk ). Repeating the same argument for every open set

In fact, for every > 0 we have

|{y B (x) : |v(y) f (

whenever x \Su . By a similar argument, if x Su is a point such that there