Related papers: Converging to Gosper's Algorithm
We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…
The canonical polyadic decomposition (CPD) is a fundamental tensor decomposition which expresses a tensor as a sum of rank one tensors. In stark contrast to the matrix case, with light assumptions, the CPD of a low rank tensor is…
We examine convergence properties of reconstructing the generalized parton distributions (GPDs) through the universal moment parameterization (GUMP). We provide a heuristic explanation for the connection between the formal…
The Douglas-Rachford algorithm is a classical and powerful splitting method for minimizing the sum of two convex functions and, more generally, finding a zero of the sum of two maximally monotone operators. Although this algorithm is well…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
In this paper, we first quickly review the basics of an algebro-geometric method of Karaji's L-summing technique in today's modern language of algebra. Then, we also review the theory of Gosper's algorithm as a decision procedure for…
We propose an algorithm to approximate solutions of global optimization problems in Sobolev spaces that follows the spirit of Consensus-based algorithms in finite dimensions. The main ingredient are Gaussian processes. In fact, we exploit…
The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…
In \cite{NZ25}, the authors resolved the rational function analogue of the finiteness results for greatest common divisors of iterates of polynomials established in \cite{HT17}. These results may be viewed as dynamical generalizations of a…
Over the fast few years, the numerical success of the generalized alternating direction method of multipliers (GADMM) proposed by Eckstein \& Bertsekas [Math. Prog., 1992] has inspired intensive attention in analyzing its theoretical…
One discovers why the solution of generalized umbral calculus difference nonhomogeneous equation in the form recently proposed by the author extends here now to generalized appellian delta operator and corresponding polynomials case almost…
Let G be a finite group and A a finite dimensional G-graded algebra over a field of characteristic zero. When A is simple as a G-graded algebra, by mean of Regev central polynomials we construct multialternating graded polynomials of…
We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…
Let $p$ be a prime. In this paper, we present a detailed $p$-adic analysis to factorials and double factorials and their congruences. We give good bounds for the $p$-adic sizes of the coefficients of the divided universal Bernoulli number…
The problem of developing an arithmetic for continued fractions (in order to perform, e.g., sums and products) does not have a straightforward solution and has been addressed by several authors. In 1972, Gosper provided an algorithm to…
We propose a procedure to reconstruct characteristic features of an unknown stochastic system from the long-time full counting statistics of some of the system's transitions that are monitored by a detector. The full counting statistics is…
Two approaches are presented for computing upper bounds on Lyapunov exponents and their sums, and on the Lyapunov dimension, among all trajectories of a dynamical system governed by ordinary differential equations. The first approach…
The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…
Multivariate regression techniques are commonly applied to explore the associations between large numbers of outcomes and predictors. In real-world applications, the outcomes are often of mixed types, including continuous measurements,…
We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we had introduced the distinction between periodic and…