Zinbiel algebras under <Emphasis Type="Italic">q</Emphasis>-commutators

An algebra with the identity t ₁(t ₂ t ₃) = (t ₁ t ₂+t ₂ t ₁)t ₃ is called Zinbiel. For example, ℂ[x] under the multiplication is Zinbiel. Let a ○ _q b = a ○ b + q b ○ a be a q-commutator, where q ∈ ℂ. We prove that for any Zinbiel algebra A the corresponding algebra under the commutator A ⁽⁻¹⁾ = (A, ○₋₁) satisfies the identities t ₁ t ₂ = −t ₂ t ₁ and (t ₁ t ₂)(t ₃ t ₄) + (t ₁ t ₄)(t ₃ t ₂) = jac(t ₁, t ₂, t ₃)t ₄ + jac(t ₁, t ₄, t ₃)t ₂, where jac(t ₁, t ₂, t ₃) = (t ₁ t ₂)t ₃ + (t ₂ t ₃)t ₁ + (t ₃ t ₁)t ₂. We find basic identities for q-Zinbiel algebras and prove that they form varieties equivalent to the variety of Zinbiel algebras if q ² ≠ 1. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 11, No. 3, pp. 57–78, 2005.     

The Permutations 123p 4…p m and 321p 4…p m are Wilf-Equivalent

Write p ₁, p ₂…p _m for the permutation matrix δ _{pi, j} . Let S _n (M) be the set of n×n permutation matrices which do not contain the m×m permutation matrix M as a submatrix. In [7] Simion and Schmidt show bijectively that |S _n (123) |=|S _n (213) |. In [9] this was generalised to a bijection between S _n (12 p ₃…p _m ) and S _n (21 p ₃…p _m ). In the present paper we obtain a bijection between S _n (123 p ₄…p _m ) and S _n (321 p ₄…p _m ). Revised: March 24, 1999     

Rank properties of certain semigroups

In this paper we consider certain ranks of some semigroups. These ranks are r ₁(S),r ₂(S),r ₃(S),r ₄(S) and r ₅(S) as defined below. We have r ₁≤r ₂≤r ₃≤r ₄≤r ₅. The semigroups are CL _n ,CL _m ×CL _n ,Z _n and SL _n . Here CL _n is a chain with n elements, Z _n is the zero semigroup on n elements and SL _n is the free semilattice generated by n elements and having 2 ⁿ −1 elements. We find many of the ranks for these classes of semigroups.     

The solvability of two linear matrix equations

The solvability conditions of the following two linear matrix equations (i)A₁X₁B₁ +A₂X₂B₂ +A₃X₃B₃ =C,(ii) A₁XB₁ =C₁ A₂XB₂ =C₂ are established using ranks and generalized inverses of matrices. In addition, the duality of the three types of matrix equations

(iii) A ₁ X ₁ B ₁+A ₂ X ₂ B ₂+A ₃ X ₃ B ₃+A ₄ X ₄ B ₄=C, (iv) A ₁ XB ₁=C ₁ A ₂ XB ₂=C ₂ A ₃ XB ₃=C ₃ A ₄ XB ₄=C ₄, (v) AXB+CXD=E are also considered.     

Two-Sample T 3 Plot: A Graphical Comparison of Two Distributions

Abstract

Consider two independent random variables x and y with means and standard deviations μ _x ,μ _y ,σ _x , and σ _y , respectively. Let F _x (t) = P[(x - μ, _x )/σ _x ≤ t] and F _y (t) = P[(y - μ _y )/σ _y ≤ t]. In this article we address the problem of testing the null hypothesis H ₀ : F _x ≡ F _y , against the alternative H ₁ : F _x ≡ F _y . A graphical tool called T ₃ plot for checking normality of independently and identically distributed univariate data was proposed in an earlier article by Ghosh. In the present article we develop a two-sample T ₃ plot where the basic statistic is the normalized difference between the T ₃ functions for the two samples. Significant departure of this difference function from the horizontal zero line is indicative of evidence against the null hypothesis. In contrast to the one-sample problem, the common distribution function under the null hypothesis is not specified in the two-sample case. Bootstrap is used to construct the acceptance region under H ₀, for the two-sample T ₃ plot.     

Maximal L p regularity for parabolic difference equations

In this paper, we consider a family of finite difference operators {Ah }_{h >0} on discrete L _q ‐spaces L _q (?^N _h ). We show that the solution u _h to u ′_h (t) – A _h u _h(t) = f _h (t), t > 0, u _h (0) = 0 satisfies the estimate ‖A _h u _h ‖equation/tex2gif-inf-15.gif ≤ C ‖f _h ‖equation/tex2gif-inf-21.gif, where C is independent of h and f _h . In this case, the family {A _h }_{h >0} is said to have discrete maximal L _p regularity on the discrete L _q ‐space. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Elementary equivalence of the automorphism groups of Abelian <Emphasis Type="Italic">p</Emphasis>-groups

We consider Abelian p-groups (p ≥ 3) A ₁ = D ₁ ⊕ G ₁ and A ₂ = D ₂ ⊕ G ₂, where D ₁ and D ₂ are divisible and G ₁ and G ₂ are reduced subgroups. We prove that if the automorphism groups Aut A ₁ and Aut A ₂ are elementarily equivalent, then the groups D ₁, D ₂ and G ₁, G ₂ are equivalent, respectively, in the second-order logic.     

On the graded identities ofM 1,1(E)

We determine theS _n ×S _m -cocharacterX _n,m of the algebraM _1,1(E) and prove that theT ₂-ideal of its graded identities is generated by the polynomialsy ₁ y ₂−y ₂ y ₁ andz ₁ z ₂ z ₃+z ₃ z ₂ z ₁.     

On trigonometric functional equations of rectangular type

Summary Letf, G₁ × G₂ C, where G _i (i = 1, 2) denote arbitrary groups and C denotes the set of complex numbers. The general solutions of the following functional equationsf(x ₁ y ₁ ,x ₂ y ₂ ) +f(x ₁ y ₁ ,x ₂ y ₂ ^-1 ) +f(x ₁ y ₁ ^-1 ,x ₂ y ₂ ) +f(x ₁ y ₁ ^-1 ,x ₂ y ₂ ^-1 ) =f(x ₁ ,x ₂ )F(y ₁ ,y ₂ ) +F(x ₁ ,x ₂ )f(y ₁ ,y ₂ ) (1) andf(x ₁ y ₁ ,x ₂ y ₂ ) +f(x ₁ y ₁ ,x ₂ y ₂ ^-1 ) +f(x ₁ y ₁ ^-1 ,x ₂ y ₂ ) +f(x ₁ y ₁ ^-1 ,x ₂ y ₂ ^-1 ) =f(x ₁ ,x ₂ )f(y ₁ ,y ₂ ) +F(x ₁ ,x ₂ )F(y ₁ ,y ₂ ) (2) are determined assuming thatf satisfies the conditionf(x ₁y₁z₁, x₂) = f(x₁z₁y₁, x₂), f(x₁, x₂y₂z₂) = f(x₁, x₂z₂y₂) (C) for allx _i, y_i, x_i G_i (i = 1, 2). The functional equations (1) and (2) are generalizations of the well known rectangular type functional equationf(x ₁ + y₁, x₂ + y₂) + f(x₁ + y₁, x₂ – y₂) + f(x₁ – y₁, x₂ + y₂) + f(x₁ – y₁, x₂ – y₂) = 4f(x₁, x₂) studied by J. Aczel, H. Haruki, M. A. McKiernan and G. N. Sakovic in 1968.     

Strongly subadditive functions

Let f: ℝ⁺ → ℝ. The subject is the trace inequality Tr f(A) + Tr f(P ₂ AP ₂) ≦ Tr f(P ₁₂ AP ₁₂) + Tr f(P ₂₃ AP ₂₃), where A is a positive operator, P ₁; P ₂; P ₃ are orthogonal projections such that P ₁ + P ₂ + P ₃ = I, P ₁₂ = P ₁ + P ₂ and P ₂₃ = P ₂ + P ₃. There are several examples of functions f satisfying the inequality (called (SSA)) and the case of equality is described.     

A Note on Relative Efficiency of Axiom Systems

We introduce a notion of relative efficiency for axiom systems. Given an axiom system A_β for a theory T consistent with S¹₂, we show that the problem of deciding whether an axiom system A_α for the same theory is more efficient than A_β is II₂-hard. Several possibilities of speed-up of proofs are examined in relation to pairs of axiom systems A_α, A_β, with A_α ? A_β, both in the case of A_α, A_β having the same language, and in the case of the language of A_α extending that of A_β: in the latter case, letting Pr_α, Pr_β denote the theories axiomatized by A_α, A_β, respectively, and assuming Pr_α to be a conservative extension of Pr_β, we show that if A_α — A_β contains no nonlogical axioms, then A_α can only be a linear speed-up of A_β; otherwise, given any recursive function g and any A_β, there exists a finite extension A_α of A_β such that A_α is a speed-up of A_β with respect to g. Mathematics Subject Classification: 03F20, 03F30.     

Random and Deterministic Triangle Generation of Three-Dimensional Classical Groups II

Let p ₁, p ₂, p ₃ be primes. This is the second article in a series of three on the (p ₁, p ₂, p ₃)-generation of the finite projective special unitary and linear groups PSU₃(p ⁿ ), PSL₃(p ⁿ ), where we say a noncyclic group is (p ₁, p ₂, p ₃)-generated if it is a homomorphic image of the triangle group T _{p 1, p 2, p 3} . This paper is concerned with the case where p ₁ = 2 and p ₂ = p ₃. We determine for any prime p ₂ the prime powers p ⁿ such that PSU₃(p ⁿ ) (respectively, PSL₃(p ⁿ )) is a quotient of T = T _{2, p 2, p 2} . We also derive the limit of the probability that a randomly chosen homomorphism in Hom(T, PSU₃(p ⁿ )) (respectively, Hom(T, PSL₃(p ⁿ ))) is surjective as p ⁿ tends to infinity.     

Bounded edge-connectivity and edge-persistence of Cartesian product of graphs

The bounded edge-connectivity λ_k(G) of a connected graph G with respect to is the minimum number of edges in G whose deletion from G results in a subgraph with diameter larger than k and the edge-persistence D⁺(G) is defined as λ_d(G)(G), where d(G) is the diameter of G. This paper considers the Cartesian product G₁×G₂, shows λ_k1+k2(G₁×G₂)≥λ_k1(G₁)+λ_k2(G₂) for k₁≥2 and k₂≥2, and determines the exact values of D⁺(G) for G=C_n×P_m, C_n×C_m, Q_n×P_m and Q_n×C_m.     

The genus of the 2-amalgamations of graphs

A graph G is called the 2-amalgamation of subgraphs G₁ and G₂ if G = G₁ ∪ G₂ and G₁ ∩ G₂ = {x, y}, 2 distinct points. in this case we write G = G₁∪_{{x, y}} G₂. in this paper we show that the orientable genus, γ(G), satisfies the inequalities γ(G₁) + γ(G₂) ? 1 ≤ γ(G₁ ∪_{{x, y}} G₂) ≤ γ(G₁) + γ(G₂) + 1 and that this is the best possible result, i. e., the resulting three values for γ(G₁ ∪_{{x, y}} G₂) which are possible can actually be realized by appropriate choices for G₁ and G₂.     

Shape preserving properties of generalized Bernstein operators on Extended Chebyshev spaces

We study the existence and shape preserving properties of a generalized Bernstein operator B _n fixing a strictly positive function f ₀, and a second function f ₁ such that f ₁/f ₀ is strictly increasing, within the framework of extended Chebyshev spaces U _n . The first main result gives an inductive criterion for existence: suppose there exists a Bernstein operator B _n : C[a, b] → U _n with strictly increasing nodes, fixing f₀, f₁ ? U_n{f_{0}, f_{1} \in U_{n}} . If U_n ì U_{n + 1}{U_{n} \subset U_{n + 1}} and U _n+1 has a non-negative Bernstein basis, then there exists a Bernstein operator B _n+1 : C[a, b] → U _n+1 with strictly increasing nodes, fixing f ₀ and f ₁. In particular, if f ₀, f ₁, . . . , f _n is a basis of U _n such that the linear span of f ₀, . . . , f _k is an extended Chebyshev space over [a, b] for each k = 0, . . . , n, then there exists a Bernstein operator B _n with increasing nodes fixing f ₀ and f ₁. The second main result says that under the above assumptions the following inequalities hold

Direct factors of polynomial rings over finite fields

Let G_q denote the multiplicative semigroup of all monic polynomials in one indeterminate over a finite field F_q with q elements. By a direct factor of G_q is understood a subset B₁ of G_q such that, for some subset B₂ of G_q, every polynomial w G_q has a unique factorization in the form w = b₁b₂ for b_i B_i. An asymptotic formula B₁^#(n) c₁qⁿ as n → ∞ is derived for the total number B₁^#(n) of polynomials of degree n in an arbitrary direct factor B₁ of G_q, c₁ a constant depending on B₁.     

On Selfsimilar Jordan Curves on the Plane

We study the attractors of a finite system of planar contraction similarities S _j (j=1,...,n) satisfying the coupling condition: for a set {x ₀,...,x _n} of points and a binary vector (s ₁,...,s _n ), called the signature, the mapping S _j takes the pair {x ₀,x _n} either into the pair {x _j-1,x _j } (if s _j =0) or into the pair {x _j , x _j-1} (if s _j =1). We describe the situations in which the Jordan property of such attractor implies that the attractor has bounded turning, i.e., is a quasiconformal image of an interval of the real axis.     

Chromatic factorizations of a graph

Let n₁ ? n₂ ? …? ? n_k ? 2 be integers. We say that G has an (n₁, n₂, …?, n_k-chromatic factorization if G) can be edge-factored as G₁ ⊕ G₂ ⊕ …? ⊕ G_k with χ(G_i) = nA_i, for i = 1,2,…, k. The following results are proved:

• i If (n₁ ? 1)n₂ …? n_k < χ(G) ? n₁n₂ …? n_k, then G has an (n₁, n₂, …?, n_k)-chromatic factorization.
• ii If n₁ + n₂ + …? + n_k ? (k - 1) ? n ? n₁n₂ …? n_k, then K_n has an (n₁, n₂, …?, n_k)-chromatic factorization.

     

Line-graphical degree sequences

A degree sequence π = (d₁, d₂,…,d_p), with d₁ ≥ d₂ ≥…≥ d_p, is line graphical if it is realized by the line graph of some graph. Degree sequences with line-graphical realizations are characterized for the cases d₁ = p - 1, d₁ = p - 2, d₁ ≤ 3, and d₁ = d_p. It is also shown that if a degree sequence with d₁ = p-1 is line graphical, it is uniquely line graphical. It follows that with possibly one exception each line-graphical realization of an arbitrary degree sequence must have either C₅, 2K₁, + K₂, K₁ + 2K₂, or 3K₁, as an induced subgraph.     

Mixed ramsey numbers: Chromatic numbers versus graphs

For positive integers n₁, n₂, …, n_I and graphs G_I+1, G_I+2, …, G_k, 1 ≤ / < k, the mixed Ramsey number _χ(n₁, …, n₁, G_I+1, …, G_k) is define as the least positive integer p such that for each factorization K_p = F₁⊕ … ⊕ F_⊕ F_I+1⊕ … ⊕ F_k, it it follows that χ(F_i) ≥ n_i for some i, 1 ? i ? l, or G_i is a subgraph of F_i for some i, l < i ? k. Formulas are presented for maxed Ramsey numbers in which the graphs G_I+1, G_I+2, …, G_k are connected, and in which k = I+1 and G_I+1 is arbitray.