An Algorithm for Reducibility of 3-arrangements

We consider a central hyperplane arrangement in a three-dimensional vector space. The definition of characteristic form to a hyperplane arrangement is given and we could make use of characteristic form to judge the reducibility of this arrangement. In addition, the relationship between the reducibility and freeness of a hyperplane arrangement is given     

Reducibility of matrix weights

In this paper, we discuss the notion of reducibility of matrix weights and introduce a real vector space \(\mathcal C_\mathbb R\) which encodes all information about the reducibility of W. In particular, a weight W reduces if and only if there is a nonscalar matrix T such that \(TW=WT^*\). Also, we prove that reducibility can be studied by looking at the commutant of the monic orthogonal polynomials or by looking at the coefficients of the corresponding three-term recursion relation. A matrix weight may not be expressible as direct sum of irreducible weights, but it is always equivalent to a direct sum of irreducible weights. We also establish that the decompositions of two equivalent weights as sums of irreducible weights have the same number of terms and that, up to a permutation, they are equivalent. We consider the algebra of right-hand-side matrix differential operators \(\mathcal D(W)\) of a reducible weight W, giving its general structure. Finally, we make a change of emphasis by considering the reducibility of polynomials, instead of reducibility of matrix weights.     

Lie Superalgebras Over 𝔤𝔩2

Whereas Holm proved that the ring of differential operators on a generic hyperplane arrangement is finitely generated as an algebra, the problem of its Noetherian properties is still open. In this article, after proving that the ring of differential operators on a central arrangement is right Noetherian if and only if it is left Noetherian, we prove that the ring of differential operators on a central 2-arrangement is Noetherian. In addition, we prove that its graded ring associated to the order filtration is not Noetherian when the number of the consistuent hyperplanes is greater than 1.     

几何定理机器证明的WE完全方法

在几何定理机器证明的各种方法中，吴氏方法获得了显著的成功．如预先把有关代数簇分解为不可约簇，则吴氏方法可成为完全方法．本文在吴法的基础上，以辗转伪除法为辅助工具，发展出一种不必预先分解代数簇的完全方法，并给出一些手算实例．     

Locally heavy hyperplanes in multiarrangements

Hyperplane arrangements of rank 3 admitting an unbalanced Ziegler restriction are known to fulfill Terao's conjecture. This long-standing conjecture asks whether the freeness of an arrangement is determined by its combinatorics. In this note we prove that arrangements which admit a locally heavy flag satisfy Terao's conjecture which is a generalization of the statement above to arbitrary dimension. To this end we extend results characterizing the freeness of multiarrangements with a heavy hyperplane to those satisfying the weaker notion of a locally heavy hyperplane. As a corollary we give a new proof that irreducible arrangements with a generic hyperplane are totally nonfree. In another application we show that an irreducible multiarrangement of rank 3 with at least two locally heavy hyperplanes is not free.     

Derivation radical subspace arrangements

In this note we study modules of derivations on collections of linear subspaces in a finite dimensional vector space. The central aim is to generalize the notion of freeness from hyperplane arrangements to subspace arrangements. We call this generalization ‘derivation radical’. We classify all coordinate subspace arrangements that are derivation radical and show that certain subspace arrangements of the Braid arrangement are derivation radical. We conclude by proving that under an algebraic condition the subspace arrangement consisting of all codimension c intersections, where c is fixed, of a free hyperplane arrangement are derivation radical.     

有限域上与仿射多项式有关的一些多项式的可约性

在这篇文章中,研究了有限域上一些与仿射多项式有关的多项式的可约性.对于有限域Fp上不是xppt-x-1的仿射三项式,得到了这些三项式的一个明确的因式.完全确定了多项式g(xps-ax-b)在Fp[x]中的分解,这里g(x)是Fp[x]中一个不可约多项式.证明了Fp上次数相同的不可约多项式的全体可以构成一个正则图.同时给出了多项式g(xqs-x-b)在Fp[x]不可约因式的个数公式,这里g(x)是Fp上一个不可约多项式.     

On Milnor Fibrations of Arrangements

We use covering space theory and homology with local coefficientsto study the Milnor fiber of a homogeneous polynomial. Thesetechniques are applied in the context of hyperplane arrangements,yielding an explicit algorithm for computing the Betti numbersof the Milnor fiber of an arbitrary real central arrangementin C³, as well as the dimensions of the eigenspaces of the algebraicmonodromy. We also obtain combinatorial formulas for these invariantsof the Milnor fiber of a generic arrangement of arbitrary dimensionusing these methods.     

非负矩阵的一些算法

本文利用有限图论和齐次有限马尔可夫链理论的有关命题和算法得到了不同于[1]、[3]的算法:(1)有限阶非负矩阵可约性的判别、有限阶可约矩阵化为主对角线上都为不可约子块的分块三角阵的算法;(2)有限阶不可约矩阵的Frobenius表示的算法.对上述二算法本文还分别给出了直观简便的图示法.     

Mustafin varieties

A Mustafin variety is a degeneration of projective space induced by a point configuration in a Bruhat-Tits building. The special fiber is reduced and Cohen-Macaulay, and its irreducible components form interesting combinatorial patterns. For configurations that lie in one apartment, these patterns are regular mixed subdivisions of scaled simplices, and the Mustafin variety is a twisted Veronese variety built from such a subdivision. This connects our study to tropical and toric geometry. For general configurations, the irreducible components of the special fiber are rational varieties, and any blow-up of projective space along a linear subspace arrangement can arise. A detailed study of Mustafin varieties is undertaken for configurations in the Bruhat-Tits tree of PGL(2) and in the 2-dimensional building of PGL(3). The latter yields the classification of Mustafin triangles into 38 combinatorial types.     

Gauge Distances and Median Hyperplanes

A median hyperplane in d-dimensional space minimizes the weighted sum of the distances from a finite set of points to it. When the distances from these points are measured by possibly different gauges, we prove the existence of a median hyperplane passing through at least one of the points. When all the gauges are equal, some median hyperplane will pass through at least d-1 points, this number being increased to d when the gauge is symmetric, i.e. the gauge is a norm.Whereas some of these results have been obtained previously by different methods, we show that they all derive from a simple formula for the distance of a point to a hyperplane as measured by an arbitrary gauge.     

On completely irreducible operators

Let T be a bounded linear operator on Hilbert space H, M an invariant subspace of T. If there exists another invariant subspace N of T such that H = M + N and M ∩ N = 0, then M is said to be a completely reduced subspace of T. If T has a nontrivial completely reduced subspace, then T is said to be completely reducible; otherwise T is said to be completely irreducible. In the present paper we briefly sum up works on completely irreducible operators that have been done by the Functional Analysis Seminar of Jilin University in the past ten years and more. The paper contains four sections. In section 1 the background of completely irreducible operators is given in detail. Section 2 shows which operator in some well-known classes of operators, for example, weighted shifts, Toeplitz operators, etc., is completely irreducible. In section 3 it is proved that every bounded linear operator on the Hilbert space can be approximated by the finite direct sum of completely irreducible operators. It is clear that a completely irreducible operator is a rather suitable analogue of Jordan blocks in L(H), the set of all bounded linear operators on Hilbert space H. In section 4 several questions concerning completely irreducible operators are discussed and it is shown that some properties of completely irreducible operators are different from properties of unicellular operators. __________ Translated from Acta Sci. Nat. Univ. Jilin, 1992, (4): 20–29     

On factoring parametric multivariate polynomials

This paper presents a new algorithm for the absolute factorization of parametric multivariate polynomials over the field of rational numbers. This algorithm decomposes the parameters space into a finite number of constructible sets. The absolutely irreducible factors of the input parametric polynomial are given uniformly in each constructible set. The algorithm is based on a parametric version of Hensel's lemma and an algorithm for quantifier elimination in the theory of algebraically closed field in order to reduce the problem of finding absolute irreducible factors to that of representing solutions of zero-dimensional parametric polynomial systems. The complexity of this algorithm is single exponential in the number n of the variables of the input polynomial, its degree d w.r.t. these variables and the number r of the parameters.     

Affine and Toric Hyperplane Arrangements

We extend the Billera–Ehrenborg–Readdy map between the intersection lattice and face lattice of a central hyperplane arrangement to affine and toric hyperplane arrangements. For arrangements on the torus, we also generalize Zaslavsky’s fundamental results on the number of regions.     

Brill–Noether general curves on Knutsen K3 surfaces

This article classifies Knutsen K3 surfaces all of whose hyperplane sections are irreducible and reduced. As an application, this gives infinite families of K3 surfaces of Picard number two whose general hyperplane sections are Brill–Noether general curves.     

The Direct Sum Decomposition of Type G_2 Lie Algebra

This article mainly discusses the direct sum decomposition of type G_2 Lie algebra, which, under such decomposition, is decomposed into a type A_1 simple Lie algebra and one of its modules. Four theorems are given to describe this module,which could be the direct sum of two or three irreducible modules, or the direct sum of weight modules and trivial modules, or the highest weight module.     

Complexity of solving parametric polynomial systems

In this paper, we present three algorithms: the first one solves zero-dimensional parametric homogeneous polynomial systems within single exponential time in the number n of unknowns; it decomposes the parameter space into a finite number of constructible sets and computes the finite number of solutions by parametric rational representations uniformly in each constructible set. The second algorithm factirizes absolutely multivariate parametic polynomials within single exponential time in n and in the upper bound d on the degree of the factorized polynomials. The third algorithm decomposes algebraic varieties defined by parametric polynomial systems of positive dimension into absolutely irreducible components uniformly in the values of the parameters. The complexity bound for this algorithm is double exponential in n. On the other hand, the lower bound on the complexity of the problem of resolution of parametric polynomial systems is double exponential in n. Bibliography: 72 titles.     

Self-Scaled Barrier Functions on Symmetric Cones and Their Classification

Self-scaled barrier functions on self-scaled cones were axiomatically introduced by Nesterov and Todd in 1994 as a tool for the construction of primal—dual long-step interior point algorithms. This paper provides firm foundations for these objects by exhibiting their symmetry properties, their close ties with the symmetry groups of their domains of definition, and subsequently their decomposition into irreducible parts and their algebraic classification theory. In the first part we recall the characterization of the family of self-scaled cones as the set of symmetric cones and develop a primal—dual symmetric viewpoint on self-scaled barriers, results that were first discovered by the second author. We then show in a short, simple proof that any pointed, convex cone decomposes into a direct sum of irreducible components in a unique way, a result which can also be of independent interest. We then proceed to showing that any self-scaled barrier function decomposes, in an essentially unique way, into a direct sum of self-scaled barriers defined on the irreducible components of the underlying symmetric cone. Finally, we present a complete algebraic classification of self-scaled barrier functions using the correspondence between symmetric cones and Euclidean—Jordan algebras. December 5, 1999. Final version received: September 6, 2001.     

Characterization of a free arrangement and conjecture of Edelman and Reiner

We consider a hyperplane arrangement in a vector space of dimension four or higher. In this case, the freeness of the arrangement is characterized by properties around a fixed hyperplane. As an application, we prove the freeness of cones over certain truncated affine Weyl arrangements which was conjectured by Edelman and Reiner.     

Numerical computation of the genus of an irreducible curve within an algebraic set

The common zero locus of a set of multivariate polynomials (with complex coefficients) determines an algebraic set. Any algebraic set can be decomposed into a union of irreducible components. Given a one-dimensional irreducible component, i.e. a curve, it is useful to understand its invariants. The most important invariants of a curve are the degree, the arithmetic genus and the geometric genus (where the geometric genus denotes the genus of a desingularization of the projective closure of the curve). This article presents a numerical algorithm to compute the geometric genus of any one-dimensional irreducible component of an algebraic set.