相关论文: Linear independence of periods related to polyloga…
Pad\'e approximants are rational functions whose series expansion match a given series as far as possible. These approximants are usually written under a rational form. In this paper, we will show how to write them also under two different…
We prove that of the creator operators, on the $d$ commuting indeterminates polynomial algebra, are linearly independent. We further study the connection between the classical (one dimensional) and the multi-dimensional ($d$-dimensional, $d…
In this paper, we propose a domain decomposition method for multiscale second order elliptic partial differential equations with highly varying coefficients. The method is based on a discontinuous Galerkin formulation. We present both a…
Variational formulations of time-dependent PDEs in space and time yield $(d+1)$-dimensional problems to be solved numerically. This increases the number of unknowns as well as the storage amount. On the other hand, this approach enables…
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…
In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…
This paper explores the Law of the Iterated Logarithm (LIL) for $m$-dependent sequences under the framework of sub-linear expectations. We first extend existing LIL results to sequences of independent, non-identically distributed random…
Log-linear models are the popular workhorses of analyzing contingency tables. A log-linear parameterization of an interaction model can be more expressive than a direct parameterization based on probabilities, leading to a powerful way of…
For a large class of systems of o.d.e.'s which have first integrals, the method of arrays yields the following results: i) The first integrals $I$ can be found by solving systems of linear equations. ii) How the first integral $I$ responds…
In this paper, we study linear forms \[\lambda = \beta_1\mathrm{e}^{\alpha_1}+\cdots+\beta_m\mathrm{e}^{\alpha_m},\] where $\alpha_i$ and $\beta_i$ are algebraic numbers. An explicit lower bound for the absolute value of $\lambda$ is…
We prove an analogue of the Lindemann-Weierstrass theorem (that the exponentials of Q-linearly independent algebraic numbers are algebraically independent) for commutative algebraic groups G without unipotent quotients, over function…
Let $(x_1,y_1),\ldots,(x_n,y_n)$ be distinct non-constant and non-degenerate solutions of the classical Lotka-Volterra system \begin{equation}\notag \begin{split} x'&= axy + bx\\ y'&= cxy + dy, \end{split} \end{equation} where…
Algebraic independence is an advanced notion in commutative algebra that generalizes independence of linear polynomials to higher degree. Polynomials {f_1, ..., f_m} \subset \F[x_1, ..., x_n] are called algebraically independent if there is…
We introduce algebraic sets in the products of complex projective spaces for the mixed states in multipartite quantum systems as their invariants under local unitary operations. The algebraic sets have to be the union of the linear…
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
For a directed acyclic graph, there are two known criteria to decide whether any specific conditional independence statement is implied for all distributions factorized according to the given graph. Both criteria are based on special types…
In this article we obtain new irrationality measures for values of functions which belong to a certain class of hypergeometric functions including shifted logarithmic functions, binomial functions and shifted exponential functions. We…
In this paper we study linear and non-linear Fourier-Pad\'e approximation for Angelesco systems of functions. This construction is similar to that of Hermite-Pad\'e approximation. Instead of considering power series expansions of the…
Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…
We present here algorithms for efficient computation of linear algebra problems over finite fields.