In this paper, we prove lower and upper bounds on the achromatic pseudoachromatic indices of n-dimensional finite projective space order q.

Let $mathcal{X}$ be a class of $R$-modules‎. ‎In this paper‎, ‎we investigate ;$mathcal{X}$-injective (projective) and DG-$mathcal{X}$-injective (projective) complexes which are generalizations of injective (projective) and DG-injecti‎‎ve (projective) complexes‎. ‎We prove that some known results can be extended to the class of ;$mathcal{X}$-injective (projective) and DG-$mathcal{X}$-injective ...

In this paper, we formulate and prove a weighted homogeneous version of Zariski’s hyperplane section theorem on the fundamental groups of the complements of hypersurfaces in a complex projective space, and apply it to the study of π1(P 2 \C), where C ⊂ P is a projective plane curve. The main application is to prove a comparison theorem as follows. Let φ : P → P be the composition of the Verones...

We formalize weighted dependency parsing as searching for maximum spanning trees (MSTs) in directed graphs. Using this representation, the parsing algorithm of Eisner (1996) is sufficient for searching over all projective trees in O(n3) time. More surprisingly, the representation is extended naturally to non-projective parsing using Chu-Liu-Edmonds (Chu and Liu, 1965; Edmonds, 1967) MST algorit...

Let A be an arbitrary hereditary abelian category that may not have enough projective objects. For example, can the of finite-dimensional representations a quiver or coherent sheaves on smooth curve weighted line. Inspired by works Bridgeland and Gorsky, we define semi-derived Ringel-Hall algebra A, denoted SDHZ/2(A), to localization quotient Z/2-graded complexes over A. We obtain following thr...

We give a survey on projective ring lines and some of their substructures which in turn are more general than a projective line over a ring.

The purpose of this study is to broaden the scope of projective transformation methods in mathematical programming, both in terms of theory and algorithms. We start by generalizing the concept of the analytic center of a polyhedral system of constraints to the w-center of a polyhedral system, which stands for weighted center, where there are positive weights on the logarithmic barrier terms for...

We formalize weighted dependency parsing as searching for maximum spanning trees (MSTs) in directed graphs. Using this representation, the parsing algorithm of Eisner (1996) is sufficient for searching over all projective trees inO(n3) time. More surprisingly, the representation is extended naturally to non-projective parsing using Chu-Liu-Edmonds (Chu and Liu, 1965; Edmonds, 1967) MST algorith...