Related papers: On combined component-by-component constructions o…
We introduce a new class of algorithms for finding a short vector in lattices defined by codes of co-dimension $k$ over $\mathbb{Z}_P^d$, where $P$ is prime. The co-dimension $1$ case is solved by exploiting the packing properties of the…
We show how to obtain a fast component-by-component construction algorithm for higher order polynomial lattice rules. Such rules are useful for multivariate quadrature of high-dimensional smooth functions over the unit cube as they achieve…
A three-dimensional (3D) lattice Boltzmann method based on central moments is derived. Two main elements are the local attractors in the collision term and the source terms representing the effect of external and/or self-consistent internal…
Sequential assembly with geometric primitives has drawn attention in robotics and 3D vision since it yields a practical blueprint to construct a target shape. However, due to its combinatorial property, a greedy method falls short of…
The generalized knots-quivers correspondence extends the original knots-quivers correspondence, by allowing higher level generators of quiver generating series. In this paper we explore the underlined combinatorics of such generating…
We introduce a structured approach to the construction of linear BGK-type collision operators ensuring that the resulting Lattice-Boltzmann methods are stable with respect to a weighted $L^2$-norm. The results hold for particular boundary…
We recall the main types of lattice paths, which are sequences in the lattice of integer coordinates points in the plane. We start with the fundamental central lattice paths and Dyck paths and proceed in elementary terms through recently…
Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…
Discovering a solution in a combinatorial space is prevalent in many real-world problems but it is also challenging due to diverse complex constraints and the vast number of possible combinations. To address such a problem, we introduce a…
In this work, we propose a family of single-node second-order boundary schemes for the lattice Boltzmann method with general collision terms. The construction of the schemes is quite universal and simple, it does not involve concrete…
Interpolation is a fundamental technique in scientific computing and is at the heart of many scientific visualization techniques. There is usually a trade-off between the approximation capabilities of an interpolation scheme and its…
A lattice Boltzmann method (LBM) with enhanced stability and accuracy is presented for various Hermite tensor-based lattice structures. The collision operator relies on a regularization step, which is here improved through a recursive…
We present a systematic method for constructing lattice QCD operators for systems of an arbitrary number of particles with arbitrary momentum, spin, and internal quantum numbers. Explicit constructions are provided for one-, two-, three-,…
In this paper an approach to generate multi-dimensionally consistent $N$-component systems is proposed. The approach starts from scalar multi-dimensionally consistent quadrilateral systems and makes use of the cyclic group. The obtained…
In this paper, we study the problem of principal component analysis with generative modeling assumptions, adopting a general model for the observed matrix that encompasses notable special cases, including spiked matrix recovery and phase…
A recurrence relation of the generating function of the dimer model of Fibonacci type gives a functional relation for formal power series associated to lattice paths such as a Dyck, Motzkin and Schr\"oder path. In this paper, we generalize…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
Lattice structures have great potential for several application fields ranging from medical and tissue engineering to aeronautical one. Their development is further speeded up by the continuing advances in additive manufacturing…
The obvious way to construct a GDD (group-divisible design) recursively is to use Wilson's Fundamental Construction for GDDs (WFC). Then a PBD (pairwise balanced design) is often obtained by adding a new point to each group of the GDD.…