Related papers: Can polylogarithms at algebraic points be linearly…

Consider some non-zero complex numbers $a_i, b_i, c_i, d_i$ with $1 \leq i \leq n$ and the associated classical Lotka-Volterra systems \[ \begin{cases} x' = a_i xy + b_i y \newline y' = c_i xy + d_i y \text{ .} \end{cases} \] We show that…

We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…

Let $p_1,...,p_L\in Z[x_1,...,x_d]$ be non-constant polynomials with zero constant term. The ergodic theoretical proofs of the polynomial and the IP-polynomial Szemeredi theorems as well as some of the ergodic-theoretical and combinatorial…

A linear polyomial non-negative on the non-negativity domain of finitely many linear polynomials can be expressed as their non-negative linear combination. Recently, under several additional assumptions, Helton, Klep, and McCullough…

Let $\chi$ be a real and non-principal Dirichlet character, $L(s,\chi)$ its Dirichlet $L$-function and let $p$ be a generic prime number. We prove the following result: If for some $0\leq \sigma<1$ the partial sums $\sum_{p\leq…

We present an algorithm, based on the explicit formula for $L$-functions and conditional on GRH, for proving that a given integer is squarefree with little or no knowledge of its factorization. We analyze the algorithm both theoretically…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Our aim is to explain instances in which the value of the logarithmic Mahler measure of a polynomial can be written in an unexpectedly neat manner. To this end we examine polynomials defining rational curves, which allows their zero-locus…

In even-dimensional Euclidean space for integer powers of the Laplacian greater than or equal to the dimension divided by two, a fundamental solution for the polyharmonic equation has logarithmic behavior. We give two approaches for…

Let $L$ be a linear symmetric differential operators on $L^{2}\left( \mathbb{R}\right) $ whose domain is the Schwartz test function space, $\mathcal{S}.$ For the majority of this paper, it is assumed that the coefficient of $L$ are…

Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $q$ elements and let $\theta$ be a generator of the cyclic group $\mathbb F_q^*$. For each $a\in \mathbb F_q^*$, let $\log_{\theta} a$ be the unique integer $i\in \{1,…

We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…

We prove, in a quantitative form, linear independence results for values of a certain class of q-series, which generalize classical q-hypergeometric series. These results refine our recent estimates.

Let $\Re_n$ be the set of all rational functions of the type $r(z) = p(z)/w(z),$ where $p(z)$ is a polynomial of degree at most $n$ and $w(z) = \prod_{j=1}^{n}(z-a_j)$, $|a_j|>1$ for $1\leq j\leq n$. In this paper, we set up some results…

For $\alpha$ a positive irrational, let $\mathcal{A}_{\alpha}$ be the subalgebra of continuous functions on the two-torus whose Fourier transform vanishes at $(m, n)$ if $m + \alpha n < 0.$ These algebras were studied by Wermer and others,…

We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…

We start with the Lorentz algebra $ L=o_{R}(1,3)$ over the reals and find a suitable basis $B$ relative to which the structure constants are integers. Thus we consider the $Z$-algebra $L_{Z}$ which is free as a $Z$-module and its $Z$-basis…

These lecture notes show that linear probing takes expected constant time if the hash function is 5-independent. This result was first proved by Pagh et al. [STOC'07,SICOMP'09]. The simple proof here is essentially taken from [Patrascu and…

We establish several results concerning the expected general phenomenon that, given a multiplicative function $f:\mathbb{N}\to\mathbb{C}$, the values of $f(n)$ and $f(n+a)$ are "generally" independent unless $f$ is of a "special" form.…

We show that maximal $S$-free convex sets are polyhedra when $S$ is the set of integral points in some rational polyhedron of $\mathbb{R}^n$. This result extends a theorem of Lov\'asz characterizing maximal lattice-free convex sets. Our…