Results 101 to 110 of about 1,721 (200)
Bruhat order, rationally smooth Schubert varieties, and hyperplane arrangements [PDF]
, 2010 We link Schubert varieties in the generalized flag manifolds with hyperplane arrangements. For an element of a Weyl group, we construct a certain graphical hyperplane arrangement.
Oh, Suho, Yoo, Hwanchul
core +1 more source
Application of hyperplane arrangements to weight enumeration [PDF]
, 2014 Many research in coding theory is focussed on linear error-correcting codes. Since these codes are subspaces, linear algebra plays a prominent role in studying them.
Jurrius, RPMJ Relinde +3 more
core
Jumping Numbers of Hyperplane Arrangements [PDF]
Communications in Algebra, 2010 M. Saito recently proved that the jumping numbers of a hyperplane arrangement depend only on the combinatorics of the arrangement. However, a formula in terms of the combinatorial data was still missing. In this note, we give a formula and a different proof of the fact that the jumping numbers of a hyperplane arrangement depend only on the ...
openaire +2 more sources
Group Actions on Hyperplane Arrangements [PDF]
, 2012 In this dissertation, we will look at two families of algebras with connections to hyperplane arrangements that admit actions of finite groups. One of the fundamental questions to ask is how these decompose into irreducible representations. For the first
Moseley, Daniel
core
A combinatorial statistic for labeled threshold graphs [PDF]
Enumerative Combinatorics and Applications, 2021 Priyavrat Deshpande +2 more
doaj
Projection volumes of hyperplane arrangements [PDF]
, 2010 We prove that for any finite real hyperplane arrangement the average projection volumes of the maximal cones is given by the coefficients of the characteristic polynomial of the arrangement. This settles the conjecture of Drton and Klivans that this held
Caroline J. Klivans, Ed Swartz
core
The face lattice of hyperplane arrangements
Discrete Mathematics, 1988 A finite set \({\mathcal H}\) of hyperplanes in \({\mathbb{R}}^ d\) is called an arrangement. It determines a partition of \({\mathbb{R}}^ d\) into open topological cells, the face lattice \(L({\mathcal H})\) of which is studied by the author. He shows \(L({\mathcal H})\) to be shellable. To \({\mathcal H}\) there is assigned a zonotope \(\tilde Z\) in
openaire +2 more sources
Electrical networks and hyperplane arrangements
Advances in Applied Mathematics, 2019 This paper studies \emph{Dirichlet arrangements}, a generalization of graphic hyperplane arrangements arising from electrical networks and order polytopes of finite posets. We generalize descriptions of combinatorial features of graphic arrangements to Dirichlet arrangements, including characteristic polynomials and supersolvability.
openaire +4 more sources
Hyperplane arrangements: computations and conjectures
Advanced Studies in Pure Mathematics, 2019 This paper provides an overview of selected results and open problems in the theory of hyperplane arrangements, with an emphasis on computations and examples. We give an introduction to many of the essential tools used in the area, such as Koszul and Lie algebra methods, homological techniques, and the Bernstein-Gelfand-Gelfand correspondence, all ...
openaire +3 more sources
Hyperplane Arrangements And Linear Strands In Resolutions [PDF]
this paper A stands for a central hyperplane arrangement of hyperplanes H 1 ; : : : ; H
Irena Peeva
core