Related papers: Recursive, parameter-free, explicitly defined inte…
Years ago Zeev Rudnick defined the ${\lambda}$-Poisson generic sequences as the infinite sequences of symbols in a finite alphabet where the number of occurrences of long words in the initial segments follow the Poisson distribution with…
We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and…
While interpolatory bases such as the Lagrange basis form the cornerstone of classical finite element methods, they have been replaced in the more general finite element setting of isogeometric analysis in favor of other desirable…
In recent years, there has been significant progress in the theory of orthogonal polynomials on algebraic curves, particularly on genus 1 surfaces. In this paper, we focus on elliptic orthogonal polynomials and establish several of their…
We introduce a method for describing Riordan matrices via recurrence relations along their diagonals. This provides a new structural description that complements the classical row-wise and column-wise constructions via the A-sequence. As an…
Recently, several works have shown that natural modifications of the classical conditional gradient method (aka Frank-Wolfe algorithm) for constrained convex optimization, provably converge with a linear rate when: i) the feasible set is a…
The inverse problem of supervised reconstruction of depth-variable (time-dependent) parameters in a neural ordinary differential equation (NODE) is considered, that means finding the weights of a residual network with time continuous…
In this article, we construct affine group schemes $GL(X)$ where $X$ is any object in the Verlinde category in characteristic $p$ and classify their irreducible representations. We begin by showing that for a simple object $X$ of…
We give the first construction of explicit constant-degree lossless vertex expanders. Specifically, for any $\varepsilon > 0$ and sufficiently large $d$, we give an explicit construction of an infinite family of $d$-regular graphs where…
We construct new families of U_q(gl_n)-modules by continuation from finite dimensional representations. Each such module is associated with a combinatorial object - admissible set of relations defined in \cite{FRZ}. More precisely, we prove…
The method of constructing Hermite trigonometric polynomials, which interpolate the values of a certain periodic function and its derivatives up to (including ) the -th ( ) order in nodes of a uniform grid, is considered. The proposed…
In this paper we present a new perspective on error analysis of Legendre approximations for differentiable functions. We start by introducing a sequence of Legendre-Gauss-Lobatto polynomials and prove their theoretical properties, such as…
We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many…
This note describes a constructive heuristic to select frequencies of interest within the context of reduced-order modelling by interpolation. The approach is described here through the Loewner framework. Numerical illustrations highlight…
We present an approach to the momentum-space resummation of global, recursive infrared and collinear safe observables featuring kinematic zeros away from the Sudakov limit. In the hadro-production of a generic colour singlet, we consider…
Let $p$ be a prime and $s,m,n$ be positive integers. This paper studies quasi-recursive MDS matrices over Galois rings $GR(p^{s}, p^{sm})$ and proposes various direct construction methods for such matrices. The construction is based on skew…
We estimate the Lebesgue constants for Lagrange interpolation processes on one or several intervals by rational functions with fixed poles. We admit that the poles have accumulation points on the intervals. To prove it we use an analog of…
The Krawtchouck polynomials arise naturally in both coding theory and probability theory and have been studied extensively from these points of view. However, very little is known about their irreducibility and Galois properties. Just like…
This paper develops a general methodology to connect propositional and first-order interpolation. In fact, the existence of suitable skolemizations and of Herbrand expansions together with a propositional interpolant suffice to construct a…
An accurate implicit description of geometries is enabled by the level-set method. Level-set data is given at the nodes of a higher-order background mesh and the interpolated zero-level sets imply boundaries of the domain or interfaces…