Related papers: On combined component-by-component constructions o…
Inspired by a new mathematical model for bobbin lace, this paper considers finite lattice paths formed from the set of step vectors $\mathfrak{A}=$$\{\rightarrow,$ $\nearrow,$ $\searrow,$ $\uparrow,$ $\downarrow\}$ with the restriction that…
This work presents a novel methodology for speeding up the assembly of stiffness matrices for laminate composite 3D structures in the context of isogeometric and finite element discretizations. By splitting the involved terms into their…
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'…
Lattice-type structures can provide a combination of stiffness with light weight that is desirable in a variety of applications. Design optimization of these structures must rely on approximations of the governing physics to render solution…
We seek shifted lattice rules that are good for high dimensional integration over the unit cube in the setting of an unanchored weighted Sobolev space of functions with square-integrable mixed first derivatives. Many existing studies rely…
Architected materials can exhibit remarkable combinations of stiffness, strength, and toughness, yet their application is currently limited by an incomplete understanding of how cracks initiate and propagate through their discrete…
In the framework of the quantum inverse scattering method, we consider a problem of constructing local operators for two-dimensional quantum integrable models, especially for the lattice versions of the nonlinear Schrodinger and sine-Gordon…
We propose a general construction of commuting projector lattice models for 2D and 3D topological phases enriched by U(1) symmetry, with finite-dimensional Hilbert space per site. The construction starts from a commuting projector model of…
Adjoint functors and projectivization in representation theory of partially ordered sets are used to generalize the algorithms of differentiation by a maximal and by a minimal point. Conceptual explanations are given for the combinatorial…
Lattice and special nonlattice multilevel constellations constructed from binary codes, such as Constructions A, C, and D, have relevant applications in Mathematics (sphere packing) and in Communication (multi-stage decoding and efficient…
We propose new local error estimators for splitting and composition methods. They are based on the construction of lower order schemes obtained at each step as a linear combination of the intermediate stages of the integrator, so that the…
3D point cloud classification requires distinct models from 2D image classification due to the divergent characteristics of the respective input data. While 3D point clouds are unstructured and sparse, 2D images are structured and dense.…
In this paper, we present new multiplicity fixed point theorems for operators acting on Cartesian products of two normed linear spaces. We show that Leggett-Williams type conditions in each component of the system guarantee the existence of…
The so-called min-sum algorithm has been applied for decoding lattices constructed by Construction D'. We generalize this iterative decoding algorithm to decode lattices constructed by Construction D. An upper bound on the decoding…
We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…
It has been realized in recent years that coupled focusing lattices in accelerators and storage rings have significant advantages over conventional uncoupled focusing lattices, especially for high-intensity charged particle beams. A…
Alternating projection method has been used in a wide range of engineering applications since it is a gradient-free method (without requiring tuning the step size) and usually has fast speed of convergence. In this paper, we formalize two…
We present a stochastic algorithm for constructing a topologically disordered (i.e., non-regular) spatial lattice with nodes of constant coordination number, the CC lattice. The construction procedure dramatically improves on an earlier…
A new method for computing all elements of the lattice quark propagator is proposed. The method combines the spectral decomposition of the propagator, computing the lowest eigenmodes exactly, with noisy estimators which are 'diluted', i.e.…
The goal of this manuscript is to give an introduction into the design of the magnet lattice and as a consequence into the transverse dynamics of the particles in a synchrotron or storage ring. Starting from the basic principles of how to…