Results 41 to 50 of about 1,232 (194)

Arrangements of oriented hyperplanes [PDF]

open access: yesDiscrete & Computational Geometry, 1993
The paper refers to arrangements of \(n\) oriented hyperplanes in \(E^ d\). For \(n\) and \(d\) given, the author derives an upper bound on the number \(c_ k\) of convex cells which are covered by precisley \(k\) half-spaces. Denoting the corresponding maximal number by \(C_ k(n,d)\), for \(n>d\) the following recursive inequality holds: \[ C_ k(n,d ...
openaire   +1 more source

Schubert varieties, inversion arrangements, and Peterson translation [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
We show that an element $\mathcal{w}$ of a finite Weyl group W is rationally smooth if and only if the hyperplane arrangement $\mathcal{I} (\mathcal{w})$ associated to the inversion set of \mathcal{w} is inductively free, and the product $(d_1+1) ...(d_l+
William Slofstra
doaj   +1 more source

Bigraphical arrangements [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
We define the bigraphical arrangement of a graph and show that the Pak-Stanley labels of its regions are the parking functions of a closely related graph, thus proving conjectures of Duval, Klivans, and Martin and of Hopkins and Perkinson.
Sam Hopkins, David Perkinson
doaj   +1 more source

Cutting hyperplane arrangements [PDF]

open access: yesProceedings of the sixth annual symposium on Computational geometry - SCG '90, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Equivariant perverse sheaves on Coxeter arrangements and buildings [PDF]

open access: yesÉpijournal de Géométrie Algébrique, 2019
When $W$ is a finite Coxeter group acting by its reflection representation on $E$, we describe the category ${\mathsf{Perv}}_W(E_{\mathbb C}, {\mathcal{H}}_{\mathbb C})$ of $W$-equivariant perverse sheaves on $E_{\mathbb C}$, smooth with respect to the ...
Martin H. Weissman
doaj   +1 more source

Free hyperplane arrangements over arbitrary fields [PDF]

open access: yes, 2020
In this paper, we study the class of free hyperplane arrangements. Specifically, we investigate the relations between freeness over a field of finite characteristic and freeness over ...
Torielli, Michele, Palezzato, Elisa
core   +1 more source

On the freeness of hypersurface arrangements consisting of hyperplanes and spheres

open access: yesOpen Mathematics, 2018
Let V be a smooth variety. A hypersurface arrangement 𝓜 in V is a union of smooth hypersurfaces, which locally looks like a union of hyperplanes. We say 𝓜 is free if all these local models can be chosen to be free hyperplane arrangements.
Gao Ruimei, Dai Qun, Li Zhe
doaj   +1 more source

Graded Linearity of Stanley–Reisner Ring of Broken Circuit Complexes

open access: yesJournal of Mathematics, 2022
This paper introduces two new notions of graded linear resolution and graded linear quotients, which generalize the concepts of linear resolution property and linear quotient for modules over the polynomial ring A=kx1,…,xn.
Mohammad Reza-Rahmati, Gerardo Flores
doaj   +1 more source

Projection Volumes of Hyperplane Arrangements [PDF]

open access: yesDiscrete & Computational Geometry, 2011
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 for all finite real reflection arrangements. The methods used are geometric and combinatorial. As a
Caroline J. Klivans, Ed Swartz
openaire   +3 more sources

Face monoid actions and tropical hyperplane arrangements [PDF]

open access: yes, 2017
We study the combinatorics of tropical hyperplane arrangements, and their relationship to (classical) hyperplane face monoids. We show that the refinement operation on the faces of a tropical hyperplane arrangement, introduced by Ardila and Develin in ...
Kambites, Mark   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy