The inversion formulae for automorphisms of polynomial algebras and rings of differential operators in prime characteristic

Let K be an arbitrary field of characteristic p>0. We find an explicit formula for the inverse of any algebra automorphism of any of the following algebras: the polynomial algebra P_n?K[x₁,…,x_n], the ring of differential operators D(P_n) on P_n, D(P_n)⊗P_m, the n’th Weyl algebra A_n or A_n⊗P_m, the power series algebra K[[x₁,…,x_n]], the subalgebra T_k1,…,kn of D(P_n) generated by P_n and the higher derivations , 0≤j<p^k_i, i=1,…,n (where k₁,…,k_n∈N), T_k1,…,kn⊗P_m or an arbitrary central simple (countably generated) algebra over an arbitrary field.     

Noncommutative plurisubharmonic polynomials part I: Global assumptions

We consider symmetric polynomials, p, in the noncommutative (nc) free variables {x₁,x₂,…,xg}. We define the nc complex hessian of p as the second directional derivative (replacing xT by y)

     

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 prime power factorization of n!

In this paper, we prove two results. The first theorem uses a paper of Kim (J. Number Theory 74 (1999) 307) to show that for fixed primes p₁,…,p_k, and for fixed integers m₁,…,m_k, with , the numbers (e_p1(n),…,e_pk(n)) are uniformly distributed modulo (m₁,…,m_k), where e_p(n) is the order of the prime p in the factorization of n!. That implies one of Sander's conjectures from Sander (J. Number Theory 90 (2001) 316) for any set of odd primes. Berend (J. Number Theory 64 (1997) 13) asks to find the fastest growing function f(x) so that for large x and any given finite sequence , there exists n<x such that the congruences hold for all i?f(x). Here, p_i is the ith prime number. In our second result, we are able to show that f(x) can be taken to be at least , with some absolute constant c₁, provided that only the first odd prime numbers are involved.     

A generalized Cayley-Hamilton theorem for polynomials with matrix coefficients

A family F of square matrices of the same order is called a quasi-commuting family if (AB-BA)C=C(AB-BA) for all A,B,C∈F where A,B,C need not be distinct. Let f_k(x₁,x₂,…,x_p),(k=1,2,…,r), be polynomials in the indeterminates x₁,x₂,…,x_p with coefficients in the complex field C, and let M₁,M₂,…,M_r be n×n matrices over C which are not necessarily distinct. Let and let δ_F(x₁,x₂,…,x_p)=detF(x₁,x₂,…,x_p). In this paper, we prove that, for n×n matrices A₁,A₂,…,A_p over C, if {A₁,A₂,…,A_p,M₁,M₂,…,M_r} is a quasi-commuting family, then F(A₁,A₂,…,A_p)=O implies that δ_F(A₁,A₂,…,A_p)=O.     

Polynomial Cunningham chains

A sequence of prime numbers p₁,p₂,p₃,…, such that pi=2pi−1+? for all i, is called a Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the smallest positive integer such that 2pk+? is composite, then we say the chain has length k. It is conjectured that there are infinitely many Cunningham chains of length k for every positive integer k. A sequence of polynomials f₁(x),f₂(x),… in Z[x], such that f₁(x) has positive leading coefficient, each fi(x) is irreducible in Q[x] and fi(x)=xfi−1(x)+? for all i, is defined to be a polynomial Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the least positive integer such that fk+1(x) is reducible in Q[x], then we say the chain has length k. In this article, for polynomial Cunningham chains of both kinds, we prove that there are infinitely many chains of length k and, unlike the situation in the integers, that there are infinitely many chains of infinite length, by explicitly giving infinitely many polynomials f₁(x), such that fk+1(x) is the only term in the sequence that is reducible.     

On the minimum number of completely 3-scrambling permutations

A family P={π₁,…,π_q} of permutations of [n]={1,…,n} is completely k-scrambling [Spencer, Acta Math Hungar 72; Füredi, Random Struct Algor 96] if for any distinct k points x₁,…,x_k∈[n], permutations π_i's in P produce all k! possible orders on π_i(x₁),…,π_i(x_k). Let N^*(n,k) be the minimum size of such a family. This paper focuses on the case k=3. By a simple explicit construction, we show the following upper bound, which we express together with the lower bound due to Füredi for comparison.

     

Adding machines, kneading maps, and endpoints

Given a unimodal map f, let I=[c₂,c₁] denote the core and set E={(x₀,x₁,…)∈(I,f)|xi∈ω(c,f) for all i∈N}. It is known that there exist strange adding machines embedded in symmetric tent maps f such that the collection of endpoints of (I,f) is a proper subset of E and such that limk→∞Q(k)≠∞, where Q(k) is the kneading map.We use the partition structure of an adding machine to provide a sufficient condition for x to be an endpoint of (I,f) in the case of an embedded adding machine. We then show there exist strange adding machines embedded in symmetric tent maps for which the collection of endpoints of (I,f) is precisely E. Examples of this behavior are provided where limk→∞Q(k) does and does not equal infinity, and in the case where limk→∞Q(k)=∞, the collection of endpoints of (I,f) is always E.     

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

On the independence of Heegner points in the function field case

Let ∞ be a fixed place of a global function field k. Let E be an elliptic curve defined over k which has split multiplicative reduction at ∞ and fix a modular parametrization ΦE:X₀(N)→E. Let be Heegner points associated to the rings of integers of distinct quadratic “imaginary” fields K₁,…,Kr over (k,∞). We prove that if the “prime-to-2p” part of the ideal class numbers of ring of integers of K₁,…,Kr are larger than a constant C=C(E,ΦE) depending only on E and ΦE, then the points P₁,…,Pr are independent in . Moreover, when k is rational, we show that there are infinitely many imaginary quadratic fields for which the prime-to-2p part of the class numbers are larger than C.     

Completeness for flat modal fixpoint logics

This paper exhibits a general and uniform method to prove axiomatic completeness for certain modal fixpoint logics. Given a set Γ of modal formulas of the form γ(x,p₁,…,p_n), where x occurs only positively in γ, we obtain the flat modal fixpoint language L_?(Γ) by adding to the language of polymodal logic a connective ?_γ for each γ∈Γ. The term ?_γ(φ₁,…,φ_n) is meant to be interpreted as the least fixed point of the functional interpretation of the term γ(x,φ₁,…,φ_n). We consider the following problem: given Γ, construct an axiom system which is sound and complete with respect to the concrete interpretation of the language L_?(Γ) on Kripke structures. We prove two results that solve this problem.First, let be the logic obtained from the basic polymodal by adding a Kozen-Park style fixpoint axiom and a least fixpoint rule, for each fixpoint connective ?_γ. Provided that each indexing formula γ satisfies a certain syntactic criterion, we prove this axiom system to be complete.Second, addressing the general case, we prove the soundness and completeness of an extension of . This extension is obtained via an effective procedure that, given an indexing formula γ as input, returns a finite set of axioms and derivation rules for ?_γ, of size bounded by the length of γ. Thus the axiom system is finite whenever Γ is finite.     

Unextendible product bases and 1-factorization of complete graphs

Let f(k₁,…,k_m) be the minimal value of size of all possible unextendible product bases in the tensor product space . We have trivial lower bounds and upper bound k₁?k_m. Alon and Lovász determined all cases such that f(k₁,…,k_m)=n(k₁,…,k_m). In this paper we determine all cases such that f(k₁,…,k_m)=k₁?k_m by presenting a sharper upper bound. We also determine several cases such that f(k₁,…,k_m)=n(k₁,…,k_m)+1 by using a result on 1-factorization of complete graphs.     

Reduced order models for random functions. Application to stochastic problems

A method is developed for constructing reduced order models for arbitrary random functions. The reduced order models are simple random functions, that is, functions with a finite range (_x1,…,_xm)$({\mathit{x}}_1\text{,}\dots \text{,}{\mathit{x}}_m)$. The construction of the reduced order models involves two steps. First, a range (_x1,…,_xm)$({\mathit{x}}_1\text{,}\dots \text{,}{\mathit{x}}_m)$ is selected based on somewhat heuristic arguments. Second, the probabilities (_p1,…,_pm)$(p_1\text{,}\dots \text{,}{p}_m)$ of (_x1,…,_xm)$({\mathit{x}}_1\text{,}\dots \text{,}{\mathit{x}}_m)$ are obtained from the solution of an optimization problem. Reduced order models are applied to calculate the distributions of the modal frequencies of a linear dynamic system with random stiffness matrix and statistics of the hydraulic head in a soil deposit with random heterogeneous conductivity. The performance of reduced order models in both applications is remarkable.     

Mapping properties for oscillatory integrals in d-dimensions

For aj,bj?1, j=1,2,…,d, we prove that the operator maps into itself for , where , and k(x,y)=φ(x,y)eig(x,y), φ(x,y) satisfies (1.2) (e.g. φ(x,y)=|x−y|^iτ,τ real) and the phase g(x,y)=xa⋅yb. We study operators with more general phases and for these operators we require that aj,bj>1, j=1,2,…,d, or al=bl?1 for some l∈{1,2,…,d}.     

Von Neumann’s inequality for noncommuting contractions

Let T₁,…,T_d be linear contractions on a complex Hilbert space and p a complex polynomial in d variables which is a sum of d single variable polynomials. We show that the operator norm of p(T₁,…,T_d) is bounded by

     

On covering vertices of a graph by trees

The purpose of this paper is to initiate study of the following problem: Let G be a graph, and k?1. Determine the minimum number s of trees T₁,…,T_s, Δ(T_i)?k,i=1,…,s, covering all vertices of G. We conjecture: Let G be a connected graph, and k?2. Then the vertices of G can be covered by edge-disjoint trees of maximum degree ?k. As a support for the conjecture we prove the statement for some values of δ and k.     

Trace formulas for Hecke operators, Gaussian hypergeometric functions, and the modularity of a threefold

We present simple trace formulas for Hecke operators Tk(p) for all p>3 on Sk(Γ₀(3)) and Sk(Γ₀(9)), the spaces of cusp forms of weight k and levels 3 and 9. These formulas can be expressed in terms of special values of Gaussian hypergeometric series and lend themselves to recursive expressions in terms of traces of Hecke operators on spaces of lower weight. Along the way, we show how to express the traces of Frobenius of a family of elliptic curves equipped with a 3-torsion point as special values of a Gaussian hypergeometric series over Fq, when . As an application, we use these formulas to provide a simple expression for the Fourier coefficients of η⁸(3z), the unique normalized cusp form of weight 4 and level 9, and then show that the number of points on a certain threefold is expressible in terms of these coefficients.