An axiomatic formulation is presented for point processes which may be interpreted as ordered sequences of points randomly located on the real line. Such concepts as forward recurrence times and number of points in intervals are defined and related in set-theoretic Note that for α∈$A$,$G$^{α}may not cover$G$_{α}as a convex subgroup and so we cannot use Theorem 1.1 to prove this result. Moreover, all that we know about the$G$^{α}/G_{α}is that each is an extension of a trivially ordered subgroup by a subgroup of$R$. It$B$is a plenary subset of$A$, then there exists a$v$-isomorphism μ of$G$into$V(B, G$^{β}/G_{β}), but whether or not μ is an$o$-isomorphism is not known.

In this paper we discuss the change in contact structures as their supporting open book decompositions have their binding components cabled. To facilitate this and applications we define the notion of a rational open book decomposition that generalizes the standard notion of open book decomposition and allows one to more easily study surgeries on transverse knots. As a corollary to our investigation we are able to show there are Stein fillable contact structures supported by open books whose monodromies cannot be written as a product of positive Dehn twists. We also exhibit several monoids in the mapping class group of a surface that have contact geometric significance.

Motivated by an extra credit problem from our Linear Algebra class, we study the invertibility probability of binary matrices (the number of invertible binary matrices divided by the total number of binary matrices). Binary matrices are of interest in combinatorics, information theory, cryptology, and graph theory. It is known that the invertibility probability of n × n binary matrices goes to 1 as n→∞. We conjecture that this probability monotonically increases as the size of the binary matrix increases, and we investigate this by exploring how n×n binary matrices of rank n and rank (n−1) can be enlarged to (n + 1) × (n + 1) invertible binary matrices. Calculating this explicitly for the identity matrix, we obtain a probable bound that would show that, in a sense, our conjecture is asymptotically true. With the use of a computer, we also computed how many (n + 1) × (n + 1) invertible binary matrices can be enlarged from n×n matrices of rank n and rank (n−1) for small n. In addition, we study the invertibility probability of matrices with entries in Z_q.

No abstract uploaded!

In this paper, we study the relationship between the cocenter and the representation theory of affine Hecke algebras. The approach is based on the interaction between the rigid cocenter, an important subspace of the cocenter, and the dual object in representation theory, the rigid quotient of the Grothendieck group of finite dimensional representations.