Related papers: Polylogarithmic functions with prescribed branchin…

Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…

Polynomial system solving arises in many application areas to model non-linear geometric properties. In such settings, polynomial systems may come with degeneration which the end-user wants to exclude from the solution set. The…

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

The article is devoted to investigation of the classes of functions belonging to the gaps between classes $P_{n+1}(I)$ and $P_{n}(I)$ of matrix monotone functions for full matrix algebras of successive dimensions. In this paper we address…

In this article we discuss the solvability of some class of fully nonlinear equations, and equations with p-Laplacian in more general conditions by using a new approach given in [1] for studying the nonlinear continuous operator. Moreover…

Special functions like the polygamma, Hurwitz zeta, and Lerch zeta functions have sporadically been connected with the nth derivatives of trigonometric functions. We show the polylogarithm $\text{Li}_s(z)$, a function of complex argument…

We consider the problem of the computation of $\inf_p \theta p$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $\theta$. An effective algorithm is presented. The output of the…

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 we study the complexity of the problems: given a loop, described by linear constraints over a finite set of variables, is there a linear or lexicographical-linear ranking function for this loop? While existence of such…

Existence and global regularity results for boundary-value problems of Robin type for harmonic and polyharmonic functions in $n$-dimensional half-spaces are offered. The Robin condition on the normal derivative on the boundary of the…

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

We study the problem of synthesizing polyhedral Lyapunov functions for hybrid linear systems. Such functions are defined as convex piecewise linear functions, with a finite number of pieces. We first prove that deciding whether there exists…

Using a multiple critical points theorem for locally Lipschitz continuous functionals, we establish the existence of at least three distinct solutions for a parametric discrete differential inclusion problem involving a real symmetric and…

Numerous examples of functional relations for multiple polylogarithms are known. For elliptic polylogarithms, however, tools for the exploration of functional relations are available, but only very few relations are identified. Starting…

We introduce a basis of rational polynomial-like functions $P_0,\ldots,P_{n-1}$ for the free module of functions $Z/nZ\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the…

Finding the length of the longest increasing subsequence (LIS) is a classic algorithmic problem. Let $n$ denote the size of the array. Simple $O(n\log n)$ algorithms are known for this problem. We develop a polylogarithmic time randomized…

We describe all linear operators on spaces of multivariate polynomials preserving the property of being non-vanishing in open circular domains. This completes the multivariate generalization of the classification program initiated by…

The aim of this article is to introduce the H-infinity functional calculus for unbounded bisectorial operators in a Clifford module over the algebra R_n. While recent studies have focused on bounded operators or unbounded paravector…

Polynomial algorithms are given for the following two problems: given a graph with $n$ vertices and $m$ edges, where $m \ge 3 n^{3/2}$, find a complete balanced bipartite subgraph with parts about $\ln n/(\ln (n^2/m))$, given a graph with…

We introduce the notion of Local Computation Mechanism Design - designing game theoretic mechanisms which run in polylogarithmic time and space. Local computation mechanisms reply to each query in polylogarithmic time and space, and the…