English
Related papers

Related papers: Supersolvable simplicial arrangements

200 papers

This is an expository introduction to simplicial sets and simplicial homotopy theory with particular focus on relating the combinatorial aspects of the theory to their geometric/topological origins. It is intended to be accessible to…

Algebraic Topology · Mathematics 2023-06-12 Greg Friedman

In the first part of this paper we study scrollers and linearly joined varieties. A particular class of varieties, of important interest in classical Geometry are Cohen--Macaulay varieties of minimal degree. They appear naturally studying…

Commutative Algebra · Mathematics 2009-09-29 Marcel Morales

We are concerned with rigid analytic geometry in the general setting of Henselian fields $K$ with separated analytic structure, whose theory was developed by Cluckers--Lipshitz--Robinson. It unifies earlier work and approaches of numerous…

Algebraic Geometry · Mathematics 2019-07-19 Krzysztof Jan Nowak

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

Classical Analysis and ODEs · Mathematics 2018-03-08 José Ginés Espín Buendía , Víctor Jiménez López

In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…

Algebraic Geometry · Mathematics 2026-01-07 Liena Colarte-Gómez , Francesco Galuppi

The simple symplectic triple systems over the real numbers are classified up to isomorphism, and linear models of all of them are provided. Besides the split cases, one for each complex simple Lie algebra, there are two kinds of non-split…

Rings and Algebras · Mathematics 2022-05-16 Cristina Draper , Alberto Elduque

To every realizable oriented matroid there corresponds an arrangement of real hyperplanes. The homeomorphism type of the complexified complement of such an arrangement is completely determined by the oriented matroid. In this paper we study…

Combinatorics · Mathematics 2015-06-23 Priyavrat Deshpande

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

Combinatorics · Mathematics 2020-01-16 Rémi Bottinelli , Laura Grave de Peralta , Alexander Kolpakov

We find an explicit combinatorial gradient vector field on the well known complex S (Salvetti complex) which models the complement to an arrangement of complexified hyperplanes. The argument uses a total ordering on the facets of the…

Algebraic Topology · Mathematics 2014-11-11 Mario Salvetti , Simona Settepanella

We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Gr\"unbaums catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines,…

Combinatorics · Mathematics 2011-08-16 Michael Cuntz

We study the hyperplane arrangements associated, via the minimal model programme, to symplectic quotient singularities. We show that this hyperplane arrangement equals the arrangement of CM-hyperplanes coming from the representation theory…

Representation Theory · Mathematics 2017-07-05 Gwyn Bellamy , Travis Schedler , Ulrich Thiel

In 1962, Fadell and Neuwirth showed that the configuration space of the braid arrangement is aspherical. Having generalized this to many real reflection groups, Brieskorn conjectured this for all finite Coxeter groups. This in turn follows…

Algebraic Topology · Mathematics 2018-10-25 Nils Amend , Gerhard Roehrle

Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…

Combinatorics · Mathematics 2007-05-23 Stefan Felsner , Sarah Kappes

We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…

Algebraic Geometry · Mathematics 2019-10-09 Takuro Abe , Alexandru Dimca

We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…

Metric Geometry · Mathematics 2015-06-23 Michael Gene Dobbins , Andreas Holmsen , Alfredo Hubard

We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…

Computational Complexity · Computer Science 2016-02-05 Sylvain Schmitz

We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…

Rings and Algebras · Mathematics 2024-05-21 Gabriele Rembado

The simplicial complexity is an invariant for finitely presentable groups that was recently introduced by Babenko, Balacheff and Bulteau to study systolic area. The simplicial complexity $\kappa(G)$ was proved to be a good approximation of…

Geometric Topology · Mathematics 2019-07-04 Eugenio Borghini , Elias Gabriel Minian

We survey results on the topological complexity of classical configuration spaces of distinct ordered points in orientable surfaces and related spaces, including certain orbit configuration spaces and Eilenberg-Mac Lane spaces associated to…

Algebraic Topology · Mathematics 2019-08-27 Daniel C. Cohen

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable. For X in L(A), it is known that the restriction A^X is…

Combinatorics · Mathematics 2014-07-09 N. Amend , T. Hoge , G. Roehrle