Lempel–Ziv Factorization Using Less Time & Space

For 30 years the Lempel–Ziv factorization LZ _x of a string x = x[1..n] has been a fundamental data structure of string processing, especially valuable for string compression and for computing all the repetitions (runs) in x. Traditionally the standard method for computing LZ _x was based on Θ(n)-time (or, depending on the measure used, O(n log n)-time) processing of the suffix tree ST _x of x. Recently Abouelhoda et al. proposed an efficient Lempel–Ziv factorization algorithm based on an “enhanced” suffix array – that is, a suffix array SA _x together with supporting data structures, principally an “interval tree”. In this paper we introduce a collection of fast space-efficient algorithms for LZ factorization, also based on suffix arrays, that in theory as well as in many practical circumstances are superior to those previously proposed; one family out of this collection achieves true Θ(n)-time alphabet-independent processing in the worst case by avoiding tree structures altogether. The work of the first and third authors was supported in part by grants from the Natural Sciences & Engineering Research Council of Canada.     

A result on resolutions of Veronese embeddings

This paper deals with syzygies of the ideals of the Veronese embeddings. By Green’s Theorem we know thatO _P ⁿ (d) satisfies Green-Lazarsfeld’s PropertyN _p ∀d≥p, ∀n. By Ottaviani-Paoletti’s theorem ifn≥2, d≥3 and 3d−2≤p thenO _P ⁿ (d) does not satisfy PropertyN _p. The casesn≥3, d≥3, d<p<3d−2 are still open (exceptn=d=3). Here we deal with one of these cases, namely we prove thatO _P ⁿ (3) satisfies PropertyN ₄ ∀n. Besides we prove thatO _P ⁿ (d) satisfiesN _p ∀n≥p iffO _P ⁿ (d) satisfiesN _p.

---

Sunto L’argomento di questo articolo sono le sizigie degli ideali delle varietà di Veronese. Per il teorema di Green sappiamo cheO _P ⁿ (d) soddisfa la proprietàN _p di Green-Lazarsfeld ∀d≥p, ∀n. Per il teorema di Ottaviani-Paoletti sen≥2, d≥3 and 3d−2≤p alloraO _P ⁿ (d) non soddisfa la ProprietàN _p. I casin≥3, d≥3, d<p<3d−2 sono ancora aperti (eccetton=d=3). Qui consideriamo uno di tali casi, precisamente proviamo cheO _P ⁿ (3) soddisfa la ProprietàN ₄ ∀n. Inoltre proviamo cheO _P ⁿ (d) soddisfaN _p ∀n≥p se e solo seO _P ^p (d) satisfiesN _p.

     

On the weak non-defectivity of veronese embeddings of projective spaces

Fix integers n, x, k such that n≥3, k>0, x≥4, (n, x)≠(3, 4) and k(n+1)<( _n ^n+x ). Here we prove that the order x Veronese embedding ofP ⁿ is not weakly (k−1)-defective, i.e. for a general S⊃P ⁿ such that #(S) = k+1 the projective space | I _2S (x)| of all degree t hypersurfaces ofP ⁿ singular at each point of S has dimension ( _n ^/n+x )−1− k(n+1) (proved by Alexander and Hirschowitz) and a general F∈| I _2S (x)| has an ordinary double point at each P∈ S and Sing (F)=S. The author was partially supported by MIUR and GNSAGA of INdAM (Italy).     

New Coins from Old, Smoothly

Given a (known) function f:[0,1]→(0,1), we consider the problem of simulating a coin with probability of heads f(p) by tossing a coin with unknown heads probability p, as well as a fair coin, N times each, where N may be random. The work of Keane and O’Brien (ACM Trans. Model. Comput. Simul. 4(2):213–219, 1994) implies that such a simulation scheme with the probability ℙ _p (N<∞) equal to 1 exists if and only if f is continuous. Nacu and Peres (Ann. Appl. Probab. 15(1A):93–115, 2005) proved that f is real analytic in an open set S⊂(0,1) if and only if such a simulation scheme exists with the probability ℙ _p (N>n) decaying exponentially in n for every p∈S. We prove that for α>0 noninteger, f is in the space C ^α [0,1] if and only if a simulation scheme as above exists with ℙ _p (N>n)≤C(Δ _n (p)) ^α , where \varDelta _n(x):=max{?{x(1-x)/n},1/n}\varDelta _{n}(x):=\max\{\sqrt{x(1-x)/n},1/n\}. The key to the proof is a new result in approximation theory: Let B⁺_n\mathcal{B}^{+}_{n} be the cone of univariate polynomials with nonnegative Bernstein coefficients of degree n. We show that a function f:[0,1]→(0,1) is in C ^α [0,1] if and only if f has a series representation ?_n=1^￥F_n\sum_{n=1}^{\infty}F_{n} with F_n ? B⁺_nF_{n}\in \mathcal{B}^{+}_{n} and ∑ _k>n F _k (x)≤C(Δ _n (x)) ^α for all x∈[0,1] and n≥1. We also provide a counterexample to a theorem stated without proof by Lorentz (Math. Ann. 151:239–251, 1963), who claimed that if some j_n ? B⁺_n\varphi_{n}\in\mathcal{B}^{+}_{n} satisfy |f(x)−φ _n (x)|≤C(Δ _n (x)) ^α for all x∈[0,1] and n≥1, then f∈C ^α [0,1].     

On the almost monotone convergence of sequences of continuous functions

A sequence (f _n ) _n of functions f _n : X → ℝ almost decreases (increases) to a function f: X → ℝ if it pointwise converges to f and for each point x ∈ X there is a positive integer n(x) such that f _n+1(x) ≤ f _n (x) (f _n+1(x) ≥ f _n (x)) for n ≥ n(x). In this article I investigate this convergence in some families of continuous functions.     

Implicatively selector sets

Let A⊆N={0,1,2,...} and β be an n-ary Boolean function. We call A a β-implicatively selector (β-IS) set if there exists an n-ary selector general recursive function f such that (∀x₁,...,x_n)(β(χ(x₁),...,χ(x_n))=1⟹f(x₁,...,x_n)∈A), where χ is the characteristic function of A. Let F^(m), m≥1, be the family of all d _m+1 ^* -IS sets, where , F⁽⁰⁾=N, and F^(∞) is the class of all subsets in N. The basic result of the article says that the family of all β-IS sets coincides with one of F^(m), m≥0, or F^(∞), and, moreover, the inclusions F⁽⁰⁾⊂F⁽¹⁾⊂...⊂F^(∞) hold. Translated fromAlgebra i Logika, Vol. 35, No. 2, pp. 145–153, March–April, 1996.     

Invertibility and the fredholm property of difference operators

We obtain conditions for the invertibility and the Fredholm property of the difference operator (Dx)(n)=x(n) -U(n)x(n − 1),n ε ℤ, in the Banach space l _p (ℤ, X),p ε [1, ∞], of vector sequences, whereX is a Banach space andU is a bounded operator function. Translated fromMatematicheskie Zametki, Vol. 67, No. 6, pp. 816–827, June, 2000.     

Aggregate and fractal tessellations

Consider a sequence of stationary tessellations {Θ ⁿ }, n=0,1,…, of ℝ ^d consisting of cells {C ⁿ (x _i ⁿ )}with the nuclei {x _i ⁿ }. An aggregate cell of level one, C ₀ ¹(x _i ⁰), is the result of merging the cells of Θ¹ whose nuclei lie in C ⁰(x _i ⁰). An aggregate tessellation Θ₀ ⁿ consists of the aggregate cells of level n, C ₀ ⁿ (x _i ⁰), defined recursively by merging those cells of Θ ⁿ whose nuclei lie in C ^{n −1}(x _i ⁰). We find an expression for the probability for a point to belong to atypical aggregate cell, and obtain bounds for the rate of itsexpansion. We give necessary conditions for the limittessellation to exist as n→∞ and provide upperbounds for the Hausdorff dimension of its fractal boundary and forthe spherical contact distribution function in the case ofPoisson-Voronoi tessellations {Θ ⁿ }. Received: 3 June 1999 / Revised version: 22 November 2000 / Published online: 24 July 2001     

On a class of semilinear weakly hyperbolic equations

Abstract  In this paper, we deal with some global existence results for the large data smooth solutions of the Cauchy Problem associated with the semilinear weakly hyperbolic equations

Bispectrality of Multivariable Racah–Wilson Polynomials

We construct a commutative algebra A_x{\mathcal{A}}_{x} of difference operators in ℝ ^p , depending on p+3 parameters, which is diagonalized by the multivariable Racah polynomials R _p (n;x) considered by Tratnik (J. Math. Phys. 32(9):2337–2342, 1991). It is shown that for specific values of the variables x=(x ₁,x ₂,…,x _p ) there is a hidden duality between n and x. Analytic continuation allows us to construct another commutative algebra A_n{\mathcal{A}}_{n} in the variables n=(n ₁,n ₂,…,n _p ) which is also diagonalized by R _p (n;x). Thus, R _p (n;x) solve a multivariable discrete bispectral problem in the sense of Duistermaat and Grünbaum (Commun. Math. Phys. 103(2):177–240, 1986). Since a change of the variables and the parameters in the Racah polynomials gives the multivariable Wilson polynomials (Tratnik in J. Math. Phys. 32(8):2065–2073, 1991), this change of variables and parameters in A_x{\mathcal{A}}_{x} and A_n{\mathcal{A}}_{n} leads to bispectral commutative algebras for the multivariable Wilson polynomials.     

The density of rational points on non-singular hypersurfaces

LetF(x) =F[x₁,…,x_n]∈ℤ[x₁,…,x_n] be a non-singular form of degree d≥2, and letN(F, X)=#{xεℤ ⁿ ;F(x)=0, |x|⩽X}, where . It was shown by Fujiwara [4] [Upper bounds for the number of lattice points on hypersurfaces,Number theory and combinatorics, Japan, 1984, (World Scientific Publishing Co., Singapore, 1985)] thatN(F, X)≪X ^n−2+2/n for any fixed formF. It is shown here that the exponent may be reduced ton - 2 + 2/(n + 1), forn ≥ 4, and ton - 3 + 15/(n + 5) forn ≥ 8 andd ≥ 3. It is conjectured that the exponentn - 2 + ε is admissable as soon asn ≥ 3. Thus the conjecture is established forn ≥ 10. The proof uses Deligne’s bounds for exponential sums and for the number of points on hypersurfaces over finite fields. However a composite modulus is used so that one can apply the ‘q-analogue’ of van der Corput’s AB process. Dedicated to the memory of Professor K G Ramanathan     

Asymtotics of <Emphasis Type="Italic">M</Emphasis>-estmation in Non-linear Regression

Consider the standard non-linear regression model y _i = g(x _i , θ ₀)+ε _i , i = 1, ... ,n where g(x, θ) is a continuous function on a bounded closed region X × Θ, θ ₀ is the unknown parameter vector in Θ ⊂ R ^p , {x ₁, x ₂, ... , x _n } is a deterministic design of experiment and {ε₁, ε₂, ... , ε _n } is a sequence of independent random variables. This paper establishes the existences of M-estimates and the asymptotic uniform linearity of M-scores in a family of non-linear regression models when the errors are independent and identically distributed. This result is then used to obtain the asymptotic distribution of a class of M-estimators for a large class of non-linear regression models. At the same time, we point out that Theorem 2 of Wang (1995) (J. of Multivariate Analysis, vol. 54, pp. 227–238, Corrigenda. vol. 55, p. 350) is not correct. This research was supported by the Natural Science Foundation of China (Grant No. 19831010 and grant No. 39930160) and the Doctoral Foundation of China     

Symmetric block bases of sequences with large average growth

We show that if 0<ε≦1, 1≦p<2 andx ₁, …,x _n is a sequence of unit vectors in a normed spaceX such thatE ‖∑ _l ⁿ ε_i x _l‖≧n ^1/p, then one can find a block basisy ₁, …,y _m ofx ₁, …,x _n which is (1+ε)-symmetric and has cardinality at leastγn ^2/p-1(logn)⁻¹, where γ depends on ε only. Two examples are given which show that this bound is close to being best possible. The first is a sequencex ₁, …,x _n satisfying the above conditions with no 2-symmetric block basis of cardinality exceeding 2n ^2/p-1. This sequence is not linearly independent. The second example is a sequence which satisfies a lowerp-estimate but which has no 2-symmetric block basis of cardinality exceedingCn ^2/p-1(logn)^4/3, whereC is an absolute constant. This applies when 1≦p≦3/2. Finally, we obtain improvements of the lower bound when the spaceX containing the sequence satisfies certain type-condition. These results extend results of Amir and Milman in [1] and [2]. We include an appendix giving a simple counterexample to a question about norm-attaining operators.     

Super Connectivity of Line Graphs and Digraphs

The h-super connectivity κh and the h-super edge-connectivity λh are more refined network reliability indices than the conneetivity and the edge-connectivity. This paper shows that for a connected balanced digraph D and its line digraph L, if D is optimally super edge-connected, then κ1（L） = 2λ1 （D）, and that for a connected graph G and its line graph L, if one of κ1 （L） and λ（G） exists, then κ1（L） = λ2（G）. This paper determines that κ1（B（d, n） is equal to 4d- 8 for n = 2 and d ≥ 4, and to 4d-4 for n ≥ 3 and d ≥ 3, and that κ1（K（d, n）） is equal to 4d- 4 for d 〉 2 and n ≥ 2 except K（2, 2）. It then follows that B（d,n） and K（d, n） are both super connected for any d ≥ 2 and n ≥ 1.     

On the index of composition of integers from various sets

Given an integer n ≥ 2, let λ(n) := (log n)/(log γ(n)), where γ(n) = Π _p|n p, stand for the index of composition of n, with λ(1) = 1. We study the distribution function of (λ(n) – 1) log n as n runs through particular sets of integers, such as the shifted primes, the values of a given irreducible cubic polynomial and the shifted powerful numbers. Research supported in part by a grant from NSERC. Research supported by the Applied Number Theory Research Group of the Hungarian Academy of Science and by a grant from OTKA. Professor M.V. Subbarao passed away on February 15, 2006. Received: 3 March 2006 Revised: 28 October 2006     

An algorithm for constructing a variety of arbitrary finite dimension

The dimension of a variety V of algebras is the greatest length of a basis (i.e., of an independent generating set) for an SC-theory SC(V), consisting of strong Mal'tsev conditions satisfied in V. The variety V is assumed infinite-dimensional if the lengths of the bases in SC(V) are not bounded. A simple algorithm is found for constructing a variety of any finite dimension r≥1. Using the sieve of Eratosthenes, r distinct primes p₁, p₂,…, p_r are written and their product n=p₁p₂…p_r computed. The variety G_n of algebras (A, f) with one n-ary operation satisfying the identity f(x₁, x₂,…,x_n)=f(x₂,…,x_n, x₁) has, then, dimension r. Translated fromAlgebra i Logika, Vol. 37, No. 2, pp. 167–180, March–April, 1998.     

Arithmetic Interpretability Types of Varieties and Some Additive Problems with Primes

We deal with varieties with one basic operation f(x₁,...,x_n) and one defining identity f(x₁,..., x_n) = f(x_π(1),...,x_π(n)), where π is a permutation whose cyclic set consists of distinct primes p₁,...,p_r, with the sum p₁+...+p_r = n. Their interpretability types, together with the greatest element 1 in a lattice ^int, are said to be arithmetic. It is proved that the arithmetic types constitute a distributive lattice _ar, which is dual to a lattice Sub _fΠ of finite subsets of the set Π of all primes. It is shown that for n ⩾ 2, the poset _ar( _n) of arithmetic types defined by permutations in _n, for n fixed, is a lattice iff n = 2, 3, 4, 6, 8, 9, 11. __________ Translated from Algebra i Logika, Vol. 44, No. 5, pp. 622–630, September–October, 2005.     

Convex Minimization over the Fixed Point Set of Demicontractive Mappings

This paper deals with a viscosity iteration method, in a real Hilbert space , for minimizing a convex function over the fixed point set of , a mapping in the class of demicontractive operators, including the classes of quasi-nonexpansive and strictly pseudocontractive operators. The considered algorithm is written as: x _n+1 := (1 − w) v _n + w T v _n , v _n := x _n − α _n Θ′(x _n ), where w ∈ (0,1) and , Θ′ is the Gateaux derivative of Θ. Under classical conditions on T, Θ, Θ′ and the parameters, we prove that the sequence (x _n ) generated, with an arbitrary , by this scheme converges strongly to some element in Argmin _Fix(T) Θ.      

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph

 Let G be a graph with n vertices, and denote as γ(G) (as θ(G)) the cardinality of a minimum edge cover (of a minimum clique cover) of G. Let E (let C) be the edge-vertex (the clique-vertex) incidence matrix of G; write then P(E)={x∈ℜ ⁿ :Ex≤1,x≥0}, P(C)={x∈ℜ ⁿ :Cx≤1,x≥0}, α _E (G)=max{1 ^T x subject to x∈P(E)}, and α _C (G)= max{1 ^T x subject to x∈P(C)}. In this paper we prove that if α _E (G)=α _C (G), then γ(G)=θ(G). Received: May 20, 1998?Final version received: April 12, 1999     

Some presentations for the special linear groups on finite fields

We simplify the Steinberg presentation of SL _n (F _d ), where n≥1 and F _d is any finite field with d elements. That presentation has the elementary matrices e _ij (r), with i,j∈{1,...,n}, i≠=j and r∈F _d , as generators, and (E1)–(E3), described at the opening of this work, as relations. The presentation that we shall obtain reduces the number of generators e _ij (r) and relations (E1)–(E3). In particular, relations (E3) are considerably reduced. Received: March 16, 1998; in final form: November 3, 2000?Published online: October 2, 2001