We report on the measurement of the two-point correlation function, and the pairwise peculiar velocity of galaxies in the IRAS PSCz survey. We compute these statistics first in redshift space, and then obtain the projected functions which have simple relations to the real-space correlation functions on the basis of the method developed earlier in analyzing the Las Campanas Redshift Survey (LCRS...

Let A1,…,Am be families of k-subsets an n-set. Suppose that one cannot choose pairwise disjoint edges from s+1 distinct families. Subject to this condition we investigate the maximum |A1|+…+|Am|. Note subcase m=s+1, A1=…=Am is Erdős Matching Conjecture, most important open problems in extremal set theory. We provide some upper bounds, a general conjecture and its solution for range n≥4k2s.

We construct the first examples of manifolds, the simplest one being S3×S4×R5, which admit infinitely many complete nonnegatively curved metrics with pairwise nonhomeomorphic souls. According to the soul theorem of J. Cheeger and D. Gromoll [CG72], a complete open manifold of nonnegative sectional curvature is diffeomorphic to the total space of the normal bundle of a compact totally geodesic s...

In this article, in a bigeneralized topological space, we introduce new space namely, (s, v)-bigeneralized submaximal and analyze its nature. Also, the characterization theorem for image preimage of v) is under (µ, η)-open, η)-continuous map, respectively are proved. Further, relationship between hyperconnected pairwise given.

Given a set S of n pairwise interior-disjoint (d?1)-simplices in d-space, for d 3, a Convex Space Partition induced by S (denoted CSP(S)) is a partition of d-space into convex cells such that the interior of each cell does not intersect the interior of any simplex in S. In this paper it is shown that a CSP(S) of size O(n d?1) can be computed deterministically in time O(n d?1). These bounds are ...

This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...

The aim of the paper is to obtain some theoretical and numerical properties of Saaty ’s and Koczkodaj ’s inconsistencies of pairwise comparison matrices (PRM ). In the case of 3 × 3 PRM, a differentiable one-to-one correspondence is given between Saaty ’s inconsistency ratio and Koczkodaj ’s inconsistency index based on the elements of PRM. In order to make a comparison of Saaty ’s and Koczkoda...

In 1980, Bondy proved that for an integer k ≥ 2 a (k+ s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least 1 2 ((k+1)(n+ s−1)+1). This generalizes the well-known sufficient conditions of Dirac (k = 0) and Ore (k = 1). The condition in Bondy’s Theorem is not ...

Let As,k(m) be the maximum number of distinct letters in any sequence which can be partitioned into m contiguous blocks of pairwise distinct letters, has at least k occurrences of every letter, and has no subsequence forming an alternation of length s. Nivasch (2010) proved that A5,2d+1(m) = θ(mαd(m)) for all fixed d ≥ 2. We show that As+1,s(m) = ( m−⌈ s 2 ⌉ ⌊ s 2 ⌋ ) for all s ≥ 2, A5,6(m) = θ...

let $g$ be a non-abelian group of order $p^n$‎, ‎where $nleq 5$ in which $g$ is not extra special of order $p^5$‎. ‎in this paper we determine the maximal size of subsets $x$ of $g$‎ ‎with the property that $xyneq yx$ for any $x,y$ in $x$ with‎ ‎$xneq y$‎.