Related papers: The Pattern Complexity of the 2-Dimensional Paperf…
Numerical computations of bifurcation maps for one dimensional maps show patterns (regular jumps in point density) in the zones of chaotic behaviour. In this work, empiric formulas are given for these patterns for an entire class of maps.
We prove several hardness results on folding origami crease patterns. Flat-folding finite crease patterns is fixed-parameter tractable in the ply of the folded pattern (how many layers overlap at any point) and the treewidth of an…
We reprove a few results concerning paperfolding sequences using properties of Catalan numbers modulo 2.
These results complete our paper in Hiroshima Mathematical Journal, vol. 42, pp. 37-75. Let C be a covering of the plane by disjoint complete folding curves which satisfies the local isomorphism property. We show that C is locally…
Linear complexity is an important parameter for arrays that are used in applications related to information security. In this work we survey constructions of two and three dimensional arrays, and present new results on the multidimensional…
The analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the…
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…
In this paper, we study how to fold a specified origami crease pattern in order to minimize the impact of paper thickness. Specifically, origami designs are often expressed by a mountain-valley pattern (plane graph of creases with relative…
Superficial (two dimensional) crack patterns appear when a thin layer of material elastically attached to a substrate contracts. We study numerically the maturation process undergone by these crack patterns when they are allowed to adapt in…
Segregation patterns of size-bidisperse particle mixtures in a fully-three-dimensional flow produced by alternately rotating a spherical tumbler about two perpendicular axes are studied over a range of particle sizes and volume ratios using…
A closed-form formula is derived for the number of occurrences of matches of a multiset of patterns among all ordered (plane-planted) trees with a given number of edges. A pattern looks like a tree, with internal nodes and leaves, but also…
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…
We investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…
Using a recently developed method to simulate percolation on large clusters of distributed machines [N. R. Moloney and G. Pruessner, Phys. Rev. E 67, 037701 (2003)], we have numerically calculated crossing, spanning and wrapping…
Complex textured surfaces occur in nature and industry, from fingerprints to lithography-based micropatterns. Wrinkling by confinement to an incompatible substrate is an attractive way of generating reconfigurable patterned topographies,…
We propose a novel framework for analyzing the geometric structure of horseshoes arising in three- and four-dimensional H\'enon-type maps by introducing paperfolding structures as geometric templates. These structures capture the folding…
In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and…
In this study, we investigate the clustering of 5000 droplets, each originating from one of five distinct droplet classes, each representing a unique geometry. The shape coordinates of the droplets are mapped to a 2D latent space through a…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
A variational framework is introduced to describe how a surface bends when it is subject to local constraints on its geometry. This framework is applied to describe the patterns of a folded sheet of paper. The unstretchability of paper…