中文
相关论文

相关论文: Combinatorially formal arrangements are not determ…

200 篇论文

A hyperplane arrangement is called formal provided all linear dependencies among the defining forms of the hyperplanes are generated by ones corresponding to intersections of codimension two. The significance of this notion stems from the…

组合数学 · 数学 2024-07-03 Tilman Möller , Paul Mücksch , Gerhard Roehrle

The complement of a hyperplane arrangement in the complex projective space is known to be formal. We prove the global Milnor fiber associated to the homogeneous polynomial defining the arrangement may not even be 1-formal, by giving an…

代数几何 · 数学 2014-02-26 Hugues Zuber

It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…

组合数学 · 数学 2014-10-10 Jürgen Bokowski , Jurij Kovič , Tomaž Pisanski , Arjana Žitnik

It is known that there exist hyperplane arrangements with same underlying matroid that admit non-homotopy equivalent complement manifolds. In this work we show that, in any rank, complex central hyperplane arrangements with up to 7…

组合数学 · 数学 2017-01-31 Matteo Gallet , Elia Saini

We show a combinatorial formula for a lower bound of the dimension of the non-unipotent monodromy part of the first Milnor cohomology of a hyperplane arrangement satisfying some combinatorial conditions. This gives exactly its dimension if…

代数几何 · 数学 2010-05-18 Nero Budur , Alexandru Dimca , Morihiko Saito

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

组合数学 · 数学 2025-09-30 Marién Abreu , Martin Funk , Vedran Krčadinac , Domenico Labbate

We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the…

代数几何 · 数学 2015-07-08 Grigory Rybnikov

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…

组合数学 · 数学 2023-03-14 Jaeho Shin

The discriminantal arrangement is the space of configurations of $n$ hyperplanes in generic position in a $k$ dimensional space (see \cite{MS}). Differently from the case $k=1$ in which it corresponds to the well known braid arrangement,…

组合数学 · 数学 2022-05-11 Simona Settepanella , So Yamagata

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

组合数学 · 数学 2021-10-29 C P Anil Kumar

Let $B$ be an arrangement of linear complex hyperplanes in $C^d$. Then a classical result by Orlik \& Solomon asserts that the cohomology algebra of the complement can be constructed from the combinatorial data that are given by the…

alg-geom · 数学 2008-02-03 Günter M. Ziegler

Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic…

交换代数 · 数学 2007-10-11 Takuro Abe , Hiroaki Terao , Max Wakefield

We discuss algebraic and combinatorial aspects of the Hamiltonian normal form theory. The main objective is to describe the normal form near a singular point purely in terms of the original Hamiltonian, avoiding the normalization procedure.…

动力系统 · 数学 2026-05-05 Dmitry Treschev

Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…

历史与综述 · 数学 2025-04-17 Stefan Forcey

We study the combinatorial properties of a tropical hyperplane arrangement. We define tropical oriented matroids, and prove that they share many of the properties of ordinary oriented matroids. We show that a tropical oriented matroid…

组合数学 · 数学 2007-06-25 Federico Ardila , Mike Develin

We show that the notion of MAT-freeness for hyperplane arrangements depends on the underlying field. In particular, MAT-freeness is not combinatorial.

组合数学 · 数学 2025-12-05 Torsten Hoge , Gerhard Roehrle

We show that, for an arrangement of subspaces in a complex vector space with geometric intersection lattice, the complement of the arrangement is formal. We prove that the Morgan rational model for such an arrangement complement is formal…

代数拓扑 · 数学 2007-05-23 Eva Maria Feichtner , Sergey Yuzvinsky

We will consider some characterizations of freeness of a hyperplane arrangement, in terms of the following properties: locally freeness, factorization of characteristic polynomial and freeness of restricted multiarrangement. In the case of…

组合数学 · 数学 2007-05-23 Masahiko Yoshinaga

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

组合数学 · 数学 2010-01-24 David Forge , Thomas Zaslavsky

Each complex hyperplane arrangement $\mathcal{A}$ gives rise to a Milnor fibration of its complement. Building on work of Zuber, we give a combinatorial sufficient condition for the Milnor fiber $F(\mathcal{A})$ to be non-$1$-formal,…

代数拓扑 · 数学 2026-03-10 Alexander I. Suciu
‹ 上一页 1 2 3 10 下一页 ›