Related papers: On ranks of regular polygons

The rank of the matrix multiplication operator for nxn matrices is one of the most studied quantities in algebraic complexity theory. I prove that the rank is at least n^2-o(n^2). More precisely, for any integer p\leq n -1, the rank is at…

In this paper we compute asymptotics for the coefficients of an infinite class of overpartition rank generating functions. Using these results, we show that $ \overline{N}(a,c,n), $ the number of overpartitions of $ n $ with rank congruent…

We examine the ranks of a subfamily of curves in a previous article, which are derived from the existence of solutions to certain Pell equations. We exhibit an abundance of curves of moderately large rank, and prove under mild conditions…

We show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability problem for pseudolines arrangements. In…

In this paper, we address a question of Donaldson's on the best estimate that can be achieved for the transversality of an asymptotically holomorphic sequence of sections of increasing powers of a line bundle over an integral symplectic…

The existence of a polynomial pivot rule for the simplex method for linear programming, policy iteration for Markov decision processes, and strategy improvement for parity games each are prominent open problems in their respective fields.…

The aim of this paper is two-fold: first, we look at the fractional Laplacian and the conformal fractional Laplacian from the general framework of representation theory on symmetric spaces and, second, we construct new boundary operators…

Whereas matrix rank is additive under direct sum, in 1981 Sch\"onhage showed that one of its generalizations to the tensor setting, tensor border rank, can be strictly subadditive for tensors of order three. Whether border rank is additive…

In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…

A presentation of numerical range for rectangular matrices is undertaken in this paper, introducing two different definitions and elaborating basic properties. Then we are extended to the treatment of rank-k numerical range.

In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…

We give a lower bound for the Waring rank and cactus rank of forms that are invariant under an action of a connected algebraic group. We use this to improve the Ranestad--Schreyer--Shafiei lower bounds for the Waring ranks and cactus ranks…

We derive a priori bounds on the size of the structure constants of the free Lie algebra over a set of indeterminates, relative to its Hall bases. We investigate their asymptotic growth, especially as a function of the length of the…

Constant-recursive sequences are those which satisfy a linear recurrence, so that later terms can be obtained as a linear combination of the previous ones. The rank of a constant-recursive sequence is the minimal number of previous terms…

We generalize the prior linked symplectic Grassmannian construction, applying it to to prove smoothing results for rank-2 limit linear series with fixed special determinant on chains of curves. We apply this general machinery to prove new…

In this paper, we study several definitions of generalized rank weights for arbitrary finite extensions of fields. We prove that all these definitions coincide, generalizing known results for extensions of finite fields.

We complete the study of characters on higher rank semisimple lattices initiated in [BH19,BBHP20], the missing case being the case of lattices in higher rank simple algebraic groups in arbitrary characteristics. More precisely, we…

For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal…

Estimating the linear dimensionality of a data set in the presence of noise is a common problem. However, data may also be corrupted by monotone nonlinear distortion that preserves the ordering of matrix entries but causes linear methods…

This paper studies the problem of finding best rank-1 approximations for both symmetric and nonsymmetric tensors. For symmetric tensors, this is equivalent to optimizing homogeneous polynomials over unit spheres; for nonsymmetric tensors,…