Related papers: Weighted lattice polynomials

We introduce a class of functions which constitutes an obvious elliptic generalization of multiple polylogarithms. A subset of these functions appears naturally in the \epsilon-expansion of the imaginary part of the two-loop massive sunrise…

We study the mixed-integer epigraph of a special class of convex functions with non-convex indicator constraints, which are often used to impose logical constraints on the support of the solutions. The class of functions we consider are…

We approximate $d$-variate periodic functions in weighted Korobov spaces with general weight parameters using $n$ function values at lattice points. We do not limit $n$ to be a prime number, as in currently available literature, but allow…

We introduce weighted cycles on weaves of general Dynkin types and define a skew-symmetrizable intersection pairing between weighted cycles. We prove that weighted cycles on a weave form a Laurent polynomial algebra and construct a…

We show that a large class of Euclidean extended supersymmetric lattice gauge theories constructed in [hep-lat/0302017 - hep-lat/0503039] can be regarded as compact formulations by using the polar decomposition of the complex link fields.…

Lucas polynomials are polynomials in $s_1$ and $s_2$ defined recursively by $\{0\}=0$, $\{1\}=1$, and $\{m\}=s_1\{m-1\}+s_2\{m-2\}$ for $m \geq 2$. We generalize Lucas polynomials from 2-variable polynomials to multivariable polynomials.…

This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…

In this paper we obtain the average sensitivity of the laced Boolean functions. This confirms a conjecture of Shparlinski. We also compute the weights of the laced Boolean functions and show that they are almost balanced.

We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…

We restate a process presented by Stanley as a technique to prove that there exists exactly one $d$-differential distributive lattice for any positive integer $d$. This process can be trivially extended to apply to distributive finitary…

In the present paper, by extending some fractional calculus to the framework of Cliffors analysis, new classes of wavelet functions are presented. Firstly, some classes of monogenic polynomials are provided based on 2-parameters weight…

Wigner limits are given formally as the difference between a lattice sum, associated to a positive definite quadratic form, and a corresponding multiple integral. To define these limits, which arose in work of Wigner on the energy of static…

In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…

All squigonometric functions admit derivatives that can be expressed as polynomials of the squine and cosquine. We introduce a general framework that allows us to determine these polynomials recursively. We also provide an explicit formula…

Weighted First-Order Model Counting (WFOMC) computes the weighted sum of the models of a first-order theory on a given finite domain. WFOMC has emerged as a fundamental tool for probabilistic inference. Algorithms for WFOMC that run in…

We introduce the notion of a pre-sequence of matrix orthogonal polynomials to mean a sequence {F_n} of matrix orthogonal functions with respect to a weight function W, satisfying a three term recursion relation and such that det(F_0) is not…

Studying degenerate versions of various special polynomials have become an active area of research and yielded many interesting arithmetic and combinatorial results. Here we introduce a degenerate version of polylogarithm function, called…

It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…

We introduce two classes of homogeneous polynomials and show their role in constructing of integrable hierarchies for some integrable lattices.

We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…