Related papers: The Pattern Complexity of the 2-Dimensional Paperf…
Spatiotemporal patterns, which are of interest in statistical physics and nonlinear dynamics, form on the tape-peeling trace. Recently, we have proposed a mathematical model to describe these pattern formation in the tape-peeling trace. In…
We describe three identification spaces of the square, interesting choices of immersion into $\mathbb{R}^3$, and a process to construct 3d-printable models of their parametrizations.
The dimension of random simplicial complexes (defined as the maximal dimension among all faces) is a natural extreme value associated with the complex, and is closely related to other functionals defined by a maximum, such as the clique…
The calculation of scattering amplitudes at higher orders in perturbation theory has reached a high degree of maturity. However, their usage to produce physical predictions within Monte Carlo programs is often precluded by the slow…
We consider the densities of clusters, at the percolation point of a two-dimensional system, which are anchored in various ways to an edge. These quantities are calculated by use of conformal field theory and computer simulations. We find…
The probability distributions of the masses of the clusters spanning from top to bottom of a percolating lattice at the percolation threshold are obtained in all dimensions from two to five. The first two cumulants and the exponents for the…
This is a complete classification of the complex forms of quaternionic symmetric spaces
We present a novel computational scheme to solve acoustic wave transmission problems over composite scatterers, i.e. penetrable obstacles possessing junctions or triple points. Our continuous problem is cast as a multiple traces time-domain…
This article describes a natural piecewise Euclidean bi-simplicial cell structure for the space of $n$-element multisets in a fixed Euclidean rectangle. In particular, we highlight some connections with spaces of complex polynomials and…
Superstring scattering from orientifold planes requires considering string amplitudes on world-sheets with crosscaps with the lowest order case (in string coupling constant) having the topology of the real projective plane. While amplitudes…
We formulate and solve a class of two-dimensional matrix gauge models describing ensembles of non-folding surfaces covering an oriented, discretized, two-dimensional manifold. We interpret the models as string theories characterized by a…
In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex permutoninoes, a related subclass…
Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…
We study the properties of 2D fibre clusters and networks formed by deposition processes. We first examine the growth and scaling properties of single clusters. We then consider a network of such clusters, whose spatial distribution obeys…
Inspired by the modelization of 2D materials systems, we characterize arrangements of identical nonflat squares in 3D. We prove that the fine geometry of such arrangements is completely characterized in terms of patterns of mutual…
We consider $n$-folding triangular curves, or $n$-folding t-curves, obtained by folding $n$ times a strip of paper in $3$, each time possibly left then right or right then left, and unfolding it with $\pi /3$ angles. An example is the well…
Formulae for the number of branch points of one-dimensional orbifolds defined over a non-archimedean local field and uniformisable by discrete projective linear groups are given. They depend only on the uniformising group. The method of…
A square is a factor $S = (S_1; S_2)$ where $S_1$ and $S_2$ have the same pattern, and a permutation is said to be square-free if it contains no non-trivial squares. The permutation is further said to be bicrucial if every extension to the…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
We consider causal 3-dimensional triangulations with the topology of $S^2\times [0,1]$ or $D^2\times [0,1]$ where $S^2$ and $D^2$ are the two-dimensional sphere and disc, respectively. These triangulations consist of slices and we show that…