Results 21 to 30 of about 1,232 (194)
Lefschetz properties and hyperplane arrangements [PDF]
Journal of Algebra, 2020 To appear in the Journal of ...
Elisa Palezzato, Michele Torielli
openaire +7 more sources
The Varchenko determinant of an oriented matroid [PDF]
Transactions on Combinatorics, 2021 Varchenko introduced in 1993 a distance function on the chambers of a hyperplane arrangement that gave rise to a determinant whose entry in position $(C, D)$ is the distance between the chambers $C$ and $D$, and computed that determinant. In 2017, Aguiar
Hery Randriamaro
doaj +1 more source
More Bisections by Hyperplane Arrangements [PDF]
Discrete & Computational Geometry, 2021 A union of an arrangement of affine hyperplanes $H$ in $R^d$ is the real algebraic variety associated to the principal ideal generated by the polynomial $p_{H}$ given as the product of the degree one polynomials which define the hyperplanes of the arrangement.
Pavle V. M. Blagojevic +3 more
openaire +2 more sources
Affine and toric arrangements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 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.
Richard Ehrenborg +2 more
doaj +1 more source
Depth in an Arrangement of Hyperplanes [PDF]
Discrete & Computational Geometry, 1999 A collection of \(n\) hyperplanes in \(\mathbb R^d\) forms a hyperplane arrangement. The depth of a point \(\theta\in\mathbb R^d\) is the smallest number of hyperplanes crossed by any ray emanating from \(\theta.\) The authors prove that for \(d = 2\) there always exists a point \(\theta\) with depth at least \(\lceil n/3\rceil.\) This theorem allows ...
Peter J. Rousseeuw, Mia Hubert
openaire +3 more sources
An Edge-Signed Generalization of Chordal Graphs, Free Multiplicities on Braid Arrangements, and Their Characterizations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 In this article, we propose a generalization of the notion of chordal graphs to signed graphs, which is based on the existence of a perfect elimination ordering for a chordal graph. We give a special kind of filtrations of the generalized chordal graphs,
Takuro Abe, Koji Nuida, Yasuhide Numata
doaj +1 more source
IET Networks, EarlyView., 2022 Abstract Sensor technology advancements have provided a viable solution to fight COVID and to develop healthcare systems based on Internet of Things (IoTs). In this study, image processing and Artificial Intelligence (AI) are used to improve the IoT framework.
Noor M Allayla +2 more
wiley +1 more source
Bases for modules of differential operators [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 It is well-known that the derivation modules of Coxeter arrangements are free. Holm began to study the freeness of modules of differential operators on hyperplane arrangements. In this paper, we study the cases of the Coxter arrangements of type A, B and
Norihiro Nakashima
doaj +1 more source
Computing characteristic polynomials of hyperplane arrangements with symmetries [PDF]
, 2023 Brysiewicz T, Eble H, Kühne L. Computing characteristic polynomials of hyperplane arrangements with symmetries. Discrete and Computational Geometry. 2023;70:1356–1377.We introduce a new algorithm computing the characteristic polynomials of hyperplane ...
Kühne, Lukas ; https://orcid.org/ +2 more
core +1 more source
Pseudo-Permutations II: Geometry and Representation Theory [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this paper, we provide the second part of the study of the pseudo-permutations. We first derive a complete analysis of the pseudo-permutations, based on hyperplane arrangements, generalizing the usual way of translating the permutations. We then study
François Boulier +3 more
doaj +1 more source