Related papers: Approximation by the Dickman distribution and quas…
Almost block diagonal linear systems of equations can be exemplified by two modules. This makes it possible to construct all sequential forms of band and/or block elimination methods, six old and fourteen new. It allows easy assessment of…
Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…
Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…
We characterize a number of well known systems of approximate inference as loss models: lax sections of 2-fibrations of statistical games, constructed by attaching internally-defined loss functions to Bayesian lenses. Our examples include…
In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…
The idea behind Poisson approximation to the binomial distribution was used in [J. de la Cal, F. Luquin, J. Approx. Theory, 68(3), 1992, 322-329] and subsequent papers in order to establish the convergence of suitable sequences of positive…
This paper is concerned with a non-compact GIT quotient of a vector space, in the presence of an abelian group action and an equivariant regular function (potential) on the quotient. We define virtual counts of quasimaps from prestable…
The set of points of a one-dimensional cut-and-project quasicrystal or model set, while not additive, is shown to be multiplicative for appropriate choices of acceptance windows. This leads to the definition of an associative additive…
Countable $\mathcal{L}$-structures $\mathcal{N}$ whose isomorphism class supports a permutation invariant probability measure in the logic action have been characterized by Ackerman-Freer-Patel to be precisely those $\mathcal{N}$ which have…
We develop three approaches of combinatorial flavour to study the structure of minimal codes and cutting blocking sets in finite geometry, each of which has a particular application. The first approach uses techniques from algebraic…
A locally-optimal structure is a combinatorial structure such as a maximal independent set that cannot be improved by certain (greedy) local moves, even though it may not be globally optimal. It is trivial to construct an independent set in…
Approximate Bayesian Computation (ABC for short) is a family of computational techniques which offer an almost automated solution in situations where evaluation of the posterior likelihood is computationally prohibitive, or whenever…
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…
With the aim of derive a quasi-monomiality formulation in the context of discrete hypercomplex variables, one will amalgamate through a Clifford-algebraic structure of signature $(0,n)$ the umbral calculus framework with Lie-algebraic…
Weak almost contact manifolds, i.e., the linear complex structure on the contact distribution is approximated by a nonsingular skew-symmetric tensor, defined by the author and R. Wolak (2022), allowed a new look at the theory of contact…
Mixed superposition rules are, in short, a method to describe the general solutions of a time-dependent system of first-order differential equations, a so-called Lie system, in terms of particular solutions of other ones. This article is…
The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of…
Spectral quasi correlations are small sums of lattice points lying on the same circle; we show that, for generic integers representable as the sum of two squares, there are no spectral quasi-correlations. Moreover, we apply our result to…
Lognormal random variables appear naturally in many engineering disciplines, including wireless communications, reliability theory, and finance. So, too, does the sum of (correlated) lognormal random variables. Unfortunately, no closed form…
In this paper we continue the study of dilatation structures, introduced in math.MG/0608536 . A dilatation structure on a metric space is a kind of enhanced self-similarity. By way of examples this is explained here with the help of the…