Related papers: A seventeenth-order polylogarithm ladder
The degrees of polynomials representing or approximating Boolean functions are a prominent tool in various branches of complexity theory. Sherstov recently characterized the minimal degree deg_{\eps}(f) among all polynomials (over the…
Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…
Consider a matrix $\mathbf{F} \in \mathbb{K}[x]^{m \times n}$ of univariate polynomials over a field $\mathbb{K}$. We study the problem of computing the column rank profile of $\mathbf{F}$. To this end we first give an algorithm which…
Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitably partitioned into a bounded number of parts…
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…
We use a variety of computational tools to obtain a degree-$\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \times n$ matrix. The degree of this equation has…
Given a monogenic function on the quaternionic algebra $\mathbb{H}$, the Clifford algebra $\mathbb{R}_n$ or the octonionic algebra $\mathbb{O}$ we prove that $|\nabla^m f|^\alpha$ is subharmonic for some $\alpha>0$ where $\nabla^m f$ is the…
The Euclidean algorithm is one of the oldest algorithms known to mankind. Given two integral numbers $a_1$ and $a_2$, it computes the greatest common divisor (gcd) of $a_1$ and $a_2$ in a very elegant way. From a lattice perspective, it…
We investigate the real Lie algebra of first-order differential operators with polynomial coefficients, which is subject to the following requirements. (1) The Lie algebra should admit a basis of differential operators with homogeneous…
A crucial ingredient in the recent discovery by Ablowitz, Halburd, Herbst and Korhonen \cite{AHH}, \cite {HK-2} that a connection exists between discrete Painlev\'e equations and (finite order) Nevanlinna theory is an estimate of the…
Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…
A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…
Polynomial sequence ${P_m}_{m\geq0}$ is $q$-logarithmically concave if $P_{m}^2-P_{m+1}P_{m-1}$ is a polynomial with nonnegative coefficients for any $m\geq{1}$. We introduce an analogue of this notion for formal power series whose…
Of the $(2H+1)^n$ monic integer polynomials $f(x)=x^n+a_1 x^{n-1}+\cdots+a_n$ with $\max\{|a_1|,\ldots,|a_n|\}\leq H$, how many have associated Galois group that is not the full symmetric group $S_n$? There are clearly $\gg H^{n-1}$ such…
Exceptional orthogonal Hermite and Laguerre polynomials have been linked to the k-step extension of harmonic and singular oscillators. The exceptional polynomials allow the existence of different supercharges from the Darboux-Crum and…
The classical Stern sequence of positive integers was extended to a polynomial sequence $S_n(\lambda)$ by Klav\v{z}ar et. al. by defining $S_0(\lambda) = 0$, $S_1(\lambda) = 1$, and $$S_{2n}(\lambda) = \lambda S_n(\lambda),\quad…
Lasserre [La] proved that for every compact set $K\subset\mathbb R^n$ and every even number $d$ there exists a unique homogeneous polynomial $g_0$ of degree $d$ with $K\subset G_1(g_0)=\{x\in\mathbb R^n:g_0(x)\leq 1\}$ minimizing $|G_1(g)|$…
Given nonnegative integers $n$ and $d$, where $n \gg d$, what is the minimum number $r$ such that there exist linear forms $\ell_1, \ldots, \ell_r \in \mathbb{C}[x_1, \ldots, x_n]$ so that $\ell_1^d + \cdots + \ell_r^d$ is supported exactly…
An extension of the theory of the Iterated Logarithmic Algebra gives the logarithmic analog of a Sheffer or Appell sequence of polynomials. This leads to several examples including Stirling's formula and a logarithmic version of the…
A vanishing sum of roots of unity is called minimal if no proper, nonempty sub-sum of it vanishes. This paper classifies all minimal vanishing sums of roots of unity of weight at most 16 by hand, thereby uncovering new phenomena beyond the…