相关论文: A seventeenth-order polylogarithm ladder

Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the edges set $E(H)$ of the graph $H$ ($H$ is a subgraph of $K_{m}$). We use the symbol $Z_4$ to denote $K_4-P_2.$ A sequence $S$ is potentially $K_{m}-H$-graphical if it has a…

The Mahler measure of a monic polynomial $P(x) = a_dx^d + a_{d-1}x^{d-1} + \dots + a_1x + a_0$ is defined as $M(P) := |a_d| \prod_{P(\alpha)=0} \max\{1, |\alpha|\}$, where the product runs over all roots of $P$. Lehmer's problem asks…

Let $\theta $ be a Salem number and $P(x)$ a polynomial with integer coefficients. It is well-known that the sequence $(\theta^n)$ modulo 1 is dense but not uniformly distributed. In this article we discuss the sequence $(P(\theta^n))$…

Starting from the four normed division algebras - the real numbers, complex numbers, quaternions and octonions - a systematic procedure gives a 3-cocycle on the Poincare Lie superalgebra in dimensions 3, 4, 6 and 10. A related procedure…

The modified B_{n}^{*} = \sum_{r=0}^{n} \binom{n+r}{2r} \frac{B_{r}}{n+r}, \quad n > 0 introduced by D. Zagier in 1998 are extended to the polynomial case by replacing $B_{r}$ by the Bernoulli polynomials $B_{r}(x)$. Properties of these new…

The WL-dimension of a graph X is the smallest positive integer m such that the m-dimensional Weisfeiler-Leman algorithm correctly tests the isomorphism between X and any other graph. It is proved that the WL-dimension of any circulant graph…

Let $\mathbb{F}$ be a field of characteristic zero and let $\mathfrak{g}$ be a non-zero finite-dimensional split semisimple Lie algebra with root system $\Delta$. Let $\Gamma$ be a finite set of integral weights of $\mathfrak{g}$ containing…

Define $|n|$ to be the complexity of $n$, the smallest number of 1's needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $|n|\ge 3\log_3 n$ for all $n$. Define the defect of $n$,…

The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…

The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros of a linear recurrence sequence is the union of a finite set and finitely many arithmetic progressions. The corresponding computational question, the Skolem Problem,…

We give a polynomial delay algorithm, that for any graph $G$ and positive integer $k$, enumerates all connected induced subgraphs of $G$ of order $k$. Our algorithm enumerates each subgraph in at most…

Machin-like arctangent relations are classical tools for computing $\pi$, with efficiency quantified by the Lehmer measure ($\lambda$). We present a framework for discovering low-measure relations by coupling the PSLQ integer-relation…

Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…

LSP(n), the largest small polygon with n vertices, is the polygon of unit diameter that has maximal area A(n). It is known that for all odd values $n \geq 3$, LSP(n) is the regular n-polygon; however, this statement is not valid for even…

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…

We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \emph{arbitrary} undirected graph on n vertices. We study the detection task between a ``null'' Erd\H{o}s-R\'{e}nyi random graph G(n,p)…

For every complex number $x$, let $\Vert x\Vert_{\mathbb{Z}}:=\min\{|x-m|:\ m\in\mathbb{Z}\}$. Let $K$ be a number field, let $k\in\mathbb{N}$, and let $\alpha_1,\ldots,\alpha_k$ be non-zero algebraic numbers. In this paper, we completely…

Let $K$ be a number field of degree $n$ with ring of integers $O_K$. By means of a criterion of Gilmer for polynomially dense subsets of the ring of integers of a number field, we show that, if $h\in K[X]$ maps every element of $O_K$ of…

The alternating and non-alternating harmonic sums and other algebraic objects of the same equivalence class are connected by algebraic relations which are induced by the product of these quantities and which depend on their index calss…

The Jordan algebra of the symmetric matrices of order two over a field $K$ has two natural gradings by $\mathbb{Z}_2$, the cyclic group of order 2. We describe the graded polynomial identities for these two gradings when the base field is…