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.     

Non-generic unramified representations in metaplectic covering groups

Let G^(r) denote the metaplectic covering group of the linear algebraic group G. In this paper we study conditions on unramified representations of the group G^(r) not to have a nonzero Whittaker function. We state a general Conjecture about the possible unramified characters χ such that the unramified subrepresentation of \(Ind_{{B^{\left( r \right)}}}^{{G^{\left( r \right)}}}{X^{\delta _B^{1/2}}}\) will have no nonzero Whittaker function. We prove this Conjecture for the groups GL _n ^{( r)} with r ≥ n ? 1, and for the exceptional groups G ₂ ^{( r)} when r ≠ 2.     

Properties of element orders in covers for L<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>) and U<Subscript>n</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

We show that if a finite simple group G, isomorphic to PSL_n(q) or PSU_n(q) where either n ≠ 4 or q is prime or even, acts on a vector space over a field of the defining characteristic of G; then the corresponding semidirect product contains an element whose order is distinct from every element order of G. We infer that the group PSL_n(q), n ≠ 4 or q prime or even, is recognizable by spectrum from its covers thus giving a partial positive answer to Problem 14.60 from the Kourovka Notebook.     

Characterizing projective general unitary groups PGU<Subscript>3</Subscript>(<Emphasis Type="Italic">q</Emphasis><Superscript>2</Superscript>) by their complex group algebras

Let G be a finite group. Let X ₁(G) be the first column of the ordinary character table of G. We will show that if X ₁(G) = X1(PGU₃(q ²)), then G ? PGU₃(q ²). As a consequence, we show that the projective general unitary groups PGU₃(q ²) are uniquely determined by the structure of their complex group algebras.     

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).     

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).     

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.     

The Erdös-Kac theorem for additive arithmetical semigroups

We show that the Erdös-Kac theorem for additive arithmetical semigroups can be proved under the condition that the counting function of elements has the asymptotics G(n) = q ⁿ (A + O(1/(lnn)^k) as n → ∞ with A > 0, q > 1, and arbitrary k ∈ ? and that P(n) = O(q ⁿ /n) for the number of prime elements of degree n. This improves a result of Zhang.     

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.     

Note edge-colourings of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n,n</Emphasis></Subscript> with no long two-coloured cycles

Consider the set of all proper edge-colourings of a graph G with n colours. Among all such colourings, the minimum length of a longest two-coloured cycle is denoted L(n, G). The problem of understanding L(n, G) was posed by Häggkvist in 1978 and, specifically, L(n, K _n,n ) has received recent attention. Here we construct, for each prime power q ≥ 8, an edge-colouring of K _n,n with n colours having all two-coloured cycles of length ≤ 2q ², for integers n in a set of density 1 ? 3/(q ? 1). One consequence is that L(n, K _n,n ) is bounded above by a polylogarithmic function of n, whereas the best known general upper bound was previously 2n ? 4.     

Seifert manifolds and (1, 1)-knots

The aim of this paper is to investigate the relations between Seifert manifolds and (1, 1)-knots. In particular, we prove that each orientable Seifert manifold with invariants

$\{ Oo,0| - 1;\underbrace {(p,q),...,(p,q)}_{n times},(l,l - 1)\} $

has the fundamental group cyclically presented by G _n ((x ₁ ^q ...x _n ^{q l} x _n ^?p ) and, moreover, it is the n-fold strongly-cyclic covering of the lens space L(|nlq ? p|, q) which is branched over the (1, 1)-knot K(q, q(nl ? 2), p ? 2q, p ? q) if p ≥ 2q and over the (1, 1)-knot K(p? q, 2q ? p, q(nl ? 2), p ? q) if p< 2q.

     

Bounds for the signless Laplacian energy of digraphs

Let G be a digraph with n vertices, a arcs, c ₂ directed closed walks of length 2. Let q1; q2;:::; q _n be the eigenvalues of the signless Laplacian matrix of G. The signless Laplacian energy of a digraph G is defined as E _SL (G) = \(\sum\limits_{i = 1}^n {\left| {{q_i} - \frac{a}{n}} \right|} \). In this paper, some lower and upper bounds are derived for the signless Laplacian energy of digraphs.     

Fast Algorithm of Square Rooting in Some Finite Fields of Odd Characteristic

It was proved that the complexity of square root computation in the Galois field GF(3^s), s = 2^kr, is equal to O(M(2^k)M(r)k + M(r) log₂r) + 2^kkr^1+o(1), where M (n) is the complexity of multiplication of polynomials of degree n over fields of characteristics 3. The complexity of multiplication and division in the field GF(3^s) is equal to O(M(2^k)M(r)) and O(M(2^k)M(r)) + r^1+o(1), respectively. If the basis in the field GF(3^r) is determined by an irreducible binomial over GF(3) or is an optimal normal basis, then the summands 2^kkr^1+o(1) and r^1+o(1) can be omitted. For M(n) one may take n log₂nψ(n) where ψ(n) grows slower than any iteration of the logarithm. If k grow and r is fixed, than all the estimates presented here have the form O_r (M (s) log ₂s) = s (log ₂s)²ψ(s).     

The best extension of algebraic polynomials from the unit circle

We study the class \(\mathfrak{P}_n \) of algebraic polynomials P _n (x, y) in two variables of total degree n whose uniform norm on the unit circle Γ₁ centered at the origin is at most 1: \(\left\| {P_n } \right\|_{C(\Gamma _1 )} \) ≤ 1. The extension of polynomials from the class \(\mathfrak{P}_n \) to the plane with the least uniform norm on the concentric circle Γ _r of radius r is investigated. It is proved that the values θ _n (r) of the best extension of the class \(\mathfrak{P}_n \) satisfy the equalities θ _n (r) = r ⁿ for r > 1 and θ _n (r) = r ^n?1 for 0 < r < 1.     

Independence numbers of random subgraphs of distance graphs

We consider the distance graph G(n, r, s), whose vertices can be identified with r-element subsets of the set {1, 2,..., n}, two arbitrary vertices being joined by an edge if and only if the cardinality of the intersection of the corresponding subsets is s. For s = 0, such graphs are known as Kneser graphs. These graphs are closely related to the Erd?s–Ko–Rado problem and also play an important role in combinatorial geometry and coding theory. We study some properties of random subgraphs of G(n, r, s) in the Erd?s–Rényi model, in which every edge occurs in the subgraph with some given probability p independently of the other edges. We find the asymptotics of the independence number of a random subgraph of G(n, r, s) for the case of constant r and s. The independence number of a random subgraph is Θ(log₂n) times as large as that of the graph G(n, r, s) itself for r ≤ 2s + 1, while for r > 2s + 1 one has asymptotic stability: the two independence numbers asymptotically coincide.     

New characterization of <Emphasis Type="Italic">S</Emphasis><Subscript>4</Subscript>(<Emphasis Type="Italic">q</Emphasis>) by its noncommuting graph

Let G be a nonabelian group, and associate the noncommuting graph ?(G) with G as follows: the vertex set of ?(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. Let S ₄(q) be the projective symplectic simple group, where q is a prime power. We prove that if G is a group with ?(G) ? ?(S ₄(q)) then G ? S ₄(q).     

Peixoto graph of Morse-Smale diffeomorphisms on manifolds of dimension greater than three

Let M ⁿ be a closed orientable manifold of dimension greater than three and G ₁(M ⁿ ) be the class of orientation-preserving Morse-Smale diffeomorphisms on M ⁿ such that the set of unstable separatrices of every f ∈ G ₁(M ⁿ ) is one-dimensional and does not contain heteroclinic orbits. We show that the Peixoto graph is a complete invariant of topological conjugacy in G ₁(M ⁿ ).     

Spectral invariant subalgebras of reduced groupoid <Emphasis Type="Italic">C</Emphasis>*-algebras

We introduce the notion of property (RD) for a locally compact, Hausdorff and r-discrete groupoid G, and show that the set S ₂ ^l (G) of rapidly decreasing functions on G with respect to a continuous length function l is a dense spectral invariant and Fréchet *-subalgebra of the reduced groupoid C*-algebra C _r ^* (G) of G when G has property (RD) with respect to l, so the K-theories of both algebras are isomorphic under inclusion. Each normalized cocycle c on G, together with an invariant probability measure on the unit space G ⁰ of G, gives rise to a canonical map τ _c on the algebra C _c (G) of complex continuous functions with compact support on G. We show that the map τ _c can be extended continuously to S ₂ ^l (G) and plays the same role as an n-trace on C _r ^* (G) when G has property (RD) and c is of polynomial growth with respect to l, so the Connes’ fundament paring between the K-theory and the cyclic cohomology gives us the K-theory invariants on C _r ^* (G).     

On the optimal robust solution of IVPs with noisy information

We investigate the optimal solution of systems of initial-value problems with smooth right-hand side functions f from a Hölder class \(F^{r,\varrho }_{\text {reg}}\), where r ≥ 0 is the number of continuous derivatives of f, and ? ∈ (0, 1] is the Hölder exponent of rth partial derivatives. We consider algorithms that use n evaluations of f, the ith evaluation being corrupted by a noise δ_i of deterministic or random nature. For δ ≥ 0, in the deterministic case the noise δ_i is a bounded vector, ∥δ_i∥≤δ. In the random case, it is a vector-valued random variable bounded in average, (E(∥δ_i∥^q))^1/q ≤ δ, q ∈ [1, + ∞). We point out an algorithm whose L_p error (p ∈ [0, + ∞]) is O(n ^{? (r + ?)} + δ), independently of the noise distribution. We observe that the level n ^{? (r + ?)} + δ cannot be improved in a class of information evaluations and algorithms. For ε > 0, and a certain model of δ-dependent cost, we establish optimal values of n(ε) and δ(ε) that should be used in order to get the error at most ε with minimal cost.     

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.