Related papers: The Hyperdeterminant and Triangulations of the 4-C…

First steps towards a classification of irreducible symplectic 4-folds whose integral 2-cohomology with 4-tuple cup product is isomorphic to that of Hilb^2(K3). We prove that any such 4-fold deforms to an irreducible symplectic 4-fold of…

Hyperdeterminants are generalizations of determinants from matrices to multi-dimensional hypermatrices. They were discovered in the 19th century by Arthur Cayley but were largely ignored over a period of 100 years before once again being…

We complete the classification of compact hyperbolic Coxeter $d$-polytopes with $d+4$ facets for $d=4$ and $5$. By previous work of Felikson and Tumarkin, the only remaining dimension where new polytopes may arise is $d=6$. We derive a new…

We give a complete enumeration of all 2-neighborly 0/1-polytopes of dimension 7. There are 13 959 358 918 different 0/1-equivalence classes of such polytopes. They form 5 850 402 014 combinatorial classes and 1 274 089 different f-vectors.…

The article [14] gives a list of 51 symplectic hypergeometric monodromy groups corresponding to primitive pairs of degree four polynomials, which are products of cyclotomic polynomials, and for which, the absolute value of the leading…

The discriminant of a multivariate polynomial with indeterminate coefficients is not necessarily a hypersurface, and characterizing its codimension was an open problem for quite a while. We resolve this problem for the discriminants of…

We present two algorithms that compute the Newton polytope of a polynomial defining a hypersurface H in C^n using numerical computation. The first algorithm assumes that we may only compute values of f - this may occur if f is given as a…

We prove that the dimension of the intersection $\mathcal Z$ of all Hassett divisors of special cubic fourfolds is sixteen. We do this by studying which subsets of the natural numbers $\mathbb N$ can be obtained as the image of a…

We derive formulas for the number of polycubes of size $n$ and perimeter $t$ that are proper in $n-1$ and $n-2$ dimensions. These formulas complement computer based enumerations of perimeter polynomials in percolation problems. We…

The problem of counting points is revisited from the perspective of reflexive 4-dimensional polytopes. As an application, the Hilbert series of the 473,800,776 reflexive polytopes (equivalently, their Calabi-Yau hypersurfaces) are computed.

We study the degree of the special cubic fourfolds in the Hilbert scheme of cubic fourfolds via a computation of the generating series of Heegner divisors of even lattice of signature (2, 20).

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

In this work, we investigate hyperelliptic curves of type $C: y^2 = x^{2g+1} + ax^{g+1} + bx$ over the finite field $\mathbb{F}_q, q = p^n, p > 2$. For the case of $g = 3$ and $4$ we propose algorithms to compute the number of points on the…

We give coordinate-minimal geometric realizations in general position of all 865 vertex-minimal triangulations of the orientable surface of genus 2 in the 4x4x4-cube.

This article announces the completion of the classification of rank 4 locally projective polytopes and their quotients. There are seventeen universal locally projective polytopes (nine nondegenerate). Amongst their 441 quotients are a…

We consider systems of Laurent polynomials with support on a fixed point configuration. In the non-defective case, the closure of the locus of coefficients giving a non-degenerate multiple root of the system is defined by a polynomial…

A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…

Using recurrence matrices, defined and described with some details, we study a few determinants related to evaluations of binomial coefficients on Dirichlet characters modulo 2, 4 and 8.

Using equivariant geometry, we find a universal formula that computes the number of times a general cubic surface arises in a family. As applications, we show that the PGL(4) orbit closure of a generic cubic surface has degree 96120, and…

Counting integral binary quadratic forms with certain restrictions is a classical problem. In this paper, we count binary quadratic forms of fixed discriminant given restrictions on the size of their coefficients. We accomplish this by…