相关论文: A seventeenth-order polylogarithm ladder

We first summarize the basic structure of the outer distribution module of a completely regular code. Then, employing a simple lemma concerning eigenvectors in association schemes, we propose to study the tightest case, where the indices of…

Hadamard matrices of order $n$ are conjectured to exist whenever $n$ is $1$, $2$, or a multiple of $4$; a similar conjecture exists for skew Hadamard matrices. We provide constructions covering orders $\le 1208$ of all known Hadamard and…

A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…

We study arithmetic progressions in primes with common differences as small as possible. Tao and Ziegler showed that, for any $k \geq 3$ and $N$ large, there exist non-trivial $k$-term arithmetic progressions in (any positive density subset…

Let $k\ge 1$ be an integer, and let $P= (f_1(x), \ldots, f_k(x) )$ be $k$ admissible linear polynomials over the integers, or \textit{the pattern}. We present two algorithms that find all integers $x$ where $\max{ \{f_i(x) \} } \le n$ and…

We present an infinite family of finite planar graphs $\{X_n\}$ with degree at most five and such that for some constant $c > 0$, $$ \lambda_1(X_n) \geq c(\frac{\log \diam(X_n)}{\diam(X_n)})^2\,, $$ where $\lambda_1$ denotes the smallest…

We give a general method to construct a complete set of linearly independent Casimir operators of a Lie algebra with rank N. For a Casimir operator of degree p, this will be provided by an explicit calculation of its symmetric coefficients…

We evaluate multiple polylogarithm values at sixth roots of unity up to weight six, i.e. of the form $G(a_1,\ldots,a_w;1)$ where the indices $a_i$ are equal to zero or a sixth root of unity, with $a_1\neq 1$. For $w\leq 6$, we present bases…

We speed up existing decoding algorithms for three code classes in different metrics: interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the subspace metric, and linearized Reed-Solomon codes in the…

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

Let $m$ and $k \geq 2$ be positive integers. We show that polynomial $P = (1+x)^m(1+x^k)$ is strongly unimodal (frequently known as {\it log concave\/}) if and only if $m \geq k^2 -3$; this is also the criterion for $P$ to be merely…

Given a trivially graded polynomial ring $A=K[a_1,\dots,a_m]$ over a field $K$ and a positively graded polynomial ring $P=A[x_1,\dots,x_k]$, we study graded rings $R=P/I$, where $I$ is a homogeneous ideal in $P$ such that $I\cap A = \{0\}$.…

Recollements of derived module categories are investigated, using a new technique, ladders of recollements, which are mutation sequences. The position in the ladder is shown to control whether a recollement restricts from unbounded to…

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

Logarithmic Sobolev inequalities are a fundamental class of inequalities that play an important role in information theory. They play a key role in establishing concentration inequalities and in obtaining quantitative estimates on the…

We study $\{0, 1\}$ and $\{-1, 1\}$ polynomials $f(z)$, called Newman and Littlewood polynomials, that have a prescribed number $N(f)$ of zeros in the open unit disk $\mathcal{D} = \{z \in \mathbb{C}: |z| < 1\}$. For every pair $(k, n) \in…

The complexity of matrix multiplication is measured in terms of $\omega$, the smallest real number such that two $n\times n$ matrices can be multiplied using $O(n^{\omega+\epsilon})$ field operations for all $\epsilon>0$; the best bound…

Let $A$ be a finite dimensional algebra over an algebraically closed field $k$. Assume $A$ is a basic connected and triangular algebra with $n$ pairwise non-isomorphic simple modules. We consider the {\em Coxeter transformation} $\phi_A(T)$…

We prove two-sided estimates for the best (i.e., the smallest possible) constant $\,c_n(\alpha)\,$ in the Markov inequality $$ \|p_n'\|_{w_\alpha} \le c_n(\alpha) \|p_n\|_{w_\alpha}\,, \qquad p_n \in {\cal P}_n\,. $$ Here, ${\cal P}_n$…

The interlace polynomial q was introduced by Arratia, Bollobas, and Sorkin. It encodes many properties of the orbit of a graph under edge local complementation (ELC). The interlace polynomial Q, introduced by Aigner and van der Holst,…