AbstractWe recently conjectured that a certain projective d-arrangement ℘d associated with a regular simplex θd is simplicial for d = 4 and suggested that it night even be simplical for d ⪢ 4. In this note we disprove both conjectures
AbstractA set of n nonconcurrent lines in the projective plane (called an arrangment) divides the pl...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
An abstract simplicial complex is said to be $d$-representable if it records the intersection patter...
AbstractWe recently conjectured that a certain projective d-arrangement ℘d associated with a regular...
AbstractLet GH(S,H) be the bipartite graph with partition sets S and H, the set of simplices and hyp...
In this thesis, we study simplicial arrangements of hyperplanes. Classically, a simplicial arrangeme...
In the present note we provide a complete classification of nearly free (and not free simultaneousl...
We introduce a greedy algorithm optimizing arrangements of lines with respect to a property. We appl...
We provide a simple characterization of simplicial complexes on few vertices that embed into the d-s...
AbstractWe show that the ideal of an arrangement of d linear subspaces of projective space is d-regu...
AbstractKalai proved that the simplicial polytopes with g2=0 are the stacked polytopes. We character...
AbstractA simplicial scheme is a certain structure which can be defined on graphs. The purpose of th...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
AbstractFor every n, d, n⩾2d+1⩾5, we prove the existence of an arrangement H of n hyperplanes in the...
AbstractA set of n nonconcurrent lines in the projective plane (called an arrangment) divides the pl...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
An abstract simplicial complex is said to be $d$-representable if it records the intersection patter...
AbstractWe recently conjectured that a certain projective d-arrangement ℘d associated with a regular...
AbstractLet GH(S,H) be the bipartite graph with partition sets S and H, the set of simplices and hyp...
In this thesis, we study simplicial arrangements of hyperplanes. Classically, a simplicial arrangeme...
In the present note we provide a complete classification of nearly free (and not free simultaneousl...
We introduce a greedy algorithm optimizing arrangements of lines with respect to a property. We appl...
We provide a simple characterization of simplicial complexes on few vertices that embed into the d-s...
AbstractWe show that the ideal of an arrangement of d linear subspaces of projective space is d-regu...
AbstractKalai proved that the simplicial polytopes with g2=0 are the stacked polytopes. We character...
AbstractA simplicial scheme is a certain structure which can be defined on graphs. The purpose of th...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
AbstractFor every n, d, n⩾2d+1⩾5, we prove the existence of an arrangement H of n hyperplanes in the...
AbstractA set of n nonconcurrent lines in the projective plane (called an arrangment) divides the pl...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
An abstract simplicial complex is said to be $d$-representable if it records the intersection patter...
DOI
Add to ORKG