Related papers: Approximation by the Dickman distribution and quas…
A useful heuristic in the understanding of large random combinatorial structures is the Arratia-Tavare principle, which describes an approximation to the joint distribution of component-sizes using independent random variables. The…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…
We discuss a selection of recent developments in arithmetic combinatorics having to do with ``approximate algebraic structure'' together with some of their applications.
When approximating the joint distribution of the component counts of a decomposable combinatorial structure that is `almost' in the logarithmic class, but nonetheless has irregular structure, it is useful to be able first to establish that…
An approximate relativistic two-component Hamiltonian for use in molecular electronic structure calculations is derived in the form of a sum of fixed atom-centered kinetic and spin-orbit operators added to the non-relativistic Hamiltonian.…
The quasi likelihood analysis is generalized to the partial quasi likelihood analysis. Limit theorems for the quasi likelihood estimators, especially the quasi Bayesian estimator, are derived in the situation where existence of a slow…
Approximate Bayesian Computation (ABC) is a useful class of methods for Bayesian inference when the likelihood function is computationally intractable. In practice, the basic ABC algorithm may be inefficient in the presence of discrepancy…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
This paper is concerned with the characterizations of quasi self-adjoint extensions of a class of formally non-self-adjoint discrete Hamiltonian systems. Some properties of the solutions and the characterization of the minimal linear…
The relative equilibria of a symmetric Hamiltonian dynamical system are the critical points of the so-called augmented Hamiltonian. The underlying geometric structure of the system is used to decompose the critical point equations and…
A quasi-hereditary algebra is an Artin algebra together with a partial order on its set of isomorphism classes of simple modules which satisfies certain conditions. In this article we investigate all the possible choices that yield to…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
Compound distributions allow construction of a rich set of distributions. Typically they involve an intractable integral. Here we use a quadrature approximation to that integral to define the quadrature compound family. Special care is…
We establish some limit theorems for quasi-arithmetic means of random variables. This class of means contains the arithmetic, geometric and harmonic means. Our feature is that the generators of quasi-arithmetic means are allowed to be…
In many condensed-matter systems, it is very useful to introduce a quasi-particle approach, which is based on some sort of linearization around a suitable background state. In order to be a systematic and controlled approximation, this…
The quasi-classical $\bar{\partial}$-dressing method is used to derive compact generating equations for dispersionless hierarchies. Dispersionless Kadomtsev-Petviashvili (KP) and two-dimensional Toda lattice (2DTL) hierarchies are…
The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
We introduce the quasi-partition algebra $QP_k(n)$ as a centralizer algebra of the symmetric group. This algebra is a subalgebra of the partition algebra and inherits many similar combinatorial properties. We construct a basis for…