Equalities on the number of conjugacy classes of the Sylow p-subgroups of GL(n,q)

We denote by Gn the group of the upper unitriangular matrices over F_q, the finite field with q = p^t elements, and r(G_n) the number of conjugacy classes of G_n. In this paper, we obtain the value of r(G_n) modulo (q² -1)(q -1). We prove the following equalities     

Nonlinear trigonometric approximations of multivariate function classes

Order-sharp estimates are established for the best N-term approximations of functions from Nikol’skii–Besov type classes B_pq^sm(T^k) with respect to the multiple trigonometric system T^(k) in the metric of L_r(T^k) for a number of relations between the parameters s, p, q, r, and m (s = (s₁,..., s_n) ∈ R₊ⁿ, 1 ≤ p, q, r ≤ ∞, m = (m₁,..., m_n) ∈ Nⁿ, k = m₁ +... + m_n). Constructive methods of nonlinear trigonometric approximation—variants of the so-called greedy algorithms—are used in the proofs of upper estimates.     

(<Emphasis Type="Italic">m</Emphasis>,<Emphasis Type="Italic">r</Emphasis>)-central Riordan arrays and their applications

For integers m > r ≥ 0, Brietzke (2008) defined the (m, r)-central coefficients of an infinite lower triangular matrix G = (d, h) = (d_n,k)_n,k∈N as d_{mn+r,(m?1)n+r}, with n = 0, 1, 2,..., and the (m, r)-central coefficient triangle of G as

$${G^{\left( {m,r} \right)}} = {\left( {{d_{mn + r,\left( {m - 1} \right)n + k + r}}} \right)_{n,k \in \mathbb{N}}}.$$

It is known that the (m, r)-central coefficient triangles of any Riordan array are also Riordan arrays. In this paper, for a Riordan array G = (d, h) with h(0) = 0 and d(0), h′(0) ≠ 0, we obtain the generating function of its (m, r)-central coefficients and give an explicit representation for the (m, r)-central Riordan array G^(m,r) in terms of the Riordan array G. Meanwhile, the algebraic structures of the (m, r)-central Riordan arrays are also investigated, such as their decompositions, their inverses, and their recessive expressions in terms of m and r. As applications, we determine the (m, r)-central Riordan arrays of the Pascal matrix and other Riordan arrays, from which numerous identities are constructed by a uniform approach.

     

Word maps and word maps with constants of simple algebraic groups

In the present paper, we consider word maps w: G ^m → G and word maps with constants w _Σ: G ^m → G of a simple algebraic group G, where w is a nontrivial word in the free group F _m of rank m, w _Σ = w ₁ σ ₁ w ₂ ··· w _r σ _r w _{r + 1}, w ₁, …, w _{r + 1} ∈ F _m , w ₂, …, w _r ≠ 1, Σ = {σ ₁, …, σ _r | σ _i ∈ G Z(G)}. We present results on the images of such maps, in particular, we prove a theorem on the dominance of “general” word maps with constants, which can be viewed as an analogue of a well-known theorem of Borel on the dominance of genuine word maps. Besides, we establish a relationship between the existence of unipotents in the image of a word map and the structure of the representation variety R(Γ_w, G) of the group Γ_w = F _m /<w>.     

Maximum number of sum-free colorings in finite abelian groups

An r-coloring of a subset A of a finite abelian group G is called sum-free if it does not induce a monochromatic Schur triple, i.e., a triple of elements a, b, c ∈ A with a + b = c. We investigate κ_r,G, the maximum number of sum-free r-colorings admitted by subsets of G, and our results show a close relationship between κ_r,G and largest sum-free sets of G.Given a sufficiently large abelian group G of type I, i.e., |G| has a prime divisor q with q ≡ 2 (mod 3). For r = 2, 3 we show that a subset A ? G achieves κ_r,G if and only if A is a largest sum-free set of G. For even order G the result extends to r = 4, 5, where the phenomenon persists only if G has a unique largest sum-free set. On the contrary, if the largest sum-free set in G is not unique, then A attains κ_r,G if and only if it is the union of two largest sum-free sets (in case r = 4) and the union of three (“independent”) largest sum-free sets (in case r = 5).Our approach relies on the so called container method and can be extended to larger r in case G is of even order and contains sufficiently many largest sum-free sets.     

A new characterization of symmetric group by NSE

Let G be a group and ω(G) be the set of element orders of G. Let k ∈ ω(G) and m _k (G) be the number of elements of order k in G. Let nse(G) = {m _k (G): k ∈ ω(G)}. Assume r is a prime number and let G be a group such that nse(G) = nse(S _r ), where S _r is the symmetric group of degree r. In this paper we prove that G ? S _r , if r divides the order of G and r ² does not divide it. To get the conclusion we make use of some well-known results on the prime graphs of finite simple groups and their components.     

Recognition of some families of finite simple groups by order and set of orders of vanishing elements

Let G be a finite group. An element g ∈ G is called a vanishing element if there exists an irreducible complex character χ of G such that χ(g)= 0. Denote by Vo(G) the set of orders of vanishing elements of G. Ghasemabadi, Iranmanesh, Mavadatpour (2015), in their paper presented the following conjecture: Let G be a finite group and M a finite nonabelian simple group such that Vo(G) = Vo(M) and |G| = |M|. Then G ≌ M. We answer in affirmative this conjecture for M = Sz(q), where q = 2²ⁿ⁺¹ and either q ? 1, \(q - \sqrt {2q} + 1\) or q + \(\sqrt {2q} + 1\) is a prime number, and M = F⁴(q), where q = 2 ⁿ and either q⁴ + 1 or q⁴ ? q² + 1 is a prime number.     

Nilpotent residual of fixed points

Let q be a prime and A a finite q-group of exponent q acting by automorphisms on a finite \(q'\)-group G. Assume that A has order at least \(q^3\). We show that if \(\gamma _{\infty } (C_{G}(a))\) has order at most m for any \(a \in A^{\#}\), then the order of \(\gamma _{\infty } (G)\) is bounded solely in terms of m and q. If \(\gamma _{\infty } (C_{G}(a))\) has rank at most r for any \(a \in A^{\#}\), then the rank of \(\gamma _{\infty } (G)\) is bounded solely in terms of r and q.     

Universal rigidity of bar frameworks via the geometry of spectrahedra

A bar framework (G, p) in dimension r is a graph G whose nodes are points \(p^1,\ldots ,p^n\) in \(\mathbb {R}^r\) and whose edges are line segments between pairs of these points. Two frameworks (G, p) and (G, q) are equivalent if each edge of (G, p) has the same (Euclidean) length as the corresponding edge of (G, q). A pair of non-adjacent vertices i and j of (G, p) is universally linked if \(||p^i-p^j||\) = \(||q^i-q^j||\) in every framework (G, q) that is equivalent to (G, p). Framework (G, p) is universally rigid iff every pair of non-adjacent vertices of (G, p) is universally linked. In this paper, we present a unified treatment of the universal rigidity problem based on the geometry of spectrahedra. A spectrahedron is the intersection of the positive semidefinite cone with an affine space. This treatment makes it possible to tie together some known, yet scattered, results and to derive new ones. Among the new results presented in this paper are: (1) The first sufficient condition for a given pair of non-adjacent vertices of (G, p) to be universally linked. (2) A new, weaker, sufficient condition for a framework (G, p) to be universally rigid thus strengthening the existing known condition. An interpretation of this new condition in terms of the Strong Arnold Property is also presented.     

On the pronormality of subgroups of odd index in finite simple symplectic groups

A subgroup H of a group G is pronormal if the subgroups H and H ^g are conjugate in 〈H,H ^g 〉 for every g ∈ G. It was conjectured in [1] that a subgroup of a finite simple group having odd index is always pronormal. Recently the authors [2] verified this conjecture for all finite simple groups other than PSL _n (q), PSU _n (q), E ₆(q), ² E ₆(q), where in all cases q is odd and n is not a power of 2, and P Sp_2n (q), where q ≡ ±3 (mod 8). However in [3] the authors proved that when q ≡ ±3 (mod 8) and n ≡ 0 (mod 3), the simple symplectic group P Sp²ⁿ (q) has a nonpronormal subgroup of odd index, thereby refuted the conjecture on pronormality of subgroups of odd index in finite simple groups.The natural extension of this conjecture is the problem of classifying finite nonabelian simple groups in which every subgroup of odd index is pronormal. In this paper we continue to study this problem for the simple symplectic groups P Sp_2n (q) with q ≡ ±3 (mod 8) (if the last condition is not satisfied, then subgroups of odd index are pronormal). We prove that whenever n is not of the form 2 ^m or 2 ^m (2^2k +1), this group has a nonpronormal subgroup of odd index. If n = 2 ^m , then we show that all subgroups of P Sp_2n (q) of odd index are pronormal. The question of pronormality of subgroups of odd index in P Sp_2n (q) is still open when n = 2 ^m (2^2k + 1) and q ≡ ±3 (mod 8).     

On Frankl and Füredi’s conjecture for 3-uniform hypergraphs

Frankl and Füredi in [1] conjectured that the r-graph with m edges formed by taking the first m sets in the colex ordering of N^(r) has the largest Lagrangian of all r-graphs with m edges. Denote this r-graph by C _r,m and the Lagrangian of a hypergraph by λ(G). In this paper, we first show that if \(\leqslant m \leqslant \left( {\begin{array}{*{20}{c}}t \\ 3 \end{array}} \right)\), G is a left-compressed 3-graph with m edges and on vertex set [t], the triple with minimum colex ordering in G ^c is (t ? 2 ? i)(t ? 2)t, then λ(G) ≤ λ(C _3,m ). As an implication, the conjecture of Frankl and Füredi is true for \(\left( {\begin{array}{*{20}{c}}t \\ 3\end{array}} \right) - 6 \leqslant m \leqslant \left( {\begin{array}{*{20}{c}}t \\ 3\end{array}} \right)\).     

Quasirecognition by prime graph of the simple group <Superscript>2</Superscript><Emphasis Type="Italic">G</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

Let G be a finite group. The main result of this paper is as follows: If G is a finite group, such that Γ(G) = Γ(²G₂(q)), where q = 3²ⁿ⁺¹ for some n ≥ 1, then G has a (unique) nonabelian composition factor isomorphic to ² G ₂(q). We infer that if G is a finite group satisfying |G| = |² G ₂(q)| and Γ(G) = Γ (² G ₂(q)) then G ? = ² G ₂(q). This enables us to give new proofs for some theorems; e.g., a conjecture of W. Shi and J. Bi. Some applications of this result are also considered to the problem of recognition by element orders of finite groups.     

Finite groups in which Sylow normalizers have nilpotent Hall supplements

The normalizer of each Sylow subgroup of a finite group G has a nilpotent Hall supplement in G if and only if G is soluble and every tri-primary Hall subgroup H (if exists) of G satisfies either of the following two statements: (i) H has a nilpotent bi-primary Hall subgroup; (ii) Let π(H) = {p, q, r}. Then there exist Sylow p-, q-, r-subgroups H _p , H _q , and H _r of H such that H _q ? N _H (H _p ), H _r ? N _H (H _q ), and H _p ? N _H (H _r ).     

Dense 3-uniform hypergraphs containing a large clique

An r-uniform graph C is dense if and only if every proper subgraph G' of G satisfies λ(G') λ(G).,where λ(G) is the Lagrangian of a hypergraph G. In 1980's, Sidorenko showed that π(F), the Turán density of an γ-uniform hypergraph F is r! multiplying the supremum of the Lagrangians of all dense F-hom-free γ-uniform hypergraphs. This connection has been applied in the estimating Turán density of hypergraphs. When γ=2 the result of Motzkin and Straus shows that a graph is dense if and only if it is a complete graph. However,when r ≥ 3, it becomes much harder to estimate the Lagrangians of γ-uniform hypergraphs and to characterize the structure of all dense γ-uniform graphs. The main goal of this note is to give some sufficient conditions for3-uniform graphs with given substructures to be dense. For example, if G is a 3-graph with vertex set [t] and m edges containing [t-1]~(3),then G is dense if and only if m≥{t-2 3)+(t-2 2)+1. We also give a sufficient condition on the number of edges for a 3-uniform hypergraph containing a large clique minus 1 or 2 edges to be dense.     

The product of octahedra is badly approximated in the <Emphasis Type="Italic">ℓ</Emphasis><Subscript>2,1</Subscript>-metric

We prove that the Cartesian product of octahedra B _1,∞ ^n,m = B ₁ ⁿ ×···× B ₁ ⁿ (m factors) is poorly approximated by spaces of half dimension in the mixed norm: d _N/2(B _1,∞ ^n,m , ? _2,1 ^n,m ) ≥ cm, N = mn. As a corollary, we find the order of linear widths of the Hölder–Nikol’skii classes H _p ^r (T ^d ) in the metric of L _q in certain domains of variation of the parameters (p, q).     

Improved bounds on the generalized acyclic chromatic number

An r-acyclic edge chromatic number of a graph G, denoted by a _r ^′ r(G), is the minimum number of colors used to produce an edge coloring of the graph such that adjacent edges receive different colors and every cycle C has at least min {|C|, r} colors. We prove that a _r ^′ r(G) ≤ (4r + 1)Δ(G), when the girth of the graph G equals to max{50, Δ(G)} and 4 ≤ r ≤ 7. If we relax the restriction of the girth to max {220, Δ(G)}, the upper bound of a _r ^′ r(G) is not larger than (2r + 5)Δ(G) with 4 ≤ r ≤ 10.     

On nonabelian composition factors of a finite prime spectrum minimal group

Assume that G is a primitive permutation group on a finite set X, x ∈ X, y ∈ X \ {x}, and G _x,y \(\underline \triangleleft \) G _x . P. Cameron raised the question about the validity of the equality G _x,y = 1 in this case. The author proved earlier that, if soc(G) is not a direct power of an exceptional group of Lie type, then G _x,y = 1. In the present paper, we prove that, if soc(G) is a direct power of an exceptional group of Lie type distinct from E ₆(q), ² E ₆(q), E ₇(q), and E ₈(q), then G _x,y = 1.     

Pointwise multipliers for Besov spaces of dominating mixed smoothness-Ⅱ

We continue our investigations on pointwise multipliers for Besov spaces of dominating mixed smoothness. This time we study the algebra property of the classes S_(p,q)~rB(R~d) with respect to pointwise multiplication. In addition, if p≤q, we are able to describe the space of all pointwise multipliers for S_(p,q)~rB(R~d).     

Bessel Property of the System of Root Functions of a Second-Order Singular Operator on an Interval

For the system of root functions of an operator defined by the differential operation ?u″ + p(x)u′ + q(x)u, x ∈ G = (0, 1), with complex-valued singular coefficients, sufficient conditions for the Bessel property in the space L₂(G) are obtained and a theorem on the unconditional basis property is proved. It is assumed that the functions p(x) and q(x) locally belong to the spaces L₂ and W₂^?1, respectively, and may have singularities at the endpoints of G such that q(x) = q_R(x) +q′S(x) and the functions q_S(x), p(x), q ₂ ^S (x)w(x), p²(x)w(x), and q_R(x)w(x) are integrable on the whole interval G, where w(x) = x(1 ? x).     

A Note on Generalized Lagrangians of Non-uniform Hypergraphs

Set \(A\subset {\mathbb N}\) is less than \(B\subset {\mathbb N}\) in the colex ordering if m a x(A△B)∈B. In 1980’s, Frankl and Füredi conjectured that the r-uniform graph with m edges consisting of the first m sets of \({\mathbb N}^{(r)}\) in the colex ordering has the largest Lagrangian among all r-uniform graphs with m edges. A result of Motzkin and Straus implies that this conjecture is true for r=2. This conjecture seems to be challenging even for r=3. For a hypergraph H=(V,E), the set T(H)={|e|:e∈E} is called the edge type of H. In this paper, we study non-uniform hypergraphs and define L(H) a generalized Lagrangian of a non-uniform hypergraph H in which edges of different types have different weights. We study the following two questions: 1. Let H be a hypergraph with m edges and edge type T. Let C _m,T denote the hypergraph with edge type T and m edges formed by taking the first m sets with cardinality in T in the colex ordering. Does L(H)≤L(C _m,T ) hold? If T={r}, then this question is the question by Frankl and Füredi. 2. Given a hypergraph H, find a minimum subhypergraph G of H such that L(G) = L(H). A result of Motzkin and Straus gave a complete answer to both questions if H is a graph. In this paper, we give a complete answer to both questions for {1,2}-hypergraphs. Regarding the first question, we give a result for {1,r ₁,r ₂,…,r _l }-hypergraph. We also show the connection between the generalized Lagrangian of {1,r ₁,r ₂,? ,r _l }-hypergraphs and {r ₁,r ₂,? ,r _l }-hypergraphs concerning the second question.