One-dimensional Tilings Using Tiles with Two Gap Lengths

Let n,p,k,q,l be positive integers with n=k+l+1. Let x₁,x₂, . . . ,x_n be a sequence of positive integers with x₁<x₂<···<x_n. A set {x₁,x₂, . . . ,x_n} is called a set of type (p,k;q,l) if the set of differences {x₂–x₁,x₃–x₂, . . . ,x_n–x_n–1} equals {p, . . . ,p,q, . . . ,q} as a multiset, where p and q appear k and l times, respectively. Among other results, it is shown that for any p,k,q, there exists a finite interval I in the set of integers such that I is partitioned into sets of type (p,k;q,1).     

Fast canonization of circular strings

A circular string A = (a₁,…,a_n) is a string that has n equivalent linear representations A_i = a_i,…,a_n,a₁,…,a_i?1 for i = 1,…,n. The a_i's are assumed to be well ordered. We say that A_i < A_j if the word a_i…a_na₁…a_i?1 precedes the word a_j…a_na₁…a_j?1 in the lexicographic order, A_i ? A_j if either A_i < A_j or A_i = A_j. A_i0 is a minimal representation of A if A_i0 ? A_i for all 1 ≤ i ≤ n. The index i₀ is called a minimal starting point (m.s.p.). In this paper we discuss the problem of finding m.s.p. of a given circular string. Our algorithm finds, in fact, all the m.s.p.'s of a given circular string A of length n by using at most $\text{n + ?}\text{d}\text{2}\text{?}$ comparisons. The number d denotes the difference between two successive m.s.p.'s (see Lemma 1.1) and is equal to n if A has a unique m.s.p. Our algorithm improves the result of 3n comparisons given by K. S. Booth. Only constant auxiliary storage is used.     

态射和的Drazin逆

设C 是加法范畴, 态射φ,η： X→ X 是C上的态射. 若φ,η 具有Drazin逆且φη =0, 则φ+η 也具有Drazin逆. 若φ具有Drazin逆φ^D 且1_X+φ^Dη 可逆, 作者讨论f =φ+η 的Drazin逆( 群逆)并且给出 f ^D(f ^#}=(1_X+φ^Dη)^-1φ^D的充分必要条件. 最后, 把Huylebrouck的结果从群逆推广到了Drazin逆.     

On the Approximation of Positive Functions by Power Series, II

We consider positive functionsh=h(x) defined forxR⁺₀. Conditions for the existence of a power seriesN(x)=∑ c_nxⁿ,c_n0, with the propertyd₁h(x)/N(x)d₂, x0,for some constantsd₁, d₂R⁺, are investigated in [J. Clunie and T. Kövari,Canad. J. Math.20(1968), 7–20; P. Erd s and T. Kövari,Acta Math. Acad. Sci. Hung.7(1956), 305–316; U. Schmid,Complex Variables18(1992), 187–192; U. Schmid, J.Approx. Theory83(1995), 342–346]. In this paper, methods are discussed which allow for a given functionhthe construction of the coefficientsc_n,n ₀, for the above defined power seriesNand to find suitable constantsd₁andd₂. We also study the power seriesH(x)=∑ xⁿ/u_n, where we setu_n=sup{xⁿ/h(x), x0}, forn ₀, and the relation betweenhandHconcerning the above stated inequalities.     

Coalescence in the recent past in rapidly growing populations

In a rapidly growing population one expects that two individuals chosen at random from the n$n$th generation are unlikely to be closely related if n$n$ is large. In this paper it is shown that for a broad class of rapidly growing populations this is not the case. For a Galton–Watson branching process with an offspring distribution {_pj}$\left\{p_j\right\}$ such that _p0=0$p_0=0$ and ψ(x)=_{∑jpjI{j≥x}}$\psi \left(x\right)={\sum }_j{p}_j{I}_{\{j\ge x\}}$ is asymptotic to x^−αL(x)$x^{-\alpha }L\left(x\right)$ as x→∞$x\to \infty$ where L(⋅)$L(\cdot )$ is slowly varying at ∞$\infty$ and 0<α<1$0<\alpha <1$ (and hence the mean m=∑j_pj=∞$m=\sum j{p}_j=\infty$) it is shown that if _Xn$X_n$ is the generation number of the coalescence of the lines of descent backwards in time of two randomly chosen individuals from the n$n$th generation then n−_Xn$n-X_n$ converges in distribution to a proper distribution supported by N={1,2,3,…}$\mathbb{N}=\{1,2,3,\dots \}$. That is, in such a rapidly growing population coalescence occurs in the recent past rather than the remote past. We do show that if the offspring mean m$m$ satisfies 1<m≡∑j_pj<∞$1<m\equiv \sum j{p}_j<\infty$ and _p0=0$p_0=0$ then coalescence time _Xn$X_n$ does converge to a proper distribution as n→∞$n\to \infty$, i.e., coalescence does take place in the remote past.     

A version of Chevet's theorem for stable processes

Let $\text{X}\text{}\text{?}\text{bo}\text{Y}$ be the injective tensor product of the separable Banach spaces X and Y and let S_X, S_Y and $\text{S}{}_{\mathrm{<mtext>X\; </mtext><mtext>\backslash </mtext><mtext>?</mtext><mtext>bo\; Y</mtext>}}$ be the unit spheres of these spaces. The tensor product of two symmetric finite measures η₁ on S_X and η₂ on S_Y, η₁?η₂, is defined in a natural way as a measure on $\text{S}{}_{\mathrm{<mtext>X\; </mtext><mtext>\backslash </mtext><mtext>?</mtext><mtext>bo\; Y</mtext>}}$. It is shown that η₁? η₂ is the spectral measure of a p-stable random variable W on $\text{X}\text{}\text{?}\text{bo}\text{Y}$, 0 <p < 2, if and only if η₁ and η₂ are the spectral measures of p-stable random variables U and V on X and Y, respectively. Actually upper and lower bounds for $\text{(E∥ W∥}{}^{\mathrm{r}}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>r</mtext>}}$ in terms of the random variables U and V are obtained. When X = C(S), Y = C(T) with S, T compact metric spaces, and η₁, and η₂ are discrete, our results imply that if θ_i, θ_ij are i.i.d. standard symmetric real valued p-stable random variables, 0 < p <2, x_i?C(S), and y_i?C(T), then the series ∑_ijθ_ijx_i(s) y_j(t) converges uniformly a.s. iff the series ∑_iθ_ix_i(s) and ∑_iθ_iy_i(t) both converge uniformly a.s. When p = 2 this follows from Chevet's theorem on Gaussian processes. Several examples are given. One of them requires an interesting upper bound on the probability distribution of the maximum of i.i.d. p-stable random variables taking values in a general Banach space.     

On Vertices, focal curvatures and differential geometry of space curves

The focal curve of an immersed smooth curve γ : θ ↦ γ (θ), in Euclidean space ℝ^m+1, consists of the centres of its osculating hyperspheres. This curve may be parametrised in terms of the Frenet frame of γ (t, n₁, . . . , n_m), as C_γ (θ) = (γ +c₁n₁+ c₂n₂ + • • • + c_mn_m)(θ), where the coefficients c₁, . . . , c_m-1 are smooth functions that we call the focal curvatures of γ . We discovered a remarkable formula relating the Euclidean curvatures κ_i , i = 1, . . . ,m, of γ with its focal curvatures. We show that the focal curvatures satisfy a system of Frenet equations (not vectorial, but scalar!). We use the properties of the focal curvatures in order to give, for ℓ = 1, . . . ,m, necessary and sufficient conditions for the radius of the osculating ℓ-dimensional sphere to be critical. We also give necessary and sufficient conditions for a point of γ to be a vertex. Finally, we show explicitly the relations of the Frenet frame and the Euclidean curvatures of γ with the Frenet frame and the Euclidean curvatures of its focal curve C_γ.     

Uniform hypergraphs containing no grids

A hypergraph is called an r×r$r\times r$grid   if it is isomorphic to a pattern of r$r$ horizontal and r$r$ vertical lines, i.e., a family of sets {_A1,…,_Ar,_B1,…,_Br}$\{A_1,\dots ,A_r,B_1,\dots ,B_r\}$ such that _Ai∩_Aj=_Bi∩_Bj=0?$A_i\cap A_j=B_i\cap B_j=0?$ for 1≤i<j≤r$1\le i<j\le r$ and |_Ai∩_Bj|=1$|A_i\cap B_j|=1$ for 1≤i,j≤r$1\le i,j\le r$. Three sets _C1,_C2,_C3$C_1,C_2,C_3$ form a triangle   if they pairwise intersect in three distinct singletons, |_C1∩_C2|=|_C2∩_C3|=|_C3∩_C1|=1$|C_1\cap C_2|=|C_2\cap C_3|=|C_3\cap C_1|=1$, _C1∩_C2≠_C1∩_C3$C_1\cap C_2\ne C_1\cap C_3$. A hypergraph is linear  , if |E∩F|≤1$|E\cap F|\le 1$ holds for every pair of edges E≠F$E\ne F$.