Related papers: Border Waring Rank via Asymptotic Rank

Motivated by a problem in computational complexity, we consider the behavior of rank functions for tensors and polynomial maps under random coordinate restrictions. We show that, for a broad class of rank functions called natural rank…

Let $W_3(n)$ be the set of Waring ranks of reducible cubic forms in $n+1$ variables. We prove that $W_3(n)\subseteq \lbrace 1,..., 2n+1\rbrace$.

As a continuation of our earlier paper, we offer a new approach to murmurations and Sato-Tate laws for higher rank zetas of elliptic curves. Our approach here does not depend on the Riemann hypothesis for the so-called a-invariant in rank…

This thesis is devoted to the application of random matrix theory to the study of random surfaces, both discrete and continuous; special emphasis is placed on surface boundaries and the associated boundary conditions in this formalism. In…

After introducing the different boundary geometries of rank one symmetric spaces, we state and prove Fried's theorem in the general setting of all those geometries: a closed manifold with a similarity structure is either complete or the…

The nonnegative rank of a matrix A is the smallest integer r such that A can be written as the sum of r rank-one nonnegative matrices. The nonnegative rank has received a lot of attention recently due to its application in optimization,…

We consider a one dimensional random-walk-like process, whose steps are centered Gaussians with variances which are determined according to the sequence of arrivals of a Poisson process on the line. This process is decorated by independent…

Asymptotic expansions are derived for solutions of the parabolic cylinder and Weber differential equations. In addition the inhomogeneous versions of the equations are considered, for the case of polynomial forcing terms. The expansions…

We systematically study the boundaries of one-dimensional, 2-color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries that appear to be reducible. Morphic…

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

Tensors decompositions are a class of tools for analysing datasets of high dimensionality and variety in a natural manner, with the Canonical Polyadic Decomposition (CPD) being a main pillar. While the notion of CPD is closely intertwined…

Let T be a free Z_p-module of finite rank equipped with a continuous Z_p-linear action of the absolute Galois group of a number field K satisfying certain conditions. In this article, by using a Selmer group corresponding to T, we give a…

We consider robust low rank matrix estimation as a trace regression when outputs are contaminated by adversaries. The adversaries are allowed to add arbitrary values to arbitrary outputs. Such values can depend on any samples. We deal with…

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

We present a method of obtaining a lower bound estimate of the curvatures of the Bergman metric without using the regularity of the kernel function on the boundary. As an application, we prove the existence of an uniform lower bound of the…

We prove that the (divisorial) gonality of a finite connected graph is lower bounded by its treewidth. We show that equality holds for grid graphs and complete multipartite graphs. We prove that the treewidth lower bound also holds for…

This paper is concerned with investigating the asymptotic behavior of the gradients of solutions to a class of elliptic systems with general boundary data, especially covering the Lam\'{e} systems, in a narrow region. The novelty of this…

In this paper we give a short introduction to the local uniformization problem. This follows a similar line as the one presented by the second author in his talk at ALANT 3. We also discuss our paper on the reduction of local uniformization…

We investigate the asymptotics of boundary layers in periodic homogenization. The analysis is focused on a Stokes system with periodic coefficients and periodic Dirichlet data posed in the half-space $\{y\in \mathbb{R}^d: y\cdot n -s>0\}$.…

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…