Resolutions of Stanley-Reisner rings and Alexander duality

Associated to any simplicial complex Δ on n vertices is a square-free monomial ideal I_Δ in the polynomial ring A = k[x₁, …, x_n], and its quotient k[Δ] = A/I_Δ known as the Stanley-Reisner ring. This note considers a simplicial complex Δ^* which is in a sense a canonical Alexander dual to Δ, previously considered in [1, 5]. Using Alexander duality and a result of Hochster computing the Betti numbers dim_k Tor_i^A (k[Δ],k), it is shown (Proposition 1) that these Betti numbers are computable from the homology of links of faces in Δ^*. As corollaries, we prove that I_Δ has a linear resolution as A-module if and only if Δ^* is Cohen-Macaulay over k, and show how to compute the Betti numbers dim_k Tor_i^A (k[Δ],k) in some cases where Δ^* is wellbehaved (shellable, Cohen-Macaulay, or Buchsbaum). Some other applications of the notion of shellability are also discussed.     

Elasticity of factorizations in integral domains

For an atomic integral domain R, define(R)=sup{mn|x₁x_m=y₁y_n, each x_i,y_jεR is irreducible}. We investigate (R), with emphasis for Krull domains R. When R is a Krull domain, we determine lower and upper bounds for (R); in particular,(R)≤max{|Cl(R)| 2, 1}. Moreover, we show that for any real numbers r≥1 or R=∞, there is a Dedekind domain R with torsion class group such that (R)=r.     

Invariant record processes and applications to best choice modelling

Let X₁, X₂,…be identically distributed random variables from an unknown continuous distribution. Further let I_r(1), I_r(2),…be a sequence of indicator functions defined on X₁, X₂,…by I_r(k) = 0 if k < r, I_r(k) = 1 if X_k is a r-record AND = 0 otherwise. Suppose that we observe X₁, X₂,… at times T₁ < T₂ <… where the T_k's are realisations of some regular counting process (N(τ)) defined on the positive half-line. Having observed [0, τ], say, the problem is to predict the future behaviour of the counting processes (R_r(τ, s))_sτ = # r-records in [τ, s]. More specifically the objective of this paper is to show that these processes can be (inhomogeneous) Poisson processes even if (N(τ))_τ0 has dependent increments.

The strong link between optimal selection and optimal stopping of record sequences or record processes, perhaps not fully recognized so far, is pointed out in this paper. It is shown to lead to a unification of the treatment of problems which, at first sight, are rather different. Moreover the stopping of record processes in continuous time can lead to rigorous and elegant solutions in cases where dynamic programming is bound to fail. Several examples will be given to facilitate a comparison with other methods.     

Singularity categories with respect to Ding projective modules

We introduce the singularity category with respect to Ding projective modules, D_(dpsg)~b(R),as the Verdier quotient of Ding derived category D_(DP)~b(R) by triangulated subcategory K~b(DP), and give some triangle equivalences. Assume DP is precovering. We show that D_(DP)~b(R)≌K~(-,dpb)(DP)and D_(dpsg)~b(R)≌D_(Ddefect)~b(R). We prove that each R-module is of finite Ding projective dimension if and only if D_(dpsg)~b(R) = 0.     

π-Armendariz rings relative to a monoid

Let Mbe a monoid. A ring Ris called M-π-Armendariz if whenever α = a₁g₁+ a₂g₂+ · · · + a_ng_n, β = b₁h₁+ b₂h₂+ · · · + b_mh_m ∈ R[M] satisfy αβ ∈ nil(R[M]), then aibj ∈ nil(R) for all i, j. A ring R is called weakly 2-primal if the set of nilpotent elements in R coincides with its Levitzki radical. In this paper, we consider some extensions of M-π-Armendariz rings and further investigate their properties under the condition that R is weakly 2-primal. We prove that if R is an M-π-Armendariz ring then nil(R[M]) = nil(R)[M]. Moreover, we study the relationship between the weak zip-property (resp., weak APP-property, nilpotent p.p.-property, weak associated prime property) of a ring R and that of the monoid ring R[M] in case R is M-π-Armendariz.     

Upper bounds for Ramsey numbers

The Ramsey number R(G₁,G₂,…,G_k) is the least integer p so that for any k-edge coloring of the complete graph K_p, there is a monochromatic copy of G_i of color i. In this paper, we derive upper bounds of R(G₁,G₂,…,G_k) for certain graphs G_i. In particular, these bounds show that R(9,9)6588 and R(10,10)23556 improving the previous best bounds of 6625 and 23854.     

New families of exact solitary patterns solutions for the nonlinearly dispersive R(m,n) equations

The R(m,n) equations u_tt+a(uⁿ)_xx+b(u^m)_xxtt=0 (a, b const) are investigated by using some ansatze. As a result, new exact solitary patterns solutions and solitary wave solutions are obtained. These obtained solutions show that not only the nonlinearly dispersive R(m,m) equations (m≠1) but also the linearly dispersive R(1,n) equations (m=1) possess solitary patterns solutions, which has infinite slopes or cusps and solitary wave solutions.     

A sufficient and necessary condition for an OWA bag mapping having the self-identity

A mapping ƒ : _n=1^∞Iⁿ → I is called a bag mapping having the self-identity if for every (x₁,…,x_n) ε _i=1^∞Iⁿ we have (1) ƒ(x₁,…,x_n) = ƒ(x_i1,…,x_in) for any arrangement (i₁,…,i_n) of {1,…,n}; monotonic; (3) ƒ(x₁,…,x_n, ƒ(x₁,…,x_n)) = ƒ(x₁,…,x_n). Let {ω_i,n : I = 1,…,n;n = 1,2,…} be a family of non-negative real numbers satisfying Σ_i=1ⁿω_i,n = 1 for every n. Then one calls the mapping ƒ : _i=1^∞Iⁿ → I defined as follows an OWA bag mapping: for every (x₁,…,x_n) ε _i=1^∞Iⁿ, ƒ(x₁,…,x_n) = Σ_i=1ⁿω_i,ny_i, where y_i is the it largest element in the set {x₁,…,x_n}. In this paper, we give a sufficient and necessary condition for an OWA bag mapping having the self-identity.     

Hilbert bases of cuts

Let X be a set of vectors in R^m. X is said to be a Hilbert base if every vector in R^m which can be written both as a linear combination of members of X with nonnegative coefficients and as a linear combination with integer coefficients can also be written as a linear combination with nonnegative integer coefficients. Denote by H the collection of the graphs whose family of cuts is a Hilbert base. It is known that K₅ and graphs with no K₅-minor belong to H and that K₆ does not belong to H. We show that every proper subgraph of K₆ belongs to H and that every graph from H does not have K₆ as a minor. We also study how the class H behaves under several operations.     

On extensions of the domain invariance theorem

If f maps continuously a compact subset X of Rⁿ into Rⁿ and x is a point whose distance from the boundary ∂X is greater than double diameter of the fibres of the points in f(∂X) then f(x) is in the interior of f(X). This theorem extends some results due to Borsuk and Sitnikov.     

Compatibilité entre structures d''intervalles et relations d''orde

Compatibility between interval structures and partial orderings.

If H=(X,E) is a hypergraph, n the cardinality of X,I_n the ordered set {1..n} and < an order relation on X, we call F(X,<) the set of the one-to-one functions from X to I_n which are compatible with <. If AI_n we denote by (A) the length of the smallest interval of I_n which contains A.

We first deal with the following problem: Find ƒF(X,<) which minimise . The a_e, eR are positive coefficients.

This problem can be understood as a scheduling problem and is checked to be NP-complete. We learn how to recognize in polynomial time those hypergraphs H=(X,E) which induce an optimal value of z min equal to .

Next we work on a dual question which arises about interval graphs, when some partial orderings on the vertex set of these graphs intend to represent inclusion, overlapping or anteriority relations between closed intervals of the real line.     

Stability of Periodic Orbits and Return Trajectories of Continuous Multi-valued Maps on Intervals

Let I be a compact interval of real axis R, and(I, H) be the metric space of all nonempty closed subintervals of I with the Hausdorff metric H and f : I → I be a continuous multi-valued map. Assume that Pn =(x_0, x_1,..., xn) is a return tra jectory of f and that p ∈ [min Pn, max Pn] with p ∈ f(p). In this paper, we show that if there exist k(≥ 1) centripetal point pairs of f(relative to p)in {(x_i; x_i+1) : 0 ≤ i ≤ n-1} and n = sk + r(0 ≤ r ≤ k-1), then f has an R-periodic orbit, where R = s + 1 if s is even, and R = s if s is odd and r = 0, and R = s + 2 if s is odd and r 0. Besides,we also study stability of periodic orbits of continuous multi-valued maps from I to I.     

A parallel computing scheme for minimizing a class of large scale functions

This paper gives a parallel computing scheme for minimizing a twice continuously differentiable function with the form

where x = (x^T₁,…,x^T_m)^T and x_i R^n_i, ∑^m_{i = 1}n_i = n, and n a very big number. It is proved that we may use m parallel processors and an iterative procedure to find a minimizer of ƒ(x). The convergence and convergence rate are given under some conditions. The conditions for finding a global minimizer of ƒ(x by using this scheme are given, too. A similar scheme can also be used parallelly to solve a large scale system of nonlinear equations in the similar way. A more general case is also investigated.     

Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix

Let A be a positive definite, symmetric matrix. We wish to determine the largest eigenvalue, λ₁. We consider the power method, i.e. that of choosing a vector v₀ and setting v_k = A^kv₀; then the Rayleigh quotients R_k = (Av_k, v_k)/(v_k, v_k) usually converge to λ₁ as k → ∞ (here (u, v) denotes their inner product). In this paper we give two methods for determining how close R_k is to λ₁. They are both based on a bound on λ₁ − R_k involving the difference of two consecutive Rayleigh quotients and a quantity ω_k. While we do not know how to directly calculate ω_k, we can given an algorithm for giving a good upper bound on it, at least with high probability. This leads to an upper bound for λ₁ − R_k which is proportional to (λ₂/λ₁)^2k, which holds with a prescribed probability (the prescribed probability being an arbitrary δ > 0, with the upper bound depending on δ).     

Ramsey linear families and generalized subdivided graphs

The following results are obtained. (i) Let p, d, and k be fixed positive integers, and let G be a graph whose vertex set can be partitioned into parts V₁, V₂,…, V_a such that for each i at most d vertices in V₁ … V_i have neighbors in V_i+1 and r(K_k, V_i) p | V(G) |, where V_i denotes the subgraph of G induced by V_i. Then there exists a number c depending only on p, d, and k such that r(K_k, G)c | V(G) |. (ii) Let d be a positive integer and let G be a graph in which there is an independent set I V(G) such that each component of G−I has at most d vertices and at most two neighbors in I. Then r(G,G)c | V(G) |, where c is a number depending only on d. As a special case, r(G, G) 6 | V(G) | for a graph G in which all vertices of degree at least three are independent. The constant 6 cannot be replaced by one less than 4.     

Wiener–Hopf factorization for a group of exponentials of nilpotent matrices

A complete study of the generalized factorization for a group of 2×2 matrix functions of the form G=I+γN, where , I denotes the 2×2 identity matrix and N represents a rational nilpotent matrix function, is presented. A closely related class involving the same matrix N is also studied. The canonical and non-canonical factorizations are considered and explicit formulas are obtained for the partial indices and the factors in such factorizations. It is shown in particular that only one of the columns in the factors needs to be determined, as a solution to a homogeneous linear Riemann–Hilbert problem, the other column being expressed in terms of the first. Necessary and sufficient conditions for existence of a canonical factorization within the same class are established, as well as explicit formulas for the factors in this case.     

A new class of fuzzy implications. Axioms of fuzzy implication revisited

Many different fuzzy implication operators have been proposed; most of them fit into one of the two classes: implication operations that are based on an explicit representation of implication A → B in terms of &, , and ¬ (e.g., S-implications that are based on the formula B ¬ A), and R-implications that are based on an implicit representation of implication A → B as the weakest C for which C&B implies A. However, some fuzzy implication operations (such as b^a) cannot be naturally represented in this form. To describe such operations, we propose a new (third) class of implication operations called A-implications whose relation to &, , and ¬ is described by (implicit) axioms.     

On the Glivenko–Cantelli theorem for generalized empirical processes based on strong mixing sequences

Given \s{X_i, i 1\s} as non-stationary strong mixing (n.s.s.m.) sequence of random variables (r.v.'s) let, for 1 i n and some γ ε [0, 1],

F₁(x)=γP(X_i<x)+(1-γ)P(X_ix)

and

I_i(x)=γI(X_i<x)+(1-γ)I(X_ix)

. For any real sequence \s{C_i\s} satisfying certain conditions, let

.

In this paper an exponential type of bound for P(D_n ), for any >0, and a rate for the almost sure convergence of D_n are obtained under strong mixing. These results generalize those of Singh (1975) for the independent and non-identically distributed sequence of r.v.'s to the case of strong mixing.     

Kernel structure of Toeplitz-plus-Hankel matrices

The structure of the kernel of block Toeplitz-plus-Hankel matrices R=[a_j−k+b_j+k], where a_j and b_j are the given p×q blocks with entries from a given field, is investigated. It is shown that R corresponds to two systems of at most p+q vector polynomials from which a basis of the kernel of R and all other Toeplitz-plus-Hankel matrices with the same parameters a_j and b_j can be built. The main result is an analogue of a known kernel structure theorem for block Toeplitz and block Hankel matrices.