Related papers: BFACF-style algorithms for polygons in the body-ce…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the $s$-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions $s > 2$, one usually has to…
We present efficient algorithms to calculate trajectories for periodic Lorentz gases consisting of square lattices of circular obstacles in two dimensions, and simple cubic lattices of spheres in three dimensions; these become increasingly…
Lattices of compatibly embedded finite fields are useful in computer algebra systems for managing many extensions of a finite field $\mathbb{F}_p$ at once. They can also be used to represent the algebraic closure $\bar{\mathbb{F}}_p$, and…
A mathematical model of plastic deformation in face-centered cubic (FCC) materials based on a balance model taking into account fundamental properties of deformation defects of a crystal lattice was developed. This model is based on a…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
Lattice models or structures are geometrical objects with mathematical forms, that are used to represent physical systems. They have been used widely in diverse fields, namely, in condensed matter physics, to study degrees of freedom of…
We study the bootstrap and diffusion percolation models in the simple-cubic (sc), body-centered cubic (bcc), and face-centered cubic (fcc) lattices using the Newman-Ziff algorithm. The percolation threshold and critical exponents were…
We first extend the construction of generalized barycentric coordinates (GBC) based on the vertices on the boundary of a polygon $\Omega$ to a new kind of GBCs based on vertices inside the $\Omega$ of interest. For clarity, the standard…
The problem of designing physical-layer network coding (PNC) schemes via nested lattices is considered. Building on the compute-and-forward (C&F) relaying strategy of Nazer and Gastpar, who demonstrated its asymptotic gain using…
The lattice size of a lattice polytope $P$ was defined and studied by Schicho, and Castryck and Cools. They provided an "onion skins" algorithm for computing the lattice size of a lattice polygon $P$ in $\mathbb{R}^2$ based on passing…
This work provides a rigorous analysis of Bain-type cuboidal lattice transformations, which connect the face-centered cubic (fcc), mean-centered cubic (mcc), body-centered cubic (bcc) and axially centered cubic (acc) lattices. Our study…
We present a new 3D lattice Boltzmann (LB) algorithm based on central moments for the D3Q27 lattice using a cuboid grid, which is parameterized by two grid aspect ratios that are related to the ratios of the particle speeds with respect to…
Entropic lattice Boltzmann methods have been developed to alleviate intrinsic stability issues of lattice Boltzmann models for under-resolved simulations. Its reliability in combination with moving objects was established for various…
The (isothermic) compressibility of lattice knots can be examined as a model of the effects of topology and geometry on the compressibility of ring polymers. In this paper, the compressibility of minimal length lattice knots in the simple…
Body-centered Cubic (BCC) lattice structures demonstrate promising performance for applications that require simultaneous mechanical energy absorption and thermal management. However, current optimization approaches are typically confined…
Most existing popular methods for learning graph embedding only consider fixed-order global structural features and lack structures hierarchical representation. To address this weakness, we propose a novel graph embedding algorithm named…
Quantum error correction codes defined on hyperbolic lattices leverage the unique geometric properties of the hyperbolic space to enhance the performance of quantum error correction. By embedding qubits in hyperbolic lattices, these codes…
We present a quantum computing algorithm for fluid flows based on the Carleman-linearization of the Lattice Boltzmann (LB) method. First, we demonstrate the convergence of the classical Carleman procedure at moderate Reynolds numbers,…
We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.