On the matricial version of Fermat–Euler congruences

The congruences modulo the primary numbers n=p ^a are studied for the traces of the matrices A ⁿ and A ^n-φ(n), where A is an integer matrix and φ(n) is the number of residues modulo n, relatively prime to n. We present an algorithm to decide whether these congruences hold for all the integer matrices A, when the prime number p is fixed. The algorithm is explicitly applied for many values of p, and the congruences are thus proved, for instance, for all the primes p ≤ 7 (being untrue for the non-primary modulus n=6). We prove many auxiliary congruences and formulate many conjectures and problems, which can be used independently. Partially supported by RFBR, grant 05-01-00104. An erratum to this article is available at .     

A new characterization of the simple group <Emphasis Type="Italic">A</Emphasis><Subscript>1</Subscript>(<Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

The simple group A ₁(p ⁿ ) is proved to be uniquely determined by the set of the orders of the maximal abelian subgroups of A ₁(p ⁿ ).     

Blocks with nonabelian defect groups which have cyclic subgroups of index p

In representation theory of finite groups, one of the most important and interesting problems is that, for a p-block A of a finite group G where p is a prime, the numbers k(A) and ℓ(A) of irreducible ordinary and Brauer characters, respectively, of G in A are p-locally determined. We calculate k(A) and ℓ(A) for the cases where A is a full defect p-block of G, namely, a defect group P of A is a Sylow p-subgroup of G and P is a nonabelian metacyclic p-group M _n+1(p) of order p ⁿ⁺¹ and exponent p ⁿ for n \geqslant 2{n \geqslant 2}, and where A is not necessarily a full defect p-block but its defect group P = M _n+1(p) is normal in G. The proof is independent of the classification of finite simple groups.     

On the corestriction ofp n -symbol

LetF be a field of characteristicp. Teichmüller proved that anyp-algebra overF of indexp ⁿ and exponentp ^e is similar to a tensor product with at mostp ⁿ !(p ⁿ !−1) factors of cyclicp-algebras overF of degreep ^e . In this note we improve Teichmüller bound for two particular types ofp-algebras. LetL be a finite separable extension ofF. IfA is a cyclicp-algebra overL of degreep ^e we show that Cor _L/F A, the corestriction ofA, is similar to a tensor product with at most [L :F] factors of cyclicp-algebras overF of degreep ^e . Moreover we prove that [L :F] is the best possible bound. From this we deduce that ifA is a cyclicp-algebra overF of degreep ⁿ and exponentp ^e thenA is similar to a tensor product with at mostp ^n−e factors of cyclicp-algebras overF of degreep ^e .     

Lipschitz functions,Schatten ideals,and unbounded derivations

It is proved that, for any Lipschitz function f(t ₁, ..., t _n ) of n variables, the corresponding map f _op: (A ₁, ...,A _n ) → f(A ₁, ..., A _n ) on the set of all commutative n-tuples of Hermitian operators on a Hilbert space is Lipschitz with respect to the norm of each Schatten ideal S ^p , p ∈ (1,∞). This result is applied to the functional calculus of normal operators and contractions. It is shown that Lipschitz functions of one variable preserve domains of closed derivations with values in S ^p . It is also proved that the map f _op is Fréchet differentiable in the norm of S ^p if f is continuously differentiable.     

Functions realizing as abelian group automorphisms

Let A be a set and f:A→A a bijective function. Necessary and sufficient conditions on f are determined which makes it possible to endow A with a binary operation ? such that (A,?) is a cyclic group and f∈Aut(A). This result is extended to all abelian groups in case |A| = p², p a prime. Finally, in case A is countably infinite, those f for which it is possible to turn A into a group (A,?) isomorphic to ?ⁿ for some n≥1, and with f∈Aut(A), are completely characterized.     

The greedy coloring is a bad probabilistic algorithm

Given a graph G and an ordering p of its vertices, denote by A(G, p) the number of colors used by the greedy coloring algorithm when applied to G with vertices ordered by p. Let , , Δ be positive constants. It is proved that for each n there is a graph G_n such that the chromatic number of G_n is at most n, but the probability that A(G_n, p) < (1 − )n/log₂ n for a randomly chosen ordering p is O(n^−Δ).     

Random sparse unary predicates

Random unary predicates U on [n] holding with probability p are examined with respect to sentences A in a first-order language containing U and “less than.” When p = p(n) satisfies n^k+1 ? 1 ? np^k it is shown that Pr[A] approaches a limit dependent only on k and A. In a similar circular model the limit is shown to be zero or one. © 1994 John Wiley & Sons, Inc.     

Exponential sums on An. III

We give two applications of our earlier work [4]. We compute the p-adic cohomology of certain exponential sums on A ⁿ involving a polynomial whose homogeneous component of highest degree defines a projective hypersurface with at worst weighted homogeneous isolated singularities. This study was motivated by recent work of García [9]. We also compute the p-adic cohomology of certain exponential sums on A ⁿ whose degree is divisible by the characteristic. Received: 12 October 1999     

Binomial Matrices

Every s×s matrix A yields a composition map acting on polynomials on R ^s . Specifically, for every polynomial p we define the mapping C _A by the formula (C _A p)(x):=p(Ax), xR ^s . For each nonnegative integer n, homogeneous polynomials of degree n form an invariant subspace for C _A . We let A ⁽ⁿ⁾ be the matrix representation of C _A relative to the monomial basis and call A ⁽ⁿ⁾ a binomial matrix. This paper studies the asymptotic behavior of A ⁽ⁿ⁾ as n. The special case of 2×2 matrices A with the property that A ²=I corresponds to discrete Taylor series and motivated our original interest in binomial matrices.     

Preconditioned HSS methods for the solution of non-Hermitian positive definite linear systems and applications to the discrete convection-diffusion equation

Summary. We study the role of preconditioning strategies recently developed for coercive problems in connection with a two-step iterative method, based on the Hermitian skew-Hermitian splitting (HSS) of the coefficient matrix, proposed by Bai, Golub and Ng for the solution of nonsymmetric linear systems whose real part is coercive. As a model problem we consider Finite Differences (FD) matrix sequences {A_n(a,p)}_n discretizing the elliptic (convection-diffusion) problem with being a plurirectangle of R^d with a(x) being a uniformly positive function and p(x) denoting the Reynolds function: here for plurirectangle we mean a connected union of rectangles in d dimensions with edges parallel to the axes. More precisely, in connection with preconditioned HSS/GMRES like methods, we consider the preconditioning sequence {P_n(a)}_n, P_n(a):= D_n^1/2(a)A_n(1,0) D_n^1/2(a) where D_n(a) is the suitably scaled main diagonal of A_n(a,0). If a(x) is positive and regular enough, then the preconditioned sequence shows a strong clustering at unity so that the sequence {P_n(a)}_n turns out to be a superlinear preconditioning sequence for {A_n(a,0)}_n where A_n(a,0) represents a good approximation of Re(A_n(a,p)) namely the real part of A_n(a,p). The computational interest is due to the fact that the preconditioned HSS method has a convergence behavior depending on the spectral properties of {P_n^-1(a)Re(A_n(a,p))}_n {P_n^-1(a)A_n(a,0)}_n: therefore the solution of a linear system with coefficient matrix A_n(a,p) is reduced to computations involving diagonals and to the use of fast Poisson solvers for {A_n(1,0)}_n.Some numerical experimentations confirm the optimality of the discussed proposal and its superiority with respect to existing techniques.Mathematics Subject Classification (1991): 65F10, 65N22, 15A18, 15A12, 47B65     

Elementary abelian operator groups

Letp be a prime,n a positive integer. Suppose thatG is a finite solvablep'-group acted on by an elementary abelianp-groupA. We prove that ifC _G (ϕ) is of nilpotent length at mostn for every nontrivial element ϕ ofA and |A|≥p ⁿ⁺¹ thenG is of nilpotent length at mostn+1.     

Anisotropic Local Hardy Spaces

In this paper we introduce and study the anisotropic local Hardy spaces h_A^p(\mathbbRⁿ)h_{A}^{p}(\mathbb{R}^{n}) 0<p≤1, associated with the expansive matrix A. We obtain an atomic characterization of the distributions in h_A^p(\mathbbRⁿ)h_{A}^{p}(\mathbb{R}^{n}). Also we describe the dual spaces of our local Hardy anisotropic spaces as anisotropic Campanato type spaces.     

On the complexity of linear boolean operators with thin matrices

Under consideration is the problem of constructing a square Booleanmatrix A of order n without “rectangles” (it is a matrix whose every submatrix of the elements that are in any two rows and two columns does not consist of 1s). A linear transformation modulo two defined by A has complexity o(ν(A) − n) in the base {⊕}, where ν(A) is the weight of A, i.e., the number of 1s (the matrices without rectangles are called thin). Two constructions for solving this problem are given. In the first construction, n = p ² where p is an odd prime. The corresponding matrix H _p has weight p ³ and generates the linear transformation of complexity O(p ² log p log log p). In the second construction, the matrix has weight nk where k is the cardinality of a Sidon set in ℤ _n . We may assume that

Extremal eigenvalue problems for convex sets of symmetric matrices and operators

LetA ₁,...,A_n andK bem×m symmetric matrices withK positive definite. Denote byC the convex hull of {A ₁,...A_n}. Let {λ _p (KA)} ₁ ⁿ be then real eigenvalues ofKA arranged in decreasing order. We show that maxλ _p (KA) onC is attained for someA ^*=Σ _i ^{= 1/n} for which at mostp(p+1)/2 of α _i ^* do not vanish. We extend this result in several directions and consider applications to classes of integral equations. This paper is based mainly on the author’s doctoral dissertation written at the Technion—Israel Institute of Technology, March 1971, under the direction of Professor B. Schwarz. I wish to thank Professor Schwarz for his advice and encouragement. I am also grateful to Professor S. Karlin for supplying simplifications of several of my arguments. Some extensions discussed here are joint results of Karlin and the author.     

Generalizations of Arnold’s version of Euler’s theorem for matrices

A recent result, conjectured by Arnold and proved by Zarelua, states that for a prime number p, a positive integer k, and a square matrix A with integral entries one has ${\textrm tr}(A^{p^k}) \equiv {\textrm tr}(A^{p^{k-1}}) ({\textrm mod}{p^k})${\textrm tr}(A^{p^k}) \equiv {\textrm tr}(A^{p^{k-1}}) ({\textrm mod}{p^k}). We give a short proof of a more general result, which states that if the characteristic polynomials of two integral matrices A,  B are congruent modulo p ^k then the characteristic polynomials of A ^p and B ^p are congruent modulo p ^k+1, and then we show that Arnold’s conjecture follows from it easily. Using this result, we prove the following generalization of Euler’s theorem for any 2 × 2 integral matrix A: the characteristic polynomials of A ^Φ(n) and A ^Φ(n)-ϕ(n) are congruent modulo n. Here ϕ is the Euler function, ?_i=1^l p_i^a_i\prod_{i=1}^{l} p_i^{\alpha_i} is a prime factorization of n and $\Phi(n)=(\phi(n)+\prod_{i=1}^{l} p_i^{\alpha_i-1}(p_i+1))/2$\Phi(n)=(\phi(n)+\prod_{i=1}^{l} p_i^{\alpha_i-1}(p_i+1))/2.     

Generalized commutators for Marcinkiewicz type integrals with variable kernels

Let A be a function with derivatives of order m and D γ A ∈■β (0 < β < 1, |γ| = m). The authors in the paper prove that if Ω(x, z) ∈ L ∞ (R n ) × L s (S n 1 ) (s ≥ n/(n β)) is homogenous of degree zero and satisfies the mean value zero condition about the variable z, then both the generalized commutator for Marcinkiewicz type integral μ A Ω and its variation μ A Ω are bounded from L p (R n ) to L q (R n ), where 1 < p < n/β and 1/q = 1/p β/n. The authors also consider the boundedness of μ A Ω and its variation μ A Ω on Hardy spaces.     

The natural operators lifting 1-forms on manifolds to the bundles ofA-velocities

LetA be a Weil algebra withp variables. We prove that forn-manifolds (np+2) the set of all natural operatorsT ^*T ^* T ^A is a free finitely generated module over a ring canonically dependent onA. We construct explicitly the basis of this module.     

A congruence for the Fourier coefficients of a modular form and its application to quadratic forms

Let F(z)=∑ _n=1^∞ A(n)q ⁿ denote the unique weight 6 normalized cuspidal eigenform on Γ₀(4). We prove that A(p)≡0,2,−1(mod 11) when p≠11 is a prime. We then use this congruence to give an application to the number of representations of an integer by quadratic form of level 4.