Related papers: Recursive, parameter-free, explicitly defined inte…
We introduce and characterize a particularly tractable class of unital type 1 C*-algebras with bounded dimension of irreducible representations. Algebras in this class are called recursive subhomogeneous algebras, and they have an inductive…
We propose principled Gaussian processes (GPs) for modeling functions defined over the edge set of a simplicial 2-complex, a structure similar to a graph in which edges may form triangular faces. This approach is intended for learning…
Direct search is one of the most popular derivative-free optimization paradigms, that relies on exploring the variable space using polling directions. To analyze and implement direct search, one typically relies on positive spanning sets.…
Residual networks (Resnets) have become a prominent architecture in deep learning. However, a comprehensive understanding of Resnets is still a topic of ongoing research. A recent view argues that Resnets perform iterative refinement of…
In the supersymmetric triplet (type-II) seesaw model, in which a single SU(2)_L-triplet couples to leptons, the high-energy neutrino flavour structure can be directly determined from the low-energy neutrino data. We show that even with such…
On a compact interval, we introduce and study a whole family of wavelets depending on a free parameter that can be suitably modulated to improve performance. Such wavelets arise from de la Vall\'ee Poussin (VP) interpolation at Chebyshev…
This chapter deals with the exact enumeration of certain classes of self-avoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of…
A set of arbitrarily high-order WENO schemes for reconstructions on nonuniform grids is presented. These non-linear interpolation methods use simple smoothness indicators with a linear cost with respect to the order, making them easy to…
Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…
This paper is concerned with Lagrange interpolation by total degree polynomials in moderate dimensions. In particular, we are interested in characterising the optimal choice of points for the interpolation problem, where we define the…
We study multivariate numerical integration of smooth functions in weighted Sobolev spaces with dominating mixed smoothness $\alpha\geq 2$ defined over the $s$-dimensional unit cube. We propose a new quasi-Monte Carlo (QMC)-based quadrature…
For modules over a finite-dimensional algebra, there is a canonical one-to-one correspondence between the projective indecomposable modules and the simple modules. In this purely expository note, we take a straight-line path from the…
We consider a basis of square integrable functions on a rectangle, contained in $R^2$, constructed with Legendre polynomials, suitable, for instance, for the analogical description of images on the plane or in other fields of application of…
The existence of a polynomial pivot rule for the simplex method for linear programming, policy iteration for Markov decision processes, and strategy improvement for parity games each are prominent open problems in their respective fields.…
We introduce SCORES, a recursive neural network for shape composition. Our network takes as input sets of parts from two or more source 3D shapes and a rough initial placement of the parts. It outputs an optimized part structure for the…
We present a simple novel construction of recursion operators for integrable multidimensional dispersionless systems that admit a Lax pair whose operators are linear in the spectral parameter and do not involve the derivatives with respect…
As a generalization of Hermite interpolation problem, Birkhoff interpolation is an important subject in numerical approximation. This paper generalizes the existing Generalized Recursive Polynomial Interpolation Algorithm (GRPIA) that is…
Aggregation functions are widely used in answer set programming for representing and reasoning on knowledge involving sets of objects collectively. Current implementations simplify the structure of programs in order to optimize the overall…
The concepts of evaluation and interpolation are extended from univariate skew polynomials to multivariate skew polynomials, with coefficients over division rings. Iterated skew polynomial rings are in general not suitable for this purpose.…
We consider a family of nonlinear recurrences with the Laurent property. Although these recurrences are not generated by mutations in a cluster algebra, they fit within the broader framework of Laurent phenomenon algebras, as introduced…