Related papers: An optimal algorithm to generate tilings
Proctor proved a formula for the number of lozenge tilings of a hexagon with side-lengths $a,b,c,a,b,c$ after removing a "maximal staircase." Ciucu then presented a weighted version of Proctor's result. Here we present weighted and…
We consider a simply supported plate with constant thickness, defined on an unknown multiply connected domain. We optimize its shape according to some given performance functional. Our method is of fixed domain type, easy to be implemented,…
We introduce a new algorithm for the simulation of Euclidean dynamical triangulations that mimics the Metropolis-Hastings algorithm, but where all proposed moves are accepted. This rejection-free algorithm allows for the factorization of…
This study proposes a methodology to utilize machine learning (ML) for topology optimization of periodic lattice structures. In particular, we investigate data representation of lattice structures used as input data for ML models to improve…
We give two flexible and degenerate constructions related to a theorem of Thurston. First, we produce geodesic segments for Thurston's asymmetric metric on Teichm\"uller space $\mathcal{T}(S_g)$ that remain geodesics after adding arbitrary…
A topology optimization formulation including a model of the layer-by-layer additive manufacturing (AM) process is considered. Defined as a multi-objective minimization problem, the formulation accounts for the performance and cost of both…
We introduce an algorithm which can be directly used to feasible and optimum search in linear programming. Starting from an initial point the algorithm iteratively moves a point in a direction to resolve the violated constraints. At the…
We study whether an asymmetric limited-magnitude ball may tile $\mathbb{Z}^n$. This ball generalizes previously studied shapes: crosses, semi-crosses, and quasi-crosses. Such tilings act as perfect error-correcting codes in a channel which…
New algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are very simple and easily coded and modified for practical needs. The…
We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several…
We present the stellar resolution, a "flexible" tile system based on Robinson's first-order resolution. After establishing formal definitions and basic properties of the stellar resolution, we show its Turing-completeness and to illustrate…
Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for a given set of…
We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…
We develop algorithms capable of tackling robust black-box optimisation problems, where the number of model runs is limited. When a desired solution cannot be implemented exactly the aim is to find a robust one, where the worst case in an…
One well studied way to construct quasicrystalline tilings is via inflate-and-subdivide (a.k.a. substitution) rules. These produce self-similar tilings--the Penrose, octagonal, and pinwheel tilings are famous examples. We present a…
The great advances of learning-based approaches in image processing and computer vision are largely based on deeply nested networks that compose linear transfer functions with suitable non-linearities. Interestingly, the most frequently…
The enumeration of lozenge tilings of hexagons with holes has been studied intensively in recent years. Researchers tried to find shapes and positions of holes in hexagonal regions so that the number of lozenge tilings of the resulting…
This paper describes an algorithm for computing optimal structural descriptions for Optimality Theory grammars with context-free position structures. This algorithm extends Tesar's dynamic programming approach [Tesar 1994][Tesar 1995] to…
An algorithm is developed for efficiently constructing the Lorentz covariant effective three-point vertices of the decay of a particle into two daughter particles in which all the masses and spins of the three particles can be arbitrary.…
A new statistical technique for constructing linear latent structure (LLS) models from available data, supported by well established theoretical results and an efficient algorithm, is presented. The method reduces the problem of estimating…