Certain complexes associated to a sequence and a matrix

Let R be a commutative noetherian ring with unit. To a sequencex:=x₁,...,x_n of elements of R and an m-by-n matrix α:=(α_ij) with entries in R we assign a complex D*(x;α), in case that m=n or m=n?1. These complexes will provide us in certain cases with explicit minimal free resolutions of ideals, which are generated by the elements a_i:=∑α_ijx_j and the maximal minors of α.     

Disjoint skolem sequences and related disjoint structures

A Skolem sequence of order n is a sequence S = (s₁, s₂…, s²ⁿ) of 2n integers satisfying the following conditions: (1) for every k ∈ {1, 2,… n} there exist exactly two elements s_i,S_j such that S_i = S_j = k; (2) If s_i = s_j = k,i < j then j ? i = k. In this article we show the existence of disjoint Skolem, disjoint hooked Skolem, and disjoint near-Skolem sequences. Then we apply these concepts to the existence problems of disjoint cyclic Steiner and Mendelsohn triple systems and the existence of disjoint 1-covering designs. © 1993 John Wiley & Sons, Inc.     

Complementing and exactly covering sequences

The following is proved (in a slightly more general setting): Let α₁, …, α_m be positive real, γ₁, …, γ_m real, and suppose that the system [nα_i + γ_i], i = 1, …, m, n = 1, 2, …, contains every positive integer exactly once (= a complementing system). Then $\text{α}{}_{\mathrm{i}}\text{α}{}_{\mathrm{j}}$ is an integer for some i ≠ j in each of the following cases: (i) m = 3 and m = 4; (ii) m = 5 if all α_i but one are integers; (iii) m ? 5, two of the α_i are integers, at least one of them prime; (iv) m ? 5 and α_n ? 2ⁿ for n = 1, 2, …, m ? 4.For proving (iv), a method of reduction is developed which, given a complementing system of m sequences, leads under certain conditions to a derived complementing system of m ? 1 sequences.     

A subdeterminant inequality for normal matrices

Let A be an n × n normal matrix over $\text{C}$, and Q_m, _n be the set of strictly increasing integer sequences of length m chosen from 1,…,n. For α, β ? Q_m, _n denote by A[α|β] the submatrix obtained from A by using rows numbered α and columns numbered β. For k ? {0, 1,…, m} we write |α∩β| = k if there exists a rearrangement of 1,…, m, say i₁,…, i_k, i_k+1,…, i_m, such that α(i_j) = β(i_j), i = 1,…, k, and {α(i_k+1),…, α(i_m) } ∩ {β(i_k+1),…, β(i_m) } = ?. A new bound for |detA[α|β ]| is obtained in terms of the eigenvalues of A when 2m = n and |α∩β| = 0.Let $\text{U}$_n be the group of n × n unitary matrices. Define the nonnegative number

where | α ∩ β| = k. It is proved that

Let A be semidefinite hermitian. We conjecture that ρ₀(A) ? ρ₁(A) ? ··· ? ρ_m(A). These inequalities have been tested by machine calculations.     

Phase reconstruction from magnitude of band-limited multidimensional signals

In this paper, the problem of phase reconstruction from magnitude of multidimensional band-limited functions is considered. It is shown that any irreducible band-limited function f(z₁…,z_n), z_i ? $\text{C}$, i=1, …, n, is uniquely determined from the magnitude of f(x₁…,x_n): | f(x₁…,x_n)|, x_i ? $\text{R}$, i=1,…, n, except for (1) linear shifts: ^{i(α1z1+…+α_n2n+β}), β, α_i?$\text{R}$, i=1,…, n; and (2) conjugation: $\text{f}{}^1\text{(z}{}_1{}^1\text{,…,z}{}_{\mathrm{n}}{}^1\text{)}$.     

Most primitive groups have messy invariants

Suppose G is a finite group of complex n × n matrices, and let R^G be the ring of invariants of G: i.e., those polynomials fixed by G. Many authors, from Klein to the present day, have described R^G by writing it as a direct sum Σ^δ_j=1 η_j$\text{C}$[θ₁ ,…, θ_n]. For example, if G is a unitary group generated by reflections, δ = 1. In this note we show that in general this approach is hopeless by proving that, for any ? > 0, the smallest possible δ is greater than | G |^n-1-? for almost all primitive groups. Since for any group we can choose δ ? | G |^n-1, this means that most primitive groups are about as bad as they can be. The upper bound on δ follows from Dade's theorem that the θ_i can be chosen to have degrees dividing | G |.     

Subsets of a finite set that intersect each other in at most one element

In this paper we study de Bruijn-Erdös type theorems that deal with the foundations of finite geometries. The following theorem is one of our main conclusions. Let S₁,…, S_n be n subsets of an n-set S. Suppose that |S_i| ? 3 (i = 1,…,n) and that |S_i ∩ S_j| ? 1 (i ≠ j;i,j = 1,…,n). Suppose further that each S_i has nonempty intersection with at least n ? 2 of the other subsets. Then the subsets S₁,…,S_n of S are one of the following configurations. (1) They are a finite projective plane. (2) They are a symmetric group divisible design and each subset has nonempty intersection with exactly n ? 2 of the other subsets. (3) We have n = 9 or n = 10 and in each case there exists a unique configuration that does not satisfy (1) or (2).     

Asymptotically optimal empirical bayes procedures for selecting good

Let ∏₁,…,∏_k denote k independent populations, where a random observation from population ∏ _i has a uniform distribution over the interval (0,θ _i ) and θ _i is a realization of a random variable having an unknown prior distribution G _i . Population ∏ _i is said to be a good population if θ _i ≥θ₀, where θ₀ is a given, positive number. This paper provides a sequence of empirical Bayes procedures for selecting the good populationsamong ∏₁,…,∏ _k . It is shown that these procedures are asymptotically optimal and that the order of associated convergence rates is O(n^-r/4) for some r, 0<r<2, where n is the number of accumulated past observations

at hand     

Monotonicity of permanents of direct sums of doubly stochastic matrices

Let Ωn be the set of all n × n doubly stochastic matrices, let J_n be the n × n matrix all of whose entries are 1/n and let σ _k (A) denote the sum of the permanent of all k × k submatrices of A. It has been conjectured that if A ε Ω _n and A ≠ J_J then g_A,k (θ) ? σ _k ((1 θ)J_n 1 θA) is strictly increasing on [0,1] for k = 2,3,…,n. We show that if A = A ₁ ⊕ ⊕A_t (t ≥ 2) is an n × n matrix where A_i for i = 1,2, …,t, and if for each i g_Ai,ki (θ) is non-decreasing on [0.1] for k_t = 2,3,…,n_i , then g_A,k (θ) is strictly increasing on [0,1] for k = 2,3,…,n.     

Group of units of group algebras

By a right (left resp.) S_2n-polynomial we mean a multilinear polynomial f(X₁,…, X_t) over the ring of integers with noncommuting in-determinates X_isuch that for any prime ring R if f( X₁,…, X _t) is a PI of some nonzero right (left resp.) ideal of R, then R satisfies S_2nthe standard identity of degree 2n. In this paper we prove the theorem:Let R be a prime ring, d a nonzero derivation of R, L a noncommutative Lie ideal of R and f(X₁,…, X_t) a right or left S_2n-polynomial. Suppose that f(d( u₁)ⁿ¹,…,d(u_t)^nt)=0 for all u_iu,_i[d] L, where n₁,…,n_tare fixed positive integers. Then R satisfies S_2n+2. Also, the one-sided version of the theorem is given.     

A new inequality for symmetric functions

Let x_i ≥ 0, y_i ≥ 0 for i = 1,…, n; and let a_j(x) be the elementary symmetric function of n variables given by a_j(x) = ∑_{1 ≤ ii < … <ij ≤ n}x_ii … x_ij. Define the partical ordering x <y if a_j(x) ≤ a_j(y), j = 1,… n. We show that $\text{x}\text{\$}\text{?}\text{y ? x}{}^{\mathrm{\alpha }}\text{\$}\text{?}\text{y}{}^{\mathrm{\alpha }}\text{, 0}\text{\$}\text{?}\text{α ≤ 1}$, where {x^α}_i = x^α_i. We also give a necessary and sufficient condition on a function f(t) such that x <y ? f(x) <f(y). Both results depend crucially on the following: If x <y there exists a piecewise differentiable path z(t), with z_i(t) ≥ 0, such that z(0) = x, z(1) = y, and z(s) <z(t) if 0 ≤ s ≤ t ≤ 1.     

Topologies on products of partially ordered sets I: Interval topologies

Given a certain construction principle assigning to each partially ordered setP some topology θ(P) onP, one may ask under what circumstances the topology θ(P) of a productP = ?_j∈J P _j of partially ordered setsP _i agrees with the product topology ?_j∈Jθ(P _i) onP. We shall discuss this question for several types ofinterval topologies (Part I), forideal topologies (Part II), and fororder topologies (Part III). Some of the results contained in this first part are listed below:

1. Let θ_i(P) denote thesegment topology. For any family of posetsP _j ?_j∈Jθ_s(P_j)=θ_s(?_j∈JP_i) iff at most a finite number of theP _j has more than one element (1.1).
2. Let θ_cs(P) denote theco-segment topology (lower topology). For any family of lower directed posetsP _j ?_j∈Jθ_cs(P_i)=θ_cs(?_j∈JP_i) iff eachP _j has a least element (1.5).
3. Let θ_i(P) denote theinterval topology. For a finite family of chainsP _j,P _j ?_j∈Jθ_i(P_i)=θ_i(?_j∈JP_i) iff for allj∈k, P _j has a greatest element orP _k has a least element (2.11).
4. Let θ_ni(P) denote thenew interval topology. For any family of posetsP _j,P _j ?_j∈Jθ_ni(P_j)=θ_ni(?_j∈JP_j) whenever the product space is ab-space (i.e. a space where the closure of any subsetY is the union of all closures of bounded subsets ofY) (3.13).

In the case oflattices, some of the results presented in this paper are well-known and have been shown earlier in the literature. However, the case of arbitraryposets often proved to be more difficult.     

Δ-Monotone arrangements of real numbers

Given a set of M × N real numbers, can these always be labeled as x_i,j; i = 1,…, M; j = 1,…, N; such that x_i+1,j+1 ? x_i+1,j ? x_i,j+1 + x_ij ≥ 0, for every (i, j) where 1 ≤ i ≤ M ? 1, 1 ≤ j ≤ N ? 1? For M = N = 3, or smaller values of M, N it is shown that there is a “uniform” rule. However, for max(M, N) > 3 and min(M, N) ≥ 3, it is proved that no uniform rule can be given. For M = 3, N = 4 a way of labeling is demonstrated. For general M, N the problem is still open although, for a special case where all the numbers are 0's and 1's, a solution is given.     

Optimal labelling of a product of two paths

If G is a graph with p vertices and at least one edge, we set φ (G) = m n max |f(u) ? f(v)|, where the maximum is taken over all edges uv and the minimum over all one-to-one mappings f : V(G) → {1, 2, …, p}: V(G) denotes the set of vertices of G.P_n will denote a path of length n whose vertices are integers 1, 2, …, n with i adjacent to j if and only if |i ? j| = 1. P_m × P_n will denote a graph whose vertices are elements of {1, 2, …, m} × {1, 2, …, n} and in which (i, j), (r, s) are adjacent whenever either i = r and |j ? s| = 1 or j = s and |i ? r| = 1.Theorem.If max(m, n) ? 2, thenφ(P_m × P_n) = min(m, n).     

On bipartite 2‐factorizations of kn − I and the Oberwolfach problem

It is shown that if F₁, F₂, …, F_t are bipartite 2‐regular graphs of order n and α₁, α₂, …, α_t are positive integers such that α₁ + α₂ + ? + α_t = (n ? 2)/2, α₁≥3 is odd, and α_i is even for i = 2, 3, …, t, then there exists a 2‐factorization of K_n ? I in which there are exactly α_i 2‐factors isomorphic to F_i for i = 1, 2, …, t. This result completes the solution of the Oberwolfach problem for bipartite 2‐factors. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:22‐37, 2011     

Presentations of alternating semigroups

One presentation of the alternating groupA _n hasn?2 generatorss ₁,…,s_n?2 and relationss ₁ ³ =s _i ² =(s_1?1s_i)³=(s_js_k)²=1, wherei>1 and |j?k|>1. Against this backdrop, a presentation of the alternating semigroupA _n ^c )A _n is introduced: It hasn?1 generatorss ₁,…,S _n?2,e, theA _n-relations (above), and relationse ²=e, (es ₁)⁴, (es _j)²=(es _j)⁴,es _i=s _i s ₁ ^-1 es ₁, wherej>1 andi≥1.