Related papers: Multiple polylogarithms, a regularisation process …
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…
Boolean functions are mathematical objects used in diverse domains and have been actively researched for several decades already. One domain where Boolean functions play an important role is cryptography. There, the plethora of settings one…
We describe a procedure, called regularisation, that allows us to study geometric structures on Lie algebroids via foliated geometric structures on a manifold of higher dimension. This procedure applies to various classes of Lie algebroids;…
Let $H_k = 1 + 1/2 + 1/3 + \cdots + 1/k$ denote the $k$th harmonic number. We present an easy-to-implement algorithm for the computation of explicit closed-form evaluations, in terms of the digamma and polygamma functions, for Euler sums of…
A discrete conformality for hyperbolic polyhedral surfaces is introduced in this paper. This discrete conformality is shown to be computable. It is proved that each hyperbolic polyhedral metric on a closed surface is discrete conformal to a…
The purpose of this paper is to present a solution to perhaps the final remaining case in the line of study concerning the generalization of Forelli's theorem on the complex analyticity of the functions that are: (1) $\mathcal{C}^\infty$…
This paper is concerned with a novel regularisation technique for solving linear ill-posed operator equations in Hilbert spaces from data that is corrupted by white noise. We combine convex penalty functionals with extreme-value statistics…
Some prominent discretisation methods such as finite elements provide a way to approximate a function of $d$ variables from $n$ values it takes on the nodes $x_i$ of the corresponding mesh. The accuracy is $n^{-s_a/d}$ in $L^2$-norm, where…
The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymorphism properties under some basic graph theoretic…
Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…
Given a family of pairs of modules parametrised by a smooth space Y, the Multiplicity-Polar Theorem relates the multiplicity of the pair of modules at a special point of the parameter to the multiplicity of the pair at a generic point. This…
In this paper we extend the dichotomy given by Samuelsson and Wold that can be thought of as an analogue of the Wermer maximality theorem in $\mathbb{C}^2$ for certain polynomial polyhedra. We consider complex non-degenerate simply…
In the present paper, we derive formulas of complex and $\ell$-adic multiple polylogarithms, which have two aspects: a duality in terms of indexes and a reflection in terms of variables. We provide an algebraic proof of these formulas by…
This paper extends and analyzes the high-order kernel regularization framework of Beale & Tlupova (arXiv:2510.13639) to all four on-surface boundary integral operators of the Helmholtz Calderon calculus in three dimensions: the…
One-parameter smooth families of circles in the complex plane with the following property are described: a function is polyanalytic if and only if it has meromorphic extension inside any circle from the family, with the only singularity-a…
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…
Borel summable divergent series usually appear when studying solutions of analytic ODE near a multiple singular point. Their sum, uniquely defined in certain sectors of the complex plane, is obtained via the Borel--Laplace transformation.…
We study the Euler-Lagrange cohomology and explore the symplectic or multisymplectic geometry and their preserving properties in classical mechanism and classical field theory in Lagrangian and Hamiltonian formalism in each case…
In this paper we study convergence estimates for a multigrid algorithm with smoothers of successive subspace correction (SSC) type, applied to symmetric elliptic PDEs. First, we revisit a general convergence analysis on a class of multigrid…
Many tasks in geometry processing are modeled as variational problems solved numerically using the finite element method. For solid shapes, this requires a volumetric discretization, such as a boundary conforming tetrahedral mesh.…