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.     

W-Gröbner basis and monomial ideals under polynomial composition

The notion of weakly relatively prime and W-Gröbner basis in K[x ₁, x ₂, …, x _n ] are given. The following results are obtained: for polynomials f ₁, f ₂, …, f _m , \(\{ f_1^{\lambda _1 } ,f_2^{\lambda _2 } ,...,f_m^{\lambda _m } \} \) is a Gröbner basis if and only if f ₁, f ₂, …, f _m are pairwise weakly relatively prime with λ ₁, λ ₂, …, λ _m arbitrary non-negative integers; polynomial composition by Θ = (θ ₁, θ ₂, …, θ _n ) commutes with monomial-Gröbner bases computation if and only if θ ₁, θ ₂, …, θ _m are pairwise weakly relatively prime.     

Group analysis of the one-dimensional boltzmann equation: II. Equivalence groups and symmetry groups in the special case

We obtain relations that define the equivalence algebra of the family of one-dimensional Boltzmann equations f _t + cf _x + F(t, x, c)f _c = 0 and show that all equations of that form are locally equivalent. We carry out the group classification of the equation with respect to the function F in the special case where the function F and the transformations of the variables t and x are assumed to be independent of c. We show that, under such constraints for the transformation and the family of equations, the maximum possible symmetry algebra is eight-dimensional, which corresponds to an equation with a linear function F.     

An improvement of the five halves theorem of J. Boardman

Let (M ^m , T) be a smooth involution on a closed smooth m-dimensional manifold and F = ∪ _j=0 ⁿ F ^j (n ≤ m) its fixed point set, where F ^j denotes the union of those components of F having dimension j. The famous Five Halves Theorem of J. Boardman, announced in 1967, establishes that, if F is nonbounding, then m ≤ 5/2n. In this paper we obtain an improvement of the Five Halves Theorem when the top dimensional component of F, F ⁿ , is nonbounding. Specifically, let ω = (i ₁, i ₂, …, i _r ) be a non-dyadic partition of n and s _ω (x ₁, x ₂, …, x _n ) the smallest symmetric polynomial over Z ₂ on degree one variables x ₁, x ₂, …, x _n containing the monomial \(x_1^{i_1 } x_2^{i_2 } \cdots x_r^{i_r }\). Write s _ω (F ⁿ ) ∈ H ⁿ (F ⁿ , Z ₂) for the usual cohomology class corresponding to s _ω (x ₁, x ₂, …, x _n ), and denote by ?(F ⁿ ) the minimum length of a nondyadic partition ω with s _ω (F ⁿ ) ≠ 0 (here, the length of ω = (i ₁, i ₂, …, i _r ) is r). We will prove that, if (M ^m , T) is an involution for which the top dimensional component of the fixed point set, F ⁿ , is nonbounding, then m ≤ 2n + ?(F ⁿ ); roughly speaking, the bound for m depends on the degree of decomposability of the top dimensional component of the fixed point set. Further, we will give examples to show that this bound is best possible.     

Asymptotics of the Codimensions <Emphasis Type="Italic">c</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> in the Algebra <Emphasis Type="Italic">F</Emphasis><Superscript>(7)</Superscript>

The paper studies the additive structure of the algebra F⁽⁷⁾, i.e., a relatively free associative countably generated algebra with the identity [x₁,..., x₇] = 0 over an infinite field of characteristic ≠ 2, 3. First, the space of proper multilinear polynomials in this algebra is investigated. As an application, estimates for the codimensions c_n = dimF_n⁽⁷⁾ are obtained, where F_n⁽⁷⁾ stands for the subspace of multilinear polynomials of degree n in the algebra F⁽⁷⁾.     

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

Hausdorff dimension of the maximal run-length in dyadic expansion

For any x ∈ [0, 1), let x = [? ₁, ? ₂, …,] be its dyadic expansion. Call r _n (x):= max{j ? 1: ? _i+1 = … = ? _i+j = 1, 0 ? i ? n ? j} the n-th maximal run-length function of x. P.Erdös and A.Rényi showed that \(\mathop {\lim }\limits_{n \to \infty } \) r _n (x)/log₂ n = 1 almost surely. This paper is concentrated on the points violating the above law. The size of sets of points, whose runlength function assumes on other possible asymptotic behaviors than log₂ n, is quantified by their Hausdorff dimension.     

On a class of differential operators with constant coefficients

A linear differential operator P(D) = P(D ₁, …, D _n ) with constant coefficients is called almost hypoelliptic if all the derivatives D ^α P of the characteristic polynomial P(ξ ₁, …, ξ _n ) can be estimated by P. The paper proves that if P is an almost hypoelliptic operator and f is an infinitely differentiable function, square-summable with a definite exponential weight, then any square summable with the same weight solution u of the equation P(D)u = f is again an infinitely differentiable function and P(ξ) → ∞ as ξ → ∞.     

On real solutions of systems of equations

Systems of equations f ₁ = ··· = f _n?1 = 0 in ? ⁿ = {x} having the solution x = 0 are considered under the assumption that the quasi-homogeneous truncations of the smooth functions f ₁,..., f _n?1 are independent at x ≠ 0. It is shown that, for n ≠ 2 and n ≠ 4, such a system has a smooth solution which passes through x = 0 and has nonzero Maclaurin series.     

An algorithm to compute <Emphasis Type="Italic">ω</Emphasis>-primality in a numerical monoid

Let M be a commutative, cancellative, atomic monoid and x a nonunit in M. We define ω(x)=n if n is the smallest positive integer with the property that whenever x∣a ₁???a _t , where each a _i is an atom, there is a T?{1,2,…,t} with |T|≤n such that x∣∏_k∈T a _k . The ω-function measures how far x is from being prime in M. In this paper, we give an algorithm for computing ω(x) in any numerical monoid. Simple formulas for ω(x) are given for numerical monoids of the form 〈n,n+1,…,2n?1〉, where n≥3, and 〈n,n+1,…,2n?2〉, where n≥4. The paper then focuses on the special case of 2-generator numerical monoids. We give a formula for computing ω(x) in this case and also necessary and sufficient conditions for determining when x is an atom. Finally, we analyze the asymptotic behavior of ω(x) by computing \(\lim_{x\rightarrow \infty}\frac{\omega(x)}{x}\).     

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.     

Group classification of differential-difference equations: Low-dimensional Lie algebras

Differential-difference equations of the form u? _n = F _n (t, u_n?1, u _n , u_n+1, u?_n?1, u? _n , u?_n+1) are classified according to their intrinsic Lie point symmetries, equivalence group and some low-dimensional Lie algebras including the Abelian symmetry algebras, nilpotent nonAbelian symmetry algebras, solvable symmetry algebras with nonAbelian nilradicals, solvable symmetry algebras with Abelian nilradicals and nonsolvable symmetry algebras. Here F _n is a nonlinear function of its arguments and the dot over u denotes differentiation with respect to t.     

Group analysis of the one-dimensional Boltzmann equation: I. symmetry groups

We consider the one-dimensional Boltzmann equation f _t + cf _x + Ff _c = 0, where the functions f and F are assumed to depend on three variables t, x, and c. We obtain relations defining the symmetry algebra in the general case and also under the additional conditions of conservation of the relations dx = c dt and dc = F dt, which arise from physical considerations. We show that the widest symmetry algebra is obtained in the case of conservation of both relations. This algebra is infinite-dimensional, and its structure is independent of the form of the function F.     

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.     

On the rank of odd hyper-quasi-polynomials

Given any nonzero entire function g: ? → ?, the complex linear space F(g) consists of all entire functions f decomposable as f(z + w)g(z - w)=φ₁(z)ψ₁(w)+???+ φ_n(z)ψ_n(w) for some φ₁, ψ₁, …, φ_n, ψ_n: ? → ?. The rank of f with respect to g is defined as the minimum integer n for which such a decomposition is possible. It is proved that if g is an odd function, then the rank any function in F(g) is even.     

Division Algebras with Left Algebraic Commutators

Let D be a division algebra with center F and K a (not necessarily central) subfield of D. An element a ∈ D is called left algebraic (resp. right algebraic) over K, if there exists a non-zero left polynomial a ₀ + a ₁ x + ? + a _n x ⁿ (resp. right polynomial a ₀ + x a ₁ + ? + x ⁿ a _n ) over K such that a ₀ + a ₁ a + ? + a _n a ⁿ = 0 (resp. a ₀ + a a ₁ + ? + a ⁿ a _n ). Bell et al. proved that every division algebra whose elements are left (right) algebraic of bounded degree over a (not necessarily central) subfield must be centrally finite. In this paper we generalize this result and prove that every division algebra whose all multiplicative commutators are left (right) algebraic of bounded degree over a (not necessarily central) subfield must be centrally finite provided that the center of division algebra is infinite. Also, we show that every division algebra whose multiplicative group of commutators is left (right) algebraic of bounded degree over a (not necessarily central) subfield must be centrally finite. Among other results we present similar result regarding additive commutators under certain conditions.     

Two-Sided Estimates of Fourier Sums Lebesgue Functions with Respect to Polynomials Orthogonal on Nonuniform Grids

Let Ω = {t₀, t₁, …, t_N} and Ω_N = {x₀, x₁, …, x_N–1}, where x_j = (t_j + t_{j + 1})/2, j = 0, 1, …, N–1 be arbitrary systems of distinct points of the segment [–1, 1]. For each function f(x) continuous on the segment [–1, 1], we construct discrete Fourier sums S_{n, N}( f, x) with respect to the system of polynomials {p?_k,N(x)} _k=0 ^N–1 , forming an orthonormal system on nonuniform point systems Ω_N consisting of finite number N of points from the segment [–1, 1] with weight Δt_j = t_{j + 1}–t_j. We find the growth order for the Lebesgue function L_n,N (x) of the considered partial discrete Fourier sums S_n,N ( f, x) as n = O(δ _N ^?2/7 ), δ_N = max_{0≤ j≤N?1} Δt_j More exactly, we have a two-sided pointwise estimate for the Lebesgue function L_{n, N}(x), depending on n and the position of the point x from [–1, 1].     

On the Complexity and Depth of Embedded in Boolean Cube Circuits That Implement Boolean Functions

A class of circuits of functional elements over the standard basis of the conjunction, disjunction, and negation elements is considered. For each circuit Σ in this class, its depth D(Σ) and dimension R(Σ) equal to the minimum dimension of the Boolean cube allowing isomorphic embedding Σ are defined. It is established that for n = 1, 2,… and an arbitrary Boolean function f of n variables there exists a circuit Σ_f for implementing this function such that R(Σ_f) ? n ? log₂ log₂n + O(1) and D(Σ_f) ? 2n ? 2 log₂ log₂n + O(1). It is proved that for n = 1, 2,… almost all functions of n variables allow implementation by circuits of the considered type, whose depth and dimension differ from the minimum values of these parameters (for all equivalent circuits) by no more than a constant and asymptotically no more than by a factor of 2, respectively.     

The knaster problem: More counterexamples

Given a continuous function\(f:\mathbb{S}^{n - 1} \to \mathbb{R}^m \) andn ?m + 1 pointsp ₁, …,p _{n?m + 1} ε\(p_1 ,...,p_{n - m + 1} \in \mathbb{S}^{n - 1} \), does there exist a rotation ? εSO(n) such thatf(?(p ₁)) = … =f(?(p _n?m+1))? We give a negative answer to this question form = 1 ifn ε {61, 63, 65} orn≥67 and form=2 ifn≥5.