Characteristics ofπ −-nucleon collisions at a primary energy of 4·4 GeV

Eight hundred and sixteen nuclear interactions produced by 4·4 GeVπ ^?-mesons in nuclear emulsion have been obtained by “along the track” scanning procedure. Favourable secondary particles from a selected 290π ^?-N (pion-nucleon) collisions have been identified by blob-density and multiple scattering measurements. It is found that the pion often persists in theseπ ^?-N collisions, the average persistence is estimated to be 0·24 per collision. It is estimated thatπ-N andπ-π collisions account for 60% and 28% respectively of the secondary particles. The average number of charged shower particles is 〈n _s〉=2·09±0·12, the average number of created charged particles is 〈n _e±〉=1·94±0·12, the average number of protons with energy greater than 300 MeV is 〈n _p〉=0·15±0·05 and the average number of charged kaons is found to be 〈n _k±〉=0·11±0·06. The integral energy spectra of pions in C-system as well as in L-system are well represented by exponential forms. The average inelasticity of the proton in C-system is found to be 0·52±0·10. The charge retention probability for protons inπ ^?-p collisions is 0·45±0·07.     

Tensor convolutions and Hankel tensors

Let A be an mth order n-dimensional tensor, where m, n are some positive integers and N:= m(n?1). Then A is called a Hankel tensor associated with a vector v ∈ ?^N+1 if A_σ = v _k for each k = 0, 1,...,N whenever σ = (i₁,..., i_m) satisfies i₁ +· · ·+i_m = m+k. We introduce the elementary Hankel tensors which are some special Hankel tensors, and present all the eigenvalues of the elementary Hankel tensors for k = 0, 1, 2. We also show that a convolution can be expressed as the product of some third-order elementary Hankel tensors, and a Hankel tensor can be decomposed as a convolution of two Vandermonde matrices following the definition of the convolution of tensors. Finally, we use the properties of the convolution to characterize Hankel tensors and (0,1) Hankel tensors.     

Divided differences for functions of two variables for irregularly spaced arguments

Divided differences forf (x, y) for completely irregular spacing of points (x _i ,y _i ) are developed here by a natural generalization of Newton's scheme. Existing bivariate schemes either iterate the one-dimensional scheme, thus constraining (x _i ,y _i ) to be at corners of rectangles, or give polynomials Σa _jk x ^j y ^k having more coefficients than interpolation conditions. Here the generalizedn ^th divided difference is defined by (1)\(\left[ {01... n} \right] = \sum\limits_{i = 0}^n {A_i f\left( {x_i , y_i } \right)} \) where (2)\(\sum\limits_{i = 0}^n {A_i x_i^j , y_i^k = 0} \), and 1 for the last or (n+1)^th equation, for every (j, k) wherej+k=0, 1, 2,... in the usual ascending order. The gen. div. diff. [01...n] is symmetric in (x _i ,y _i ), unchanged under translation, 0 forf (x, y) an, ascending binary polynomial as far asn terms, degree-lowering with respect to (X, Y) whenf(x, y) is any polynomialP(X+x, Y+y), and satisfies the 3-term recurrence relation (3) [01...n]=λ{[1...n]?[0...n?1]}, where (4) λ= |1...n|·|01...n?1|/|01...n|·|1...n?1|, the |...i...| denoting determinants inx _i ^j y _i ^k . The generalization of Newton's div. diff. formula is (5)

$$\begin{gathered} f\left( {x, y} \right) = f\left( {x_0 , y_0 } \right) - \frac{{\left| {\alpha 0} \right|}}{{\left| 0 \right|}}\left[ {01} \right] + \frac{{\left| {\alpha 01} \right|}}{{\left| {01} \right|}}\left[ {012} \right] - \frac{{\left| {\alpha 012} \right|}}{{\left| {012} \right|}}\left[ {0123} \right] + \cdots + \hfill \\ + \left( { - 1} \right)^n \frac{{\left| {\alpha 01 \ldots n - 1} \right|}}{{\left| {01 \ldots n - 1} \right|}}\left[ {01 \ldots n} \right] + \left( { - 1} \right)^{n + 1} \frac{{\left| {\alpha 01 \ldots n} \right|}}{{\left| {01 \ldots n} \right|}}\left[ {01 \ldots n} \right], \hfill \\ \end{gathered} $$     

Finite Groups Whose <Emphasis Type="Italic">n</Emphasis>-Maximal Subgroups Are Modular

Let G be a finite group. If M_n< M_n?1< · · · < M₁< M₀ = G with Mi a maximal subgroup of M_i?1 for all i = 1,..., n, then M_n (n > 0) is an n-maximal subgroup of G. A subgroup M of G is called modular provided that (i) 〈X,M ∩ Z〉 = 〈X,M〉 ∩ Z for all X ≤ G and Z ≤ G such that X ≤ Z, and (ii) 〈M,Y ∩ Z〉 = 〈M,Y 〉 ∩ Z for all Y ≤ G and Z ≤ G such that M ≤ Z. In this paper, we study finite groups whose n-maximal subgroups are modular.     

The Number of <Emphasis Type="Italic">k</Emphasis>-Sumsets in an Abelian Group

Let G be an abelian group of order n. The sum of subsets A₁,...,A_k of G is defined as the collection of all sums of k elements from A₁,...,A_k; i.e., A₁ + A₂ + · · · + A_k = {a₁ + · · · + a_k | a₁ ∈ A₁,..., a_k ∈ A_k}. A subset representable as the sum of k subsets of G is a k-sumset. We consider the problem of the number of k-sumsets in an abelian group G. It is obvious that each subset A in G is a k-sumset since A is representable as A = A₁ + · · · + A_k, where A₁ = A and A₂ = · · · = A_k = {0}. Thus, the number of k-sumsets is equal to the number of all subsets of G. But, if we introduce a constraint on the size of the summands A₁,...,A_k then the number of k-sumsets becomes substantially smaller. A lower and upper asymptotic bounds of the number of k-sumsets in abelian groups are obtained provided that there exists a summand A_i such that |A_i| = n log^qn and |A₁ +· · ·+ A_i-1 + A_i+1 + · · ·+A_k| = n log^qn, where q = -1/8 and i ∈ {1,..., k}.     

Prime and composite integers close to powers of a number

We prove that, for any real numbers ξ ≠ 0 and ν, the sequence of integer parts [ξ2 ⁿ  + ν], n = 0, 1, 2, . . . , contains infinitely many composite numbers. Moreover, if the number ξ is irrational, then the above sequence contains infinitely many elements divisible by 2 or 3. The same holds for the sequence [ξ( ? 2) ⁿ  + ν _n ], n = 0, 1, 2, . . . , where ν ₀, ν ₁, ν ₂, . . . all lie in a half open real interval of length 1/3. For this, we show that if a sequence of integers x ₁, x ₂, x ₃, . . . satisfies the recurrence relation x _n+d  = cx _n  + F(x _n+1, . . . , x _n+d-1) for each n  ≥  1, where c ≠ 0 is an integer, \({F(z_1,\dots,z_{d-1}) \in \mathbb {Z}[z_1,\dots,z_{d-1}],}\) and lim _{n→ ∞}|x _n | = ∞, then the number |x _n | is composite for infinitely many positive integers n. The proofs involve techniques from number theory, linear algebra, combinatorics on words and some kind of symbolic computation modulo 3.     

On real solutions of systems of equations

Systems of equations f ₁ = ··· = f _n?1 = 0 in ? ⁿ = {x} having the solution x = 0 are considered under the assumption that the quasi-homogeneous truncations of the smooth functions f ₁,..., f _n?1 are independent at x ≠ 0. It is shown that, for n ≠ 2 and n ≠ 4, such a system has a smooth solution which passes through x = 0 and has nonzero Maclaurin series.     

On Tverberg partitions

A theorem of Tverberg from 1966 asserts that every set X ? ? ^d of n = T(d, r) = (d + 1)(r ? 1) + 1 points can be partitioned into r pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition induces an integer partition of n into r parts (that is, r integers a ₁,..., a _r satisfying n = a ₁ + ··· + a _r ), in which the parts a _i correspond to the number of points in every subset. In this paper, we prove that for any partition of n where the parts satisfy a _i ≤ d + 1 for all i = 1,..., r, there exists a set X ? ? of n points, such that every Tverberg partition of X induces the same partition on n, given by the parts a ₁,..., a _r .     

The maximum and minimum degree of the random <Emphasis Type="Italic">r</Emphasis>-uniform <Emphasis Type="Italic">r</Emphasis>-partite hypergraphs

In this paper we consider the random r-uniform r-partite hypergraph model H(n ₁, n ₂, ···, n _r; n, p) which consists of all the r-uniform r-partite hypergraphs with vertex partition {V ₁, V ₂, ···, V _r} where |V _i| = n _i = n _i(n) (1 ≤ i ≤ r) are positive integer-valued functions on n with n ₁ +n ₂ +···+n _r = n, and each r-subset containing exactly one element in V _i (1 ≤ i ≤ r) is chosen to be a hyperedge of H _p ∈ H (n ₁, n ₂, ···, n _r; n, p) with probability p = p(n), all choices being independent. Let

$${\Delta _{{V_1}}} = {\Delta _{{V_1}}}\left( H \right)$$

and

$${\delta _{{V_1}}} = {\delta _{{V_1}}}\left( H \right)$$

be the maximum and minimum degree of vertices in V ₁ of H, respectively;

$${X_{d,{V_1}}} = {X_{d,{V_1}}}\left( H \right),{Y_{d,{V_1}}} = {Y_{d,{V_1}}}\left( H \right)$$

,

$${Z_{d,{V_1}}} = {Z_{d,{V_1}}}\left( H \right)and{Z_{c,d,{V_1}}} = {Z_{c,d,{V_1}}}\left( H \right)$$

be the number of vertices in V ₁ of H with degree d, at least d, at most d, and between c and d, respectively. In this paper we obtain that in the space H(n ₁, n ₂, ···, n _r; n, p),

$${X_{d,{V_1}}},{Y_{d,{V_1}}},{Z_{d,{V_1}}}and{Z_{c,d,{V_1}}}$$

all have asymptotically Poisson distributions. We also answer the following two questions. What is the range of p that there exists a function D(n) such that in the space H(n ₁, n ₂, ···, n _r; n, p),

$$\mathop {\lim }\limits_{n \to \infty } P\left( {{\Delta _{{V_1}}} = D\left( n \right)} \right) = 1$$

? What is the range of p such that a.e., H _p ∈ H (n ₁, n ₂, ···, n _r; n, p) has a unique vertex in V ₁ with degree

$${\Delta _{{V_1}}}\left( {{H_p}} \right)$$

? Both answers are p = o (log n ₁/N), where

$$N = \mathop \prod \limits_{i = 2}^r {n_i}$$

. The corresponding problems on

$${\delta _{{V_i}}}\left( {{H_p}} \right)$$

also are considered, and we obtained the answers are p ≤ (1 + o(1))(log n ₁/N) and p = o (log n ₁/N), respectively.

     

On a singular minimizing problem

We investigate the non-homogeneous modular Dirichlet problem Δ _p (·)u(x) = f (x) (where Δ _p (·)u(x) = div(|?u|^p(x-2)?u(x)) from the functional analytic point of view and we prove the stability of the solutions \({\left( {{u_{{p_i}}}} \right)_i}\) of the equation \({\Delta _{{p_i}\left( \cdot \right)}}{u_{{p_i}\left( \cdot \right)}} = f\) as p _i (·) → q(·) via Gamma-convergence of sequence of appropriate functionals.