Regular sequences in Rees and symmetric algebras I

In this paper we describe necessary and sufficient conditions for a system of elements a₁,...,a_t of a local Noetherian ring A such that the sequence a₁T,a₁–a₂T,...,a_t–1– a_tT, a_tin the Rees algebra A[a₁T,...,a_tT], T is an indeterminate, constitutes a regular sequence.     

A sufficient condition for graphs to be weaklyk-linked

We consider graphs, which are finite, undirected, without loops and in which multiple edges are possible. For each natural numberk letg(k) be the smallest natural numbern, so that the following holds:LetG be ann-edge-connected graph and lets ₁,...,s _k,t ₁,...,t _k be vertices ofG. Then for everyi {1,..., k} there existsa pathP _i froms _i tot _i, so thatP ₁,...,P _k are pairwise edge-disjoint. We prove      

Optimum super-simple mixed covering arrays of type <Emphasis Type="Italic">a</Emphasis><Superscript>1</Superscript><Emphasis Type="Italic">b</Emphasis><Superscript><Emphasis Type="Italic">k</Emphasis>−1</Superscript>

A mixed covering array (MCA) of type (_v 1, v ₂,..., v _k ), denoted by MCA_λ (N; t, k, (v ₁, v ₂,..., v _k )), is an N × k array with entries in the i-th column from a set _{V i} of v _i symbols and has the property that each N × t sub-array covers all the t-tuples at least λ times, where 1 ≤ i ≤ k. An MCA _λ (N; t, k, (_v 1, v ₂,..., v _k )) is said to be super-simple, if each of its N × (t + 1) sub-arrays contains each (t + 1)-tuple at most once. Recently, it was proved by Tang, Yin and the author that an optimum super-simple MCA of type (a, b, b,..., b) is equivalent to a mixed detecting array (DTA) of type (a, b, b,..., b) with optimum size. Such DTAs can be used to generate test suites to identify and determine the interaction faults between the factors in a component-based system. In this paper, some combinatorial constructions of optimum super-simple MCAs of type (a, b, b,..., b) are provided. By employing these constructions, some optimum super-simple MCAs are then obtained. In particular, the spectrum across which optimum super-simple MCA₂(2b ²; 2, 4, (a, b, b, b))′s exist, is completely determined, where 2 ≤ a ≤ b.     

A moment problem associated to rational Szegő functions

Leta ₁,...,a _p be distinct points in the finite complex plane ?, such that |a _j|>1,j=1,..., p and let \(b_j = 1/\bar \alpha _j ,\) j=1,..., p. Let μ₀, μ _π ^(j) , ν _π ^(j) j=1,..., p;n=1, 2,... be given complex numbers. We consider the following moment problem. Find a distribution ψ on [?π, π], with infinitely many points of increase, such that $$\begin{array}{l} \int_{ - \pi }^\pi {d\psi (\theta ) = \mu _0 ,} \\ \int_{ - \pi }^\pi {\frac{{d\psi (\theta )}}{{(e^{i\theta } - a_j )^n }} = \mu _n^{(j)} ,} \int_{ - \pi }^\pi {\frac{{d\psi (\theta )}}{{(e^{i\theta } - b_j )^n }} = v_n^{(j)} ,} j = 1,...,p;n = 1,2,.... \\ \end{array}$$ It will be shown that this problem has a unique solution if the moments generate a positive-definite Hermitian inner product on the linear space of rational functions with no poles in the extended complex plane ?^* outside {a ₁,...,a _p,b ₁,...,b _p}.     

Cyclic Just-In-Time Sequences Are Optimal

Consider the Product Rate Variation problem. Given n products 1,...,i,...,n, and n positive integer demands d ₁,..., d_i,...,d_n. Find a sequence =₁,...,_T, T = _i=1 ⁿ d _i, of the products, where product i occurs exactly d _i times that always keeps the actual production level, equal the number of product i occurrences in the prefix ₁,..., _t, t=1,...,T, and the desired production level, equal r _i t, where r _i=d_i/T, of each product i as close to each other as possible. The problem is one of the most fundamental problems in sequencing flexible just-in-time production systems. We show that if is an optimal sequence for d ₁,...,d_i,...,d_n, then concatenation ^m of m copies of is an optimal sequence for md ₁,..., md_i,...,md_n.     

A test for the existence of Gohberg-Krein representations in terms of multiparameter Wiener processes

This paper provides new necessary and sufficient conditions for a Gaussian random field to have a Gohberg-Krein representation in terms of an n-parameter Wiener process (n > 1). As an application, it demonstrates the nonexistence of a Gohberg-Krein representation of W_s,t ? stW_1,1 in terms of the two-parameter Wiener process W_s,t with (s, t) ? [0, a] × [0, b] for 0 < a < 1, 0 < b < 1.     

Decomposition of bipartite graphs into closed trails

Let Lct(G) denote the set of all lengths of closed trails that exist in an even graph G. A sequence (t ₁,..., t _p ) of elements of Lct(G) adding up to |E(G)| is G-realisable provided there is a sequence (T ₁,..., t _p ) of pairwise edge-disjoint closed trails in G such that T _i is of length T _i for i = 1,..., p. The graph G is arbitrarily decomposable into closed trails if all possible sequences are G-realisable. In the paper it is proved that if a ⩾ 1 is an odd integer and M _a,a is a perfect matching in K _a,a , then the graph K _a,a -M _a,a is arbitrarily decomposable into closed trails.      

On computing the dispersion function

A two-dimensional analogue of the well-known bisection method for root finding is presented in order to solve the following problem, related to the dispersion function of a set of random variables: given distribution functionsF ₁,...,F _n and a probabilityp, find an interval [a,b] of minimum width such thatF _i(b)–F _i(a ^–)p, fori=1,...,n.The author wishes to thank Dr. I. D. Coope, for helpful advice offered during the preparation of this paper, and the referee, whose comments contributed to a clearer presentation.     

MAXIMUM TREES OF FINITE SEQUENCES

ＭＡＸＩＭＵＭＴＲＥＥＳＯＦＦＩＮＩＴＥＳＥＱＵＥＮＣＥＳ￥ＷＵＳＨＩＱＵＡＮＡｂｓｔｒａｃｔ：Ｌｅｔｎ，ｓ１，ｓ２，．．．，ｓｎｂｅｎｏｎ－ｎｅｇａｔｉｖｅｉｎｔｅｇｅｒｓａｎｄＭ（ｓ１，ｓ２，．．．，ｓｎ）＝｛（ａ１，ａ２，．．．，ａ．）｜ａｉｉ...     

Weight Hierarchies of Linear Codes Satisfying the Chain Condition

The weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d₁,d₂,...,d_k) where d_r is the smallest support of an r–dimensional subcode of C. By explicit construction, it is shown that if a sequence (a₁,a₂,...,a_k) satisfies certain conditions, then it is the weight hierarchy of a code satisfying the chain condition.     

Metric and ultrametric spaces of resistances

Consider an electrical circuit, each edge e of which is an isotropic conductor with a monomial conductivity function . In this formula, y_e is the potential difference and current in e, while μ_e is the resistance of e; furthermore, r and s are two strictly positive real parameters common for all edges. In particular, the case r=s=1 corresponds to the standard Ohm’s law.In 1987, Gvishiani and Gurvich [A.D. Gvishiani, V.A. Gurvich, Metric and ultrametric spaces of resistances, in: Communications of the Moscow Mathematical Society, Russian Math. Surveys 42 (6 (258)) (1987) 235-236] proved that, for every two nodes a,b of the circuit, the effective resistance μ_a,b is well-defined and for every three nodes a,b,c the inequality holds. It obviously implies the standard triangle inequality μ_a,b≤μ_a,c+μ_c,b whenever s≥r. For the case s=r=1, these results were rediscovered in the 1990s. Now, after 23 years, I venture to reproduce the proof of the original result for the following reasons:

•

It is more general than just the case r=s=1 and one can get several interesting metric and ultrametric spaces playing with parameters r and s. In particular, (i) the effective Ohm resistance, (ii) the length of a shortest path, (iii) the inverse width of a bottleneck path, and (iv) the inverse capacity (maximum flow per unit time) between any pair of terminals a and b provide four examples of the resistance distances μ_a,b that can be obtained from the above model by the following limit transitions: (i) r(t)=s(t)≡1, (ii) r(t)=s(t)→∞, (iii) r(t)≡1,s(t)→∞, and (iv) r(t)→0,s(t)≡1, as t→∞. In all four cases the limits μ_a,b=lim_t→∞μ_a,b(t) exist for all pairs a,b and the metric inequality μ_a,b≤μ_a,c+μ_c,b holds for all triplets a,b,c, since s(t)≥r(t) for any sufficiently large t. Moreover, the stronger ultrametric inequality μ_a,b≤max(μ_a,c,μ_c,b) holds for all triplets a,b,c in examples (iii) and (iv), since in these two cases s(t)/r(t)→∞, as t→∞.

•

Communications of the Moscow Math. Soc. in Russ. Math. Surveys were (and still are) strictly limited to two pages; the present paper is much more detailed.Although a translation in English of the Russ. Math. Surveys is available, it is not free in the web and not that easy to find.

•

The last but not least: priority.

     

Admissibility of the natural estimator of the mean of a Gaussian process

Let {X(t): t [a, b]} be a Gaussian process with mean μ L₂[a, b] and continuous covariance K(s, t). When estimating μ under the loss ∫_a^b ( (t)−μ(t))² dt the natural estimator X is admissible if K is unknown. If K is known, X is minimax with risk ∫_a^b K(t, t) dt and admissible if and only if the three by three matrix whose entries are K(t_i, t_j) has a determinant which vanishes identically in t_i [a, b], i = 1, 2, 3.     

Extremes of independent Gaussian processes

For every n ∈ ℕ, let X _1n ,..., X _nn be independent copies of a zero-mean Gaussian process X _n  = {X _n (t), t ∈ T}. We describe all processes which can be obtained as limits, as n→ ∞, of the process a _n (M _n  − b _n ), where M _n (t) =  max _{i = 1,...,n} X _in (t), and a _n , b _n are normalizing constants. We also provide an analogous characterization for the limits of the process a _n L _n , where L _n (t) =  min _{i = 1,...,n} |X _in (t)|.     

Singular series in the problem of the representation of a system of numbers by a system of forms

A system of Diophantine equations is considered for integers n₁,...,₂, $$\phi ^{\left( k \right)} \left( {x_1 , \ldots ,x_s } \right) = n_k \left( {k = 1, \ldots ,2} \right)$$ , Ф^(k)(x₁,...,x_s)=n_k (k=1,...,ρ), where Ф^(k) are integral forms of degree d is s variables. The singular integral and singular series of this problem are investigated.     

Selections of bounded variation under the excess restrictions

Let X be a metric space with metric d, c(X) denote the family of all nonempty compact subsets of X and, given F,G∈c(X), let e(F,G)=supx∈Finfy∈Gd(x,y) be the Hausdorff excess of F over G. The excess variation of a multifunction , which generalizes the ordinary variation V of single-valued functions, is defined by where the supremum is taken over all partitions of the interval [a,b]. The main result of the paper is the following selection theorem: If,V₊(F,[a,b])<∞,t₀∈[a,b]andx₀∈F(t₀), then there exists a single-valued functionof bounded variation such thatf(t)∈F(t)for allt∈[a,b],f(t₀)=x₀,V(f,[a,t₀))?V₊(F,[a,t₀))andV(f,[t₀,b])?V₊(F,[t₀,b]). We exhibit examples showing that the conclusions in this theorem are sharp, and that it produces new selections of bounded variation as compared with [V.V. Chistyakov, Selections of bounded variation, J. Appl. Anal. 10 (1) (2004) 1-82]. In contrast to this, a multifunction F satisfying e(F(s),F(t))?C(t−s) for some constant C?0 and all s,t∈[a,b] with s?t (Lipschitz continuity with respect to e(⋅,⋅)) admits a Lipschitz selection with a Lipschitz constant not exceeding C if t₀=a and may have only discontinuous selections of bounded variation if a<t₀?b. The same situation holds for continuous selections of when it is excess continuous in the sense that e(F(s),F(t))→0 as s→t−0 for all t∈(a,b] and e(F(t),F(s))→0 as s→t+0 for all t∈[a,b) simultaneously.     

既不含4-圈又不含6-圈的平面图的非正常染色

设d₁, d₂,..., d_k是k个非负整数. 若图G=(V,E)的顶点集V能被剖分成k个子集V₁, V₂,...,V_k, 使得对任意的i=1, 2,..., k, V_i的点导出子图G[V_i] 的最大度至多为d_i, 则称图G是(d₁, d₂,...,d_k)-可染的. 本文证明既不含4-圈又不含6-圈的平面图是(3, 0, 0)-和(1, 1, 0)-可染的.     

On bounds for eigenvalues of real symmetric matrices

Let A=(a_ij) be a real symmetric matrix of order n. We characterize all nonnegative vectors x=(x₁,...,x_n) and y=(y₁,...,y_n) such that any real symmetric matrix B=(b_ij), with b_ij=a_ij, i≠jhas its eigenvalues in the union of the intervals [b_ij?y_i, b_ij+ x_i]. Moreover, given such a set of intervals, we derive better bounds for the eigenvalues of B using the 2n quantities {b_ii?y, b_ii+x_i}, i=1,..., n.     

On the existence of Hadamard matrices

Given any natural number q > 3 we show there exists an integer t ? [2log₂(q ? 3)] such that an Hadamard matrix exists for every order 2^sq where s > t. The Hadamard conjecture is that s = 2.This means that for each q there is a finite number of orders 2^υq for which an Hadamard matrix is not known. This is the first time such a statement could be made for arbitrary q.In particular it is already known that an Hadamard matrix exists for each 2^sq where if q = 2^m ? 1 then s ? m, if q = 2^m + 3 (a prime power) then s ? m, if q = 2^m + 1 (a prime power) then s ? m + 1.It is also shown that all orthogonal designs of types (a, b, m ? a ? b) and (a, b), 0 ? a + b ? m, exist in orders m = 2^t and 2^t+2 · 3, t ? 1 a positive integer.     

Some reproducing identities for families of mean values

Gini, Lehmer, Beckenbach, and others studied the meanG _s (a, b) = (a ^s +b ^s )/(a ^{s 1} +b ^s-1 ) We proveTheorem 1 The identity (ina, b)G _s (G _t ,G _u ) =G _v holds if and only if (s, t, u, v) is (s, t, t, t) (the trivial solution) or one of (1, 1 –k, 1 +k, 1), (1/2, 1 –k, k, 1/2), or (0,–k, k, 0) (the exotic solutions,k is any real number)Theorem 2 IfP _s (a, b) is the power mean [(a ^s +b ^s )/2]^1/s , thenP _s (P _t ,P _u ) =P _v has only the trivial solution (s, t, u, v) = (s, t, t, t) and the exotic solution (0,t, –t, 0) The family of meansG _s (respP _s ) includes the classical arithmetic, geometric, and harmonic means     

Ein Beitrag Zum Ricci-Kalkül

Riassunto Sianos, t dei campi tensoriali antisi metrici sopra unan-varietà riamanniana orientata. Siano, rispettivamente,a eb i gradi dis et. Allora rot(s·t)=±(a+1)(grads)·(dual _{n−(b−a)−1} dual _b−a t) ±s·(dual _{n−(b−a)−1} div dual _b−a t), dove dual _i sono delle modificazioni dell’operatore ben noto dual. Cons⋎t=(duals)·t, il prodottos⋎t possiede delle proprità, sotto certi aspetti duali a quelle dei prodotto esterno,s⋏t. Discutendo il prodottos⋏t, si vede: l'operatore div ed il prodotto ⋎ corrispondono all’operatore rot e al prodotto ⋏.

---

Résumé Soients, t des champs tensoriels antisy métriques sur unen-variété riemannienne orientée. Soient, respectivement,a etb les degrés des ett. Alors rot(s·t)=±(a+1)(grads)·(dual _{n−(b−a)−1} dual _b−a t) ±s·(dual _{n−(b−a)−1} div dual _b−a t), où dual _i sont des modifications de l'opérateur connu dual. Avecs⋎t=(duali)·t, le produits⋎t possède des propriétés à certains égards duales à ceux du produit extérieur,s⋏t. En discutant le produits⋎t, l'on voit de plus: l'opérateur div et le produit ⋎ correspondent à l'opérateur rot et au produit ⋏.