A reversal index for tournament matrices *

Given a tournament matrix T, its reversal indexi_R (T), is the minimum k such that the reversal of the orientation of k arcs in the directed graph associated with T results in a reducible matrix. We give a formula for i_R (T) in terms of the score vector of T which generalizes a simple criterion for a tournament matrix to be irreducible. We show that i_R (T)≤[(n?1)/2] for any tournament matrix T of order n, with equality holding if and only if T is regular or almost regular, according as n is odd or even. We construct, for each k between 1 and [(n?1)/2], a tournament matrix of order n whose reversal index is k. Finally, we suggest a few problems.     

A bound for the number of tournaments with specified scores

Let $\text{T}$(R) denote the set of all tournaments with score vector R = (r₁, r₂,…, r_n). R. A. Brualdi and Li Qiao (“Proceedings of the Silver Jubilee Conference in Combinatorics at Waterloo,” in press) conjectured that if R is strong with r₁ ≤ r₂ ≤ … ≤ r_n, then |$\text{T}$(R)| ≥ 2^n?2 with equality if and only if R = (1, 1, 2,…, n ? 3, n ? 2, n ? 2). In this paper their conjecture is proved, and this result is used to establish a lower bound on the cardinality of $\text{T}$(R) for every R.     

Score vectors of tournaments

A tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ? T and (b) if x ≠ y then (x, y) ∈ T iff (y, x) ? T. The score vector of T is the cardinal valued function defined by R(x) = |{y ∈ X : (x, y) ∈ T}|. We present theorems for infinite tournaments analogous to Landau's necessary and sufficient conditions that a vector be the score vector for some finite tournament. Included also is a new proof of Landau's theorem based on a simple application of the “marriage” theorem.     

Endpoint estimates for the commutator of pseudo-differential operators

It is well known that the commutator Tb of the Calderón-Zygmund singular integral operator is bounded on L^p(Rⁿ) for 1 < p < +∞ if and only if b ∈ BMO [1]. On the other hand, the commutator T_b is bounded from H¹(Rⁿ) into L¹(Rⁿ) only if the function b is a constant [2]. In this article, we will discuss the boundedness of commutator of certain pseudo-differential operators on Hardy spaces H¹. Let T^σ be the operators that its symbol is S⁰_1,δ with 0 ≤ δ < 1, if b ∈ LMO_∞, then, the commutator [b, T^σ] is bounded from H¹(Rⁿ) into L¹(Rⁿ) and from L¹(Rⁿ) into BMO(Rⁿ); If [b, T^σ] is bounded from H¹(Rⁿ) into L¹(Rⁿ) or L¹(Rⁿ) into BMO(Rⁿ), then, b ∈ LMO_loc.     

On the maximum cardinality of a consistent set of arcs in a random tournament

For any tournament T on n vertices, let h(T) denote the maximum number of edges in the intersection of T with a transitive tournament on the same vertex set. Sharpening a previous result of Spencer, it is proved that, if T_n denotes the random tournament on n vertices, then, $\text{P}$$\text{(h(T}{}_{\mathrm{n}}\text{) ≤}\text{1}\text{2}\text{(}{}_2{}^{\mathrm{n}}\text{) + 1.73n}{}^{\mathrm{<mtext>3</mtext><mtext>2</mtext>}}\text{) → 1}$ as n → ∞.     

Quintasymptotic primes and four results of Schenzel

Let I be an ideal in a Noetherian ring R, let (I)_a be the integral closure of I, and let S be a multiplicatively closed subset of R. Let T₁, T₂, and T₃ be the topologies given by the filtrations {Iⁿ R_S ∩ R | n ≥ 1}, {Iⁿ | n ≥ 1}, and {(Iⁿ)_a | n ≥ 1}. We g results due to Schenzel, characterizing when T₁ is either equivalent or linearly equivalent to either of T₂ or T₃. The characterizations involve the sets of essential primes of I, quintessential primes of I, asymptotic primes of I, and quintasymptotic primes of I.     

Maximum Distance Between Slater Orders and Copeland Orders of Tournaments

Given a tournament T?=?(X, A), we consider two tournament solutions applied to T: Slater’s solution and Copeland’s solution. Slater’s solution consists in determining the linear orders obtained by reversing a minimum number of directed edges of T in order to make T transitive. Copeland’s solution applied to T ranks the vertices of T according to their decreasing out-degrees. The aim of this paper is to compare the results provided by these two methods: to which extent can they lead to different orders? We consider three cases: T is any tournament, T is strongly connected, T has only one Slater order. For each one of these three cases, we specify the maximum of the symmetric difference distance between Slater orders and Copeland orders. More precisely, thanks to a result dealing with arc-disjoint circuits in circular tournaments, we show that this maximum is equal to n(n???1)/2 if T is any tournament on an odd number n of vertices, to (n ²???3n?+?2)/2 if T is any tournament on an even number n of vertices, to n(n???1)/2 if T is strongly connected with an odd number n of vertices, to (n ²???3n???2)/2 if T is strongly connected with an even number n of vertices greater than or equal to 8, to (n ²???5n?+?6)/2 if T has an odd number n of vertices and only one Slater order, to (n ²???5n?+?8)/2 if T has an even number n of vertices and only one Slater order.     

A problem on arcs without bypasses in tournaments

An arc $\text{xy}$ in a tournament is bad if there exists no path of length two from x to y. Formulas are found for the number of tournaments T_n whose bad arcs determine a spanning cycle or path.     

A note on a class of extensions

An extensionR?T of commutative integral domains is called a Δ₀-extension, provided each intermediateR-module is actually an intermediate ring, and an extensionR?T is called quadratic if eacht∈T satisfies a monic quadratic polynomial overR. Our purpose is to investigate these extensions in the context of Prüfer domains.     

Coherence relative to a weak torsion class

Let R be a ring. A subclass T of left R-modules is called a weak torsion class if it is closed under homomorphic images and extensions. Let T be a weak torsion class of left R-modules and n a positive integer. Then a left R-module M is called T-finitely generated if there exists a finitely generated submodule N such that M/N ∈ T; a left R-module A is called (T,n)-presented if there exists an exact sequence of left R-modules

$$0 \to {K_{n - 1}} \to {F_{n - 1}} \to \cdots \to {F_1} \to {F_0} \to M \to 0$$

such that F₀,..., F_n?1 are finitely generated free and K_n?1 is T-finitely generated; a left R-module M is called (T,n)-injective, if Ext ⁿ _R (A,M) = 0 for each (T, n+1)-presented left R-module A; a right R-module M is called (T,n)-flat, if Tor ^R _n (M,A) = 0 for each (T, n+1)-presented left R-module A. A ring R is called (T,n)-coherent, if every (T, n+1)-presented module is (n + 1)-presented. Some characterizations and properties of these modules and rings are given.

     

Main Q-eigenvalues and generalized Q-cospectrality of graphs

Let Q ^G denote the signless Laplacian matrix of a graph G. An eigenvalue μ of Q ^G is said to be a main Q-eigenvalue of G if μ has an eigenvector which is not orthogonal to an all-ones vector e. We give some basic properties of main Q-eigenvalues. For a graph G of order n, G is called Q-controllable if G has n distinct main Q-eigenvalues. We show that a graph H is generalized Q-cospectral with a Q-controllable G if and only if H is Q-controllable and there exists a unique rational orthogonal matrix R such that R _e = e, Q _H = R ^? Q _G R.     

Linear preservers of row-dense matrices

Let M_m,n be the set of all m × n real matrices. A matrix A ∈ M_m,n is said to be row-dense if there are no zeros between two nonzero entries for every row of this matrix. We find the structure of linear functions T: M_m,n → M_m,n that preserve or strongly preserve row-dense matrices, i.e., T(A) is row-dense whenever A is row-dense or T(A) is row-dense if and only if A is row-dense, respectively. Similarly, a matrix A ∈ M_n,m is called a column-dense matrix if every column of A is a column-dense vector. At the end, the structure of linear preservers (strong linear preservers) of column-dense matrices is found.     

On universally catenarian pairs

If 1≤n<∞ and R⊆S are integral domains, then (R,S) is called an n-catenarian pair if for each intermediate ring T (that is each ring T such that R⊆T⊆S) the polynomial ring in n indeterminates, T[n] is catenarian. This implies that (R,S) is m-catenarian for all m<n. The main purpose of this paper is to prove that 1-catenarian and universally catenarian pairs are equivalent in several cases. An example of a 1-catenarian pair which is not 2-catenarian is given.     

The Number of Out-Pancyclic Vertices in a Strong Tournament

An arc in a tournament T with n ≥ 3 vertices is called pancyclic, if it belongs to a cycle of length l for all 3 ≤ l ≤ n. We call a vertex u of T an out-pancyclic vertex of T, if each out-arc of u is pancyclic in T. Yao et al. (Discrete Appl. Math. 99, 245–249, 2000) proved that every strong tournament contains an out-pancyclic vertex. For strong tournaments with minimum out-degree 1, Yao et al. found an infinite class of strong tournaments, each of which contains exactly one out-pancyclic vertex. In this paper, we prove that every strong tournament with minimum out-degree at least 2 contains three out-pancyclic vertices. Our result is best possible since there is an infinite family of strong tournaments with minimum degree at least 2 and no more than 3 out-pancyclic vertices.     

Coherence and Generalized Morphic Property of Triangular Matrix Rings

Let R be a ring. R is left coherent if each of its finitely generated left ideals is finitely presented. R is called left generalized morphic if for every element a in R, l(a) = Rb for some b ∈ R, where l(a) denotes the left annihilator of a in R. The main aim of this article is to investigate the coherence and the generalized morphic property of the upper triangular matrix ring T _n (R) (n ≥ 1). It is shown that R is left coherent if and only if T _n (R) is left coherent for each n ≥ 1 if and only if T _n (R) is left coherent for some n ≥ 1. And an equivalent condition is obtained for T _n (R) to be left generalized morphic. Moreover, it is proved that R is left coherent and left Bézout if and only if T _n (R) is left generalized morphic for each n ≥ 1.     

Integral Domains with Highly Nonunique Factorization

For a positive integer n, an atomic integral domain R is defined to be completely non- n- factorial if for any n atoms a₁…, a_n, the product a₁ … a _n has as highly nonunique a factorization into atoms as possible in that given any n ? 1 atoms b₁,…, b_{nt - 1}, b₁ … b _n? 1¦a₁ … a _n. We show that R is completely non-n-factorial for some n ≥ 2 if and only if (R, M) is a quasilocal domain with [M: M] a DVR having M as its maximal ideal.     

Calderón-Zygmund operators on product Hardy spaces

Let T be a product Calderón-Zygmund singular integral introduced by Journé. Using an elegant rectangle atomic decomposition of Hp(Rn×Rm) and Journé's geometric covering lemma, R. Fefferman proved the remarkable Hp(Rn×Rm)−Lp(Rn×Rm) boundedness of T. In this paper we apply vector-valued singular integral, Calderón's identity, Littlewood-Paley theory and the almost orthogonality together with Fefferman's rectangle atomic decomposition and Journé's covering lemma to show that T is bounded on product Hp(Rn×Rm) for if and only if , where ε is the regularity exponent of the kernel of T.     

Idempotence preserving maps on spaces of triangular matrices

SupposeF is an arbitrary field. Let |F| be the number of the elements ofF. LetT _n (F) be the space of allnxn upper-triangular matrices overF. A map Ψ: T _N (F) → T _N (F) is said to preserve idempotence ifA - λ B is idempotent if and only if Ψ(A) - λΨ(B) is idempotent for anyA, B ∈ T _n (F) and λ ∈ F. It is shown that: when the characteristic ofF is not 2, |F|>3 and n ≥ 3, Ψ:T _n (F) → T _n (F) is a map preserving idempotence if and only if there exists an invertible matrixP τ T _n (F) such that either ?(A) = PAP ^?1 for everyA ∈ T _n (F) or Ψ(A) = PJA ^t JP ^?1 for everyA ∈ T _n (F), whereJ = ∑ _n=1 ⁿ E _i,n+1?i and E_ij is the matrix with 1 in the (i,j)th entry and 0 elsewhere.     

On the 3-kings and 4-kings in multipartite tournaments

Koh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-king in [K.M. Koh, B.P. Tan, Kings in multipartite tournaments, Discrete Math. 147 (1995) 171-183, Theorem 2]. In Theorem 1 of this paper, we extend this result to n-partite tournaments, where n?3. In [K.M. Koh, B.P. Tan, Number of 4-kings in bipartite tournaments with no 3-kings, Discrete Math. 154 (1996) 281-287, K.M. Koh, B.P. Tan, The number of kings in a multipartite tournament, Discrete Math. 167/168 (1997) 411-418] Koh and Tan showed that in any n-partite tournament with no transmitters and 3-kings, where n?2, the number of 4-kings is at least eight, and completely characterized all n-partite tournaments having exactly eight 4-kings and no 3-kings. Using Theorem 1, we strengthen substantially the above result for n?3. Motivated by the strengthened result, we further show that in any n-partite tournament T with no transmitters and 3-kings, where n?3, if there are r partite sets of T which contain 4-kings, where 3?r?n, then the number of 4-kings in T is at least r+8. An example is given to justify that the lower bound is sharp.     

Hyperamarts: Conditions for regularity of continuous parameter processes

The regularity of trajectories of continuous parameter process (X_t)_t∈R+ in terms of the convergence of sequence E(X_Tn) for monotone sequences (T_n) of stopping times is investigated. The following result for the discrete parameter case generalizes the convergence theorems for closed martingales: For an adapted sequence (X_n)_1≤n≤∞ of integrable random variables, lim X_n exists and is equal to X_∞ and (X_T) is uniformly integrable over the set of all extended stopping times T, if and only if lim E(X_Tn) = E(X_∞) for every increasing sequence (T_n) of extended simple stopping times converging to ∞. By applying these discrete parameter theorems, convergence theorems about continuous parameter processes are obtained. For example, it is shown that a progressive, optionally separable process (X_t)_t∈R+ with E{X_T} < ∞ for every bounded stopping time T is right continuous if lim E(X_Tn) = E(X_T) for every bounded stopping time T and every descending sequence (T_n) of bounded stopping times converging to T. Also, Riesz decomposition of a hyperamart is obtained.