In this article, we determine all the totally positive integers of which can be represented as sums of distinct integral squares, where m=2, 3, 6.

Fix a prime number p. Let G be a p-modular Frobenius group with kernel N which is the minimal normal subgroup of G. We give the complete classification of G when N has three, four or five p-regular conjugacy classes. We also determine the structure of G when N has more than five p-regular conjugacy classes.

Let Fq be a finite field with q elements, V an n-dimensional vector space over Fq and 𝒱 the projective space associated to V. Let G≤GLn(Fq) be a classical group and PG be the corresponding projective group. In this note we prove that if Fq (V )G is purely transcendental over Fq with homogeneous polynomial generators, then Fq (𝒱)PG is also purely transcendental over Fq. We compute explicitly the generators of Fq (𝒱)PG when G is the symplectic, unitary or orthogonal group.

In this paper we consider small essential spectral radius perturbations of operators with topological uniform descent—small essential spectral radius perturbations which cover compact, quasinilpotent and Riesz perturbations.

We prove that, under certain conditions, uniform weak mixing (to zero) of the bounded sequences in Banach space implies uniform weak mixing of their tensor product. Moreover, we prove that ergodicity of tensor product of the sequences in Banach space implies their weak mixing. As applications of the results obtained, we prove that the tensor product of uniquely E-weak mixing C*-dynamical systems is also uniquely E-weak mixing.

Let G be a graph of order n, and let k≥1 be an integer. Let h:E(G)→[0,1] be a function. If ∑ e∋xh(e)=k holds for any x∈V (G), then we call G[Fh] a fractional k-factor of G with indicator function h where Fh ={e∈E(G):h(e)>0}. A graph G is called a fractional (k,m) -deleted graph if for every e∈E(H) , there exists a fractional k-factor G[Fh ] of G with indicator function h such that h(e)=0 , where H is any subgraph of G with m edges. The minimum degree of a vertex in G is denoted by δ(G) . For X⊆V (G), NG(X)=⋃ x∈XNG(x) . The binding number of G is defined by In this paper, it is proved that if then G is a fractional (k,m) -deleted graph. Furthermore, it is shown that this result is best possible in some sense.

The Möbius inversion formula for a locally finite partially ordered set is realized as a Lagrange inversion formula. Schauder bases are introduced to interpret Möbius inversion.

Let β>1 be a real number, and let {ak} be an unbounded sequence of positive integers such that ak+1/ak≤β for all k≥1. The following result is proved: if n is an integer with n>(1+1/(2β))a1 and A is a subset of {0,1,…,n} with , then (A+A)∩(A−A) contains a term of {ak }. The lower bound for |A| is optimal. Beyond these, we also prove that if n≥3 is an integer and A is a subset of {0,1,…,n} with , then (A+A)∩(A−A) contains a power of 2. Furthermore, cannot be improved.

For a d-dimensional convex lattice polytope P, a formula for the boundary volume vol(∂P) is derived in terms of the number of boundary lattice points on the first ⌊d/2⌋ dilations of P. As an application we give a necessary and sufficient condition for a polytope to be reflexive, and derive formulas for the f-vector of a smooth polytope in dimensions three, four, and five. We also give applications to reflexive order polytopes, and to the Birkhoff polytope.

In this paper, we obtain all rational points (x,y) on the superelliptic curves

The paper deals with the following problem: characterize Tichonov spaces X whose realcompactification υX is a Lindelöf Σ-space. There are many situations (both in topology and functional analysis) where Lindelöf Σ (even K-analytic) spaces υX appear. For example, if E is a locally convex space in the class 𝔊 in sense of Cascales and Orihuela (𝔊 includes among others (LM ) -spaces and (DF ) -spaces), then υ(E′,σ(E′,E)) is K-analytic and E is web-bounded. This provides a general fact (due to Cascales–Kakol–Saxon): if E∈𝔊, then σ(E′,E) is K-analytic if and only if σ(E′,E) is Lindelöf. We prove a corresponding result for spaces Cp (X) of continuous real-valued maps on X endowed with the pointwise topology: υX is a Lindelöf Σ-space if and only if X is strongly web-bounding if and only if Cp (X) is web-bounded. Hence the weak* dual of Cp (X) is a Lindelöf Σ-space if and only if Cp (X) is web-bounded and has countable tightness. Applications are provided. For example, every E∈𝔊 is covered by a family {Aα :α∈Ω} of bounded sets for some nonempty set Ω⊂ℕℕ.

Pooling designs are a very helpful tool for reducing the number of tests for DNA library screening. A disjunct matrix is usually used to represent the pooling design. In this paper, we construct a new family of disjunct matrices and prove that it has a good row to column ratio and error-tolerant property.

Some inequalities of Jensen type for Q-class functions are proved. More precisely, a refinement of the inequality f((1/P)∑ ni=1pixi)≤P∑ ni=1(f(xi)/pi) is given in which p1,…,pn are positive numbers, P=∑ ni=1pi and f is a Q-class function. The notion of the jointly Q-class function is introduced and some Jensen type inequalities for these functions are proved. Some Ostrowski and Hermite–Hadamard type inequalities related to Q-class functions are presented as well.

In general, multiplication of operators is not essentially commutative in an algebra generated by integral-type operators and composition operators. In this paper, we characterize the essential commutativity of the integral operators and composition operators from a mixed-norm space to a Bloch-type space, and give a complete description of the universal set of integral operators. Corresponding results for boundedness and compactness are also obtained.

Let k,r≥2 be two integers. We prove an asymptotic formula for the number of k-free values of the r variables polynomial t1⋯tr−1 over [1,x]r∩ℤr.

Let G be a connected simple graph. The degree distance of G is defined as D′(G)=∑ u∈V (G)dG(u)DG(u), where DG(u) is the sum of distances between the vertex u and all other vertices in G and dG(u) denotes the degree of vertex u in G. In contrast to many established results on extremal properties of degree distance, few results in the literature deal with the degree distance of composite graphs. Towards closing this gap, we study the degree distance of some composite graphs here. We present explicit formulas for D′ (G) of three composite graphs, namely, double graphs, extended double covers and edge copied graphs.