Related papers: Can polylogarithms at algebraic points be linearly…
Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…
Recently the authors showed that the algebraic integers of the form $-m+\zeta_k$ are bases of a canonical number system of $\mathbb{Z}[\zeta_k]$ provided $m\geq \phi(k)+1$, where $\zeta_k$ denotes a $k$-th primitive root of unity and $\phi$…
We study the form of possible algebraic relations between functions satisfying linear differential equations. In particular , if f and g satisfy linear differential equations and are algebraically dependent, we give conditions on the…
We show that if n>1 then there exists a Lebesgue null set in R^n containing a point of differentiability of each Lipschitz function mapping from R^n to R^(n-1); in combination with the work of others, this completes the investigation of…
Let $L(s)=\sum_{n=1}^{+\infty}\dfrac{a(n)}{n^s}$ be a Dirichlet series were $a(n)$ is a bounded completely multiplicative function. We prove that if $L(s)$ extends to a holomorphic function on the open half space $\Re s >1-\delta$,…
Maximon has recently given an excellent summary of the properties of the Euler dilogarithm function and the frequently used generalizations of the dilogarithm, the most important among them being the polylogarithm function $Li_(z)$. The…
An independent set in a graph is a set of pairwise non-adjacent vertices. Let $\alpha(G)$ denote the cardinality of a maximum independent set in the graph $G = (V, E)$. Gutman and Harary defined the independence polynomial of $G$ \[ I(G;x)…
We study a planar polynomial differential system, given by \dot{x}=P(x,y), \dot{y}=Q(x,y). We consider a function I(x,y)=\exp \{h_2(x) A_1(x,y) \diagup A_0(x,y) \} h_1(x) \prod_{i=1}^{\ell} (y-g_i(x))^{\alpha_i}, where g_i(x) are algebraic…
In this article, we establish a Liouville-type inequality for polynomials evaluated at the values of arbitrary Siegel E-functions at non-zero algebraic points. Additionally, we provide a comparable result within the framework of Mahler M…
We prove that for every fixed integer $s$ and every planar graph $H$, the class of $H$-induced-minor-free and $K_{1,s}$-induced-subgraph-free graphs has polylogarithmic tree-independence number. This is a weakening of a conjecture of…
In 2023, Li, Du, Yi proved a uniqueness theorem for L functions in the extended Selberg class under the assumptions of positive degree, a shared functional equation, and the sharing of three complex values. This was later strengthened by…
One of the motivations to state HRT conjecture on the linear independence of finite Gabor systems was the fact that there are linearly dependent Finite Wavelet Systems (FWS). Meanwhile, there are also many examples of linearly independent…
In this paper, we first prove that given pairwise distinct algebraic numbers $\alpha_1, \ldots, \alpha_n$, the numbers $\alpha_1+t, \ldots, \alpha_n+t$ are multiplicatively independent for all sufficiently large integers $t$. Then, for a…
Polylogarithmic functions (polylogs) in $n$ variables can be viewed as elements of $(U\mathfrak{p}_{m})^*$, the dual of the universal enveloping algebra of the Lie algebra $\mathfrak{p}_{m}$ of infinitesimal spherical pure braids with…
In this article, we present a new linear independence criterion for values of the $p$-adic polygamma functions defined by J.~Diamond. As an application, we obtain the linear independence of some families of values of the $p$-adic Hurwitz…
We introduce a basis of rational polynomial-like functions $P_0,\ldots,P_{n-1}$ for the free module of functions $Z/nZ\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the…
A set of multivariate polynomials, over a field of zero or large characteristic, can be tested for algebraic independence by the well-known Jacobian criterion. For fields of other characteristic p>0, there is no analogous characterization…
Given a finite subset S in F_p^d, let a(S) be the number of distinct r-tuples (x_1,...,x_r) in S such that x_1+...+x_r = 0. We consider the "moments" F(m,n) = sum_|S|=n a(S)^m. Specifically, we present an explicit formula for F(m,n) as a…
The presence of symmetries is one of the central structural features that make some integer programs challenging for state-of-the-art solvers. In this work, we study the efficacy of Linear Programming (LP) hierarchies in the presence of…
Let $K$ be a field of characteristic zero and suppose that $f:\mathbb{N}\to K$ satisfies a recurrence of the form $$f(n)\ =\ \sum_{i=1}^d P_i(n) f(n-i),$$ for $n$ sufficiently large, where $P_1(z),...,P_d(z)$ are polynomials in $K[z]$.…