On the directions problem in <Emphasis Type="Italic">AG</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)

We prove that if q = p ^h , p a prime, do not exist sets U í AG(n,q){U {\subseteq} AG(n,q)}, with |U| = q ^k and 1 < k < n, determining N directions where

The <Emphasis Type="Italic">k</Emphasis>-domatic number of a graph

Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-dominating set of the graph G is a subset D of V (G) such that every vertex of V (G)-D is adjacent to at least k vertices in D. A k-domatic partition of G is a partition of V (G) into k-dominating sets. The maximum number of dominating sets in a k-domatic partition of G is called the k-domatic number d _k (G). In this paper, we present upper and lower bounds for the k-domatic number, and we establish Nordhaus-Gaddum-type results. Some of our results extend those for the classical domatic number d(G) = d ₁(G).      

On the <Emphasis Type="Italic">k</Emphasis>-gamma <Emphasis Type="Italic">q</Emphasis>-distribution

We provide combinatorial as well as probabilistic interpretations for the q-analogue of the Pochhammer k-symbol introduced by Díaz and Teruel. We introduce q-analogues of the Mellin transform in order to study the q-analogue of the k-gamma distribution.     

Kernels and <Emphasis Type="Italic">p</Emphasis>-Kernels of <Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript>-ary 1-Perfect Codes

The rank of a q-ary code C is the dimension of the subspace spanned by C. The kernel of a q-ary code C of length n can be defined as the set of all translations leaving C invariant. Some relations between the rank and the dimension of the kernel of q-ary 1-perfect codes, over as well as over the prime field , are established. Q-ary 1-perfect codes of length n=(q^m − 1)/(q − 1) with different kernel dimensions using switching constructions are constructed and some upper and lower bounds for the dimension of the kernel, once the rank is given, are established.Communicated by: I.F. Blake     

The Vector-Valued Big <Emphasis Type="Italic">q</Emphasis>-Jacobi Transform

Big q-Jacobi functions are eigenfunctions of a second-order q-difference operator L. We study L as an unbounded self-adjoint operator on an L ²-space of functions on ℝ with a discrete measure. We describe explicitly the spectral decomposition of L using an integral transform ℱ with two different big q-Jacobi functions as a kernel, and we construct the inverse of ℱ.      

<Emphasis Type="Italic">k</Emphasis>-Free-like groups

The following results are proved. In Theorem 1, it is stated that there exist both finitely presented and not finitely presented 2-generated nonfree groups which are k-free-like for any k ⩾ 2. In Theorem 2, it is claimed that every nonvirtually cyclic (resp., noncyclic and torsion-free) hyperbolic m-generated group is k-free-like for every k ⩾ m + 1 (resp., k ⩾ m). Finally, Theorem 3 asserts that there exists a 2-generated periodic group G which is k-free-like for every k ⩾ 3. Supported by NSF (grant Nos. DMS 0455881 and DMS-0700811). (A. Yu. Olshanskii, M. V. Sapir) Supported by RFBR project No. 08-01-00573. (A. Yu. Olshanskii) Supported by BSF grant (USA–Israel). (M. V. Sapir) Translated from Algebra i Logika, Vol. 48, No. 2, pp. 245–257, March–April, 2009.     

Remarks on the <Emphasis Type="Italic">k</Emphasis>-error linear complexity of <Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>-periodic sequences

Recently the first author presented exact formulas for the number of 2 ⁿ -periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k ≥ 2, of a random 2 ⁿ -periodic binary sequence. A crucial role for the analysis played the Chan–Games algorithm. We use a more sophisticated generalization of the Chan–Games algorithm by Ding et al. to obtain exact formulas for the counting function and the expected value for the 1-error linear complexity for p ⁿ -periodic sequences over prime. Additionally we discuss the calculation of lower and upper bounds on the k-error linear complexity of p ⁿ -periodic sequences over .      

Two new families of <Emphasis Type="Italic">q</Emphasis>-positive integers

Let n,p and k be three non negative integers. We prove that the apparently rational fractions of q:

On the family of diophantine triples {<Emphasis Type="Italic">k</Emphasis> + 1, 4<Emphasis Type="Italic">k</Emphasis>, 9<Emphasis Type="Italic">k</Emphasis> + 3}

We prove that if k is a positive integer and d is a positive integer such that the product of any two distinct elements of the set {k + 1, 4k, 9k + 3, d} increased by 1 is a perfect square, then d = 144k ³ + 192k ² + 76k + 8.      

On the Theory of <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">q</Emphasis></Subscript>)-Banach Lattices

Given 1≤ p,q < ∞, let BL_pL_q be the class of all Banach lattices X such that X is isometrically lattice isomorphic to a band in some L_p(L_q)-Banach lattice. We show that the range of a positive contractive projection on any BL_pL_q-Banach lattice is itself in BL_pL_q. It is a consequence of this theorem and previous results that BL_pL_q is first-order axiomatizable in the language of Banach lattices. By studying the pavings of arbitrary BL_pL_q-Banach lattices by finite dimensional sublattices that are themselves in this class, we give an explicit set of axioms for BL_pL_q. We also consider the class of all sublattices of L_p(L_q)-Banach lattices; for this class (when p/q is not an integer) we give a set of axioms that are similar to Krivine’s well-known axioms for the subspaces of L_p-Banach spaces (when p/2 is not an integer). We also extend this result to the limiting case q = ∞.     

On Resolvable Multipartite <Emphasis Type="Italic">G</Emphasis>-Designs

A necessary and sufficient condition for the existence of a _km–factorization of the complete symmetric k–partite multi-digraph K*(n₁,n₂,...,n_k) is obtained for odd k. As a consequence, a resolvable (k,n,km,) multipartite _km–design exists for odd k if and only if m|n. This deduces a result of Ushio when m=1 and k=3. Further, a necessary and sufficient condition for the existence of a _km–factorization of is established for even k, where denotes the wreath product of graphs. Finally, a simple and short proof for the non-existence of a _k–factorization of is obtained for odd k.Acknowledgments.The author thanks Dr. P. Paulraja for his useful ideas in writing this paper and the Department of Science and Technology, New Delhi, for its support (Project Grant No. DST/MS/103/99).Final version received: November 17, 2003     

Approximate <Emphasis Type="Italic">k</Emphasis>-Closest-Pairs in Large High-Dimensional Data Sets

An approximate algorithm to efficiently solve the k-Closest-Pairs problem on large high-dimensional data sets is presented. The algorithm runs, for a suitable choice of the input parameters, in time, where d is the dimensionality and n is the number of points of the input data set, and requires linear space in the input size. It performs at most d+1 iterations. At each iteration a shifted version of the data set is sequentially scanned according to the order induced on it by the Hilbert space filling curve and points whose contribution to the solution has already been analyzed are detected and eliminated. The pruning is lossless, in fact the remaining points along with the approximate solution found can be used for the computation of the exact solution. If the data set is entirely pruned, then the algorithm returns the exact solution. We prove that the pruning ability of the algorithm is related to the nearest neighbor distance distribution of the data set and show that there exists a class of data sets for which the method, augmented with a final step that applies an exact method to the reduced data set, calculates the exact solution with the same time requirements.Although we are able to guarantee a approximation to the solution, where t{1,2,...,} identifies the Minkowski (L_t) metric of interest, experimental results give the exact k closest pairs for all the large high-dimensional synthetic and real data sets considered and show that the pruning of the search space is effective. We present a thorough scaling analysis of the algorithm for in-memory and disk-resident data sets showing that the algorithm scales well in both cases.Mathematics Subject Classification (2000) 68W25.     

<Emphasis Type="Italic">q</Emphasis>-Besselian Frames in Banach Spaces

In this paper, we introduce the concepts of q-Besselian frame and （p, σ）-near Riesz basis in a Banach space, where a is a finite subset of positive integers and 1/p＋1/q = 1 with p 〉 1, q 〉 1, and determine the relations among q-frame, p-Riesz basis, q-Besselian frame and （p, σ）-near Riesz basis in a Banach space. We also give some sufficient and necessary conditions on a q-Besselian frame for a Banach space. In particular, we prove reconstruction formulas for Banach spaces X and X^＊ that if {xn}n=1^∞ C X is a q-Besselian frame for X, then there exists a p-Besselian frame {y＆＊}n=1^∞ belong to X^＊ for X^＊ such that x = ∑n=1^∞ yn^＊（x）xn for all x ∈ X, and x^＊ =∑n=1^∞ x^＊（xn）yn^＊ for all x^＊ ∈ X^＊. Lastly, we consider the stability of a q-Besselian frame for the Banach space X under perturbation. Some results of J. R. Holub, P. G. Casazza, O. Christensen and others in Hilbert spaces are extended to Banach spaces.     

<Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>-nearest neighbor estimators of entropy

For estimating the entropy of an absolutely continuous multivariate distribution, we propose nonparametric estimators based on the Euclidean distances between the n sample points and their k _n -nearest neighbors, where {k _n : n = 1, 2, …} is a sequence of positive integers varying with n. The proposed estimators are shown to be asymptotically unbiased and consistent.      

Complete <Emphasis Type="Italic">k</Emphasis>-Curvature Homogeneous Pseudo-Riemannian Manifolds

Abstract. For k ≥ 2, we exhibit complete k-curvature homogeneous neutral signature pseudo-Riemannian manifolds which are not locally affine homogeneous (and hence not locally homogeneous). All the local scalarWeyl invariants of these manifolds vanish. These manifolds are Ricci flat, Osserman, and Ivanov-Petrova. Mathematics Subject Classification (2000): 53B20     

Sparse <Emphasis Type="Italic">H</Emphasis>-Colourable Graphs of Bounded Maximum Degree

Let F be a graph of order at most k. We prove that for any integer g there is a graph G of girth at least g and of maximum degree at most 5k¹³ such that G admits a surjective homomorphism c to F, and moreover, for any F-pointed graph H with at most k vertices, and for any homomorphism h from G to H there is a unique homomorphism f from F to H such that h=fc. As a consequence, we prove that if H is a projective graph of order k, then for any finite family of prescribed mappings from a set X to V(H) (with ||=t), there is a graph G of arbitrary large girth and of maximum degree at most 5k^26mt (where m=|X|) such that and up to an automorphism of H, there are exactly t homomorphisms from G to H, each of which is an extension of an f.Supported in part by the National Science Council under grant NSC89-2115-M-110-012Final version received: June 9, 2003     

The postage stamp problem and arithmetic in base <Emphasis Type="Italic">r</Emphasis>

Let h, k be fixed positive integers, and let A be any set of positive integers. Let hA ≔ {a ₁ + a ₂ + ... + a _r : a _i ∈ A, r ⩽ h} denote the set of all integers representable as a sum of no more than h elements of A, and let n(h, A) denote the largest integer n such that {1, 2,...,n} ⊆ hA. Let n(h, k) := : n(h, A), where the maximum is taken over all sets A with k elements. We determine n(h, A) when the elements of A are in geometric progression. In particular, this results in the evaluation of n(h, 2) and yields surprisingly sharp lower bounds for n(h, k), particularly for k = 3.     

Results on <Emphasis Type="Italic">F</Emphasis>-continuous graphs

For any nontrivial connected graph F and any graph G, the F-degree of a vertex v in G is the number of copies of F in G containing v. G is called F-continuous if and only if the F-degrees of any two adjacent vertices in G differ by at most 1; G is F-regular if the F-degrees of all vertices in G are the same. This paper classifies all P ₄-continuous graphs with girth greater than 3. We show that for any nontrivial connected graph F other than the star K _1,k , k ⩾ 1, there exists a regular graph that is not F-continuous. If F is 2-connected, then there exists a regular F-continuous graph that is not F-regular.      

Generating functions of the (<Emphasis Type="Italic">h,q</Emphasis>) extension of twisted Euler polynomials and numbers

By using p-adic q-deformed fermionic integral on ℤ _p , we construct new generating functions of the twisted (h, q)-Euler numbers and polynomials attached to a Dirichlet character χ. By applying Mellin transformation and derivative operator to these functions, we define twisted (h, q)-extension of zeta functions and l-functions, which interpolate the twisted (h, q)-extension of Euler numbers at negative integers. Moreover, we construct the partially twisted (h, q)-zeta function. We give some relations between the partially twisted (h, q)-zeta function and twisted (h, q)-extension of Euler numbers.