Related papers: Analytic continuation of harmonic sums: dispersion…
In this article, we consider a simple representation for real numbers and propose top-down procedures to approximate various algebraic and transcendental operations with arbitrary precision. Detailed algorithms and proofs are provided to…
Persistent homology is an important methodology in topological data analysis which adapts theory from algebraic topology to data settings. Computing persistent homology produces persistence diagrams, which have been successfully used in…
We present a versatile construction allowing one to obtain pairs of integer sets with infinite symmetric difference, infinite intersection, and identical representation functions.
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…
Extending ideas of A.N. Parshin and D.V. Osipov, Harmonic Analysis is developed for filtered infinite dimensional modules over a ring. We establish Pontryagin duality, the Fourier inversion formula, Plancherel formula and Poisson summation…
We formulate the problem of numerical analytic continuation in a way that lets us draw meaningful conclusions about properties of the spectral function based solely on the input data. Apart from ensuring consistency with the input data…
The paper considers a universal approach that allows one to quite simply obtain nonlinear asymptotic estimates of various summation functions. It is shown the application of this approach to the asymptotic estimation of divergent Dirichlet…
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
We show how infinite series of a certain type involving generalized harmonic numbers can be computed using a knowledge of symmetric functions and multiple zeta values. In particular, we prove and generalize some identities recently…
In this paper we deal with composite rational functions having zeros and poles forming consecutive elements of an arithmetic progression. We also correct a result published earlier related to composite rational functions having a fixed…
A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of Persistent Homology in this context, its interaction with the ordering and the repercussions of the process…
We continue our discussion from part I.
In this paper we describe an analytic method able to give the multiplication table(s) of the set(s) involved in an $S$-expansion process (with either resonance or $0_S$-resonant-reduction) for reaching a target Lie (super)algebra from a…
Let $\alpha = (1+\sqrt{5})/2$ and define the lower and upper Wythoff sequences by $a_i = \lfloor i \alpha \rfloor$, $b_i = \lfloor i \alpha^2 \rfloor$ for $i \geq 1$. In a recent interesting paper, Kawsumarng et al. proved a number of…
The problem of integer partitions is addressed using the microcanonical approach which is based on the analogy between this problem in the number theory and the calculation of microstates of a many-boson system. For ordinary…
Different representations of dissipative Hamiltonian and port-Hamiltonian differential-algebraic equations (DAE) systems are presented and compared. Using global geometric and algebraic points of view, translations between the different…
We establish some identities of Euler related sums. By using these identities, we discuss the closed form representations of sums of harmonic numbers and reciprocal parametric binomial coefficients through parametric harmonic numbers,…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…