ﻻ يوجد ملخص باللغة العربية
Associated to the cohomology ring A of the complement X(A) of a hyperplane arrangement A in complex m-space are the resonance varieties R^k(A). The most studied of these is R^1(A), which is the union of the tangent cones at the origin to the characteristic varieties of the fundamental group of X. R^1(A) may be described in terms of Fitting ideals, or as the locus where a certain Ext module is supported. Both these descriptions give obvious algorithms for computation. In this note, we show that interpreting R^1(A) as the locus of decomposable two-tensors in the Orlik-Solomon ideal leads to a description of R^1(A) as the intersection of a Grassmannian with a linear space, determined by the quadratic generators of the Orlik-Solomon ideal. This method is much faster than previous alternatives.
In this article, we present a massively parallel framework for computing tropicalizations of algebraic varieties which can make use of finite symmetries. We compute the tropical Grassmannian TGr$_0(3,8)$, and show that it refines the $15$-dimensional
We study conditional independence (CI) models in statistical theory, in the case of discrete random variables, from the point of view of algebraic geometry and matroid theory. Any CI model with hidden random variables corresponds to a variety defined
The Springer variety is the set of flags stabilized by a nilpotent operator. In 1976, T.A. Springer observed that this varietys cohomology ring carries a symmetric group action, and he offered a deep geometric construction of this action. Sixteen yea
We classify complex projective varieties of dimension $2r geq 8$ swept out by a family of codimension two grassmannians of lines $mathbb{G}(1,r)$. They are either fibrations onto normal surfaces such that the general fibers are isomorphic to $G(1,r)$
We study standard monomial bases for Richardson varieties inside the flag variety. In general, writing down a standard monomial basis for a Richardson variety can be challenging, as it involves computing so-called defining chains or key tableaux. How