Related papers: On the minimal polynomials of the arguments of dil…

A Ringel ladder can be formed by a self-bar-amalgamation operation on a symmetric ladder, that is, by joining the root vertices on its end-rungs. The present authors have previously derived criteria under which linear chains of copies of…

We identify two families of ten-point Feynman diagrams that generalize the elliptic double box, and show that they can be expressed in terms of the same class of elliptic multiple polylogarithms to all loop orders. Interestingly, one of…

This work introduces a new concept, the so-called Darboux family, which is employed to determine, to analyse geometrically, and to classify up to Lie algebra automorphisms, in a relatively easy manner, coboundary Liebialgebras on real…

An arbitrary-depth reduction theorem for the `convolution' multiple L-values of Euler-Zagier type is proven by an analytic method. To this end, generalized polylogarithms associated to Dirichlet characters are defined. The proof uses the…

We classify all two-dimensional simple algebras (which may be non-associative) over an algebraically closed field. For each two-dimensional algebra $\mathcal{A}$, we describe a minimal (with respect to inclusion) generating set for the…

We construct polylogarithms on families of pointed Riemann surfaces of any genus which describe monodromies of meromorphic connections with simple poles. Furthermore, we show that the polylogaritms are computable as power series in…

For a finite dimensional simple complex Lie algebra $\mathfrak{g}$, Lie bialgebra structures on $\mathfrak{g}[[u]]$ and $\mathfrak{g}[u]$ were classified by Montaner, Stolin and Zelmanov. In our paper, we provide an explicit algorithm to…

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

This thesis establishes a geometric approach to the de Rham realization of the polylogarithm. As a central result we construct the logarithm sheaves of rational abelian schemes in terms of the birigidified Poincar\'e bundle with universal…

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

Motivated by the Dani-Mainkar construction, we extend the notion of independence polynomial of graphs to arbitrary 2-step nilpotent Lie algebras. After establishing efficiently computable upper and lower bounds for the independence number,…

A proof is sketched of the Polynomial Conjecture of the author (circulated as preprint "Brick Tiling and Monotone Boolean Functions", available at the http://www.math.ufl.edu/~squash/tilingstuff.html url) which says that the family of…

The present paper is a continuation of [5], where Lie bialgebra structures on g[u] were studied. These structures fall into different classes labelled by the vertices of the extended Dynkin diagram of g. In [5] the Lie bialgebras…

We define lowest weight polynomials (LWPs), motivated by $so(d,2)$ representation theory, as elements of the polynomial ring over $ d \times n $ variables obeying a system of first and second order partial differential equations. LWPs…

For a square-free bivariate polynomial $p$ of degree $n$ we introduce a simple and fast numerical algorithm for the construction of $n\times n$ matrices $A$, $B$, and $C$ such that $\det(A+xB+yC)=p(x,y)$. This is the minimal size needed to…

In this paper, we obtain the ladder operators and associated compatibility conditions for the type I and the type II multiple orthogonal polynomials. These ladder equations extend known results for orthogonal polynomials and can be used to…

Let $(N, J)$ be a simply connected $2n$-dimensional nilpotent Lie group endowed with an invariant complex structure. We define a left invariant Riemannian metric on $N$ compatible with $J$ to be minimal, if it minimizes the norm of the…

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…