中文
相关论文

相关论文: A seventeenth-order polylogarithm ladder

200 篇论文

For a given rational number $x$ and an integer $s\geq 1$, let us consider a generalized polylogarithmic function, often called the Lerch function, defined by $$\Phi_{s}(x,z)= \sum_{k=0}^{\infty}\frac{z^{k+1}}{(k+x+1)^s}\enspace.$$ We prove…

数论 · 数学 2023-01-06 Sinnou David , Noriko Hirata-Kohno , Makoto Kawashima

Historically, the polylogarithm has attracted specialists and non-specialists alike with its lovely evaluations. Much the same can be said for Euler sums (or multiple harmonic sums), which, within the past decade, have arisen in…

经典分析与常微分方程 · 数学 2007-06-13 Jonathan M. Borwein , David M. Bradley , David J. Broadhurst , Petr Lisonek

In 1990, Kolesova, Lam and Thiel determined the 283,657 main classes of Latin squares of order 8. Using techniques to determine relevant Latin trades and integer programming, we examine representatives of each of these main classes and…

组合数学 · 数学 2018-07-30 Richard Bean

This article focuses on some rings of integers of number fields which are known to be norm-Euclidean domains, but for which no explicit algorithm computing the Euclidean division has yet been studied or implemented. The rings of integers we…

数论 · 数学 2026-02-16 Christophe Levrat

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…

组合数学 · 数学 2023-01-03 Christos A. Athanasiadis , Katerina Kalampogia-Evangelinou

The smoothed analysis of algorithms is concerned with the expected running time of an algorithm under slight random perturbations of arbitrary inputs. Spielman and Teng proved that the shadow-vertex simplex method has polynomial smoothed…

数据结构与算法 · 计算机科学 2016-12-23 Roman Vershynin

For a graph $G$, let $Z(G,\lambda)$ be the partition function of the monomer-dimer system defined by $\sum_k m_k(G)\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a…

数据结构与算法 · 计算机科学 2013-09-05 Marc Lelarge , Hang Zhou

Let $\mathscr{L}$ denote the $\mathbf{Q}$-vector space of logarithms of algebraic numbers. In this expository work, we provide an introduction to the study of ranks of matrices with coefficients in $\mathscr{L}$. We begin by considering a…

数论 · 数学 2024-01-03 Samit Dasgupta

Let $p(n)$ denote the number of partitions of a natural number $n$. As $ n \to \infty$, the $n$th root of $p(n)$ tends to $1$, which is related to the Cauchy--Hadamard test for power series. Andrews also discovered an elementary proof. Sun…

组合数学 · 数学 2026-01-19 Bernhard Heim und Markus Neuhauser

The class of cographs is one of the most well-known graph classes, which is also known to be equivalent to the class of $P_4$-free graphs. We show that Mader's conjecture is true if we restrict ourselves to cographs, that is, for any tree…

组合数学 · 数学 2025-11-18 Toru Hasunuma

Let $A \in Z^{m \times n}$, $rank(A) = n$, $b \in Z^m$, and $P$ be an $n$-dimensional polyhedron, induced by the system $A x \leq b$. It is a known fact that if $F$ is a $k$-face of $P$, then there exist at least $n-k$ linearly independent…

离散数学 · 计算机科学 2022-11-09 D. V. Gribanov , D. S. Malyshev , I. A. Shumilov

We present the subalgebra structure of sl(3,O), a particular real form of E6 chosen for its relevance to particle physics through the connection between its associated Lie group SL(3,O) and generalized Lorentz groups. Given the…

环与代数 · 数学 2007-12-21 Aaron Wangberg

We derive polynomial identities of arbitrary degree $n$ for syzygies degrees of numerical semigroups S_m=<d_1,...,d_m> and show that for n>=m they contain higher genera G_r=\sum_{s\in Z_>\setminus S_m}s^r of S_m. We find a number…

交换代数 · 数学 2020-12-25 Leonid G. Fel

A symmetric matrix is called a Laplacian if it has nonpositive off-diagonal entries and zero row sums. Since the seminal work of Spielman and Teng (2004) on solving Laplacian linear systems in nearly linear time, several algorithms have…

数据结构与算法 · 计算机科学 2023-04-28 Sushant Sachdeva , Yibin Zhao

We introduce Lehmer codes, with immersions in the Bruhat order, for several finite Coxeter groups, including all the classical Weyl groups. This allows to associate to each lower Bruhat interval of these groups a multicomplex whose…

组合数学 · 数学 2025-09-09 Davide Bolognini , Paolo Sentinelli

Let $\Delta \subset \R^n$ be an $n$-dimensional lattice polytope. It is well-known that $h_{\Delta}^*(t) := (1-t)^{n+1} \sum_{k \geq 0} |k\Delta \cap \Z^n| t^k $ is a polynomial of degree $d \leq n$ with nonnegative integral coefficients.…

组合数学 · 数学 2007-05-23 Victor Batyrev

The "$10$-fold way" refers to the combined classification of the $3$ associative division algebras (of real, complex and quaternionic numbers) and of the $7$, ${\mathbb Z}_2$-graded, superdivision algebras (in a superdivision algebra each…

数学物理 · 物理学 2023-03-29 Zhanna Kuznetsova , Francesco Toppan

We consider nested sums involving the Pochhammer symbol at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi,$ $\log(2)$ or zeta values. In order to perform these simplifications, we view the series as…

组合数学 · 数学 2019-04-11 Jakob Ablinger

For every monic polynomial $f \in \mathbb{Z}[X]$ with $\operatorname{deg}(f) \geq 1$, let $\mathcal{L}(f)$ be the set of all linear recurrences with values in $\mathbb{Z}$ and characteristic polynomial $f$, and let \begin{equation*}…

数论 · 数学 2024-01-17 Federico Accossato , Carlo Sanna

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…

数论 · 数学 2024-10-01 Manjul Bhargava