Related papers: Face Counting for Topological Hyperplane Arrangeme…

In this paper, we address computational questions surrounding the enumeration of non-isomorphic Andr\'e planes for any prime power order. We are particularly focused on providing a complete enumeration of all such planes for relatively…

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

We extend results of Cogolludo-Agustin and Libgober relating the Alexander polynomial of a plane curve $C$ with the Mordell--Weil rank of certain isotrivial families of jacobians over $\mathbf{P}^2$ of discriminant $C$. In the second part…

The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…

The Lefschetz hyperplane section theorem asserts that an affine variety is homotopy equivalent to a space obtained from its generic hyperplane section by attaching some cells. The purpose of this paper is to describe attaching maps of these…

We study hyperplane sections of smooth polarized $K3$-surfaces that split into unions of lines. We describe the dual adjacency graphs of such sections and find sharp upper bounds on their number. In most cases (starting from degree $6$), we…

We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and,…

In this paper we develop symbolic computation algorithms to investigate finiteness of central configurations for the planar $n$-body problem. Our approach is based on Albouy-Kaloshin's work on finiteness of central configurations for the…

The cutting-plane approach to integer programming was initiated more that 40 years ago: Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner…

We discuss here geometric structures of condensed matters by means of a fundamental topological method. Any geometric pattern can be universally represented by a decomposition space of a topological space consisting of the infinite product…

Aronhold's classical result states that a plane quartic can be recovered by the configuration of any Aronhold systems of bitangents, i.e. special 7-tuples of bitangents such that the six points at which any subtriple of bitangents touches…

We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…

An $n$-arc in a projective plane is a collection of $n$ distinct points in the plane, no three of which lie on a line. Formulas counting the number of $n$-arcs in any finite projective plane of order $q$ are known for $n \le 8$. In 1995,…

A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…

We classify one-element extensions of a hyperplane arrangement by the induced adjoint arrangement. Based on the classification, several kinds of combinatorial invariants including Whitney polynomials, characteristic polynomials, Whitney…

We describe a new relation between the topology of hypersurface complements, Milnor fibers and degree of gradient mappings. In particular we show that any projective hypersurface has affine parts which are bouquets of spheres. The main…

This article addresses the problem of enumerating the tilings of a plane by lozenges, under the restriction that these tilings be doubly periodic. Kasteleyn's Pfaffian method is applied to compute the generating function of those…

Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…

We consider arrangements of n connected codimensional one submanifolds in closed d-dimensional manifold M. Let f be the number of connected components of the complement in M to the union of submanifolds. We prove the sharp lower bound for f…

We compute the periods associated with a special class of hyperplane arrangements. In particular, we exhibit a combinatorial condition on the intersection lattice of a hyperplane arrangement that ensures that its associated periods are…