General symbolic powers: A homological point of view

Let I be an ideal of a Noetherian ring R and let S be a multiplicatively closed subset of R. We define the n-th (S)-symbolic power of 7 as S(Iⁿ) = IⁿR_s ∩R. The purpose of this paper is to compare the topologies defined by the adic {I_n}_n≤0 and the (S)-symbolic filtration {S(Iⁿ)}n≥o using the direct system {Extⁱ _R(R/Iⁿ,R)}_n≥0     

Nonabelian K-theory: The nilpotent class of K1 and general stability

A functorial filtration GL _n =S^–1L _n S⁰L _n S ⁱ L _n E _n of the general linear group GL _{n, n} 3, is defined and it is shown for any algebra A, which is a direct limit of module finite algebras, that S^–1 L _n (A)/S⁰L _n (A) is abelian, that S⁰L _n (A) S¹L _n (A) is a descending central series, and that S ⁱ L _n (A) = E _n(A) whenever i the Bass-Serre dimension of A. In particular, the K-functors k ₁ S ⁱ L _n =S ⁱ L _n /E _n are nilpotent for all i 0 over algebras of finite Bass-Serre dimension. Furthermore, without dimension assumptions, the canonical homomorphism S ⁱ L _n (A)/S ⁱ⁺¹ L _n (A)S ⁱ L _{n+ 1}(A)/S ⁱ⁺¹ L _{n + 1} (A) is injective whenever n i + 3, so that one has stability results without stability conditions, and if A is commutative then S⁰L _n (A) agrees with the special linear group SL _n (A), so that the functor S⁰L _n generalizes the functor SL _n to noncommutative rings. Applying the above to subgroups H of GL _n (A), which are normalized by E _n(A), one obtains that each is contained in a sandwich GL _n (A, ) H E _n(A, ) for a unique two-sided ideal of A and there is a descending S⁰L _n (A)-central series GL _n (A, ) S⁰L _n (A, ) S¹L _n (A, ) S ⁱ L _n (A, ) E _n(A, ) such that S ⁱ L _n (A, )=E _n(A, ) whenever i Bass-Serre dimension of A.Dedicated to Alexander Grothendieck on his sixtieth birthday     

Characterizations of Steiner points

To each convex compact A in Euclidian space Eⁿ there corresponds a point S (A) from Eⁿ such that 1) S(x) = x for x Eⁿ, 2) S(A + B) = S(A) + S(B), 3) S (A_i) , if A_i converges in the Hausdorff metric to the unit sphere in Eⁿ, then S(A) is the Steiner point of the set A. The theorem improves certain earlier results on characterizations of the Steiner point.Translated from Matematicheskie Zametki, Vol. 14, No. 2, pp. 243–247, August, 1973.In conclusion, I wish to express my appreciation to E. M. Semenov for his constant help with this work.     

Functions and line digraphs

Consider two maps f and g from a set E into a set F such that f(x) ≠ g(x) for every x in E. Suppose that there exists a positive integer n such that for any element z in F either f^?1(z) or g^?1(z) has at most n elements. Then, E can be partitioned into 2n + 1 subsets E₁, E₂,…,E_{2n + 1} such that f(E_i)∩ g(E_i) = ?, 1 ≤ i ≤ 2n + 1. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 296–303, 2003     

On the equivalence of the Euler-Pommier operators in spaces of analytic functions

In the space A (θ) of all one-valued functions f(z) analytic in an arbitrary region G ? ? (0 ∈ G) with the topology of compact convergence, we establish necessary and sufficient conditions for the equivalence of the operators L ₁=α _n z ⁿ Δ ⁿ + ... + α₁ zΔ+α₀ E and L ₂= z ⁿ a _n (z)Δ ⁿ + ... + za ₁(z)Δ+a ₀(z)E, where δ: (Δ?)(z)=(f(z)-?(0))/z is the Pommier operator in A(G), n ∈ ?, α _n ∈ ?, a _k (z) ∈ A(G), 0≤k≤n, and the following condition is satisfied: Σ _j=s ^n?1 α _j+1 ∈ 0, s=0,1,...,n?1. We also prove that the operators z ^s+1Δ+β(z)E, β(z) ∈ A _R , s ∈ ?, and z ^s+1 are equivalent in the spaces A _R, 0?R?-∞, if and only if β(z) = 0.     

The inverse problem of bisymmetric matrices with a submatrix constraint

An n×n real matrix A is called a bisymmetric matrix if A=A^T and A=S_nAS_n, where S_n is an n×n reverse unit matrix. This paper is mainly concerned with solving the following two problems: Problem I Given n×m real matrices X and B, and an r×r real symmetric matrix A₀, find an n×n bisymmetric matrix A such that where A([1: r]) is a r×r leading principal submatrix of the matrix A. Problem II Given an n×n real matrix A^*, find an n×n matrix  in S_E such that where ∥·∥ is Frobenius norm, and S_E is the solution set of Problem I. The necessary and sufficient conditions for the existence of and the expressions for the general solutions of Problem I are given. The explicit solution, a numerical algorithm and a numerical example to Problem II are provided. Copyright © 2003 John Wiley & Sons, Ltd.     

Perfect matchings in random s-uniform hypergraphs

Let E = {X₁, X₂…, X_m} where the X_i ? V for 1 ≤ i ≤ m are distinct. The hypergraph G = (V, E) is said to be s-uniform if |X₁| = s for 1 ≤ i ≤ m. A set of edges M = {X_i : i ? I } is a perfect matching if (i) i ≠ j ? I implies X_i ∩ X_i = 0, and (ii) ∪_i?I X_i = V. In this article we consider the question of whether a random s-uniform hypergraph contains a perfect matching. Let s ≥ 3 be fixed and m/n^4/3 → ∞. We show that an s-uniform hypergraph with m edges chosen uniformly from [74] contains a perfect matching with high probability. This improves an earlier result of Schmidt and Shamir who showed that m/n^3/2 → ∞ suffices. © 1995 John Wiley & Sons, Inc.     

Simultaneous similarity of matrices

In this paper we solve completely and explicitly the long-standing problem of classifying pairs of n × n complex matrices (A, B) under the simultaneous similarity (TAT⁻¹, TBT⁻¹). Roughly speaking, the classification decomposes to a finite number of steps. In each step we consider an open algebraic set ⁰_n,2,r,π M_n × M_n (M_n = the set of n × n complex-valued matrices). Here r and π are two positive integers. Then we construct a finite number of rational functions ø₁,…,ø_s in the entries of A and B whose values are constant on all pairs similar in _n,2,r,π to (A, B). The values of the functions ø_i(A, B), I = 1,…, s, determine a finite number (at most κ(n, 2, r)) of similarity classes in _n,2,r,π. Let S_n be the subspace of complex symmetric matrices in M_n. For (A, B) ε S_n × S_n we consider the similarity class (TAT^t, TBT^t), where T ranges over all complex orthogonal matrices. Then the characteristic polynomial |λI − (A + xB)| determines a finite number of similarity classes for almost all pairs (A, B) ε S_n × S_n.     

A Question of Nori: Projective Generation of Ideals

Let A be a smooth affine domain of dimension d over an infinite perfect field k and let n be an integer such that 2n d + 3. Let I A[T] be an ideal of height n. Assume that I = (f ₁,...,f _n ) + (I ² T). Under these assumptions, it is proved in this paper that I = (g ₁,...,g _n ) with f _i – g _i (I ² T), thus settling a question of Nori affirmatively.     

On improved estimators of the generalized variance

Treated in this paper is the problem of estimating with squared error loss the generalized variance | Σ | from a Wishart random matrix S: p × p W_p(n, Σ) and an independent normal random matrix X: p × k N(ξ, Σ I_k) with ξ(p × k) unknown. Denote the columns of X by X₍₁₎ ,…, X_(k) and set ψ⁽⁰⁾(S, X) = {(n − p + 2)!/(n + 2)!} | S |, ψ⁽ⁱ⁾(X, X) = min[ψ⁽ⁱ⁻¹⁾(S, X), {(n − p + i + 2)!/(n + i + 2)!} | S + X₍₁₎ X′₍₁₎ + + X_(i) X′_(i) |] and Ψ⁽ⁱ⁾(S, X) = min[ψ⁽⁰⁾(S, X), {(n − p + i + 2)!/(n + i + 2)!}| S + X₍₁₎ X′₍₁₎ + + X_(i) X′_(i) |], i = 1,…,k. Our result is that the minimax, best affine equivariant estimator ψ⁽⁰⁾(S, X) is dominated by each of Ψ⁽ⁱ⁾(S, X), i = 1,…,k and for every i, ψ⁽ⁱ⁾(S, X) is better than ψ⁽ⁱ⁻¹⁾(S, X). In particular, ψ^(k)(S, X) = min[{(n − p + 2)!/(n + 2)!} | S |, {(n − p + 2)!/(n + 2)!} | S + X₍₁₎X′₍₁₎|,…,| {(n − p + k + 2)!/(n + k + 2)!} | S + X₍₁₎X′₍₁₎ + + X_(k)X′_(k)|] dominates all other ψ's. It is obtained by considering a multivariate extension of Stein's result (Ann. Inst. Statist. Math. 16, 155–160 (1964)) on the estimation of the normal variance.     

A constructive method for the solution of the stability problem

Summary In this paper it is shown that the problem of solving the Liapounov matrix equationSM +M ^T S = –I is greatly simplified when the given real matrixM is in upper Hessenberg form. The solution is obtained as a linear combinationS = p _i S _i ofn linearly independent symmetric matricesS _i , whereS _i M +M ^T S _i =2D _i and p _i D _i = –1/2I. Explicit formulae are given for the elements of theS _i , andD _i while determination of thep _i requires the solution of ann ×n linear system.     

Towards dimension expanders over finite fields

In this paper we study the problem of explicitly constructing a dimension expander raised by [3]: Let \mathbbFⁿ \mathbb{F}^n be the n dimensional linear space over the field \mathbbF\mathbb{F}. Find a small (ideally constant) set of linear transformations from \mathbbFⁿ \mathbb{F}^n to itself {A _i } _i∈I such that for every linear subspace V ⊂ \mathbbFⁿ \mathbb{F}^n of dimension dim(V)<n/2 we have

On the normal bundle of curves on nodal quartic surfaces

Let k be an algebraically closed field, char k = 0. Let C be an irreducible nonsingular curve such that 2C = S ? F, where S and F are two surfaces and all the singularities of F are rational double points (if any). We prove that C can never pass through rational singularities of types A _2n n∈N, E₆ and E₈. We give conditions for C to pass through rational singularities of types. A _2k+1 k∈Z⁺ D_n n≥4 and E₇, (0.8).     

Sequentially equidistant points in metric spaces

A sequence (z ₀,z ₁,z ₂,, ...,z _n, z _n+1) of points fromp=z ₀ toq=z _n+1 in a metric spaceX is said to besequentially equidistant ifd(z _i−1,z _i)=d(z _i,z _i+1) for 1≦i≦n. If there is path inX fromp toq (or if a certain weaker condition holds), then such a sequence exists, with all points distinct, for every choice ofn, while ifX is compact and connected, then such a sequence exists at least forn=2. An example is given of a dense connected subspaceS ofR ^m ,m≧2, and an uncountable dense subsetE disjoint fromS for which there is no sequentially equidistant sequence of distinct points (n ≧ 2) inS ∪E between any two points ofE. Techniques of dimension theory are utilized in the construction of these examples, as well as in the proofs of some of the positive results. Supported in part by NSF Grant DMS-8701666.     

Splitting of vector bundles on algebraic curves and elementary transformations

Let Ebe a rank nvector bundle on a smooth projective curve X. It is known that Emay be obtained from a splitted bundle +1≤i≤ L_i;, rank(L_i) = 1, by a finite number of elementary transformations. Here we give upper bounds for their minimal number. If n= 2 this is related to the order of stability of E.     

Retracts of box products with odd‐angulated factors

Let G be a connected graph with odd girth 2κ+1. Then G is a (2κ+1)‐angulated graph if every two vertices of G are connected by a path such that each edge of the path is in some (2κ+1)‐cycle. We prove that if G is (2κ+1)‐angulated, and H is connected with odd girth at least 2κ+3, then any retract of the box (or Cartesian) product G□ H is S□T where S is a retract of G and T is a connected subgraph of H. A graph G is strongly (2κ+1)‐angulated if any two vertices of G are connected by a sequence of (2κ+1)‐cycles with consecutive cycles sharing at least one edge. We prove that if G is strongly (2κ+1)‐angulated, and H is connected with odd girth at least 2κ+1, then any retract of G□ H is S□T where S is a retract of G and T is a connected subgraph of H or |V(S)|=1 and T is a retract of H. These two results improve theorems on weakly and strongly triangulated graphs by Nowakowski and Rival [Disc Math 70 ( 13 ), 169–184]. As a corollary, we get that the core of the box product of two strongly (2κ+1)‐angulated cores must be either one of the factors or the box product itself. Furthermore, if G is a strongly (2κ+1)‐angulated core, then either Gⁿ is a core for all positive integers n, or the core of Gⁿ is G for all positive integers n. In the latter case, G is homomorphically equivalent to a normal Cayley graph [Larose, Laviolette, Tardiff, European J Combin 19 ( 12 ), 867–881]. In particular, let G be a strongly (2κ+1)‐angulated core such that either G is not vertex‐transitive, or G is vertex‐transitive and any two maximum independent sets have non‐empty intersection. Then Gⁿ is a core for any positive integer n. On the other hand, let G_i be a (2κ_i+1)‐angulated core for 1 ≤ i≤ n where κ₁ < κ₂ < … < κ_n. If G_i has a vertex that is fixed under any automorphism for 1 ≤ i ≤ n‐1, or G_i is vertex‐transitive such that any two maximum independent sets have non‐empty intersection for 1 ≤ i ≤ n‐1, then □_i=1ⁿ G_i is a core. We then apply the results to construct cores that are box products with Mycielski construction factors or with odd graph factors. We also show that K(r,2r+1) □ C_2l+1 is a core for any integers l ≥ r ≥ 2. It is open whether K(r,2r+1) □ C_2l+1 is a core for r > l ≥ 2. © 2006 Wiley Periodicals, Inc. J Graph Theory     

Asymptotic Behavior of the Maximum of Sums of I.I.D. Random Variables along Monotone Blocks

Let {X_i, Y_i}_i=1,2,... be an i.i.d. sequence of bivariate random vectors with P(Y₁ = y) = 0 for all y. Put M_n(j) = max_0≤k≤n-j (X_k+1 + ... X_k+j)I_k,j, where I_k,k+j = I{Y_k+1 < ⋯ < Y_k+j} denotes the indicator function for the event in brackets, 1 ≤ j ≤ n. Let L_n be the largest index l ≤ n for which I_k,k+l = 1 for some k = 0, 1, ..., n - l. The strong law of large numbers for “the maximal gain over the longest increasing runs,” i.e., for M_n(L_n) has been recently derived for the case where X₁ has a finite moment of order 3 + ε, ε > 0. Assuming that X₁ has a finite mean, we prove for any a = 0, 1, ..., that the s.l.l.n. for M(L_n - a) is equivalent to EX ₁ ^3+a I{X₁ > 0} < ∞. We derive also some new results for the a.s. asymptotics of L_n. Bibliography: 5 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 311, 2004, pp. 179–189.     

Deformation of certain quadratic algebras and the corresponding quantum semigroups

LetV be a finite-dimensional vector space. Given a decompositionV⊗V=⊕ _i=1,…n I _i , definen quadratic algebrasQ(V, J _(m)) whereJ _(m)=⊕ _i≠m I _i . There is also a quantum semigroupM(V; I ₁, …,I _n ) which acts on all these quadratic algebras. The decomposition determines as well a family of associative subalgebras of End (V ^⊗k ), which we denote byA _k =A _k (I ₁,…,I _n ),k≥2. In the classical case, whenV⊗V decomposes into the symmetric and skewsymmetric tensors,A _k coincides with the image of the representation of the group algebra of the symmetric groupS _k in End(V ^⊗k ). LetI _i,h be deformations of the subspacesI _i . In this paper we give a criteria for flatness of the corresponding deformations of the quadratic algebrasQ(V, J _(m),h ) and the quantum semigroupM(V;I _1,h ,…,I _n,h ). It says that the deformations will be flat if the algebrasA _k (I ₁, …,I _n ) are semisimple and under the deformation their dimension does not change. Usually, the decomposition intoI _i is defined by a given semisimple operatorS onV⊗V, for whichI _i are its eigensubspaces, and the deformationsI _i,h are defined by a deformationS _h ofS. We consider the cases whenS _h is a deformation of Hecke or Birman-Wenzl symmetry, and also the case whenS _h is the Yang-Baxter operator which appears by a representation of the Drinfeld-Jimbo quantum group. Applying the flatness criteria we prove that in all these cases we obtain flat deformations of the quadratic algebras and the corresponding quantum semigroups. Partially supported by a grant from the Israel Science Foundation administered by the Israel Academy of Sciences.     

The connectivity of large digraphs and graphs

This paper studies the relation between the connectivity and other parameters of a digraph (or graph), namely its order n, minimum degree δ, maximum degree Δ, diameter D, and a new parameter l_pi;, 0 ≤ π ≤ δ ? 2, related with the number of short paths (in the case of graphs l₀ = ?(g ? 1)/2? where g stands for the girth). For instance, let G = (V,A) be a digraph on n vertices with maximum degree Δ and diameter D, so that n ≤ n(Δ, D) = 1 + Δ + Δ ² + … + Δ^D (Moore bound). As the main results it is shown that, if κ and λ denote respectively the connectivity and arc-connectivity of G, . Analogous results hold for graphs. © 1993 John Wiley & Sons, Inc.     

On calculation of moments of ladder heights

Let X,X ₁,X ₂, … be independent identically distributed random variables, F(x) = P{X < x}, S ₀ = 0, and S _n =Σ _i=1 ⁿ X _i . We consider the random variables, ladder heights Z ₊ and Z ₋ that are respectively the first positive sum and the first negative sum in the random walk {S _n }, n = 0, 1, 2, …. We calculate the first three (four in the case EX = 0) moments of random variables Z ₊ and Z ₋ in the qualitatively different cases EX > 0, EX < 0, and EX = 0. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 46, No. 2, pp. 159–179, April–June, 2006.