... norm on R
d
.
In recent years, there has been an increasing interest in the study of the asymptotic behavior of the
solutions of both convolution and non-convolution-type linear and nonlinear Volterra ... aim in this section is to obtain sufficient condition for the boundedness of the solution of (1.1) under
the initial condition (1.2), but in the linea...
... B = X = A
j
.
On the structure and classification of SOMAs:
generalizations of mutually orthogonal Latin squares
Leonard H. Soicher
School of Mathematical Sciences
Queen Mary and Westfield College
Mile ... first study the structure of SOMAs, concentrating on how SO-
MAs can decompose. We then report on the use of computational group theory
and graph theory in...
... +1)
6
49n
6
.
7. The number of ascendants of a given node in a LBST
As in the case of the number of ascendants in a random BST, computing the probability that
the j
th
node in a random LBST has m ascendants ... other random variables: the number of descendants D
n
and the number of ascendants A
n
of a randomly chosen internal node...
... combinatorics 17 (2010), #R128 15
On the Structure of Sets with Few Three-Term
Arithmetic Progressions
Ernie Croot
∗
Georgia Institute of Technology
School of Mathematics
103 Skiles
Atlanta, Ga 30332
ecroot@math.gatech.edu
Submitted: ... number of cosets of some lar ge-dimensional su bspace of F
n
p
.
1 Introduction
Of central importance to the subject of addi...
... 05C05 60C05
Abstract
By a theorem of Dobrow and Smythe, the depth of the kth no de in very simple
families of increasing trees (which includes, among others, binary increasing trees,
recursive trees ... Dobrow/Smythe, Theorem 6)
In a random increasing tree with n nodes from a simple family, the distribution of the
distance between nodes i and k (i < k) is the...