A comparison of rigid and flexible crosslinked polymer-supported peptide synthesis

To correlate the coupling difficulty and nature of the support in solid-phase peptide synthesis, a set of difficult peptides were built under identical conditions on rigid and hydrophobic divinyl benzene-crosslinked polystyrene (DVB-PS) and flexible and polar 1,4-butanediol dimethacrylate-crosslinked polystyrene (BDDMA-PS) resins of same functional capacity (∼2 mmol/g). The difficult coupling stages observed on each support were identified by monitoring the acylation time, coupling yield and deprotection efficiency. The yield and purity of the peptides prepared on BDDMA-PS were higher than when DVB-PS support was used.     

Quadratic decomposition of symmetric semi-classical polynomial sequences of even class: an example from the case s = 2

In the present work, we deal with the quadratic decomposition of symmetric semi-classical polynomial sequences of even class. An example from class 2 is settled. We give an integral representation of the considered symmetric form.     

Automatic β-expansions of formal Laurent series over finite fields

We consider β-expansions of formal Laurent series over finite fields. If the base β is a Pisot or Salem series, we prove that the β-expansion of a Laurent series α is automatic if and only if α is algebraic.     

An Algebra of Exponential Polynomials as the Cofinite Dual of the Hopf Algebra of Polynomials

We prove that the cofinite dual of the Hopf algebra of polynomials in several variables can be represented as a Hopf algebra ? of exponential polynomials that contains the polynomials as a Hopf subalgebra. We also present some algebras isomorphic to ? whose elements are rational functions or multi-sequences.     

Two classes of piecewise-linear difference equations with eventual periodicity three

In this paper, we will study two classes of difference equations which are piecewise-linear and of similar forms. We will show that all nontrivial solutions of one equation are eventually periodic with prime period three. We will show this result for one case of the second equation.     

A short proof of a theorem on degree sets of graphs

For a finite simple graph G, we denote the set of degrees of its vertices, known as its degree set, by D(G). Kapoor, Polimeni and Wall [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] have determined the least number of vertices among graphs with a given degree set. We give a very short proof of this result.     

Searching for extensible Korobov rules

Extensible lattice sequences have been proposed and studied in [F.J. Hickernell, H.S. Hong, Computing multivariate normal probabilities using rank-1 lattice sequences, in: G.H. Golub, S.H. Lui, F.T. Luk, R.J. Plemmons (Eds.), Proceedings of the Workshop on Scientific Computing (Hong Kong), Singapore, Springer, Berlin, 1997, pp. 209–215; F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138; F.J. Hickernell, H.Niederreiter, The existence of good extensible rank-1 lattices, J. Complexity 19 (2003) 286–300]. For the special case of extensible Korobov sequences, parameters can be found in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C.Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138]. The searches made to obtain these parameters were based on quality measures that look at several projections of the lattice. Because it is often the case in practice that low-dimensional projections are very important, it is of interest to find parameters for these sequences based on measures that look more closely at these projections. In this paper, we prove the existence of “good” extensible Korobov rules with respect to a quality measure that considers two-dimensional projections. We also report results of experiments made on different problems where the newly obtained parameters compare favorably with those given in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138].     

Sigma function solution of the initial value problem for Somos 5 sequences

The Somos 5 sequences are a family of sequences defined by a fifth order bilinear recurrence relation with constant coefficients. For particular choices of coefficients and initial data, integer sequences arise. By making the connection with a second order nonlinear mapping with a first integral, we prove that the two subsequences of odd/even index terms each satisfy a Somos 4 (fourth order) recurrence. This leads directly to the explicit solution of the initial value problem for the Somos 5 sequences in terms of the Weierstrass sigma function for an associated elliptic curve.

     

Limit Theorems for the Maximum Terms of a Sequence of Random Variables with Marginal Geometric Distributions

Let X _n1 ^* , ... X _nn ^* be a sequence of n independent random variables which have a geometric distribution with the parameter p _n = 1/n, and M _n ^* = \max\{X _n1 ^* , ... X _nn ^* }. Let Z ₁, Z₂, Z₃, ... be a sequence of independent random variables with the uniform distribution over the set N _n = {1, 2, ... n}. For each j N _n let us denote X _nj = min{k : Z_k = j}, M _n = max{X_n1, ... X_nn}, and let S _n be the 2nd largest among X _n1, X_n2, ... X_nn. Using the methodology of verifying D(u_n) and D'(u_n) mixing conditions we prove herein that the maximum M _n has the same type I limiting distribution as the maximum M _n ^* and estimate the rate of convergence. The limiting bivariate distribution of (S_n, M_n) is also obtained. Let _n, _n N_n, , and T _n = min{M(A_n), M(B_n)}. We determine herein the limiting distribution of random variable T _n in the case _n , _n/_n > 0, as n .