Related papers: Approximation by the Dickman distribution and quas…
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…
An S-approximation space is a novel approach to study systems with uncertainty that are not expressible in terms of inclusion relations. In this work, we further examined these spaces, mostly from a topological point of view by a…
We introduce a framework of structural approximation to represent Lorentz-invariant Minkowski space-time as the limit of finite cyclic lattices, each equipped with the action of a finite quasi-Lorentz group. This construction provides a…
In this paper we present a new correlation inequality and use it for proving an Almost Sure Local Limit Theorem for the so-called Dickman distribution. Several related results are also proved
Non-self-adjoint dynamical systems, e.g., nonholonomic systems, can admit an almost Poisson structure, which is formulated by a kind of Poisson bracket satisfying the usual properties except for the Jacobi identity. A general theory of the…
Approximate Bayesian computation methods are useful for generative models with intractable likelihoods. These methods are however sensitive to the dimension of the parameter space, requiring exponentially increasing resources as this…
We study almost symmetric numerical semigroups and semigroup rings. We describe a characteristic property of the minimal free resolution of the semigroup ring of an almost symmetric numerical semigroup. For almost symmetric semigroups…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
Batch codes serve as critical tools for load balancing in distributed storage systems. While numerous constructions exist for specific batch sizes t, current methodologies predominantly rely on code dimension parameters, limiting their…
The Lattice String Approximation algorithm (or LSA algorithm) of M. L. Lapidus and M. van Frankenhuijsen is a procedure that approximates the complex dimensions of a nonlattice self-similar fractal string by the complex dimensions of a…
Similar to linear spaces, many examples of quasilinear spaces have a notion of multiplication of the elements. To characterising these examples, in the present paper we generalize the notion of quasilinear spaces and introduce…
Quasi relation algebras (qRAs) were first described by Galatos and Jipsen in 2013. They are generalisations of relation algebras and can also be viewed as certain residuated lattice expansions. We identify positive symmetric idempotent…
A quasisymmetric graph is a curve whose projection onto a line is a quasisymmetric map. We show that this class of curves is related to solutions of the reduced Beltrami equation and to a generalization of the Zygmund class $\Lambda_*$.…
Inapproximability results for $\mathsf{Max\,k\,CSP\!-\!q}$ have been traditionally established using balanced $t$-wise independent distributions, which are closely related to orthogonal arrays, a famous family of combinatorial designs. In…
In this paper, we relate the framework of mod-$\phi$ convergence to the construction of approximation schemes for lattice-distributed random variables. The point of view taken here is that of Fourier analysis in the Wiener algebra, allowing…
We present a variation of quasi-isometry to approach the problem of defining a geometric notion equivalent to commensurability. In short, this variation can be summarized as "quasi-isometry with uniform parameters for a large enough family…
We construct the quasi-classical approximation of the form factors in finite volume using the separation of variables. The latter is closely related to the Baxter equation.
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…
We discuss a universal algebraic approach to quasi-exactly solvable models which allows us to interpret them as constrained Hamiltonian systems with a finite number of physical states. Using this approach we reproduce well-known…