Related papers: Linear independence of periods related to polyloga…
We study the de Rham fundamental group of the configuration space $E^{(n)}$ of $n+1$ marked points on an elliptic curve $E$, and define multiple elliptic polylogarithms. These are multivalued functions on $E^{(n)}$ with unipotent monodromy,…
In this paper, to the best of our knowledge, we make the first attempt at studying the parametric semilinear elliptic eigenvalue problems with the parametric coefficient and some power-type nonlinearities. The parametric coefficient is…
We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…
The goal of this paper is to present examples of families of homogeneous ideals in the polynomial ring over a field that satisfy the following condition: every product of ideals of the family has a linear free resolution. As we will see,…
We establish the independence of multipliers for polynomial endomorphisms of $\mathbb C^n$ and endomorphisms of $\mathbb P^n.$ This allows us to extend results about the bifurcation measure and the critical height obtained in…
Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…
We settle the computational complexity of fundamental questions related to multicriteria integer linear programs, when the dimensions of the strategy space and of the outcome space are considered fixed constants. In particular we construct:…
Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…
We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitely representable matroids (which is not possible for…
We present a deterministic algorithm which computes the multilinear factors of multivariate lacunary polynomials over number fields. Its complexity is polynomial in $\ell^n$ where $\ell$ is the lacunary size of the input polynomial and $n$…
A representation of the Pad\'e approximation of the $Z$-transform of a signal as a resolvent of a tridiagonal matrix $J$ is given. Several formulas for the poles, zeros and residues of the Pad\'e approximation in terms of the matrix $J$ are…
We study four (families of) sets of algebraic integers of degree less than or equal to three. Apart from being simply defined, we show that they share two distinctive characteristics: almost uniformity and arithmetical independence. Here,…
We study values of generalized polylogarithms at various points and relationships among them. Polylogarithms of small weight at the points 1/2 and -1 are completely investigated. We formulate a conjecture about the structure of the linear…
A full multigrid finite element method is proposed for semilinear elliptic equations. The main idea is to transform the solution of the semilinear problem into a series of solutions of the corresponding linear boundary value problems on the…
We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…
We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…
This paper shows that algebraic (in)dependence is encoded in Milnor K-theory of fields. As an application, we show that the isomorphism type of a field is determined by its Milnor K-theory, up to purely inseparable extensions, in most…
Let $\overline{k}$ be a fixed algebraic closure of $k$. When the finite place $v$ is of degree one, we show that all $\overline{k}$-linear relations among $v$-adic Carlitz multiple polylogarithms at algebraic points arise from $k$-linear…
We study Pad\'e interpolation problems on an additive grid, related to additive difference ($d$-) Painlev\'e equations of type $E_7^{(1)}$, $E_6^{(1)}$, $D_4^{(1)}$ and $A_3^{(1)}$. By choosing suitable Pad\'e problems, we can derive time…
Pearl and Verma developed d-separation as a widely used graphical criterion to reason about the conditional independencies that are implied by the causal structure of a Bayesian network. As acyclic ground probabilistic logic programs…