English
Related papers

Related papers: On complex supersolvable line arrangements

200 papers

A well-known theorem by Hartshorne--Hirschowitz (\cite{HH}) states that a generic union $\mathbb{X}\subset \PP^n$, $n\geq 3$, of lines has good postulation with respect to the linear system $|\OO_{\PP^n}(d)|$. So a question that arises…

Algebraic Geometry · Mathematics 2016-06-10 Tahereh Aladpoosh

A set of lines in $\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We derive new upper bounds on the cardinality of equiangular lines. Let us denote the maximum cardinality of equiangular lines in…

Metric Geometry · Mathematics 2016-09-06 Wei-Hsuan Yu

For $n \in \mathbb{N}$, let $h(n)$ denote the number of simplicial complexes on $n$ vertices up to homotopy equivalence. Here we prove that $h(n) \geq 2^{2^{0.02n}}$ when $n$ is large enough. Together with the trivial upper bound of…

Algebraic Topology · Mathematics 2019-11-15 Andrew Newman

We consider arrangements of n hyperplanes of codimension one in a real projective space of dimension d. Let us denote by F the maximal possible number f of connected components of the complement in the projective space of dimension d to the…

Combinatorics · Mathematics 2015-01-06 I. Shnurnikov

We give restrictions on the weak combinatorics of line arrangements with singular points of odd multiplicity using topological arguments on locally-flat spheres in 4-manifolds. As a corollary, we show that there is no line arrangement…

Geometric Topology · Mathematics 2024-03-27 Marco Golla

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

Consider the hypergraph whose vertex set is a family of $n$ lines in general position in the plane, and whose hyperedges are induced by intersections with a family of pseudo-discs. We prove that the number of $t$-hyperedges is bounded by…

Combinatorics · Mathematics 2022-08-29 Chaya Keller , Balázs Keszegh , Dömötör Pálvölgyi

A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…

Rings and Algebras · Mathematics 2012-08-31 Gábor Czédli , Tamás Dékány , László Ozsvárt , Nóra Szakács , Balázs Udvari

Let A be an n by d matrix having full rank n. An orthogonal dual A^{\perp} of A is a (d-n) by d matrix of rank (d-n) such that every row of A^{\perp} is orthogonal (under the usual dot product) to every row of A. We define the orthogonal…

Combinatorics · Mathematics 2012-01-31 Joseph P. S. Kung , Hal Schenck

We generalize results of Hattori on the topology of complements of hyperplane arrangements, from the class of generic arrangements, to the much broader class of hypersolvable arrangements. We show that the higher homotopy groups of the…

Algebraic Topology · Mathematics 2007-05-23 Stefan Papadima , Alexander I. Suciu

We prove the following results regarding the linear solvability of networks over various alphabets. For any network, the following are equivalent: (i) vector linear solvability over some finite field, (ii) scalar linear solvability over…

Information Theory · Computer Science 2018-01-31 Joseph Connelly , Kenneth Zeger

A generalization of highly symmetric frames is presented by considering also projective stabilizers of frame vectors. This allows construction of highly symmetric line systems and study of highly symmetric frames in a more unified manner.…

Functional Analysis · Mathematics 2022-07-19 Mikhail Ganzhinov

Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…

Combinatorics · Mathematics 2014-12-04 Samuel Fiorini , Selim Rexhep

We study the number of monochromatic solution to linear equation in $\{1,\dots,n\}$ when we color the set by at least three colors. We consider the $r$-commonness for $r\geq 3$ of linear equation with odd number of terms, and we also prove…

Combinatorics · Mathematics 2025-06-27 Laurence P. Wijaya

We observe a different type of complex solutions in the isotropic spin-1/2 Heisenberg chain starting from N=12, where the central rapidity of some of the odd-length strings becomes complex making not all the strings self-conjugate…

High Energy Physics - Theory · Physics 2015-02-12 Tetsuo Deguchi , Pulak Ranjan Giri

A planar point set of $n$ points is called {\em $\gamma$-dense} if the ratio of the largest and smallest distances among the points is at most $\gamma\sqrt{n}$. We construct a dense set of $n$ points in the plane with…

Combinatorics · Mathematics 2019-04-01 István Kovács , Géza Tóth

This paper studies {\em strong blocking sets} in the $N$-dimensional finite projective space $\mathrm{PG}(N,q)$. We first show that certain unions of blocking sets cannot form strong blocking sets, which leads to a new lower bound on the…

Combinatorics · Mathematics 2024-02-13 Stefano Lia , Geertrui Van de Voorde

For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…

Combinatorics · Mathematics 2025-10-22 Sofia Brenner , Jean Cardinal , Thomas McConville , Arturo Merino , Torsten Mütze

We prove the existence of lattice isomorphic line arrangements having $\pi_1$-equivalent or homotopy-equivalent complements and non homeomorphic embeddings in the complex projective plane. We also provide two explicit examples, one is…

Geometric Topology · Mathematics 2018-01-10 Benoît Guerville-Ballé

We consider the reconstruction of a function on a finite subset of $\mathbb{Z}^2$ if the line sums in certain directions are prescribed. The real solutions form a linear manifold, its integer solutions a grid. First we provide an explicit…

Combinatorics · Mathematics 2012-03-13 Birgit van Dalen , Lajos Hajdu , Rob Tijdeman