Related papers: The Pattern Complexity of the 2-Dimensional Paperf…
We develop recursion equations to describe the three-dimensional shape of a sheet upon which a series of concentric curved folds have been inscribed. In the case of no stretching outside the fold, the three-dimensional shape of a single…
A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the…
We present a formalism for the scattering of an arbitrary linear or acyclic branched structure build by joining mutually non-interacting arbitrary functional sub-units. The formalism consists of three equations expressing the structural…
Define the augmented square twist origami crease pattern to be the classic square twist crease pattern with one crease added along a diagonal of the twisted square. In this paper we fully describe the rigid foldability of this new crease…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
Consider an oriented curve $\Gamma$ in a domain $D$ in the plane $\boldsymbol R^2$. Thinking of $D$ as a piece of paper, one can make a curved folding in the Euclidean space $\boldsymbol R^3$. This can be expressed as the image of an…
The theory of multidimensional persistence captures the topology of a multifiltration -- a multiparameter family of increasing spaces. Multifiltrations arise naturally in the topological analysis of scientific data. In this paper, we give a…
Dimensions are an integral part of many models we use every day. Without thinking about it, we frequently use the time dimension: many financial and accounting spreadsheets have columns representing months or years. Representing a second…
We prove that any finite polyhedral manifold in 3D can be continuously flattened into 2D while preserving intrinsic distances and avoiding crossings, answering a 19-year-old open problem, if we extend standard folding models to allow for…
We compute the measure with multiplicity of the set of complex planes intersecting a compact domain in a complex space form. The result is given in terms of the so-called hermitian intrinsic volumes. Moreover, we obtain two different…
The properties of the number of iterations in random sequential adsorption protocol needed to generate finite saturated random packing of spherically symmetric shapes were studied. Numerical results obtained for one, two, and three…
The preceding paper constructed tangle machines as diagrammatic models, and illustrated their utility with a number of examples. The information content of a tangle machine is contained in characteristic quantities associated to equivalence…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…
We consider pattern selection process in a wide aperture VCSEL near threshold. We show that for a square geometry of the laser aperture, the patterns formed at lasing threshold can be very complicated because of a possible misalignment…
A self-avoiding plane-filling curve cannot be periodic, but we show that it can satisfy the local isomorphism property. We investigate three families of coverings of the plane by finite sets of nonoverlapping self-avoiding curves which…
We present a general scheme how to construct a substitution rule for generating $d$-dimensional analogues of the paperfolding structures. This substitution is proven to be primitive, so that the translation action on the hull forms a…
Multiple scattering methods are widely used to reduce the computational complexity of acoustic or electromagnetic scattering problems when waves propagate through media containing many identical inclusions. Historically, this numerical…
Square-tiled surfaces can be classified by their number of squares and their cylinder diagrams (also called realizable separatrix diagrams). For the case of $n$ squares and two cone points with angle $4 \pi$ each, we set up and parametrize…
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…