One-element differential standard bases with respect to inverse lexicographical orderings

We give a simplified proof of the following fact: for all nonnegative integers n and d the monomial y _n ^d forms a differential standard basis of the ideal [y _n ^d ]. In contrast to Levi’s combinatorial proof, in this proof we use the Gröbner bases technique. Under some assumptions we prove the converse result: if an isobaric polynomial f forms a differential standard basis of [f], then f = y _n ^d .     

Modern thermodynamics as a branch of mathematics (mathematical physics)

In the paper, it is proved that, if f(x₁,..., x_n)g(y₁,..., y_m) is a multilinear central polynomial for a verbally prime T-ideal Γ over a field of arbitrary characteristic, then both polynomials f(x₁,..., x_n) and g(y₁,..., y_m) are central for Γ.     

Some irreducibility and indecomposability results for truncated binomial polynomials of small degree

In this paper, we show that the truncated binomial polynomials defined by \(P_{n,k}(x)={\sum }_{j=0}^{k} {n \choose j} x^{j}\) are irreducible for each k≤6 and every n≥k+2. Under the same assumption n≥k+2, we also show that the polynomial P _n,k cannot be expressed as a composition P _n,k (x) = g(h(x)) with \(g \in \mathbb {Q}[x]\) of degree at least 2 and a quadratic polynomial \(h \in \mathbb {Q}[x]\). Finally, we show that for k≥2 and m,n≥k+1 the roots of the polynomial P _m,k cannot be obtained from the roots of P _n,k , where m≠n, by a linear map.     

Equicontinuity of maps on a dendrite with finite branch points

Let(T, d) be a dendrite with finite branch points and f be a continuous map from T to T. Denote byω(x,f) and P(f) the ω-limit set of x under f and the set of periodic points of,respectively. Write Ω(x,f) = {y| there exist a sequence of points x_k E T and a sequence of positive integers n_1 n_2 … such that lim_(k→∞)x_k=x and lim_(k→∞)f~(n_k)(x_k) =y}. In this paper, we show that the following statements are equivalent:(1) f is equicontinuous.(2) ω(x, f) = Ω(x,f) for any x∈T.(3) ∩_(n=1)~∞f~n(T) = P(f),and ω(x,f)is a periodic orbit for every x ∈ T and map h : x→ω(x,f)(x ET)is continuous.(4) Ω(x,f) is a periodic orbit for any x∈T.     

The asymptotic formula in Waring’s problem for one square and seventeen fifth powers

Let R _k,s(n) denote the number of solutions of the equation \({n= x^2 + y_1^k + y_2^k + \cdots + y_s^k}\) in natural numbers x, y ₁, . . . , y _s . By a straightforward application of the circle method, an asymptotic formula for R _k,s(n) is obtained when k ≥ 3 and s ≥ 2^k–1 + 2. When k ≥ 6, work of Heath-Brown and Boklan is applied to establish the asymptotic formula under the milder constraint s ≥ 7 · 2^k–4 + 3. Although the principal conclusions provided by Heath-Brown and Boklan are not available for smaller values of k, some of the underlying ideas are still applicable for k = 5, and the main objective of this article is to establish an asymptotic formula for R _5,17(n) by this strategy.     

Normal families of meromorphic functions and shared functions

The paper is devoted to the normal families of meromorphic functions and shared functions. Generalizing a result of Chang (2013), we prove the following theorem. Let h (≠≡ 0,∞) be a meromorphic function on a domain D and let k be a positive integer. Let F be a family of meromorphic functions on D, all of whose zeros have multiplicity at least k + 2, such that for each pair of functions f and g from F, f and g share the value 0, and f^(k) and g^(k) share the function h. If for every f ∈ F, at each common zero of f and h the multiplicities m_f for f and m_h for h satisfy m_f ≥ m_h + k + 1 for k > 1 and m_f ≥ 2m_h + 3 for k = 1, and at each common pole of f and h, the multiplicities nf for f and nh for h satisfy n_f ≥ n_h + 1, then the family F is normal on D.     

On Templeman averages and variation functions

Let S be a countable semigroup acting in a measure-preserving fashion (g ? T _g ) on a measure space (Ω, A, µ). For a finite subset A of S, let |A| denote its cardinality. Let (A _k ) _k=1 ^∞ be a sequence of subsets of S satisfying conditions related to those in the ergodic theorem for semi-group actions of A. A. Tempelman. For A-measureable functions f on the measure space (Ω, A, μ) we form for k ≥ 1 the Templeman averages \(\pi _k (f)(x) = \left| {A_k } \right|^{ - 1} \sum\nolimits_{g \in A_k } {T_g f(x)}\) and set V _q f(x) = (Σ _k≥1|π _k+1(f)(x) ? π _k (f)(x)|q)^1/q when q ∈ (1, 2]. We show that there exists C > 0 such that for all f in L ¹(Ω, A, µ) we have µ({x ∈ Ω: V _q f(x) > λ}) ≤ C(∫_Ω | f | dµ/λ). Finally, some concrete examples are constructed.     

Solution of Functional Equations Related to Elliptic Functions

Functional equations of the form f(x + y)g(x ? y) = Σ _j=1 ⁿ α _j (x)β _j (y) as well as of the form f₁(x + z)f₂(y + z)f₃(x + y ? z) = Σ _j=1 ^m φ _j (x, y)ψ _j (z) are solved for unknown entire functions f, g,α _j , β _j : ? → ? and f₁, f₂, f₃, ψ _j : ? → ?, φ _j : ?² → ? in the cases of n = 3 and m = 4.     

Multivariate discriminant and iterated resultant

In this paper,we study the relationship between iterated resultant and multivariate discriminant.We show that,for generic form f(x_n) with even degree d,if the polynomial is squarefreed after each iteration,the multivariate discriminant △(f) is a factor of the squarefreed iterated resultant.In fact,we find a factor Hp(f,[x_1,...,x_n]) of the squarefreed iterated resultant,and prove that the multivariate discriminant △(f) is a factor of Hp(f,[x_1,...,x_n]).Moreover,we conjecture that Hp(f,[x_1,...,x_n]) = △(f) holds for generic form/,and show that it is true for generic trivariate form f(x,y,z).     

New algorithm for computing the Hermite interpolation polynomial

Let x ₀, x ₁,? , x _n , be a set of n + 1 distinct real numbers (i.e., x _i ≠ x _j , for i ≠ j) and y _{i, k} , for i = 0,1,? , n, and k = 0 ,1 ,? , n _i , with n _i ≥ 1, be given of real numbers, we know that there exists a unique polynomial p _{N ? 1}(x) of degree N ? 1 where \(N={\sum }_{i=0}^{n}(n_{i}+1)\), such that \(p_{N-1}^{(k)}(x_{i})=y_{i,k}\), for i = 0,1,? , n and k = 0,1,? , n _i . P _N?1(x) is the Hermite interpolation polynomial for the set {(x _i , y _{i, k} ), i = 0,1,? , n, k = 0,1,? , n _i }. The polynomial p _N?1(x) can be computed by using the Lagrange polynomials. This paper presents a new method for computing Hermite interpolation polynomials, for a particular case n _i = 1. We will reformulate the Hermite interpolation polynomial problem and give a new algorithm for giving the solution of this problem, the Matrix Recursive Polynomial Interpolation Algorithm (MRPIA). Some properties of this algorithm will be studied and some examples will also be given.     

On a nonlinear third-order equation

The problem of the completeness of the system of analytic functions of the form ∪ _k=0 ²{[W(zδ ^k )]³ⁿ } _n=0 ^∞, where n = 0, 1,..., k = 0, 1, 2, and δ = exp(2πi/3), in A(D) is solved.     

Engel-type subgroups and length parameters of finite groups

Let g be an element of a finite group G. For a positive integer n, let E _n (g) be the subgroup generated by all commutators [...[[x, g], g],..., g] over x ∈ G, where g is repeated n times. By Baer’s theorem, if E _n (g) = 1, then g belongs to the Fitting subgroup F(G). We generalize this theorem in terms of certain length parameters of E _n (g). For soluble G we prove that if, for some n, the Fitting height of E _n (g) is equal to k, then g belongs to the (k+1)th Fitting subgroup F_k+1(G). For nonsoluble G the results are in terms of nonsoluble length and generalized Fitting height. The generalized Fitting height h*(H) of a finite group H is the least number h such that F_h* (H) = H, where F₀* (H) = 1, and F_i+1(H)* is the inverse image of the generalized Fitting subgroup F*(H/F*_i (H)). Let m be the number of prime factors of |g| counting multiplicities. It is proved that if, for some n, the generalized Fitting height of E _n (g) is equal to k, then g belongs to F*_f(k,m)(G), where f(k, m) depends only on k and m. The nonsoluble length λ(H) of a finite group H is defined as the minimum number of nonsoluble factors in a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. It is proved that if λ(E _n (g)) = k, then g belongs to a normal subgroup whose nonsoluble length is bounded in terms of k and m. We also state conjectures of stronger results independent of m and show that these conjectures reduce to a certain question about automorphisms of direct products of finite simple groups.     

Meromorphic Solutions for a Class of Differential Equations and Their Applications

In this note, we study the admissible meromorphic solutions for algebraic differential equation fⁿf' + P_n?1(f) = R(z)e^α(z), where P_n?1(f) is a differential polynomial in f of degree ≤ n ? 1 with small function coefficients, R is a non-vanishing small function of f, and α is an entire function. We show that this equation does not possess any meromorphic solution f(z) satisfying N(r, f) = S(r, f) unless P_n?1(f) ≡ 0. Using this result, we generalize a well-known result by Hayman.     

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

Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems

In this paper we present a new algorithm for solving polynomial equations based on the Taylor series of the inverse function of a polynomial, f _P (y). The foundations of the computing of such series have been previously developed by the authors in some recent papers, proceeding as follows: given a polynomial function \(y=P(x)=a_0+a_1x+\cdots+a_mx^m\), with \(a_i \in \mathcal{R}, 0 \leq i \leq m\), and a real number u so that P′(u)?≠?0, we have got an analytic function f _P (y) that satisfies x?=?f _P (P(x)) around x?=?u. Besides, we also introduce a new proof (completely different) of the theorems involves in the construction of f _P (y), which provide a better radius of convergence of its Taylor series, and a more general perspective that could allow its application to other kinds of equations, not only polynomials. Finally, we illustrate with some examples how f _P (y) could be used for solving polynomial systems. This question has been already treated by the authors in preceding works in a very complex and hard way, that we want to overcome by using the introduced algorithm in this paper.     

On existence of a universal function for <Emphasis Type="Italic">L</Emphasis> <Superscript> <Emphasis Type="Italic">p</Emphasis> </Superscript>[0, 1] with <Emphasis Type="Italic">p</Emphasis>∈(0, 1)

We show that, for every number p ∈ (0, 1), there is g ∈ L¹[0, 1] (a universal function) that has monotone coefficients c_k(g) and the Fourier–Walsh series convergent to g (in the norm of L¹[0, 1]) such that, for every f ∈ L^p[0, 1], there are numbers δ_k = ±1, 0 and an increasing sequence of positive integers N_q such that the series ∑ _k=0^+∞δ_kc_k(g)W_k (with {W_k} theWalsh system) and the subsequence \(\sigma _{{N_q}}^{\left( \alpha \right)}\), α ∈ (?1, 0), of its Cesáro means converge to f in the metric of L^p[0, 1].     

A Formula for the Partition Function That “Counts”

We derive a combinatorial multisum expression for the number D(n, k) of partitions of n with Durfee square of order k. An immediate corollary is therefore a combinatorial formula for p(n), the number of partitions of n. We then study D(n, k) as a quasipolynomial. We consider the natural polynomial approximation \({\tilde{D}(n, k)}\) to the quasipolynomial representation of D(n, k). Numerically, the sum \({\sum_{1\leq k \leq \sqrt{n}} \tilde{D}(n, k)}\) appears to be extremely close to the initial term of the Hardy-Ramanujan-Rademacher convergent series for p(n).     

Possible isolation number of a matrix over nonnegative integers

Let ?₊ be the semiring of all nonnegative integers and A an m × n matrix over ?₊. The rank of A is the smallest k such that A can be factored as an m × k matrix times a k×n matrix. The isolation number of A is the maximum number of nonzero entries in A such that no two are in any row or any column, and no two are in a 2 × 2 submatrix of all nonzero entries. We have that the isolation number of A is a lower bound of the rank of A. For A with isolation number k, we investigate the possible values of the rank of A and the Boolean rank of the support of A. So we obtain that the isolation number and the Boolean rank of the support of a given matrix are the same if and only if the isolation number is 1 or 2 only. We also determine a special type of m×n matrices whose isolation number is m. That is, those matrices are permutationally equivalent to a matrix A whose support contains a submatrix of a sum of the identity matrix and a tournament matrix.     

Tutte polynomials of bracelets

The identity linking the Tutte polynomial with the Potts model on a graph implies the existence of a decomposition resembling that previously obtained for the chromatic polynomial. Specifically, let {G _n } be a family of bracelets in which the base graph has b vertices. It is shown here (Theorems 3 and 4) that the Tutte polynomial of G _n can be written as a sum of terms, one for each partition π of a nonnegative integer ?≤b:

$(x-1)T(G_n;x,y)=\sum_{\pi}m_{\pi}(x,y)\operatorname {tr}\bigl(N_{\pi}(x,y)\bigr)^n.$

The matrices N _π (x,y) are (essentially) the constituents of a ‘Potts transfer matrix’, and a formula for their sizes is obtained. The multiplicities m _π (x,y) are obtained by substituting k=(x?1)(y?1) in the expressions m _π (k) previously obtained in the chromatic case. As an illustration, explicit calculations are given for some small bracelets.