Related papers: Arbitrary rank jumps for $A$-hypergeometric system…

A $d$-dimensional polycube is a facet-connected set of cells (cubes) on the $d$-dimensional cubical lattice $\mathbb{Z}^d$. Let $A_d(n)$ denote the number of $d$-dimensional polycubes (distinct up to translations) with $n$ cubes, and…

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

Bounding the number of rational points of height at most $H$ on irreducible algebraic plane curves of degree $d$ has been an intense topic of investigation since the work by Bombieri and Pila. In this paper we establish optimal dependence…

We carry out some algebraic and analytic properties of a new class of orthogonal polyanalytic polynomials, including their operational formulas, recurrence relations, generating functions, integral representations and different…

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…

We show how several results about p-adic lattices generalize easily to lattices over valuation ring of arbitrary rank having only the Henselian property for quadratic polynomial. If 2 is invertible we obtain the uniqueness of the Jordan…

We use height arguments to prove two results about the dynamical Mordell-Lang problem. (i) For an endomorphism of a projective variety, the return set of a dense orbit into a curve is finite if any cohomological Lyapunov multiplier of any…

This work studies the problem of maximizing a higher degree real homogeneous multivariate polynomial over the unit sphere. This problem is equivalent to finding the leading eigenvalue of the associated symmetric tensor of higher order,…

In this article, we prove new theorems bounding the rank of different sub-matrices arising from these kernel functions. Bounds like these are often useful for analyzing the complexity of various hierarchical matrix algorithms. We also plot…

Hyperbolic machine learning is an emerging field aimed at representing data with a hierarchical structure. However, there is a lack of tools for evaluation and analysis of the resulting hyperbolic data representations. To this end, we…

We consider a generalization of low-rank matrix completion to the case where the data belongs to an algebraic variety, i.e. each data point is a solution to a system of polynomial equations. In this case the original matrix is possibly…

We study the algorithmic task of finding large independent sets in Erdos-Renyi $r$-uniform hypergraphs on $n$ vertices having average degree $d$. Krivelevich and Sudakov showed that the maximum independent set has density $\left(\frac{r\log…

We introduce a partial order on the set of all normal polytopes in R^d. This poset NPol(d) is a natural discrete counterpart of the continuum of convex compact sets in R^d, ordered by inclusion, and exhibits a remarkably rich combinatorial…

We exhibit, for each even degree, a ternary form of rank strictly greater than the maximum rank of monomials. Together with an earlier result in the odd case, this gives the lower bound…

We study the map which takes an elementwise positive matrix to the k-th root of the principal eigenvector of its k-th Hadamard power. We show that as $k$ tends to 0 one recovers the row geometric mean vector and discuss the geometric…

We investigate questions related to the set $\mathcal{SEP}_d$ consisting of the linear maps $\rho$ acting on $\mathbb{C}^d\otimes \mathbb{C}^d$ that can be written as a convex combination of rank one matrices of the form $xx^*\otimes yy^*$.…

We prove sharp upper bounds on the volume and the number of lattice points on edges of higher-dimensional reflexive simplices. These convex-geometric results are derived from new number-theoretic bounds on the denominators of unit fractions…

For a reduced hyperplane arrangement we prove the analytic Twisted Logarithmic Comparison Theorem, subject to mild combinatorial arithmetic conditions on the weights defining the twist. This gives a quasi-isomorphism between the twisted…

We give an upper-bound for the $X$-rank of points with respect to a non-degenerate irreducible variety $X$ in the case that sub-generic $X$-rank points generate a hypersurface. We give examples where this bound is sharp and it improves the…

In 2005, building on his own recent work and that of F. Zanello, A. Iarrobino discovered some constructions that, he conjectured, would yield level algebras with non-unimodal Hilbert functions. This thesis provides proofs of non-unimodality…