A note on the Jacobian Conjecture

In this note, we show that, if the Druzkowski mappings F(X)=X+(AX)^∗3, i.e. F(X)=(x₁+(a₁₁x₁+?+a_1nx_n)³,…,x_n+(a_n1x₁+?+a_nnx_n)³), satisfies TrJ((AX)^∗3)=0, then where δ is the number of diagonal elements of A which are equal to zero. Furthermore, we show the Jacobian Conjecture is true for the Druzkowski mappings in dimension ?9 in the case .     

Generalizations of the image conjecture and the Mathieu conjecture

We first propose a generalization of the image conjecture Zhao (submitted for publication) [31] for the commuting differential operators related with classical orthogonal polynomials. We then show that the non-trivial case of this generalized image conjecture is equivalent to a variation of the Mathieu conjecture Mathieu (1997) [21] from integrals of G-finite functions over reductive Lie groups G to integrals of polynomials over open subsets of Rⁿ with any positive measures. Via this equivalence, the generalized image conjecture can also be viewed as a natural variation of the Duistermaat and van der Kallen theorem Duistermaat and van der Kallen (1998) [14] on Laurent polynomials with no constant terms. To put all the conjectures above in a common setting, we introduce what we call the Mathieu subspaces of associative algebras. We also discuss some examples of Mathieu subspaces from other sources and derive some general results on this newly introduced notion.     

Singularities of the secant variety

We give positivity conditions on the embedding of a smooth variety which guarantee the normality of the secant variety, generalizing earlier results of the author and others. We also give classes of secant varieties satisfying the Hodge conjecture as well as a result on the singular locus of degenerate secant varieties.     

On additive-nilpotency of Jacobian matrices of polynomial maps

Let H:Cⁿ→Cⁿ$H:{\mathbb{C}}^n\to {\mathbb{C}}^n$ be a polynomial map, JH the Jacobian matrix of H  , and _VH$V_H$ the linear subspace of _Mn(C)$M_n(\mathbb{C})$ spanned by {JH(α)|α∈Cⁿ}$\{JH(\alpha )|\alpha \in {\mathbb{C}}^n\}$, the set of evaluated Jacobian matrices of H  . We describe the dimension of _VH$V_H$ through a power-linear Gorni–Zampieri mate of H, and give a numerical algorithm for computing this dimension and determining whether JH   is additive-nilpotent, i.e., whether _VH$V_H$ is a nilpotent subspace.     

Kernels and Choquet capacities

Summary M. Brelot showed that the capacity corresponding to a function-kernel is a Choquet capacity, provided that the kernel satisfies the principle of equilibrium, the weak domination principle and the adjoint kernel satisfies the weak principle of equilibrium. This result is not applicable for a series of important kernels in potential theory (e.g. the fundamental solution of the heat equation, or the Kolmogorov equation), since the above principles no longer hold in this situation. New principles for function kernels guaranteeing that the capacity is a Choquet capacity are introduced and applied in the framework of balayage spaces. In particular, polar and adjoint polar sets are shown to coincide in this context.     

Two results on homogeneous Hessian nilpotent polynomials

Let z=(z₁,…,z_n) and , the Laplace operator. A formal power series P(z) is said to be Hessian Nilpotent (HN) if its Hessian matrix is nilpotent. In recent developments in [M. de Bondt, A. van den Essen, A reduction of the Jacobian conjecture to the symmetric case, Proc. Amer. Math. Soc. 133 (8) (2005) 2201-2205. [MR2138860]; G. Meng, Legendre transform, Hessian conjecture and tree formula, Appl. Math. Lett. 19 (6) (2006) 503-510. [MR2170971]. See also math-ph/0308035; W. Zhao, Hessian nilpotent polynomials and the Jacobian conjecture, Trans. Amer. Math. Soc. 359 (2007) 249-274. [MR2247890]. See also math.CV/0409534], the Jacobian conjecture has been reduced to the following so-called vanishing conjecture (VC) of HN polynomials: for any homogeneous HN polynomialP(z) (of degreed=4), we haveΔ^mP^m+1(z)=0for anym?0. In this paper, we first show that the VC holds for any homogeneous HN polynomial P(z) provided that the projective subvarieties Z_P and Z_σ2 of CPⁿ⁻¹ determined by the principal ideals generated by P(z) and , respectively, intersect only at regular points of Z_P. Consequently, the Jacobian conjecture holds for the symmetric polynomial maps F=z−∇P with P(z) HN if F has no non-zero fixed point w∈Cⁿ with . Secondly, we show that the VC holds for a HN formal power series P(z) if and only if, for any polynomial f(z), Δ^m(f(z)P(z)^m)=0 when m?0.     

Room designs and one-factorizations

The existence of a Room square of order 2n is known to be equivalent to the existence of two orthogonal one-factorizations of the complete graph on 2n vertices, where orthogonal means any two one-factors involved have at most one edge in common. DefineR(n) to be the maximal number of pairwise orthogonal one-factorizations of the complete graph onn vertices.The main results of this paper are bounds on the functionR. If there is a strong starter of order 2n–1 thenR(2n) 3. If 4n–1 is a prime power, it is shown thatR(4n) 2n–1. Also, the recursive construction for Room squares, to obtain, a Room design of sidev(u – w) +w from a Room design of sidev and a Room design of sideu with a subdesign of sidew, is generalized to sets ofk pairwise orthogonal factorizations. It is further shown thatR(2n) 2n–3.     

Smoothness of the images of members of a linear system under an endomorphism of the affine plane

Let φ=(f,g) be an endomorphism of the affine plane C² defined by two polynomials f,g∈C[x,y] and let Λ={C_b∣b∈C} be the pencil of lines C_b defined by x=b. We shall consider the smoothness criterion of the image curve φ(C_b). The hypersurface V whose coordinate ring is C[x,f,g] and the normalization of V will play interesting roles in analyzing the properties of the set φ(Λ)={φ(C_b)∣b∈C}.     

A note on a conjecture of Ryser

A special case of a conjecture of Ryser states that if a 3-partite 3-uniform hypergraph has at mostv pairwise disjoint edges then there is a set of vertices of cardinality at most 2v meeting all edges of the hypergraph. The best known upper bound for the size of such a set is (8/3)v, given by Tuza [7]. In this note we improve this to (5/2)v.     

An algorithm for the difference between set covers

A set cover for a set S is a collection C of special subsets whose union is S. Given covers A and B for two sets, the set-cover difference problem is to construct a new cover for the elements covered by A but not B. Applications include testing equivalence of set covers and maintaining a set cover dynamically. In this paper, we solve the set-cover difference problem by defining a difference operation A-B, which turns out to be a pseudocomplement on a distributive lattice. We give an algorithm for constructing this difference, and show how to implement the algorithm for two examples with applications in computer science: face covers on a hypercube, and rectangle covers on a grid. We derive an upper bound on the time complexity of the algorithm, and give upper and lower bounds on complexity for face covers and rectangle covers.     

On the singular graph and the Weyr characteristic of anM-matrix

LetA be anM-matrix in standard lower block triangular form, with diagonal blocksA _ii irreducible. LetS be the set of indices such that the diagonal blockA is singular. We define the singular graph ofA to be the setS with partial order defined by > if there exists a chain of non-zero blocksA _i, A_ij, , A_l.Let ₁ be the set of maximal elements ofS, and define thep-th level _p ,p = 2, 3, , inductively as the set of maximal elements ofS \( _{1 p-1}). Denote by _p the number of elements in _p . The Weyr characteristic (associated with 0) ofA is defined to be (A) = ( ₁, ₂,, _h ), where ₁ + + _p = dim KerA ^p ,p = 1, 2, , and _h > 0, _h+1 = 0.Using a special type of basis, called anS-basis, for the generalized eigenspaceE(A) of 0 ofA, we associate a matrixD withA. We show that(A) = ( ₁, , _h) if and only if certain submatricesD _p,p+1 ,p = 1, , h – 1, ofD have full column rank. This condition is also necessary and sufficient forE(A) to have a basis consisting of non-negative vectors, which is a Jordan basis for –A. We also consider a given finite partially ordered setS, and we find a necessary and sufficient condition that allM-matricesA with singular graphS have(A) = ( ₁, , _h). This condition is satisfied ifS is a rooted forest.The work of the second-named author was partly supported by the National Science Foundation, under grant MPS-08618 A02.     

On the diameter and girth of a zero-divisor graph

For a commutative ring R with zero-divisors Z(R), the zero-divisor graph of R is Γ(R)=Z(R)−{0}, with distinct vertices x and y adjacent if and only if xy=0. In this paper, we characterize when either or . We then use these results to investigate the diameter and girth for the zero-divisor graphs of polynomial rings, power series rings, and idealizations.     

Neighborhood Complexes of Stable Kneser Graphs

It is shown that the neighborhood complexes of a family of vertex critical subgraphs of Kneser graphs—the stable Kneser graphs introduced by L. Schrijver—are spheres up to homotopy. Furthermore, it is shown that the neighborhood complexes of a subclass of the stable Kneser graphs contain the boundaries of associahedra (simplicial complexes encoding triangulations of a polygon) as a strong deformation retract.* The first author was partially supported by the Göran Gustafsson Foundation for Research in Natural Sciences and Medicine. The second author was supported by the graduate school Algorithmische Diskrete Mathematik, which is funded by the Deutsche Forschungsgemeinschaft, grant GRK 219/3. The DAAD partially supported a stay at KTH, Stockholm, in December 1998, where this work was done: DAAD program AZ 313/S-PPP     

Chow rings of excellent quadrics

In this paper we compute the multiplicative structure of the Chow ring of an excellent anisotropic quadric by using the algebraic cobordism theory.     

On globally generated vector bundles on projective spaces

A classification is given for globally generated vector bundles E of rank k on Pⁿ having first Chern class c₁(E)=2. In particular, we get that they split if k<n unless E is a twisted null-correlation bundle on P³. In view of the well-known correspondence between globally generated vector bundles and maps to Grassmannians, we obtain, as a corollary, a classification of double Veronese embeddings of Pⁿ into a Grassmannian G(k−1,N) of (k−1)-planes in P^N.     

Discriminant loci of ample and spanned line bundles

Let (X,L,V) be a triplet where X is an irreducible smooth complex projective variety, L is an ample and spanned line bundle on X and V⊆H⁰(X,L) spans L. The discriminant locus D(X,V)⊂|V| is the algebraic subset of singular elements of |V|. We study the components of D(X,V) in connection with the jumping sets of (X,V), generalizing the classical biduality theorem. We also deal with the degree of the discriminant (codegree of (X,L,V)) giving some bounds on it and classifying curves and surfaces of codegree 2 and 3. We exclude the possibility for the codegree to be 1. Significant examples are provided.     

A maximum principle for node voltages in finitely structured,transfinite, electrical networks

Transfinite electrical networks have unique finite-powered voltage-current regimes given in terms of branch voltages and branch currents, but they do not in general possess unique node voltages. However, if their structures are sufficiently restricted, those node voltages will exist and will satisfy a maximum principle much like that which holds for ordinary infinite electrical networks. The structure that is imposed in order to establish these results generalized the idea of local-finiteness. Other properties that do not hold in general for transfinite networks but do hold under the imposed structure are Kirchhoff's current laws for nodes of any ranks and the permissibility of connecting pure voltage sources to such nodes. This work lays the foundation for a theory of transfinite random walks, which will be the subject of a subsequent work.This work was supported by the National Science Foundation under the grants DMS-9200738 and MIP-9200748.