Related papers: Generalized improper integral definition for finit…
Modeling a sequence of design steps, or a sequence of parameter settings, yields a sequence of dynamical systems. In many cases, such a sequence is intended to approximate a certain limit case. However, formally defining that limit turns…
In this paper, we introduce several notions of "dimension" of a finite group, involving sizes of generating sets and certain configurations of maximal subgroups. We focus on the inequality $m(G) \leq \mathrm{MaxDim}(G)$, giving a family of…
Laplace approximations are commonly used to approximate high-dimensional integrals in statistical applications, but the quality of such approximations as the dimension of the integral grows is not well understood. In this paper, we prove a…
We consider the asymptotic expansion of the generalised exponential integral involving the Mittag-Leffler function introduced recently by Mainardi and Masina [{\it Fract. Calc. Appl. Anal.} {\bf 21} (2018) 1156--1169]. We extend the…
The single exponential (SE) and double exponential (DE) formulas are widely recognized as efficient quadrature formulas for evaluating integrals with endpoint singularity. For integrals exhibiting algebraic singularity, explicit error…
The conditions for a generalized Burgers equation which a priori involves nine arbitrary functions of one, or two variables to allow an infinite dimensional symmetry algebra are determined. Though this algebra can involve up to two…
The two Fresnel Integrals are real and imaginary part of the integral over complex-valued exp(ix^2) as a function of the upper limit. They are special cases of the integrals over x^m*exp(i*x^n) for integer powers m and n, which are…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical…
This paper studies the concept of algorithmic equiresolution of a family of embedded varieties or ideals, which means a simultaneous resolution of such a family compatible with a given (suitable) algorithm of resolution in characteristic…
This paper is devoted to the study of metric subregularity and strong subregularity of any positive order $q$ for set-valued mappings in finite and infinite dimensions. While these notions have been studied and applied earlier for $q=1$…
It has been widely believed for half a century that there will never exist a nonlinear theory of generalized functions, in any mathematical context. The aim of this text is to show the converse is the case and invite the reader to…
If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the periodicity complexity arbitrarily high at…
We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…
In applied probability, the normal approximation is often used for the distribution of data with assumed additive structure. This tradition is based on the central limit theorem for sums of (independent) random variables. However, it is…
We analyze inexact fixed point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed point…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
We construct the generalized entropy optimized by a given arbitrary statistical distribution with a finite linear expectation value of a random quantity of interest. This offers, via the maximum entropy principle, a unified basis for a…
We consider dynamical systems on a finite measure space fulfilling a spectral gap property and Birkhoff sums of a non-negative, non-integrable observable. For such systems we generalize strong laws of large numbers for intermediately…