Related papers: Forbidden ordinal patterns in higher dimensional d…
The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let $\mathcal{F}(\lambda)$ be the family of connected graphs of spectral radius $\le \lambda$. We show that $\mathcal{F}(\lambda)$ can be defined by a finite…
We characterize the algorithmic dimensions (i.e., the lower and upper asymptotic densities of information) of infinite binary sequences in terms of the inability of learning functions having an algorithmic constraint to detect patterns in…
Let $F$ be a $k\times \ell$ (0,1)-matrix. A matrix is simple if it is a (0,1)-matrix with no repeated columns. A (0,1)-matrix $A$ is said to have a $F$ as a configuration if there is a submatrix of $A$ which is a row and column permutation…
This paper focuses on distinguishing classes of dynamical behavior for one- and two-dimensional torus maps, in particular between orbits that are incommensurate, resonant, periodic, or chaotic. We first consider Arnold's circle map, for…
We introduce order conserving embeddings as a more general form of order preserving embeddings between finite dimensional nest algebras. The structure of these embeddings is determined, in terms of order indecomposable decompositions, and…
Different mechanisms for the creation of strange non-chaotic dynamics in the quasiperiodically forced logistic map are studied. These routes to strange nonchaos are characterised through the behavior of the largest nontrivial Lyapunov…
In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern…
For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by…
Outerplanar Tur\'an problem has received considerable attention recently. We study the spectral version via $Q$-index. We determine the unique graph that maximizes the $Q$-index among all $n$-vertex connected outerplanar graphs which are…
Working in two space dimensions, we show that the orientational order emerging from self-propelled polar particles aligning nematically is quasi-long-ranged beyond $\ell_{\rm r}$, the scale associated to induced velocity reversals, which is…
We investigate the morphology of diblock copolymers in the vicinity of flat, chemically patterned surfaces. Using a Ginzburg-Landau free energy, spatial variations of the order parameter are given in terms of a general two-dimensional…
In this undergraduate thesis, we expand on the study of statistics on restricted growth functions avoiding patterns initiated by Campbell, et. al. Restricted growth functions are of interest because they are in bijection with set…
Given a discrete-time random dynamical system represented by a cocycle of non-singular measurable maps, we may obtain information on dynamical quantities by studying the cocycle of Perron-Frobenius operators associated to the maps. Of…
Under a map T, a point x recurs at rate given by a sequence {r_n} near a point x_0 if d(T^n(x),x_0)< r_n infinitely often. Let us fix x_0, and consider the set of those x's. In this paper, we study the size of this set for expanding maps…
It is often desirable to summarise a probability measure on a space $X$ in terms of a mode, or MAP estimator, i.e.\ a point of maximum probability. Such points can be rigorously defined using masses of metric balls in the small-radius…
Topological orders are a prominent paradigm for describing quantum many-body systems without symmetry-breaking orders. We present a topological quantum field theoretical (TQFT) study on topological orders in five-dimensional spacetime…
Energy-minimizing constraint maps are a natural extension of the obstacle problem within a vectorial framework. Due to inherent topological constraints, these maps manifest a diverse structure that includes singularities similar to harmonic…
The present paper considers extremal combinatorics questions in the language of matrices. An $s$-matrix is a matrix with entries in $\{0,1,\ldots, s-1\}$. An $s$-matrix is simple if it has no repeated columns. A matrix $F$ is a…
A $t$-$(n,d,\lambda)$ design over ${\mathbb F}_q$, or a subspace design, is a collection of $d$-dimensional subspaces of ${\mathbb F}_q^n$, called blocks, with the property that every $t$-dimensional subspace of ${\mathbb F}_q^n$ is…
Nonlinear dynamics play an important role in the analysis of signals. A popular, readily interpretable nonlinear measure is Permutation Entropy. It has recently been extended for the analysis of graph signals, thus providing a framework for…