Related papers: Factorization of polynomials in hyperbolic geometr…

The starting point of this paper is the computation of minimal hyperbolic polynomials of duals of cones arising from chordal sparsity patterns. From that, we investigate the relation between ranks of homogeneous cones and their minimal…

In this paper we develop a complete theory of factorization for isometries of hyperbolic 4-space. Of special interest is the case where a pair of isometries is linked, that is, when a pair of isometries can be expressed each as compositions…

We compute the first cohomology group of the symmetric algebra of the universal \'etale $p$-adic local system on the tower of coverings of Drinfeld's $p$-adic half-plane. The result takes a factorized form, using the $p$-adic Langlands…

For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products of smaller graphs. When $G$ is isomorphic to a Cartesian graph product, we call the factors of this product a…

We study factorizations of HOMFLY polynomials of certain knots and oriented links. We begin with a computer analysis of knots with at most 12 crossings, finding 17 non-trivial factorizations. Next, we give an irreducibility criterion for…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

This article focuses on optimization of polynomials in noncommuting variables, while taking into account sparsity in the input data. A converging hierarchy of semidefinite relaxations for eigenvalue and trace optimization is provided. This…

The Harborth graph is the smallest known example of a 4-regular planar unit-distance graph. In this paper we give an analytical description of the coordinates of its vertices for a particular embedding in the Euclidean plane. More…

We complete the project begun by Callahan, Dean and Weeks to identify all knots whose complements are in the SnapPea census of hyperbolic manifolds with seven or fewer tetrahedra. Many of these ``simple'' hyperbolic knots have high crossing…

We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…

We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…

We explain how to perform topological twisting of supersymmetric field theories in the language of factorization algebras. Namely, given a supersymmetric factorization algebra with a choice of a topological supercharge we construct an…

We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These…

This paper is subsequent to [5]. In this paper, we extend the classification of hyperbolic Dehn fillings with sufficiently large coefficients by addressing the remaining case not covered in [5]. Specifically, by considering the case in…

We present a method to compute the full non-linear deformations of matrix factorizations for ADE minimal models. This method is based on the calculation of higher products in the cohomology, called Massey products. The algorithm yields a…

Using the recently proposed differential hierarchy (Z-expansion) technique, we obtain a general expression for the HOMFLY polynomials in two arbitrary symmetric representations of link families, including Whitehead and Borromean links.…

We survey a few trace theorems for Sobolev spaces on $N$-dimensional Euclidean domains. We include known results on linear subspaces, in particular hyperspaces, and smooth boundaries, as well as less known results for Lipschitz boundaries,…

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

We consider the problem of deterministically factoring a univariate polynomial over a finite field under the assumption of the Extended Riemann Hypothesis (ERH). This work builds upon the line of approach first explored by Gao in $2001$.…

We establish Fourier extension estimates for compact subsets of the hyperbolic hyperboloid in three dimensions via polynomial partitioning.