Related papers: Quasiperiodic packings of two-shell decagonal clus…
The (non-uniform) sparsest cut problem is the following graph-partitioning problem: given a "supply" graph, and demands on pairs of vertices, delete some subset of supply edges to minimize the ratio of the supply edges cut to the total…
The description of almost periodic or quasiperiodic structures has a long tradition in mathematical physics, in particular since the discovery of quasicrystals in the early 80's. Frequently, the modelling of such structures leads to…
In this work, we focus on the family of shell formulations referred to as "solid shells", where the simulation of shell-type structures is performed by means of a mesh of 3D solid elements, with typically only one element through the…
Interpolation-based techniques become popular in recent years, as they can improve the scalability of existing verification techniques due to their inherent modularity and local reasoning capabilities. Synthesizing Craig interpolants is the…
We study the electronic transport in quasiperiodic separable tight-binding models in one, two, and three dimensions. First, we investigate a one-dimensional quasiperiodic chain, in which the atoms are coupled by weak and strong bonds…
We use the subgraph replacement method to prove a simple product formula for the tilings of an 8-vertex counterpart of Propp's quasi-hexagons (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999),…
Simulating the dynamics of charged particles in quasi-two-dimensional (quasi-2D) nanoconfined systems presents a significant computational challenge due to the long-range nature of electrostatic interactions and the geometric anisotropy. To…
A new kind of aperiodic tiling is introduced. It is shown to underlie a structure obtained as a superposition of waves with incommensurate periods. Its connections to other other tilings and quasicrystals are discussed.
We study numerical simulations of large (N~10^4) two-dimensional quasi-static granular assemblies subjected to a slowly increasing deviator stress. We report some peculiarities in the behavior of these packings that have not yet been…
This paper considers a linear quasi-cyclic product code of two given quasi-cyclic codes of relatively prime lengths over finite fields. We give the spectral analysis of a quasi-cyclic product code in terms of the spectral analysis of the…
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few…
This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.
The set of 2-dimensional packing problems builds an important class of optimization problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional Knapsack is one of the most famous of these problems. Given a set of…
We study the optimal packing of short, hard spherocylinders confined to lie tangential to a spherical surface, using simulated annealing and molecular dynamics simulations. For clusters of up to twelve particles, we map out the changes in…
Many clustering problems enjoy solutions by semidefinite programming. Theoretical results in this vein frequently consider data with a planted clustering and a notion of signal strength such that the semidefinite program exactly recovers…
Multi-component aggregates are being intensively researched in various fields because of their highly tunable properties and wide applications. Due to the complex configurational space of these systems, research would greatly benefit from a…
We numerically perform a spectral analysis of a quasi-periodically driven spin 1/2 system, the spectrum of which is Singular Continuous. We compute fractal dimensions of spectral measures and discuss their connections with the time…
We give an overview of various prolongations of quasigroups. Two step prolongation procedure is proposed.
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
We study the equilibrium phase diagram of binary mixtures of hard spheres as well as of parallel hard cubes. A superior cluster algorithm allows us to establish and to access the demixed phase for both systems and to investigate the subtle…