Extrapolation in Grand Lebesgue Spaces with <Emphasis Type="Italic">A</Emphasis>∞ Weights

Results on extrapolation withA∞ weights in grand Lebesgue spaces are obtained. Generally, these spaces are defined with respect to the productmeasure μ₁ ×· · ·×μ_n onX₁ ×· · ·×X_n, where (X_i, d_i, μ_i), i = 1,..., n, are spaces of homogeneous type. As applications of the obtained results, new one-weight estimates with A_∞ weights for operators of harmonic analysis are derived.     

A criterion for the <Emphasis Type="Italic">F</Emphasis> <Subscript> <Emphasis Type="Italic">π</Emphasis> </Subscript>-residuality of free products with amalgamated cyclic subgroup of nilpotent groups of finite ranks

Let G be the free product of nilpotent groups A and B of finite rank with amalgamated cyclic subgroup H, H ≠ A and H ≠ B. Suppose that, for some set π of primes, the groups A and B are residually F_π, where F_π is the class of all finite p-groups. We prove that G is residually F_π if and only if H is F_π-separable in A and B.     

On the product of relatively weakly almost Lindelöf subsets

The purpose of this note is to show that there exist two Tychonoff spaces X, Y, a subset A of X and a subset B of Y such that A is weakly almost Lindelöf in X and B is weakly almost Lindelöf in Y, but A × B is not weakly almost Lindelöf in X × Y.     

Block partitions of sequences

Given a sequence A = (a ₁, …, a _n ) of real numbers, a block B of A is either a set B = {a _i , a _i+1, …, a _j } where i ≤ j or the empty set. The size b of a block B is the sum of its elements. We show that when each a _i ∈ [0, 1] and k is a positive integer, there is a partition of A into k blocks B ₁, …, B _k with |b _i ?b _j | ≤ 1 for every i, j. We extend this result in several directions.     

X-quasinormal subgroups

Considering two subgroups A and B of a group G and ? ≠ X ? G, we say that A is X-permutable with B if AB ^x = B ^x A for some element x ∈ X. We use this concept to give new characterizations of the classes of solvable, supersolvable, and nilpotent finite groups.     

Note: A conjecture on partitions of groups

We conjecture that every infinite group G can be partitioned into countably many cells \(G = \bigcup\limits_{n \in \omega } {A_n }\) such that cov(A _n A _n ^?1 ) = |G| for each n ∈ ω Here cov(A) = min{|X|: X} ? G, G = X A}. We confirm this conjecture for each group of regular cardinality and for some groups (in particular, Abelian) of an arbitrary cardinality.     

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.     

On Excess-time Correlated Cumulative Processes

In this paper a class of correlated cumulative processes, B _s (t) = ∑^N(t)_i=1 H _s (X _i )X _i , is studied with excess level increments X _i ?s, where {N(t), t ?0} is the counting process generated by the renewal sequence T _n , T _n and X _n are correlated for given n, H _s (t) is the Heaviside function and s?0 is a given constant. Several useful results, for the distributions of B _s (t), and that of the number of excess (non-excess) increments on (0, t) and the corresponding means, are derived. First passage time problems are also discussed and various asymptotic properties of the processes are obtained. Transform results, by applying a flexible form for the joint distribution of correlated pairs (T _n , X _n ) are derived and inverted. The case of non-excess level increments, X _i < s, is also considered. Finally, applications to known stochastic shock and pro-rata warranty models are given.     

Homological Epimorphisms, Compactly Generated t-Structures and Gorenstein-Projective Modules

The aim of this paper is two-fold. Given a recollement (T′, T, T″, i*, i_*, i^!, j_!, j*, j_*), where T′, T, T″ are triangulated categories with small coproducts and T is compactly generated. First, the authors show that the BBD-induction of compactly generated t-structures is compactly generated when i_* preserves compact objects. As a con-sequence, given a ladder (T′, T, T″, T, T′) of height 2, then the certain BBD-induction of compactly generated t-structures is compactly generated. The authors apply them to the recollements induced by homological ring epimorphisms. This is the first part of their work. Given a recollement (D(B-Mod),D(A-Mod),D(C-Mod), i*, i_*, i^!, j_!, j*, j_*) induced by a homological ring epimorphism, the last aim of this work is to show that if A is Gorenstein, _A B has finite projective dimension and j_! restricts to D ^b (C-mod), then this recollement induces an unbounded ladder (B-Gproj,A-Gproj, C-Gproj) of stable categories of finitely generated Gorenstein-projective modules. Some examples are described.     

Dimension scales of bicompacta

We introduce the notion of a (stable) dimension scale d-sc(X) of a space X, where d is a dimension invariant. A bicompactum X is called dimensionally unified if dim F = dim_G F for every closed F ? X and for an arbitrary abelian group G. We prove that there exist dimensionally unified bicompacta with every given stable scale dim-sc.     

Hyperbolas over two-dimensional Fibonacci quasilattices

For the number n _s (α, β; X) of points (x ₁ , x ₂) in the two-dimensional Fibonacci quasilattices \( \mathcal{F}_m^2 \) of level m?=?0, 1, 2,… lying on the hyperbola x ₁ ² ? ??αx ₂ ² ?=?β and such that 0?≤?x ₁? ≤?X, x ₂? ≥?0, the asymptotic formula

$ {n_s}\left( {\alpha, \beta; X} \right)\sim {c_s}\left( {\alpha, \beta } \right)\ln X\,\,\,\,{\text{as}}\,\,\,\,X \to \infty $

is established, and the coefficient c _s (α, β) is calculated exactly. Using this, we obtain the following result. Let F _m be the Fibonacci numbers, A _i ∈ \( \mathbb{N} \), i?=?1, 2, and let \( \overleftarrow {{A_i}} \) be the shift of A _i in the Fibonacci numeral system. Then the number n _s (X) of all solutions (A ₁ , A ₂) of the Diophantine system

$ \left\{ {\begin{array}{*{20}{c}} {A_1^2 + \overleftarrow {A_1^2} - 2{A_2}{{\overleftarrow A }_2} + \overleftarrow {A_2^2} = {F_{2s}},} \\ {\overleftarrow {A_1^2} - 2{A_1}{{\overleftarrow A }_1} + A_2^2 - 2{A_2}{{\overleftarrow A }_2} + 2\overleftarrow {A_2^2} = {F_{2s - 1}},} \\ \end{array} } \right. $

0?≤?A ₁? ≤?X, A ₂? ≥?0, satisfies the asymptotic formula

$ {n_s}(X)\sim \frac{{{c_s}}}{{{\text{ar}}\cosh \left( {{{1} \left/ {\tau } \right.}} \right)}}\ln X\,\,\,\,{\text{as}}\,\,\,\,X \to \infty . $

Here τ?=?(?1?+?√5)/2 is the golden ratio, and c _s ?=?1/2 or 1 for s?=?0 or s?≥?1, respectively.

     

On dihedrants admitting arc-regular group actions

We consider Cayley graphs Γ over dihedral groups, dihedrants for short, which admit an automorphism group G acting regularly on the arc set of Γ. We prove that, if D _2n ≤G≤Aut(Γ) is a regular dihedral subgroup of G of order 2n such that any of its index 2 cyclic subgroups is core-free in G, then Γ belongs to the family of graphs of the form \((K_{n_{1}}\otimes\cdots\otimes K_{n_{\ell}})[K_{m}^{\mathrm{c}}]\), where 2n=n ₁???n _? m, and the numbers n _i are pairwise coprime. Applications to 1-regular dihedrants and Cayley maps on dihedral groups are also given.     

Coloring number and on-line Ramsey theory for graphs and hypergraphs

Let c,s,t be positive integers. The (c,s,t)-Ramsey game is played by Builder and Painter. Play begins with an s-uniform hypergraph G ₀=(V,E ₀), where E ₀=Ø and V is determined by Builder. On the ith round Builder constructs a new edge e _i (distinct from previous edges) and sets G _i =(V,E _i ), where E _i =E _i?1∪{e _i }. Painter responds by coloring e _i with one of c colors. Builder wins if Painter eventually creates a monochromatic copy of K _s ^t , the complete s-uniform hypergraph on t vertices; otherwise Painter wins when she has colored all possible edges.We extend the definition of coloring number to hypergraphs so that χ(G)≤col(G) for any hypergraph G and then show that Builder can win (c,s,t)-Ramsey game while building a hypergraph with coloring number at most col(K _s ^t ). An important step in the proof is the analysis of an auxiliary survival game played by Presenter and Chooser. The (p,s,t)-survival game begins with an s-uniform hypergraph H ₀ = (V,Ø) with an arbitrary finite number of vertices and no edges. Let H _i?1=(V _i?1,E _i?1) be the hypergraph constructed in the first i ? 1 rounds. On the i-th round Presenter plays by presenting a p-subset P _i ?V _i?1 and Chooser responds by choosing an s-subset X _i ?P _i . The vertices in P _i ? X _i are discarded and the edge X _i added to E _i?1 to form E _i . Presenter wins the survival game if H _i contains a copy of K _s ^t for some i. We show that for positive integers p,s,t with s≤p, Presenter has a winning strategy.     

Precise large deviations for sums of random vectors with dependent components of consistently varying tails

Let {X _i = (X _1,i ,...,X _m,i )^?, i ≥ 1} be a sequence of independent and identically distributed nonnegative m-dimensional random vectors. The univariate marginal distributions of these vectors have consistently varying tails and finite means. Here, the components of X ₁ are allowed to be generally dependent. Moreover, let N(·) be a nonnegative integer-valued process, independent of the sequence {X _i , i ≥ 1}. Under several mild assumptions, precise large deviations for S _n = Σ _i=1 ⁿ X _i and S _N(t) = Σ _i=1 ^N(t) X _i are investigated. Meanwhile, some simulation examples are also given to illustrate the results.     

Turán-Type Results for Complete <Emphasis Type="Italic">h</Emphasis>-Partite Graphs in Comparability and Incomparability Graphs

We consider an h-partite version of Dilworth’s theorem with multiple partial orders. Let P be a finite set, and let <₁,...,< _r be partial orders on P. Let G(P, <₁,...,< _r ) be the graph whose vertices are the elements of P, and x, y ∈ P are joined by an edge if x< _i y or y< _i x holds for some 1 ≤ i ≤ r. We show that if the edge density of G(P, <₁, ... , < _r ) is strictly larger than 1 ? 1/(2h ? 2) ^r , then P contains h disjoint sets A ₁, ... , A _h such that A ₁ < _j ... < _j A _h holds for some 1 ≤ j ≤ r, and |A ₁| = ... = |A _h | = Ω(|P|). Also, we show that if the complement of G(P, <) has edge density strictly larger than 1 ? 1/(3h ? 3), then P contains h disjoint sets A ₁, ... , A _h such that the elements of A _i are incomparable with the elements of A _j for 1 ≤ i < j ≤ h, and |A ₁| = ... = |A _h | = |P|^1?o(1). Finally, we prove that if the edge density of the complement of G(P, <₁, <₂) is α, then there are disjoint sets A, B ? P such that any element of A is incomparable with any element of B in both <₁ and <₂, and |A| = |B| > n ^1?γ(α), where γ(α) → 0 as α → 1. We provide a few applications of these results in combinatorial geometry, as well.     

Palindromic widths of nilpotent and wreath products

We prove that the nilpotent product of a set of groups A ₁,…,A _s has finite palindromic width if and only if the palindromic widths of A _i ,i=1,…,s,are finite. We give a new proof that the commutator width of F _n ?K is infinite, where F _n is a free group of rank n≥2 and K is a finite group. This result, combining with a result of Fink [9] gives examples of groups with infinite commutator width but finite palindromic width with respect to some generating set.     

<Emphasis Type="Italic">θ</Emphasis>-Pairs for 2-maximal subgroups of finite groups

Let H, A and B be subgroups of a group G. We call the pair (A, B) a θ-pair for H in G if: (i) \({\langle H, A\rangle=G}\) and B = (A ∩ H) _G ; (ii) if A ₁/B is a proper subgroup of A/B and \({{A_1/B \vartriangleleft G/B}}\), then \({G\neq \langle H, A_1\rangle}\). In this paper, we study the θ-pairs for 2-maximal subgroups of a group, which imply a group to be solvable or supersolvable.     

On hereditary superradical formations

A formation F is superradical provided that: (1) F is a normally hereditary formation; (2) each group G = AB, where A and B are F-subnormal F-subgroups in G, belongs to F. We give an example of a hereditary superradical formation that is not soluble saturated. This gives a negative answer to Problem 14.99(b) in The Kourovka Notebook.     

On necessary and sufficient conditions for the self-normalized central limit theorem

Let X₁, X₂, … be a sequence of independent random variables and S_n = Σ _i=1 ⁿ X_i and V _n ² = Σ _i=1 ⁿ X _i ² . When the elements of the sequence are i.i.d., it is known that the self-normalized sum S_n=V_n converges to a standard normal distribution if and only if max_1?i?n|X_i|/V_n→0 in probability and the mean of X₁ is zero. In this paper, sufficient conditions for the self-normalized central limit theorem are obtained for general independent random variables. It is also shown that if max_1?i?n|X_i|/V_n→0 in probability, then these sufficient conditions are necessary.